{"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/match","entry":"match","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":12,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":2,"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":12,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":13,"n_places_pointer_only":6,"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":4,"ran_draft_wrong":0,"ran_fixture":2,"ran":6,"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":"2505.19616","arxiv_id_is_arxiv":true,"paper":"/paper/diagnosing-and-mitigating-modality","title":"Diagnosing and Mitigating Modality Interference in Multimodal Large Language Models","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luisrui/Modality-Interference-in-MLLMs","path":"analysis/evaluate/evaluate_mc.py","file_url":"https://github.com/luisrui/Modality-Interference-in-MLLMs/blob/HEAD/analysis/evaluate/evaluate_mc.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, luisrui/Modality-Interference-in-MLLMs when it was checked","code_sha256":"1ae0578c2de4bede","code_sha256_prefix":"1ae0578c2de4bede","mcp_get_code":{"code_sha256":"1ae0578c2de4bede"}},{"arxiv_id":"2410.20724","arxiv_id_is_arxiv":true,"paper":"/paper/simple-is-effective-the-roles-of-graphs-and","title":"Simple Is Effective: The Roles of Graphs and Large Language Models in Knowledge-Graph-Based Retrieval-Augmented Generation","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/SubgraphRAG","path":"reason/metrics/evaluate_results.py","file_url":"https://github.com/Graph-COM/SubgraphRAG/blob/HEAD/reason/metrics/evaluate_results.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f75dc97b8ef40987","code_sha256_prefix":"f75dc97b8ef40987","mcp_get_code":{"code_sha256":"f75dc97b8ef40987"}},{"arxiv_id":"2410.03659","arxiv_id_is_arxiv":true,"paper":"/paper/unraveling-cross-modality-knowledge-conflict","title":"Unraveling Cross-Modality Knowledge Conflicts in Large Vision-Language Models","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luka-group/vlm-knowledge-conflict","path":"src/evaluate/evaluate_mc.py","file_url":"https://github.com/luka-group/vlm-knowledge-conflict/blob/HEAD/src/evaluate/evaluate_mc.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, luka-group/vlm-knowledge-conflict when it was checked","code_sha256":"bcc5b7e1c3c18f93","code_sha256_prefix":"bcc5b7e1c3c18f93","mcp_get_code":{"code_sha256":"bcc5b7e1c3c18f93"}},{"arxiv_id":"2407.00023","arxiv_id_is_arxiv":true,"paper":"/paper/preble-efficient-distributed-prompt","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wuklab/preble","path":"preble/global_lru_cache.py","file_url":"https://github.com/wuklab/preble/blob/HEAD/preble/global_lru_cache.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e42d08e4e512c65e","code_sha256_prefix":"e42d08e4e512c65e","mcp_get_code":{"code_sha256":"e42d08e4e512c65e"}},{"arxiv_id":"2402.16842","arxiv_id_is_arxiv":true,"paper":"/paper/asymmetry-in-low-rank-adapters-of-foundation","title":"Asymmetry in Low-Rank Adapters of Foundation Models","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jiacheng-Zhu-AIML/AsymmetryLoRA","path":"GPT_experiments/utils.py","file_url":"https://github.com/Jiacheng-Zhu-AIML/AsymmetryLoRA/blob/HEAD/GPT_experiments/utils.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, Jiacheng-Zhu-AIML/AsymmetryLoRA when it was checked","code_sha256":"59f97c4aab5b76e8","code_sha256_prefix":"59f97c4aab5b76e8","mcp_get_code":{"code_sha256":"59f97c4aab5b76e8"}},{"arxiv_id":"2402.11199","arxiv_id_is_arxiv":true,"paper":"/paper/direct-evaluation-of-chain-of-thought-in","title":"Direct Evaluation of Chain-of-Thought in Multi-hop Reasoning with Knowledge Graphs","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minhvuong2000/llmreasoncert","path":"evaluate_results.py","file_url":"https://github.com/minhvuong2000/llmreasoncert/blob/HEAD/evaluate_results.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, minhvuong2000/llmreasoncert when it was checked","code_sha256":"876ffe758695f56b","code_sha256_prefix":"876ffe758695f56b","mcp_get_code":{"code_sha256":"876ffe758695f56b"}},{"arxiv_id":"2204.02549","arxiv_id_is_arxiv":true,"paper":"/paper/c3kg-a-chinese-commonsense-conversation","title":"C3KG: A Chinese Commonsense Conversation Knowledge Graph","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaoMi/C3KG","path":"construct/extract_entity.py","file_url":"https://github.com/XiaoMi/C3KG/blob/HEAD/construct/extract_entity.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":"96a7d2e42770e48d","code_sha256_prefix":"96a7d2e42770e48d","mcp_get_code":{"code_sha256":"96a7d2e42770e48d"}},{"arxiv_id":"2103.16130","arxiv_id_is_arxiv":true,"paper":"/paper/active-learning-for-deep-object-detection-via","title":"Active Learning for Deep Object Detection via Probabilistic Modeling","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/AL-MDN","path":"layers/modules/multibox_loss_gmm.py","file_url":"https://github.com/NVlabs/AL-MDN/blob/HEAD/layers/modules/multibox_loss_gmm.py","status":"unverified","verification_level":0,"contract_check":null,"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, NVlabs/AL-MDN (NOASSERTION)","code_sha256":"b30de0bd397ec8e3","code_sha256_prefix":"b30de0bd397ec8e3","mcp_get_code":{"code_sha256":"b30de0bd397ec8e3"}},{"arxiv_id":"2010.07518","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-analysis-and-influence-of","title":"Automatic Analysis and Influence of Hierarchical Structure on Melody, Rhythm and Harmony in Popular Music","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"Dsqvival/hierarchical-structure-analysis","path":"preprocessing/quantize_and_match.py","file_url":"https://github.com/Dsqvival/hierarchical-structure-analysis/blob/HEAD/preprocessing/quantize_and_match.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":"fc3a60a1cf1f7e08","code_sha256_prefix":"fc3a60a1cf1f7e08","mcp_get_code":{"code_sha256":"fc3a60a1cf1f7e08"}},{"arxiv_id":"2004.12316","arxiv_id_is_arxiv":true,"paper":"/paper/endowing-empathetic-conversational-models","title":"Towards Persona-Based Empathetic Conversational Models","date":"2020-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongpeixiang/PEC","path":"CoBERT.py","file_url":"https://github.com/zhongpeixiang/PEC/blob/HEAD/CoBERT.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, zhongpeixiang/PEC, is not in the permissive set Syntology serves inline","code_sha256":"dc6a16e2c4a8f975","code_sha256_prefix":"dc6a16e2c4a8f975","mcp_get_code":{"code_sha256":"dc6a16e2c4a8f975"}},{"arxiv_id":"1904.04514","arxiv_id_is_arxiv":true,"paper":"/paper/high-resolution-representations-for-labeling","title":"High-Resolution Representations for Labeling Pixels and Regions","date":"2019-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mdt48/semantic-segmentation-pytorch","path":"adjust_hotels.py","file_url":"https://github.com/mdt48/semantic-segmentation-pytorch/blob/HEAD/adjust_hotels.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"98a265524b160e10","code_sha256_prefix":"98a265524b160e10","mcp_get_code":{"code_sha256":"98a265524b160e10"}},{"arxiv_id":"1806.10348","arxiv_id_is_arxiv":true,"paper":"/paper/learning-visually-grounded-semantics-from","title":"Learning Visually-Grounded Semantics from Contrastive Adversarial Samples","date":"2018-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ExplorerFreda/VSE-C","path":"adversarial_attack/relation.py","file_url":"https://github.com/ExplorerFreda/VSE-C/blob/HEAD/adversarial_attack/relation.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":"373106f951241575","code_sha256_prefix":"373106f951241575","mcp_get_code":{"code_sha256":"373106f951241575"}},{"arxiv_id":"2024.findings-emnlp.927","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.927","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hwy9855/GSR","path":"src/gsr/inference.py","file_url":"https://github.com/hwy9855/GSR/blob/HEAD/src/gsr/inference.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":"4c0b6fe3f3f87b7c","code_sha256_prefix":"4c0b6fe3f3f87b7c","mcp_get_code":{"code_sha256":"4c0b6fe3f3f87b7c"}}],"record_sha256":"8942fca60d3a918cc449fda8bcce9b21bce690ad18755f058c2e9f5ee6f04a9b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}