{"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/get-dataset-dir","entry":"get_dataset_dir","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":6,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":2,"unverified":3},"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":"2605.01676","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01676","title":"Missingness-aware Data Imputation via AI-powered Bayesian Generative Modeling","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"liuq-lab/MissBGM","path":"missbgm/datasets/real_data.py","file_url":"https://github.com/liuq-lab/MissBGM/blob/HEAD/missbgm/datasets/real_data.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":"430a704694742547","code_sha256_prefix":"430a704694742547","mcp_get_code":{"code_sha256":"430a704694742547"}},{"arxiv_id":"2602.21492","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-21492","title":"GradAlign: Gradient-Aligned Data Selection for LLM Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"StigLidu/GradAlign","path":"automated/config.py","file_url":"https://github.com/StigLidu/GradAlign/blob/HEAD/automated/config.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, StigLidu/GradAlign when it was checked","code_sha256":"b160cd5de60e562d","code_sha256_prefix":"b160cd5de60e562d","mcp_get_code":{"code_sha256":"b160cd5de60e562d"}},{"arxiv_id":"2401.11437","arxiv_id_is_arxiv":true,"paper":"/paper/open-the-black-box-step-based-policy-updates","title":"Open the Black Box: Step-based Policy Updates for Temporally-Correlated Episodic Reinforcement Learning","date":"2024-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brucegeli/tce_rl","path":"mprl/util/util_file.py","file_url":"https://github.com/brucegeli/tce_rl/blob/HEAD/mprl/util/util_file.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, brucegeli/tce_rl, is not in the permissive set Syntology serves inline","code_sha256":"791d15c2f8feff67","code_sha256_prefix":"791d15c2f8feff67","mcp_get_code":{"code_sha256":"791d15c2f8feff67"}},{"arxiv_id":"2303.09564","arxiv_id_is_arxiv":true,"paper":"/paper/typet5-seq2seq-type-inference-using-static","title":"TypeT5: Seq2seq Type Inference using Static Analysis","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utopia-group/typet5","path":"src/typet5/utils.py","file_url":"https://github.com/utopia-group/typet5/blob/HEAD/src/typet5/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1650108633cf4fd4","code_sha256_prefix":"1650108633cf4fd4","mcp_get_code":{"code_sha256":"1650108633cf4fd4"}},{"arxiv_id":"2107.09539","arxiv_id_is_arxiv":true,"paper":"/paper/parametric-scattering-networks","title":"Parametric Scattering Networks","date":"2021-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bentherien/ParametricScatteringNetworks","path":"kymatio/datasets.py","file_url":"https://github.com/bentherien/ParametricScatteringNetworks/blob/HEAD/kymatio/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef226b6c70d1f814","code_sha256_prefix":"ef226b6c70d1f814","mcp_get_code":{"code_sha256":"ef226b6c70d1f814"}},{"arxiv_id":"2024.findings-emnlp.815","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.815","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"behavioral-data/BLADE","path":"blade_bench/utils.py","file_url":"https://github.com/behavioral-data/BLADE/blob/HEAD/blade_bench/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2afdcafd1c34636","code_sha256_prefix":"c2afdcafd1c34636","mcp_get_code":{"code_sha256":"c2afdcafd1c34636"}}],"record_sha256":"56b95dbb1f978297223c373de7a5da19cf6d0675ec620e792cc1a67b79e22079","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}