{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/dataset","entry":"Dataset","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":14,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":14,"n_samples_ran":8,"n_samples_constructed":7,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":8,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"unverified":6},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2608.12477","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-12477","title":"Learning Under Treatment-Induced Label Indeterminacy with Expert Annotations of Counterfactual Outcomes: A Case Study in Neurological Prognostication","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"xiaobin-xs/learning-under-label-indeterminacy","path":"src/evaluation/uncertain.py","file_url":"https://github.com/xiaobin-xs/learning-under-label-indeterminacy/blob/HEAD/src/evaluation/uncertain.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84af608b6dea72aa","code_sha256_prefix":"84af608b6dea72aa","mcp_get_code":{"code_sha256":"84af608b6dea72aa"}},{"arxiv_id":"2605.11246","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11246","title":"Support-Proximity Augmented Diffusion Estimation for Offline Black-Box Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HarryYoung2018/spade","path":"spade/optimize.py","file_url":"https://github.com/HarryYoung2018/spade/blob/HEAD/spade/optimize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1fe070d1ecb71daf","code_sha256_prefix":"1fe070d1ecb71daf","mcp_get_code":{"code_sha256":"1fe070d1ecb71daf"}},{"arxiv_id":"2602.05833","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05833","title":"SecretFan: Synthesizing Realistic Data without Breaking Privacy","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"LaPlei96/SecretFan","path":"src/secretfan/generation/fan_generation.py","file_url":"https://github.com/LaPlei96/SecretFan/blob/HEAD/src/secretfan/generation/fan_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7a4c25efd04ed05","code_sha256_prefix":"f7a4c25efd04ed05","mcp_get_code":{"code_sha256":"f7a4c25efd04ed05"}},{"arxiv_id":"2505.13000","arxiv_id_is_arxiv":true,"paper":"/paper/dualcodec-a-low-frame-rate-semantically-1","title":"DualCodec: A Low-Frame-Rate, Semantically-Enhanced Neural Audio Codec for Speech Generation","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":"archive","repo":"jiaqili3/DualCodec","path":"dualcodec/dataset/dataset.py","file_url":"https://github.com/jiaqili3/DualCodec/blob/HEAD/dualcodec/dataset/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc6ecd768e01e65d","code_sha256_prefix":"dc6ecd768e01e65d","mcp_get_code":{"code_sha256":"dc6ecd768e01e65d"}},{"arxiv_id":"2411.19339","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-mechanistic-explanation-of","title":"Towards a Mechanistic Explanation of Diffusion Model Generalization","date":"2024-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plai-group/pspc","path":"pspc/denoisers.py","file_url":"https://github.com/plai-group/pspc/blob/HEAD/pspc/denoisers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, plai-group/pspc (NOASSERTION)","code_sha256":"eb9bc2f6d4a0b703","code_sha256_prefix":"eb9bc2f6d4a0b703","mcp_get_code":{"code_sha256":"eb9bc2f6d4a0b703"}},{"arxiv_id":"2302.10429","arxiv_id_is_arxiv":true,"paper":"/paper/fedspeed-larger-local-interval-less","title":"FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy","date":"2023-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woodenchild95/fl-simulator","path":"client/fedspeed.py","file_url":"https://github.com/woodenchild95/fl-simulator/blob/HEAD/client/fedspeed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, woodenchild95/fl-simulator when it was checked","code_sha256":"763117dabc45a37d","code_sha256_prefix":"763117dabc45a37d","mcp_get_code":{"code_sha256":"763117dabc45a37d"}},{"arxiv_id":"2211.06550","arxiv_id_is_arxiv":true,"paper":"/paper/tapas-a-toolbox-for-adversarial-privacy","title":"TAPAS: a Toolbox for Adversarial Privacy Auditing of Synthetic Data","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alan-turing-institute/privacy-sdg-toolbox","path":"tapas/generators/generator.py","file_url":"https://github.com/alan-turing-institute/privacy-sdg-toolbox/blob/HEAD/tapas/generators/generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97bb588ddc4fce18","code_sha256_prefix":"97bb588ddc4fce18","mcp_get_code":{"code_sha256":"97bb588ddc4fce18"}},{"arxiv_id":"2210.11771","arxiv_id_is_arxiv":true,"paper":"/paper/informask-unsupervised-informative-masking","title":"InforMask: Unsupervised Informative Masking for Language Model Pretraining","date":"2022-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NafisSadeq/InforMask","path":"pretrain/dataset.py","file_url":"https://github.com/NafisSadeq/InforMask/blob/HEAD/pretrain/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NafisSadeq/InforMask when it was checked","code_sha256":"10a9cbaf46838744","code_sha256_prefix":"10a9cbaf46838744","mcp_get_code":{"code_sha256":"10a9cbaf46838744"}},{"arxiv_id":"2209.07400","arxiv_id_is_arxiv":true,"paper":"/paper/private-synthetic-data-for-multitask-learning","title":"Private Synthetic Data for Multitask Learning and Marginal Queries","date":"2022-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/relaxed-adaptive-projection","path":"mechanisms/rap_pp.py","file_url":"https://github.com/amazon-research/relaxed-adaptive-projection/blob/HEAD/mechanisms/rap_pp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, amazon-research/relaxed-adaptive-projection (NOASSERTION)","code_sha256":"4cfb7c38939bbc13","code_sha256_prefix":"4cfb7c38939bbc13","mcp_get_code":{"code_sha256":"4cfb7c38939bbc13"}},{"arxiv_id":"2203.06304","arxiv_id_is_arxiv":true,"paper":"/paper/misf-multi-level-interactive-siamese","title":"MISF: Multi-level Interactive Siamese Filtering for High-Fidelity Image Inpainting","date":"2022-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsingqguo/misf","path":"src/misf.py","file_url":"https://github.com/tsingqguo/misf/blob/HEAD/src/misf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tsingqguo/misf when it was checked","code_sha256":"688f3ec6a92f1d08","code_sha256_prefix":"688f3ec6a92f1d08","mcp_get_code":{"code_sha256":"688f3ec6a92f1d08"}},{"arxiv_id":"2106.07153","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-methods-for-private-synthetic-data","title":"Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terranceliu/pmw-pub","path":"mbi/inference.py","file_url":"https://github.com/terranceliu/pmw-pub/blob/HEAD/mbi/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, terranceliu/pmw-pub when it was checked","code_sha256":"6c76176ca38b93e8","code_sha256_prefix":"6c76176ca38b93e8","mcp_get_code":{"code_sha256":"6c76176ca38b93e8"}},{"arxiv_id":"2010.04806","arxiv_id_is_arxiv":true,"paper":"/paper/autoqa-from-databases-to-qa-semantic-parsers","title":"AutoQA: From Databases To QA Semantic Parsers With Only Synthetic Training Data","date":"2020-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-oval/genienlp","path":"genienlp/tasks/almond_task.py","file_url":"https://github.com/stanford-oval/genienlp/blob/HEAD/genienlp/tasks/almond_task.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, stanford-oval/genienlp (NOASSERTION)","code_sha256":"b455c27f6b438cf5","code_sha256_prefix":"b455c27f6b438cf5","mcp_get_code":{"code_sha256":"b455c27f6b438cf5"}},{"arxiv_id":"2002.12815","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-learning-on-graphs-via-super-classes-1","title":"Few-Shot Learning on Graphs via Super-Classes based on Graph Spectral Measures","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chauhanjatin10/GraphsFewShot","path":"src/dataloader.py","file_url":"https://github.com/chauhanjatin10/GraphsFewShot/blob/HEAD/src/dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chauhanjatin10/GraphsFewShot when it was checked","code_sha256":"97b06db12b226711","code_sha256_prefix":"97b06db12b226711","mcp_get_code":{"code_sha256":"97b06db12b226711"}},{"arxiv_id":"ijcai2025_0648","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0648","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"BW297/FACD","path":"model/FACD.py","file_url":"https://github.com/BW297/FACD/blob/HEAD/model/FACD.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e7a361bee49c7c5","code_sha256_prefix":"6e7a361bee49c7c5","mcp_get_code":{"code_sha256":"6e7a361bee49c7c5"}}],"record_sha256":"aaab37bdf2907abbc3fdc48e9145bba00bcd0148658fce993e1b80e4b7d6c136","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}