{"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/mix","entry":"mix","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":1,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":6,"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":1,"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":"2609.13445","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-13445","title":"CAUSAL ANALYSIS AND MITIGATION OF SPURIOUS ONSETS IN FULL-DUPLEX SPEECH LLMS","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"KentoNishi/icassp27-spurious-onsets","path":"protocol.py","file_url":"https://github.com/KentoNishi/icassp27-spurious-onsets/blob/HEAD/protocol.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, KentoNishi/icassp27-spurious-onsets when it was checked","code_sha256":"f7e97264d33e3e8d","code_sha256_prefix":"f7e97264d33e3e8d","mcp_get_code":{"code_sha256":"f7e97264d33e3e8d"}},{"arxiv_id":"2407.19845","arxiv_id_is_arxiv":true,"paper":"/paper/backdoorbench-a-comprehensive-benchmark-and-1","title":"BackdoorBench: A Comprehensive Benchmark and Analysis of Backdoor Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sclbd/backdoorbench","path":"backdoorbench_nlp/attack/hiddenkiller/generate_poison_train_data.py","file_url":"https://github.com/sclbd/backdoorbench/blob/HEAD/backdoorbench_nlp/attack/hiddenkiller/generate_poison_train_data.py","status":"unverified","verification_level":0,"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, sclbd/backdoorbench (NOASSERTION)","code_sha256":"433cf4cd7e583ce3","code_sha256_prefix":"433cf4cd7e583ce3","mcp_get_code":{"code_sha256":"433cf4cd7e583ce3"}},{"arxiv_id":"2406.12572","arxiv_id_is_arxiv":true,"paper":"/paper/mathador-lm-a-dynamic-benchmark-for","title":"Mathador-LM: A Dynamic Benchmark for Mathematical Reasoning on Large Language Models","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IST-DASLab/Mathador-LM","path":"base.py","file_url":"https://github.com/IST-DASLab/Mathador-LM/blob/HEAD/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7891f329305d1ee6","code_sha256_prefix":"7891f329305d1ee6","mcp_get_code":{"code_sha256":"7891f329305d1ee6"}},{"arxiv_id":"2110.07139","arxiv_id_is_arxiv":true,"paper":"/paper/mind-the-style-of-text-adversarial-and","title":"Mind the Style of Text! Adversarial and Backdoor Attacks Based on Text Style Transfer","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/StyleAttack","path":"experiments/run_poison_bert.py","file_url":"https://github.com/thunlp/StyleAttack/blob/HEAD/experiments/run_poison_bert.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":"eb0542d4161b89dd","code_sha256_prefix":"eb0542d4161b89dd","mcp_get_code":{"code_sha256":"eb0542d4161b89dd"}},{"arxiv_id":"2104.03113","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-scaling-laws-with-board-games","title":"Scaling Scaling Laws with Board Games","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyljones/boardlaw","path":"boardlaw/learning.py","file_url":"https://github.com/andyljones/boardlaw/blob/HEAD/boardlaw/learning.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":"4012a2148ebeacb0","code_sha256_prefix":"4012a2148ebeacb0","mcp_get_code":{"code_sha256":"4012a2148ebeacb0"}},{"arxiv_id":"1903.00374","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-reinforcement-learning-for-atari","title":"Model-Based Reinforcement Learning for Atari","date":"2019-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thomas-schillaci/SimPLe","path":"simple/next_frame_predictor.py","file_url":"https://github.com/thomas-schillaci/SimPLe/blob/HEAD/simple/next_frame_predictor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, thomas-schillaci/SimPLe (NOASSERTION)","code_sha256":"3ed887b5cb35096c","code_sha256_prefix":"3ed887b5cb35096c","mcp_get_code":{"code_sha256":"3ed887b5cb35096c"}}],"record_sha256":"1166df8e1c10ae767b413ceb229bb68c9be3d7e75a618641e1e841634709b1cc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}