{"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/prepare-prompt","entry":"prepare_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":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":4,"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":5,"ran_fixture":0,"ran":2,"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":"2608.09209","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-09209","title":"UNMASK: Discovering and Causally Verifying Spurious Shortcuts in Text Classifiers","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"chidaksh/spurious_mitigator","path":"src/civil_comments/spurfinder.py","file_url":"https://github.com/chidaksh/spurious_mitigator/blob/HEAD/src/civil_comments/spurfinder.py","status":"ran","verification_level":1,"contract_check":null,"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, chidaksh/spurious_mitigator when it was checked","code_sha256":"995d99f342d7b16d","code_sha256_prefix":"995d99f342d7b16d","mcp_get_code":{"code_sha256":"995d99f342d7b16d"}},{"arxiv_id":"2607.00605","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-00605","title":"Auditing Forgetting in Limited Memory Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"raeesiarya/LMLMAudit","path":"src/lmlm-audit/run_audit.py","file_url":"https://github.com/raeesiarya/LMLMAudit/blob/HEAD/src/lmlm-audit/run_audit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7a44c18a1cf3b39","code_sha256_prefix":"f7a44c18a1cf3b39","mcp_get_code":{"code_sha256":"f7a44c18a1cf3b39"}},{"arxiv_id":"2603.15892","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-15892","title":"Temporal Conflicts in LLMs: Reproducibility Insights from Unifying DYNAMICQA and MULAN","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"terrierteam/temporal_conflicts","path":"fact_mutability/bkp_inference.py","file_url":"https://github.com/terrierteam/temporal_conflicts/blob/HEAD/fact_mutability/bkp_inference.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, terrierteam/temporal_conflicts when it was checked","code_sha256":"087a8df73a06c291","code_sha256_prefix":"087a8df73a06c291","mcp_get_code":{"code_sha256":"087a8df73a06c291"}},{"arxiv_id":"2507.17539","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.17539","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"MeteorElf/FundusExpert","path":"src/eval/eval_api/call_api.py","file_url":"https://github.com/MeteorElf/FundusExpert/blob/HEAD/src/eval/eval_api/call_api.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":"c0da0a953e4ec70f","code_sha256_prefix":"c0da0a953e4ec70f","mcp_get_code":{"code_sha256":"c0da0a953e4ec70f"}},{"arxiv_id":"2501.15140","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-and-boosting-the-power-of-fine","title":"Analyzing and Boosting the Power of Fine-Grained Visual Recognition for Multi-modal Large Language Models","date":"2025-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-icst-mipl/finedefics_iclr2025","path":"FOCI-Benchmark/benchmark/model/model.py","file_url":"https://github.com/pku-icst-mipl/finedefics_iclr2025/blob/HEAD/FOCI-Benchmark/benchmark/model/model.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, pku-icst-mipl/finedefics_iclr2025 when it was checked","code_sha256":"97922863aafd3d20","code_sha256_prefix":"97922863aafd3d20","mcp_get_code":{"code_sha256":"97922863aafd3d20"}},{"arxiv_id":"2406.11171","arxiv_id_is_arxiv":true,"paper":"/paper/sugarcrepe-dataset-vision-language-model","title":"SUGARCREPE++ Dataset: Vision-Language Model Sensitivity to Semantic and Lexical Alterations","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sri-Harsha/scpp","path":"generate_sugarcrepe_plus-mistral.py","file_url":"https://github.com/Sri-Harsha/scpp/blob/HEAD/generate_sugarcrepe_plus-mistral.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd7870b8098d6090","code_sha256_prefix":"cd7870b8098d6090","mcp_get_code":{"code_sha256":"cd7870b8098d6090"}},{"arxiv_id":"2403.00843","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-long-term-recommendation-with-bi","title":"Large Language Models are Learnable Planners for Long-Term Recommendation","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jizhi-zhang/billp","path":"generation_rec_agents.py","file_url":"https://github.com/jizhi-zhang/billp/blob/HEAD/generation_rec_agents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"709bc4884360648d","code_sha256_prefix":"709bc4884360648d","mcp_get_code":{"code_sha256":"709bc4884360648d"}},{"arxiv_id":"2310.13332","arxiv_id_is_arxiv":true,"paper":"/paper/democratizing-reasoning-ability-tailored","title":"Democratizing Reasoning Ability: Tailored Learning from Large Language Model","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Raibows/Learn-to-Reason","path":"preprocessors.py","file_url":"https://github.com/Raibows/Learn-to-Reason/blob/HEAD/preprocessors.py","status":"unverified","verification_level":0,"contract_check":null,"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, Raibows/Learn-to-Reason when it was checked","code_sha256":"838de4f52529652c","code_sha256_prefix":"838de4f52529652c","mcp_get_code":{"code_sha256":"838de4f52529652c"}}],"record_sha256":"eaadaa93762d5b7d6ac95a87865ff3f3026920b3ceb292d318eb4455a21a6ad9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}