{"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/parse-csv","entry":"parse_csv","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"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":2,"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":"2606.18237","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18237","title":"ReproRepo: Scaling Reproducibility Audits with GitHub Repository Issues","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"LithiumDA/ReproRepo","path":"utils/csv_utils.py","file_url":"https://github.com/LithiumDA/ReproRepo/blob/HEAD/utils/csv_utils.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":"ed317c92fd5031c5","code_sha256_prefix":"ed317c92fd5031c5","mcp_get_code":{"code_sha256":"ed317c92fd5031c5"}},{"arxiv_id":"2604.08595","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-08595","title":"Adaptive Rigor in AI System Evaluation using Temperature-Controlled Verdict Aggregation via Generalized Power Mean","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"meshkovQA/Eval-ai-library","path":"eval_lib/connector/dataset_parser.py","file_url":"https://github.com/meshkovQA/Eval-ai-library/blob/HEAD/eval_lib/connector/dataset_parser.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4c11982abde1e24e","code_sha256_prefix":"4c11982abde1e24e","mcp_get_code":{"code_sha256":"4c11982abde1e24e"}},{"arxiv_id":"2403.02512","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-quantum-programming-with-pennylane","title":"Hybrid quantum programming with PennyLane Lightning on HPC platforms","date":null,"month_inferred_from_arxiv_id":"2024-03","title_source":"archive","repo":"pennylaneai/lightning-on-hpc","path":"DataCollection/single_node/VQE/lightning_kokkos_openmp/genplot.py","file_url":"https://github.com/pennylaneai/lightning-on-hpc/blob/HEAD/DataCollection/single_node/VQE/lightning_kokkos_openmp/genplot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efd5c96b7d42c07d","code_sha256_prefix":"efd5c96b7d42c07d","mcp_get_code":{"code_sha256":"efd5c96b7d42c07d"}},{"arxiv_id":"2308.09951","arxiv_id_is_arxiv":true,"paper":"/paper/semantics-meets-temporal-correspondence-self","title":"Semantics Meets Temporal Correspondence: Self-supervised Object-centric Learning in Videos","date":"2023-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shvdiwnkozbw/smtc","path":"src/kinetics.py","file_url":"https://github.com/shvdiwnkozbw/smtc/blob/HEAD/src/kinetics.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, shvdiwnkozbw/smtc when it was checked","code_sha256":"f69760b372f30f51","code_sha256_prefix":"f69760b372f30f51","mcp_get_code":{"code_sha256":"f69760b372f30f51"}},{"arxiv_id":"2002.12418","arxiv_id_is_arxiv":true,"paper":"/paper/mnn-a-universal-and-efficient-inference","title":"MNN: A Universal and Efficient Inference Engine","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba/MNN","path":"transformers/llm/finetune/mnn_qlora.py","file_url":"https://github.com/alibaba/MNN/blob/HEAD/transformers/llm/finetune/mnn_qlora.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":"bead42e4ce2b9da9","code_sha256_prefix":"bead42e4ce2b9da9","mcp_get_code":{"code_sha256":"bead42e4ce2b9da9"}}],"record_sha256":"41b43af2dcc0ddb6ed17271583b8d6a8ef1bae1fbd7f98d1c8a5a2c7219fe6f1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}