{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/load-rows","entry":"load_rows","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":5,"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":6,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":1},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a8bcaebe3121e09","mcp_get_code":{"code_sha256":"4a8bcaebe3121e09"}},{"arxiv_id":"2608.23476","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d8e9410a00e4b8e8","mcp_get_code":{"code_sha256":"d8e9410a00e4b8e8"}},{"arxiv_id":"2608.07439","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"96c385e0307d143e","mcp_get_code":{"code_sha256":"96c385e0307d143e"}},{"arxiv_id":"2606.29331","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bb25d3a84bcd337a","mcp_get_code":{"code_sha256":"bb25d3a84bcd337a"}},{"arxiv_id":"2606.29331","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"476e81ebdff6983b","mcp_get_code":{"code_sha256":"476e81ebdff6983b"}},{"arxiv_id":"2605.23940","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f1ee38270e3cbda","mcp_get_code":{"code_sha256":"9f1ee38270e3cbda"}},{"arxiv_id":"2604.26052","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8e7210e0a9408f5b","mcp_get_code":{"code_sha256":"8e7210e0a9408f5b"}}]}