{"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/build-user-prompt","entry":"build_user_prompt","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":8,"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":4,"ran_fixture":0,"ran":4,"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":"2608.10218","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10218","title":"Mind Viruses: Self-Propagating Ideas in Multi-Agent LLM Systems","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"frotaur/mindvirus-viruschain","path":"helper_scripts/classify_failures.py","file_url":"https://github.com/frotaur/mindvirus-viruschain/blob/HEAD/helper_scripts/classify_failures.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":"5163aeeb968db960","code_sha256_prefix":"5163aeeb968db960","mcp_get_code":{"code_sha256":"5163aeeb968db960"}},{"arxiv_id":"2607.26654","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-26654","title":"Constitutional Midtraining: Content Presence Drives Alignment Gains","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"desBugger/constitutional-mt","path":"data_generation/build_prompts.py","file_url":"https://github.com/desBugger/constitutional-mt/blob/HEAD/data_generation/build_prompts.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":"50b09888949bbb57","code_sha256_prefix":"50b09888949bbb57","mcp_get_code":{"code_sha256":"50b09888949bbb57"}},{"arxiv_id":"2606.26130","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-26130","title":"Thinking Like a Scientist? A Structural Study of LLM-Generated Research Methods","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"francescacarlon/Thinking-Like-a-Scientist","path":"src/pipeline/batch_claude_classification.py","file_url":"https://github.com/francescacarlon/Thinking-Like-a-Scientist/blob/HEAD/src/pipeline/batch_claude_classification.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":"68b8f34b9396ed55","code_sha256_prefix":"68b8f34b9396ed55","mcp_get_code":{"code_sha256":"68b8f34b9396ed55"}},{"arxiv_id":"2606.16316","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-16316","title":"RL-Index: Reinforcement Learning for Retrieval Index Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Yoega/RL-Index","path":"RL_Index/data_preprocess/build_dataset.py","file_url":"https://github.com/Yoega/RL-Index/blob/HEAD/RL_Index/data_preprocess/build_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, Yoega/RL-Index (NOASSERTION)","code_sha256":"9b3a4c5e3d3b9e48","code_sha256_prefix":"9b3a4c5e3d3b9e48","mcp_get_code":{"code_sha256":"9b3a4c5e3d3b9e48"}},{"arxiv_id":"2605.30415","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30415","title":"Domain Adaptation and Reasoning Frameworks in Language Models: A Controlled Experiment with Historical Cosmology","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fdeberna/chat-ptolemaic","path":"judge/judge_eval.py","file_url":"https://github.com/fdeberna/chat-ptolemaic/blob/HEAD/judge/judge_eval.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, fdeberna/chat-ptolemaic when it was checked","code_sha256":"0d42b9d7998bd299","code_sha256_prefix":"0d42b9d7998bd299","mcp_get_code":{"code_sha256":"0d42b9d7998bd299"}},{"arxiv_id":"2605.07510","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07510","title":"InterLV-Search: Benchmarking Interleaved Multimodal Agentic Search","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hbhalpha/InterLV-Search-Bench","path":"agentic_search/prompts.py","file_url":"https://github.com/hbhalpha/InterLV-Search-Bench/blob/HEAD/agentic_search/prompts.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, hbhalpha/InterLV-Search-Bench when it was checked","code_sha256":"fe1235904cab4f81","code_sha256_prefix":"fe1235904cab4f81","mcp_get_code":{"code_sha256":"fe1235904cab4f81"}},{"arxiv_id":"2605.07024","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07024","title":"DELULU: A Verified Multi-Lingual Benchmark for Code Hallucination Detection in Fill-in-the-Middle Tasks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"microsoft/delulu","path":"evaluations/run_delulu_judges.py","file_url":"https://github.com/microsoft/delulu/blob/HEAD/evaluations/run_delulu_judges.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":"bd072bee6c3e3420","code_sha256_prefix":"bd072bee6c3e3420","mcp_get_code":{"code_sha256":"bd072bee6c3e3420"}},{"arxiv_id":"2601.05051","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05051","title":"Publishing FAIR and Machine-actionable Reviews in Materials Science: The Case for Symbolic Knowledge in Neuro-symbolic Artificial Intelligence","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"sciknoworg/ald-ale-orkg-review","path":"llm-experiments/context_injected_doc_qa.py","file_url":"https://github.com/sciknoworg/ald-ale-orkg-review/blob/HEAD/llm-experiments/context_injected_doc_qa.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":"4711d8b4405f7c5c","code_sha256_prefix":"4711d8b4405f7c5c","mcp_get_code":{"code_sha256":"4711d8b4405f7c5c"}}],"record_sha256":"06ede7b2cebfac9fbd56abe4177505fced3a1d8c15e2f1af4eaf616ba4a1fb31","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}