{"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/sha256","entry":"sha256","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":8,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":8,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":9,"n_samples_unverified":1,"n_samples_fingerprinted":1,"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":9,"ran_fixture":0,"ran":0,"unverified":1},"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":"2609.15657","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-15657","title":"Predictive Likelihood Ratios for Language Model Watermark Detection","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MaStatLab/PLRWatermark","path":"code/build_prompts.py","file_url":"https://github.com/MaStatLab/PLRWatermark/blob/HEAD/code/build_prompts.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":"683398569d564d3b","code_sha256_prefix":"683398569d564d3b","mcp_get_code":{"code_sha256":"683398569d564d3b"}},{"arxiv_id":"2608.31017","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-31017","title":"One note in three: a verified census of three deployed AI scribes, and the instrument that counted it","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"composo-ai/omission-bench","path":"anchors/wb_medval_ingest.py","file_url":"https://github.com/composo-ai/omission-bench/blob/HEAD/anchors/wb_medval_ingest.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":"7ae530b94f0d11ea","code_sha256_prefix":"7ae530b94f0d11ea","mcp_get_code":{"code_sha256":"7ae530b94f0d11ea"}},{"arxiv_id":"2608.26093","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-26093","title":"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"akhan-ericsson/autoresearch-percentile-optimization","path":"verify/verify.py","file_url":"https://github.com/akhan-ericsson/autoresearch-percentile-optimization/blob/HEAD/verify/verify.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, akhan-ericsson/autoresearch-percentile-optimization, is not in the permissive set Syntology serves inline","code_sha256":"3408b39e52529fca","code_sha256_prefix":"3408b39e52529fca","mcp_get_code":{"code_sha256":"3408b39e52529fca"}},{"arxiv_id":"2608.25592","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-25592","title":"A Hierarchical Synergistic Deep Learning Framework Integrating Composition, Structure, and Ionic Transport for Solid-State Electrolyte Discovery","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"dhw059/MatCascade","path":"src/matcascade/audit.py","file_url":"https://github.com/dhw059/MatCascade/blob/HEAD/src/matcascade/audit.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, dhw059/MatCascade when it was checked","code_sha256":"04cb8aca0c89eef4","code_sha256_prefix":"04cb8aca0c89eef4","mcp_get_code":{"code_sha256":"04cb8aca0c89eef4"}},{"arxiv_id":"2608.24938","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24938","title":"ExFold: Unified Expert Folding for Training-Free MoE Prefill-Decode Acceleration","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Time-Rune/ExFold-MoE","path":"exfold/artifacts.py","file_url":"https://github.com/Time-Rune/ExFold-MoE/blob/HEAD/exfold/artifacts.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":"99f3e316d3813cb7","code_sha256_prefix":"99f3e316d3813cb7","mcp_get_code":{"code_sha256":"99f3e316d3813cb7"}},{"arxiv_id":"2608.24229","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24229","title":"A Theory of Finite-Noise Optima and Generalization in Quantum Machine Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"dongsnaq/Finite-Noise-Generalization-QML","path":"code/evaluate_molecular_checkpoint.py","file_url":"https://github.com/dongsnaq/Finite-Noise-Generalization-QML/blob/HEAD/code/evaluate_molecular_checkpoint.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":"6f2a533d0951e650","code_sha256_prefix":"6f2a533d0951e650","mcp_get_code":{"code_sha256":"6f2a533d0951e650"}},{"arxiv_id":"2605.25816","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25816","title":"Fine-Tuning Over Architectural Complexity: Broad-Coverage PII Detection on PIIBench with DeBERTa","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pritesh-2711/pii-bench","path":"run_existing_models_benchmark.py","file_url":"https://github.com/pritesh-2711/pii-bench/blob/HEAD/run_existing_models_benchmark.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":"5af10371e040e4e0","code_sha256_prefix":"5af10371e040e4e0","mcp_get_code":{"code_sha256":"5af10371e040e4e0"}},{"arxiv_id":"2605.25816","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25816","title":"Fine-Tuning Over Architectural Complexity: Broad-Coverage PII Detection on PIIBench with DeBERTa","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pritesh-2711/pii-bench","path":"run_streaming_model_benchmark.py","file_url":"https://github.com/pritesh-2711/pii-bench/blob/HEAD/run_streaming_model_benchmark.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":"4766926320baf68b","code_sha256_prefix":"4766926320baf68b","mcp_get_code":{"code_sha256":"4766926320baf68b"}},{"arxiv_id":"2605.18959","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18959","title":"Hyrax: An Extensible Framework for Rapid ML Experimentation and Unsupervised Discovery in the Era of Rubin, Roman, and Euclid","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chroma-core/chroma","path":"bin/ci/preload_default_onnx_model.py","file_url":"https://github.com/chroma-core/chroma/blob/HEAD/bin/ci/preload_default_onnx_model.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":"576021ed65e8768f","code_sha256_prefix":"576021ed65e8768f","mcp_get_code":{"code_sha256":"576021ed65e8768f"}},{"arxiv_id":"2410.00210","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-piano-performance-midi-to-score","title":"End-to-end Piano Performance-MIDI to Score Conversion with Transformers","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timfelixbeyer/midi2scoretransformer","path":"midi2scoretransformer/dataset.py","file_url":"https://github.com/timfelixbeyer/midi2scoretransformer/blob/HEAD/midi2scoretransformer/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, timfelixbeyer/midi2scoretransformer when it was checked","code_sha256":"cc0ea2b14103785a","code_sha256_prefix":"cc0ea2b14103785a","mcp_get_code":{"code_sha256":"cc0ea2b14103785a"}}],"record_sha256":"bce19986ec37fa4125cf9f117abc3b7109975fb47d332bc69c2f60a07a02dcab","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}