{"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/format","entry":"format","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":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":9,"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":3,"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":"2511.02667","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-02667","title":"Scalable Evaluation and Neural Models for Compositional Generalization","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"IBM/scalable-compositional-generalization","path":"results/plot_settings.py","file_url":"https://github.com/IBM/scalable-compositional-generalization/blob/HEAD/results/plot_settings.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":"431c8c9b1a1e144c","code_sha256_prefix":"431c8c9b1a1e144c","mcp_get_code":{"code_sha256":"431c8c9b1a1e144c"}},{"arxiv_id":"2410.14211","arxiv_id_is_arxiv":true,"paper":"/paper/paths-over-graph-knowledge-graph-enpowered","title":"Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoning","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SteveTANTAN/PoG","path":"PoG/freebase_func.py","file_url":"https://github.com/SteveTANTAN/PoG/blob/HEAD/PoG/freebase_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":"4b8d1e745df21f90","code_sha256_prefix":"4b8d1e745df21f90","mcp_get_code":{"code_sha256":"4b8d1e745df21f90"}},{"arxiv_id":"2410.00025","arxiv_id_is_arxiv":true,"paper":"/paper/improving-spoken-language-modeling-with","title":"Improving Spoken Language Modeling with Phoneme Classification: A Simple Fine-tuning Approach","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bootphon/abkhazia","path":"abkhazia/decode/_score.py","file_url":"https://github.com/bootphon/abkhazia/blob/HEAD/abkhazia/decode/_score.py","status":"ran","verification_level":1,"contract_check":null,"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, bootphon/abkhazia, is not in the permissive set Syntology serves inline","code_sha256":"9f11e9e71c6dfb7e","code_sha256_prefix":"9f11e9e71c6dfb7e","mcp_get_code":{"code_sha256":"9f11e9e71c6dfb7e"}},{"arxiv_id":"2407.00695","arxiv_id_is_arxiv":true,"paper":"/paper/learning-formal-mathematics-from-intrinsic","title":"Learning Formal Mathematics From Intrinsic Motivation","date":"2024-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpoesia/peano","path":"domains/generate.py","file_url":"https://github.com/gpoesia/peano/blob/HEAD/domains/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"572549ed9144b302","code_sha256_prefix":"572549ed9144b302","mcp_get_code":{"code_sha256":"572549ed9144b302"}},{"arxiv_id":"2402.14625","arxiv_id_is_arxiv":true,"paper":"/paper/putting-the-count-back-into-accountability-an","title":"Putting the Count Back Into Accountability: An Analysis of Transparency Data About the Sexual Exploitation of Minors","date":null,"month_inferred_from_arxiv_id":"2024-02","title_source":"archive","repo":"apparebit/diaphanous","path":"diaphanous/fetch.py","file_url":"https://github.com/apparebit/diaphanous/blob/HEAD/diaphanous/fetch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"73fd4fec4fefb430","code_sha256_prefix":"73fd4fec4fefb430","mcp_get_code":{"code_sha256":"73fd4fec4fefb430"}},{"arxiv_id":"2312.06853","arxiv_id_is_arxiv":true,"paper":"/paper/llf-bench-benchmark-for-interactive-learning","title":"LLF-Bench: Benchmark for Interactive Learning from Language Feedback","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/llf-bench","path":"llfbench/envs/utils.py","file_url":"https://github.com/microsoft/llf-bench/blob/HEAD/llfbench/envs/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":"9016caa8866ed28d","code_sha256_prefix":"9016caa8866ed28d","mcp_get_code":{"code_sha256":"9016caa8866ed28d"}},{"arxiv_id":"2310.17110","arxiv_id_is_arxiv":true,"paper":"/paper/llm4dyg-can-large-language-models-solve","title":"LLM4DyG: Can Large Language Models Solve Spatial-Temporal Problems on Dynamic Graphs?","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/llm4dyg","path":"llm4dyg/utils/misc.py","file_url":"https://github.com/wondergo2017/llm4dyg/blob/HEAD/llm4dyg/utils/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wondergo2017/llm4dyg when it was checked","code_sha256":"17303501ce8dd466","code_sha256_prefix":"17303501ce8dd466","mcp_get_code":{"code_sha256":"17303501ce8dd466"}},{"arxiv_id":"2202.03800","arxiv_id_is_arxiv":true,"paper":"/paper/ada-nets-face-clustering-via-adaptive-1","title":"Ada-NETS: Face Clustering via Adaptive Neighbour Discovery in the Structure Space","date":"2022-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-cv/Ada-NETS","path":"GCN/cluster.py","file_url":"https://github.com/damo-cv/Ada-NETS/blob/HEAD/GCN/cluster.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":"b49214d884be3833","code_sha256_prefix":"b49214d884be3833","mcp_get_code":{"code_sha256":"b49214d884be3833"}},{"arxiv_id":"2110.04366","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-unified-view-of-parameter-efficient-1","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhe/unify-parameter-efficient-tuning","path":"analysis/paper_plot.py","file_url":"https://github.com/jxhe/unify-parameter-efficient-tuning/blob/HEAD/analysis/paper_plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, jxhe/unify-parameter-efficient-tuning, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"2a7cfa36f9e48900","code_sha256_prefix":"2a7cfa36f9e48900","mcp_get_code":{"code_sha256":"2a7cfa36f9e48900"}}],"record_sha256":"ab8afef4b6a9aecdc491ce857fe3cb84c8994a736881f59e71ec7e8e66a7ff8a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}