{"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-cache","entry":"load_cache","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":13,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":2,"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":13,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":7,"n_samples_unverified":5,"n_samples_fingerprinted":5,"n_places":14,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"unverified":5},"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":"2604.03616","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-03616","title":"The Format Tax","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ivnle/the-format-tax","path":"judge.py","file_url":"https://github.com/ivnle/the-format-tax/blob/HEAD/judge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ivnle/the-format-tax (NOASSERTION)","code_sha256":"51052e8e0a123f28","code_sha256_prefix":"51052e8e0a123f28","mcp_get_code":{"code_sha256":"51052e8e0a123f28"}},{"arxiv_id":"2512.10359","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-10359","title":"Tool-Augmented Spatiotemporal Reasoning for Streamlining Video Question Answering Task","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"fansunqi/VideoTool","path":"util.py","file_url":"https://github.com/fansunqi/VideoTool/blob/HEAD/util.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":"bc33bf64eaeb089c","code_sha256_prefix":"bc33bf64eaeb089c","mcp_get_code":{"code_sha256":"bc33bf64eaeb089c"}},{"arxiv_id":"2510.22851","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22851","title":"Semantic Surgery: Zero-Shot Concept Erasure in Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Lexiang-Xiong/Semantic-Surgery","path":"evaluation/eval_ASR.py","file_url":"https://github.com/Lexiang-Xiong/Semantic-Surgery/blob/HEAD/evaluation/eval_ASR.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":"f934c875a6a07f36","code_sha256_prefix":"f934c875a6a07f36","mcp_get_code":{"code_sha256":"f934c875a6a07f36"}},{"arxiv_id":"2510.22851","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22851","title":"Semantic Surgery: Zero-Shot Concept Erasure in Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Lexiang-Xiong/Semantic-Surgery","path":"evaluation/eval_nudity.py","file_url":"https://github.com/Lexiang-Xiong/Semantic-Surgery/blob/HEAD/evaluation/eval_nudity.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":"333c2209ff5831ac","code_sha256_prefix":"333c2209ff5831ac","mcp_get_code":{"code_sha256":"333c2209ff5831ac"}},{"arxiv_id":"2503.02972","arxiv_id_is_arxiv":true,"paper":"/paper/lingoly-too-disentangling-memorisation-from","title":"LINGOLY-TOO: Disentangling Memorisation from Reasoning with Linguistic Templatisation and Orthographic Obfuscation","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkhouja/LingOly-TOO","path":"testing/code/benchmark_model.py","file_url":"https://github.com/jkhouja/LingOly-TOO/blob/HEAD/testing/code/benchmark_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, jkhouja/LingOly-TOO (NOASSERTION)","code_sha256":"d1ef341bc9f11b9e","code_sha256_prefix":"d1ef341bc9f11b9e","mcp_get_code":{"code_sha256":"d1ef341bc9f11b9e"}},{"arxiv_id":"2406.07502","arxiv_id_is_arxiv":true,"paper":"/paper/image-textualization-an-automatic-framework","title":"Image Textualization: An Automatic Framework for Creating Accurate and Detailed Image Descriptions","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sterzhang/image-textualization","path":"benchmark/Count/cnt.py","file_url":"https://github.com/sterzhang/image-textualization/blob/HEAD/benchmark/Count/cnt.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, sterzhang/image-textualization when it was checked","code_sha256":"f0f26534728a1b2e","code_sha256_prefix":"f0f26534728a1b2e","mcp_get_code":{"code_sha256":"f0f26534728a1b2e"}},{"arxiv_id":"2403.11083","arxiv_id_is_arxiv":true,"paper":"/paper/customizing-visual-language-foundation-models","title":"Customizing Visual-Language Foundation Models for Multi-modal Anomaly Detection and Reasoning","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaohao-xu/customizable-vlm","path":"main_gemini.py","file_url":"https://github.com/xiaohao-xu/customizable-vlm/blob/HEAD/main_gemini.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":"e451feea82753bb1","code_sha256_prefix":"e451feea82753bb1","mcp_get_code":{"code_sha256":"e451feea82753bb1"}},{"arxiv_id":"2402.18104","arxiv_id_is_arxiv":true,"paper":"/paper/making-them-ask-and-answer-jailbreaking-large","title":"Making Them Ask and Answer: Jailbreaking Large Language Models in Few Queries via Disguise and Reconstruction","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm-dra/dra","path":"src/attack/attack.py","file_url":"https://github.com/llm-dra/dra/blob/HEAD/src/attack/attack.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":"4f004755ae53e080","code_sha256_prefix":"4f004755ae53e080","mcp_get_code":{"code_sha256":"4f004755ae53e080"}},{"arxiv_id":"2310.10074","arxiv_id_is_arxiv":true,"paper":"/paper/sotta-robust-test-time-adaptation-on-noisy-1","title":"SoTTA: Robust Test-Time Adaptation on Noisy Data Streams","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taeckyung/SoTTA","path":"learner/sotta.py","file_url":"https://github.com/taeckyung/SoTTA/blob/HEAD/learner/sotta.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":"59771617b119cc63","code_sha256_prefix":"59771617b119cc63","mcp_get_code":{"code_sha256":"59771617b119cc63"}},{"arxiv_id":"2310.07589","arxiv_id_is_arxiv":true,"paper":"/paper/goodtriever-adaptive-toxicity-mitigation-with","title":"Goodtriever: Adaptive Toxicity Mitigation with Retrieval-augmented Models","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"for-ai/goodtriever","path":"utils/utils.py","file_url":"https://github.com/for-ai/goodtriever/blob/HEAD/utils/utils.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, for-ai/goodtriever when it was checked","code_sha256":"ff535bf88cf43cfe","code_sha256_prefix":"ff535bf88cf43cfe","mcp_get_code":{"code_sha256":"ff535bf88cf43cfe"}},{"arxiv_id":"2304.13343","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-infinite-length-input-capacity-for","title":"Enhancing Large Language Model with Self-Controlled Memory Framework","date":"2023-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wbbeyourself/scm4llms","path":"core/api.py","file_url":"https://github.com/wbbeyourself/scm4llms/blob/HEAD/core/api.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":"80afe2c0051330cf","code_sha256_prefix":"80afe2c0051330cf","mcp_get_code":{"code_sha256":"80afe2c0051330cf"}},{"arxiv_id":"2304.12397","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-challenges-of-using-black-box-apis-for","title":"On the Challenges of Using Black-Box APIs for Toxicity Evaluation in Research","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"for-ai/black-box-api-challenges","path":"utils/utils.py","file_url":"https://github.com/for-ai/black-box-api-challenges/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from for-ai/goodtriever, and GitHub detected no licence in that repository when it was checked","code_sha256":"ff535bf88cf43cfe","code_sha256_prefix":"ff535bf88cf43cfe","mcp_get_code":{"code_sha256":"ff535bf88cf43cfe"}},{"arxiv_id":"1906.07132","arxiv_id_is_arxiv":true,"paper":"/paper/avoiding-reasoning-shortcuts-adversarial","title":"Avoiding Reasoning Shortcuts: Adversarial Evaluation, Training, and Model Development for Multi-Hop QA","date":"2019-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangycTarheel/Adversarial-MultiHopQA","path":"convert_sp_facts.py","file_url":"https://github.com/jiangycTarheel/Adversarial-MultiHopQA/blob/HEAD/convert_sp_facts.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":"4bc6c631e9149f9d","code_sha256_prefix":"4bc6c631e9149f9d","mcp_get_code":{"code_sha256":"4bc6c631e9149f9d"}},{"arxiv_id":"1906.06298","arxiv_id_is_arxiv":true,"paper":"/paper/augmenting-neural-networks-with-first-order","title":"Augmenting Neural Networks with First-order Logic","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utahnlp/layer_augmentation","path":"constraint_preprocess.py","file_url":"https://github.com/utahnlp/layer_augmentation/blob/HEAD/constraint_preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"47b31034a78a8672","code_sha256_prefix":"47b31034a78a8672","mcp_get_code":{"code_sha256":"47b31034a78a8672"}}],"record_sha256":"3bad9c61294c2587c88ad27138b55efdf23c3a2b3a6695cc5ac4dbe70ab7f431","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}