{"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/measure","entry":"measure","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":9,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":3,"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":2,"ran_fixture":0,"ran":4,"unverified":4},"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.24460","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24460","title":"Shortcut Before Circuit: Document Statistics Time In-Context Conflict Resolution","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"lyj20071013/Shortcut-Before-Circuit","path":"an_fd.py","file_url":"https://github.com/lyj20071013/Shortcut-Before-Circuit/blob/HEAD/an_fd.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":"bf305fb5940ccf07","code_sha256_prefix":"bf305fb5940ccf07","mcp_get_code":{"code_sha256":"bf305fb5940ccf07"}},{"arxiv_id":"2608.24460","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24460","title":"Shortcut Before Circuit: Document Statistics Time In-Context Conflict Resolution","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"lyj20071013/Shortcut-Before-Circuit","path":"bench.py","file_url":"https://github.com/lyj20071013/Shortcut-Before-Circuit/blob/HEAD/bench.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":"87e6ece047e4c847","code_sha256_prefix":"87e6ece047e4c847","mcp_get_code":{"code_sha256":"87e6ece047e4c847"}},{"arxiv_id":"2608.15761","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-15761","title":"Provenance, Not Behaviour: A Serialisation Artifact in Edge-IIoTset and a Leakage-Free Benchmark for Precision-Agriculture Intrusion Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"MostafaGalal1/agriedge","path":"src/agriedge/evaluation/edge.py","file_url":"https://github.com/MostafaGalal1/agriedge/blob/HEAD/src/agriedge/evaluation/edge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c68c3aff91cba6cb","code_sha256_prefix":"c68c3aff91cba6cb","mcp_get_code":{"code_sha256":"c68c3aff91cba6cb"}},{"arxiv_id":"2406.05027","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-automatic-differentiation-with","title":"Optimizing Automatic Differentiation with Deep Reinforcement Learning","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamielohoff/graphax","path":"performance_measurements/perf.py","file_url":"https://github.com/jamielohoff/graphax/blob/HEAD/performance_measurements/perf.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":"f55fecb3286bee3e","code_sha256_prefix":"f55fecb3286bee3e","mcp_get_code":{"code_sha256":"f55fecb3286bee3e"}},{"arxiv_id":"2405.13712","arxiv_id_is_arxiv":true,"paper":"/paper/learning-diffusion-priors-from-observations","title":"Learning Diffusion Priors from Observations by Expectation Maximization","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francois-rozet/diffusion-priors","path":"experiments/cifar/utils.py","file_url":"https://github.com/francois-rozet/diffusion-priors/blob/HEAD/experiments/cifar/utils.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":"7f433faec69e336f","code_sha256_prefix":"7f433faec69e336f","mcp_get_code":{"code_sha256":"7f433faec69e336f"}},{"arxiv_id":"2403.07797","arxiv_id_is_arxiv":true,"paper":"/paper/joint-selection-adaptively-incorporating","title":"Joint Selection: Adaptively Incorporating Public Information for Private Synthetic Data","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miguel-fuentes/jam_aistats","path":"code/mechanisms/mst.py","file_url":"https://github.com/miguel-fuentes/jam_aistats/blob/HEAD/code/mechanisms/mst.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, miguel-fuentes/jam_aistats when it was checked","code_sha256":"e12535051bbf7d6d","code_sha256_prefix":"e12535051bbf7d6d","mcp_get_code":{"code_sha256":"e12535051bbf7d6d"}},{"arxiv_id":"2310.14344","arxiv_id_is_arxiv":true,"paper":"/paper/what-s-in-a-prior-learned-proximal-networks","title":"What's in a Prior? Learned Proximal Networks for Inverse Problems","date":"2023-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sulam-group/learned-proximal-networks","path":"lpn/inverse_celeba.py","file_url":"https://github.com/sulam-group/learned-proximal-networks/blob/HEAD/lpn/inverse_celeba.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":"0f7be23e768b2368","code_sha256_prefix":"0f7be23e768b2368","mcp_get_code":{"code_sha256":"0f7be23e768b2368"}},{"arxiv_id":"2306.13643","arxiv_id_is_arxiv":true,"paper":"/paper/lightglue-local-feature-matching-at-light","title":"LightGlue: Local Feature Matching at Light Speed","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvg/lightglue","path":"benchmark.py","file_url":"https://github.com/cvg/lightglue/blob/HEAD/benchmark.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":"2bd5dd5a07a0f3be","code_sha256_prefix":"2bd5dd5a07a0f3be","mcp_get_code":{"code_sha256":"2bd5dd5a07a0f3be"}},{"arxiv_id":"2306.05031","arxiv_id_is_arxiv":true,"paper":"/paper/generalizable-lightweight-proxy-for-robust-1","title":"Generalizable Lightweight Proxy for Robust NAS against Diverse Perturbations","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyeonjeongha/croze","path":"zero_cost_methods/pruners/measures/croze.py","file_url":"https://github.com/hyeonjeongha/croze/blob/HEAD/zero_cost_methods/pruners/measures/croze.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, hyeonjeongha/croze when it was checked","code_sha256":"bdba060dbdcaeb6d","code_sha256_prefix":"bdba060dbdcaeb6d","mcp_get_code":{"code_sha256":"bdba060dbdcaeb6d"}},{"arxiv_id":"2110.14416","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-generalize-deepsets-and-can-be","title":"Transformers Generalize DeepSets and Can be Extended to Graphs and Hypergraphs","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jw9730/hot","path":"run_perf_tests.py","file_url":"https://github.com/jw9730/hot/blob/HEAD/run_perf_tests.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, jw9730/hot when it was checked","code_sha256":"61118e7b3c32b89e","code_sha256_prefix":"61118e7b3c32b89e","mcp_get_code":{"code_sha256":"61118e7b3c32b89e"}}],"record_sha256":"d2523f630c1e349e8c92b5af7af1ea963665d9b2ace95479d6e0b537a1c2df0b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}