{"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/choice","entry":"choice","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":11,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":13,"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":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":7,"unverified":1},"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":"2408.03617","arxiv_id_is_arxiv":true,"paper":"/paper/is-child-directed-speech-effective-training","title":"Is Child-Directed Speech Effective Training Data for Language Models?","date":"2024-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"styfeng/TinyDialogues","path":"promptsource/templates.py","file_url":"https://github.com/styfeng/TinyDialogues/blob/HEAD/promptsource/templates.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb35fcd18dd842fb","code_sha256_prefix":"bb35fcd18dd842fb","mcp_get_code":{"code_sha256":"bb35fcd18dd842fb"}},{"arxiv_id":"2407.07532","arxiv_id_is_arxiv":true,"paper":"/paper/neural-localizer-fields-for-continuous-3d","title":"Neural Localizer Fields for Continuous 3D Human Pose and Shape Estimation","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isarandi/nlf","path":"nlf/common/util.py","file_url":"https://github.com/isarandi/nlf/blob/HEAD/nlf/common/util.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":"9c6e866d219206ab","code_sha256_prefix":"9c6e866d219206ab","mcp_get_code":{"code_sha256":"9c6e866d219206ab"}},{"arxiv_id":"2311.01331","arxiv_id_is_arxiv":true,"paper":"/paper/offline-imitation-from-observation-via-primal","title":"Offline Imitation from Observation via Primal Wasserstein State Occupancy Matching","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaiYan289/PW-DICE","path":"PWDICE_continuous/advance_NN.py","file_url":"https://github.com/KaiYan289/PW-DICE/blob/HEAD/PWDICE_continuous/advance_NN.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, KaiYan289/PW-DICE when it was checked","code_sha256":"c8bdd33928f69383","code_sha256_prefix":"c8bdd33928f69383","mcp_get_code":{"code_sha256":"c8bdd33928f69383"}},{"arxiv_id":"2310.20707","arxiv_id_is_arxiv":true,"paper":"/paper/what-s-in-my-big-data","title":"What's In My Big Data?","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/wimbd","path":"wimbd/contamination/templates.py","file_url":"https://github.com/allenai/wimbd/blob/HEAD/wimbd/contamination/templates.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb35fcd18dd842fb","code_sha256_prefix":"bb35fcd18dd842fb","mcp_get_code":{"code_sha256":"bb35fcd18dd842fb"}},{"arxiv_id":"2310.12403","arxiv_id_is_arxiv":true,"paper":"/paper/cooperative-minibatching-in-graph-neural","title":"Cooperative Minibatching in Graph Neural Networks","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gt-tdalab/dgl-coop","path":"python/dgl/dataloading/labor_sampler.py","file_url":"https://github.com/gt-tdalab/dgl-coop/blob/HEAD/python/dgl/dataloading/labor_sampler.py","status":"unverified","verification_level":0,"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":"7dc7bd1ca50e4bf6","code_sha256_prefix":"7dc7bd1ca50e4bf6","mcp_get_code":{"code_sha256":"7dc7bd1ca50e4bf6"}},{"arxiv_id":"2303.12341","arxiv_id_is_arxiv":true,"paper":"/paper/easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cchao0116/EasyDGL","path":"src/dataloader.py","file_url":"https://github.com/cchao0116/EasyDGL/blob/HEAD/src/dataloader.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":"f7109cad8993a8eb","code_sha256_prefix":"f7109cad8993a8eb","mcp_get_code":{"code_sha256":"f7109cad8993a8eb"}},{"arxiv_id":"2204.00752","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-dynamic-user-preference-via-1","title":"Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cchao0116/S2PNM-TKDE2021","path":"src/dataloader.py","file_url":"https://github.com/cchao0116/S2PNM-TKDE2021/blob/HEAD/src/dataloader.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":"f7109cad8993a8eb","code_sha256_prefix":"f7109cad8993a8eb","mcp_get_code":{"code_sha256":"f7109cad8993a8eb"}},{"arxiv_id":"2110.08207","arxiv_id_is_arxiv":true,"paper":"/paper/multitask-prompted-training-enables-zero-shot-1","title":"Multitask Prompted Training Enables Zero-Shot Task Generalization","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigscience-workshop/promptsource","path":"promptsource/templates.py","file_url":"https://github.com/bigscience-workshop/promptsource/blob/HEAD/promptsource/templates.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb35fcd18dd842fb","code_sha256_prefix":"bb35fcd18dd842fb","mcp_get_code":{"code_sha256":"bb35fcd18dd842fb"}},{"arxiv_id":"2109.14727","arxiv_id_is_arxiv":true,"paper":"/paper/dr-jekyll-and-mr-hyde-the-strange-case-of-off","title":"Dr Jekyll and Mr Hyde: the Strange Case of Off-Policy Policy Updates","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/dr-jekyll-and-mr-hyde-the-strange-case-of-off-policy-policy-updates","path":"FiniteJH/utils.py","file_url":"https://github.com/microsoft/dr-jekyll-and-mr-hyde-the-strange-case-of-off-policy-policy-updates/blob/HEAD/FiniteJH/utils.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":"368ab0000c0fc37c","code_sha256_prefix":"368ab0000c0fc37c","mcp_get_code":{"code_sha256":"368ab0000c0fc37c"}},{"arxiv_id":"2010.00979","arxiv_id_is_arxiv":true,"paper":"/paper/boss-bayesian-optimization-over-string-spaces","title":"BOSS: Bayesian Optimization over String Spaces","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henrymoss/BOSS","path":"boss/code/CFG/CFG.py","file_url":"https://github.com/henrymoss/BOSS/blob/HEAD/boss/code/CFG/CFG.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":"188e88957d3e32bd","code_sha256_prefix":"188e88957d3e32bd","mcp_get_code":{"code_sha256":"188e88957d3e32bd"}},{"arxiv_id":"2007.00611","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-temporal-difference-learning-with","title":"Gradient Temporal-Difference Learning with Regularized Corrections","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlai-lab/Regularized-GradientTD","path":"examples/MountainCar.py","file_url":"https://github.com/rlai-lab/Regularized-GradientTD/blob/HEAD/examples/MountainCar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rlai-lab/Regularized-GradientTD when it was checked","code_sha256":"3e141c4418811b4b","code_sha256_prefix":"3e141c4418811b4b","mcp_get_code":{"code_sha256":"3e141c4418811b4b"}},{"arxiv_id":"1806.03535","arxiv_id_is_arxiv":true,"paper":"/paper/cell-detection-with-star-convex-polygons","title":"Cell Detection with Star-convex Polygons","date":"2018-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hthierno/pytorch-stardist","path":"stardist_tools_/stardist_tools/csbdeep_utils.py","file_url":"https://github.com/hthierno/pytorch-stardist/blob/HEAD/stardist_tools_/stardist_tools/csbdeep_utils.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":"c9012ff9b8f828b4","code_sha256_prefix":"c9012ff9b8f828b4","mcp_get_code":{"code_sha256":"c9012ff9b8f828b4"}},{"arxiv_id":"aaai_17462","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_17462","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/nni","path":"nni/parameter_expressions.py","file_url":"https://github.com/microsoft/nni/blob/HEAD/nni/parameter_expressions.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":"eb782eb277ece3dd","code_sha256_prefix":"eb782eb277ece3dd","mcp_get_code":{"code_sha256":"eb782eb277ece3dd"}}],"record_sha256":"6352e5a551f02d25e1c780779446d1dd177c5698f29c7bf753480da19ed26caf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}