{"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/load-rows","entry":"load_rows","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":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":6,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"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":7,"ran_fixture":0,"ran":0,"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.31079","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-31079","title":"Sycophantic Agreement Transfers with Neutral Data via Contrastive Preference Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"camilablank/sycophancy-dpo","path":"src/analysis_scripts/judge_agreement.py","file_url":"https://github.com/camilablank/sycophancy-dpo/blob/HEAD/src/analysis_scripts/judge_agreement.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, camilablank/sycophancy-dpo when it was checked","code_sha256":"4a8bcaebe3121e09","code_sha256_prefix":"4a8bcaebe3121e09","mcp_get_code":{"code_sha256":"4a8bcaebe3121e09"}},{"arxiv_id":"2608.23476","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23476","title":"On the Threat Model of Weird Generalization and Emergent Misalignment","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"miriamwanner/wg-data","path":"mo_extreme_sports/datasets/translate.py","file_url":"https://github.com/miriamwanner/wg-data/blob/HEAD/mo_extreme_sports/datasets/translate.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, miriamwanner/wg-data when it was checked","code_sha256":"d8e9410a00e4b8e8","code_sha256_prefix":"d8e9410a00e4b8e8","mcp_get_code":{"code_sha256":"d8e9410a00e4b8e8"}},{"arxiv_id":"2608.07439","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-07439","title":"An Exploratory Evaluation of LLM-Assisted Rewriting of Moderate-Complexity Financial Sentences for DisCoCat-Based Sentiment Analysis","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"bllin001/qnlp-discocat-llms-finance-rewriting","path":"code/analyze_multisent_candidates.py","file_url":"https://github.com/bllin001/qnlp-discocat-llms-finance-rewriting/blob/HEAD/code/analyze_multisent_candidates.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, bllin001/qnlp-discocat-llms-finance-rewriting when it was checked","code_sha256":"96c385e0307d143e","code_sha256_prefix":"96c385e0307d143e","mcp_get_code":{"code_sha256":"96c385e0307d143e"}},{"arxiv_id":"2606.29331","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29331","title":"Sample Complexity of Scientific Discovery: PAC Learnability of Compositional Function Trees","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"suayptalha/scientific-pac","path":"make_paper_artifacts.py","file_url":"https://github.com/suayptalha/scientific-pac/blob/HEAD/make_paper_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":"bb25d3a84bcd337a","code_sha256_prefix":"bb25d3a84bcd337a","mcp_get_code":{"code_sha256":"bb25d3a84bcd337a"}},{"arxiv_id":"2606.29331","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29331","title":"Sample Complexity of Scientific Discovery: PAC Learnability of Compositional Function Trees","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"suayptalha/scientific-pac","path":"postprocess_results.py","file_url":"https://github.com/suayptalha/scientific-pac/blob/HEAD/postprocess_results.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":"476e81ebdff6983b","code_sha256_prefix":"476e81ebdff6983b","mcp_get_code":{"code_sha256":"476e81ebdff6983b"}},{"arxiv_id":"2605.23940","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23940","title":"Published at ICLR 2026 Workshop on Reasoning and Planning for LLMs RESIDUAL DRIFT DOMINATES CONTRADICTION IN MULTI-TURN CONSTRAINT REASONING","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"kaons-research/drift-bench","path":"src/analyze.py","file_url":"https://github.com/kaons-research/drift-bench/blob/HEAD/src/analyze.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":"9f1ee38270e3cbda","code_sha256_prefix":"9f1ee38270e3cbda","mcp_get_code":{"code_sha256":"9f1ee38270e3cbda"}},{"arxiv_id":"2604.26052","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-26052","title":"From Prompt Risk to Response Risk: Paired Analysis of Safety Behavior of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"microsoft/PairedSafety","path":"analysis/relevance_significance/compute_relevance_tests.py","file_url":"https://github.com/microsoft/PairedSafety/blob/HEAD/analysis/relevance_significance/compute_relevance_tests.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":"8e7210e0a9408f5b","code_sha256_prefix":"8e7210e0a9408f5b","mcp_get_code":{"code_sha256":"8e7210e0a9408f5b"}}],"record_sha256":"d5d10d5ef3ce8a95c93113b49bea0fbd9c0a3c0b2487e60cfb8a80495bea07b4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}