{"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/fill","entry":"fill","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":0,"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":4,"unverified":2},"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":"2606.06526","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-06526","title":"CROWDMATH: A Dataset of Crowdsourced Mathematical Research Discussions","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"text-machine-lab/crowdmath","path":"llm_eval/harness/tasks.py","file_url":"https://github.com/text-machine-lab/crowdmath/blob/HEAD/llm_eval/harness/tasks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0c6cfd1c1696cd4","code_sha256_prefix":"e0c6cfd1c1696cd4","mcp_get_code":{"code_sha256":"e0c6cfd1c1696cd4"}},{"arxiv_id":"2309.01507","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2309.01507","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":null,"repo":"TimDettmers/bitsandbytes","path":"bitsandbytes/optim/optimizer.py","file_url":"https://github.com/TimDettmers/bitsandbytes/blob/HEAD/bitsandbytes/optim/optimizer.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":"ffaf09e9115fadc4","code_sha256_prefix":"ffaf09e9115fadc4","mcp_get_code":{"code_sha256":"ffaf09e9115fadc4"}},{"arxiv_id":"2112.00544","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-contrastive-learning-with-chemical","title":"Molecular Contrastive Learning with Chemical Element Knowledge Graph","date":"2021-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZJU-Fangyin/KCL","path":"code/initial/load.py","file_url":"https://github.com/ZJU-Fangyin/KCL/blob/HEAD/code/initial/load.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":"2856a36f133f6835","code_sha256_prefix":"2856a36f133f6835","mcp_get_code":{"code_sha256":"2856a36f133f6835"}},{"arxiv_id":"2110.06623","arxiv_id_is_arxiv":true,"paper":"/paper/sssnet-semi-supervised-signed-network","title":"SSSNET: Semi-Supervised Signed Network Clustering","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sherylhyx/sssnet_signed_clustering","path":"src/utils.py","file_url":"https://github.com/sherylhyx/sssnet_signed_clustering/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5532a45b7a61f6bb","code_sha256_prefix":"5532a45b7a61f6bb","mcp_get_code":{"code_sha256":"5532a45b7a61f6bb"}},{"arxiv_id":"2005.10884","arxiv_id_is_arxiv":true,"paper":"/paper/patchguard-provable-defense-against","title":"PatchGuard: A Provably Robust Defense against Adversarial Patches via Small Receptive Fields and Masking","date":"2020-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicksum107/thesiswork","path":"displayim.py","file_url":"https://github.com/nicksum107/thesiswork/blob/HEAD/displayim.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":"a449b45fba80d282","code_sha256_prefix":"a449b45fba80d282","mcp_get_code":{"code_sha256":"a449b45fba80d282"}},{"arxiv_id":"1805.01956","arxiv_id_is_arxiv":true,"paper":"/paper/motion-planning-among-dynamic-decision-making","title":"Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-acl/gym-collision-avoidance","path":"gym_collision_avoidance/experiments/src/collect_regression_dataset.py","file_url":"https://github.com/mit-acl/gym-collision-avoidance/blob/HEAD/gym_collision_avoidance/experiments/src/collect_regression_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":"199938cd41a0cea0","code_sha256_prefix":"199938cd41a0cea0","mcp_get_code":{"code_sha256":"199938cd41a0cea0"}},{"arxiv_id":"2022.emnlp-demos.40","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.emnlp-demos.40","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"OpenBMB/BMCook","path":"bmcook/pruning/prune_func.py","file_url":"https://github.com/OpenBMB/BMCook/blob/HEAD/bmcook/pruning/prune_func.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af5b9b0b2f4c1703","code_sha256_prefix":"af5b9b0b2f4c1703","mcp_get_code":{"code_sha256":"af5b9b0b2f4c1703"}}],"record_sha256":"5fa99bcfb9615c6589226d4580da985ed933c9fdec8e0c6d8ff6eced749ea3d4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}