{"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-list","entry":"get_list","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":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":0,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":9,"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":0,"ran_fixture":0,"ran":9,"unverified":0},"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":"2602.13792","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13792","title":"StackingNet: Collective Inference across Independent AI Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"pymupdf/PyMuPDF","path":"src_classic/__main__.py","file_url":"https://github.com/pymupdf/PyMuPDF/blob/HEAD/src_classic/__main__.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, pymupdf/PyMuPDF, is not in the permissive set Syntology serves inline","code_sha256":"9b0844c695b3f09d","code_sha256_prefix":"9b0844c695b3f09d","mcp_get_code":{"code_sha256":"9b0844c695b3f09d"}},{"arxiv_id":"2504.02807","arxiv_id_is_arxiv":true,"paper":"/paper/megamath-pushing-the-limits-of-open-math","title":"MegaMath: Pushing the Limits of Open Math Corpora","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm360/megamath","path":"web_pipeline/url_filtering/url_filter.py","file_url":"https://github.com/llm360/megamath/blob/HEAD/web_pipeline/url_filtering/url_filter.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":"fe4e4053c2acea4a","code_sha256_prefix":"fe4e4053c2acea4a","mcp_get_code":{"code_sha256":"fe4e4053c2acea4a"}},{"arxiv_id":"2403.14364","arxiv_id_is_arxiv":true,"paper":"/paper/wikifactdiff-a-large-realistic-and-temporally","title":"WikiFactDiff: A Large, Realistic, and Temporally Adaptable Dataset for Atomic Factual Knowledge Update in Causal Language Models","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orange-opensource/wikifactdiff","path":"evaluate/experiments/py/eval_utils_wikifactdiff.py","file_url":"https://github.com/orange-opensource/wikifactdiff/blob/HEAD/evaluate/experiments/py/eval_utils_wikifactdiff.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":"067b50b7d53d46b8","code_sha256_prefix":"067b50b7d53d46b8","mcp_get_code":{"code_sha256":"067b50b7d53d46b8"}},{"arxiv_id":"2307.02869","arxiv_id_is_arxiv":true,"paper":"/paper/momentdiff-generative-video-moment-retrieval","title":"MomentDiff: Generative Video Moment Retrieval from Random to Real","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imccretrieval/momentdiff","path":"momentdiff/matcher.py","file_url":"https://github.com/imccretrieval/momentdiff/blob/HEAD/momentdiff/matcher.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, imccretrieval/momentdiff (NOASSERTION)","code_sha256":"42c73359ca76f61d","code_sha256_prefix":"42c73359ca76f61d","mcp_get_code":{"code_sha256":"42c73359ca76f61d"}},{"arxiv_id":"2305.17852","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-neural-memory-network-for-low-1","title":"Hierarchical Neural Memory Network for Low Latency Event Processing","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hamarh/HMNet_pth","path":"hmnet/utils/common.py","file_url":"https://github.com/hamarh/HMNet_pth/blob/HEAD/hmnet/utils/common.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":"dbdb23b280c73c47","code_sha256_prefix":"dbdb23b280c73c47","mcp_get_code":{"code_sha256":"dbdb23b280c73c47"}},{"arxiv_id":"2211.00241","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-policies-beat-professional-level","title":"Adversarial Policies Beat Superhuman Go AIs","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alignmentresearch/go_attack","path":"plot/plot.py","file_url":"https://github.com/alignmentresearch/go_attack/blob/HEAD/plot/plot.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":"fad9ae09ccde2671","code_sha256_prefix":"fad9ae09ccde2671","mcp_get_code":{"code_sha256":"fad9ae09ccde2671"}},{"arxiv_id":"2204.05352","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-streaming-end-to-end-speech","title":"Large-Scale Streaming End-to-End Speech Translation with Neural Transducers","date":"2022-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mu-y/diarist","path":"diarist/baseline/utils.py","file_url":"https://github.com/mu-y/diarist/blob/HEAD/diarist/baseline/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":"7356d122265ad133","code_sha256_prefix":"7356d122265ad133","mcp_get_code":{"code_sha256":"7356d122265ad133"}},{"arxiv_id":"1909.09347","arxiv_id_is_arxiv":true,"paper":"/paper/mimii-dataset-sound-dataset-for","title":"MIMII Dataset: Sound Dataset for Malfunctioning Industrial Machine Investigation and Inspection","date":"2019-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Huanzhuo/IA-Net","path":"utils.py","file_url":"https://github.com/Huanzhuo/IA-Net/blob/HEAD/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":"340f7e57a4f48a59","code_sha256_prefix":"340f7e57a4f48a59","mcp_get_code":{"code_sha256":"340f7e57a4f48a59"}},{"arxiv_id":"1804.03619","arxiv_id_is_arxiv":true,"paper":"/paper/looking-to-listen-at-the-cocktail-party-a","title":"Looking to Listen at the Cocktail Party: A Speaker-Independent Audio-Visual Model for Speech Separation","date":"2018-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vitrioil/Speech-Separation","path":"src/loader/convert_to_spec.py","file_url":"https://github.com/vitrioil/Speech-Separation/blob/HEAD/src/loader/convert_to_spec.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":"e6a20940e1bae7d0","code_sha256_prefix":"e6a20940e1bae7d0","mcp_get_code":{"code_sha256":"e6a20940e1bae7d0"}}],"record_sha256":"381b4364eeb3216fec56e844e43edb238a03ff8c28ed1c8c73eb8baa48db9bb7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}