{"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/calculate-similarity","entry":"calculate_similarity","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":3,"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":15,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":15,"n_places_pointer_only":7,"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":3,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":3,"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":"2607.05095","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-05095","title":"FAST: A Holistic Framework for Optimizing Memory-I/O, Computation, and Sampling in Temporal GNN Training","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"NoneBone/FAST","path":"fast_util/topologyAware.py","file_url":"https://github.com/NoneBone/FAST/blob/HEAD/fast_util/topologyAware.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, NoneBone/FAST when it was checked","code_sha256":"ad79e9f3511a7be4","code_sha256_prefix":"ad79e9f3511a7be4","mcp_get_code":{"code_sha256":"ad79e9f3511a7be4"}},{"arxiv_id":"2601.09028","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-09028","title":"OpenDecoder: Open Large Language Model Decoding to Incorporate Document Quality in RAG","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"fengranMark/OpenDecoder","path":"src/retrieval/construct_indicators.py","file_url":"https://github.com/fengranMark/OpenDecoder/blob/HEAD/src/retrieval/construct_indicators.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":"9ba9e62b273b7c2b","code_sha256_prefix":"9ba9e62b273b7c2b","mcp_get_code":{"code_sha256":"9ba9e62b273b7c2b"}},{"arxiv_id":"2510.17947","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-17947","title":"PLAGUE: PLUG-AND-PLAY FRAMEWORK FOR LIFE-LONG ADAPTIVE GENERATION OF MULTI-TURN JAIL-BREAKS","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"madhavaggar/PLAGUE","path":"src/plague/strategy_utils.py","file_url":"https://github.com/madhavaggar/PLAGUE/blob/HEAD/src/plague/strategy_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, madhavaggar/PLAGUE when it was checked","code_sha256":"9cd436c3e8b74032","code_sha256_prefix":"9cd436c3e8b74032","mcp_get_code":{"code_sha256":"9cd436c3e8b74032"}},{"arxiv_id":"2501.00912","arxiv_id_is_arxiv":true,"paper":"/paper/autopresent-designing-structured-visuals-from","title":"AutoPresent: Designing Structured Visuals from Scratch","date":"2025-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"para-lost/AutoPresent","path":"evaluate/match.py","file_url":"https://github.com/para-lost/AutoPresent/blob/HEAD/evaluate/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":"d8b5102dc34864a0","code_sha256_prefix":"d8b5102dc34864a0","mcp_get_code":{"code_sha256":"d8b5102dc34864a0"}},{"arxiv_id":"2501.00879","arxiv_id_is_arxiv":true,"paper":"/paper/trustrag-enhancing-robustness-and","title":"TrustRAG: Enhancing Robustness and Trustworthiness in RAG","date":"2025-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huichizhou/trustrag","path":"defend_module.py","file_url":"https://github.com/huichizhou/trustrag/blob/HEAD/defend_module.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"78ca85b024095584","code_sha256_prefix":"78ca85b024095584","mcp_get_code":{"code_sha256":"78ca85b024095584"}},{"arxiv_id":"2410.17897","arxiv_id_is_arxiv":true,"paper":"/paper/value-residual-learning-for-alleviating","title":"Value Residual Learning For Alleviating Attention Concentration In Transformers","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zcchill/Value-Residual-Learning","path":"analyze/get_similarity.py","file_url":"https://github.com/Zcchill/Value-Residual-Learning/blob/HEAD/analyze/get_similarity.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":"b486d0595afc6517","code_sha256_prefix":"b486d0595afc6517","mcp_get_code":{"code_sha256":"b486d0595afc6517"}},{"arxiv_id":"2408.09559","arxiv_id_is_arxiv":true,"paper":"/paper/hiagent-hierarchical-working-memory","title":"HiAgent: Hierarchical Working Memory Management for Solving Long-Horizon Agent Tasks with Large Language Model","date":"2024-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiagent2024/hiagent","path":"agentboard/agents/ours_agent.py","file_url":"https://github.com/hiagent2024/hiagent/blob/HEAD/agentboard/agents/ours_agent.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hiagent2024/hiagent when it was checked","code_sha256":"c9a12f3f46e05a05","code_sha256_prefix":"c9a12f3f46e05a05","mcp_get_code":{"code_sha256":"c9a12f3f46e05a05"}},{"arxiv_id":"2406.14805","arxiv_id_is_arxiv":true,"paper":"/paper/how-well-do-llms-represent-values-across","title":"How Well Do LLMs Represent Values Across Cultures? Empirical Analysis of LLM Responses Based on Hofstede Cultural Dimensions","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juliakharchenko/multilingual-ai-alignment","path":"code/multilingual_openai_experimentation.py","file_url":"https://github.com/juliakharchenko/multilingual-ai-alignment/blob/HEAD/code/multilingual_openai_experimentation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, juliakharchenko/multilingual-ai-alignment when it was checked","code_sha256":"39f8a25f30421f60","code_sha256_prefix":"39f8a25f30421f60","mcp_get_code":{"code_sha256":"39f8a25f30421f60"}},{"arxiv_id":"2406.07001","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-boundary-ambiguity-and-inherent","title":"Mitigating Boundary Ambiguity and Inherent Bias for Text Classification in the Era of Large Language Models","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuge0335/pc-cot","path":"prompter.py","file_url":"https://github.com/chuge0335/pc-cot/blob/HEAD/prompter.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, chuge0335/pc-cot when it was checked","code_sha256":"c0eb035295701366","code_sha256_prefix":"c0eb035295701366","mcp_get_code":{"code_sha256":"c0eb035295701366"}},{"arxiv_id":"2404.00511","arxiv_id_is_arxiv":true,"paper":"/paper/mips-at-semeval-2024-task-3-multimodal","title":"MIPS at SemEval-2024 Task 3: Multimodal Emotion-Cause Pair Extraction in Conversations with Multimodal Language Models","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mips-colt/mer-mce","path":"submit_emotion-cause_pair.py","file_url":"https://github.com/mips-colt/mer-mce/blob/HEAD/submit_emotion-cause_pair.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, mips-colt/mer-mce when it was checked","code_sha256":"1b60b0cc0edef2c7","code_sha256_prefix":"1b60b0cc0edef2c7","mcp_get_code":{"code_sha256":"1b60b0cc0edef2c7"}},{"arxiv_id":"2403.13372","arxiv_id_is_arxiv":true,"paper":"/paper/llamafactory-unified-efficient-fine-tuning-of","title":"LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Models","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rcrossmeister/RLQG","path":"model/collector.py","file_url":"https://github.com/Rcrossmeister/RLQG/blob/HEAD/model/collector.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":"e03cb2df2255bfe4","code_sha256_prefix":"e03cb2df2255bfe4","mcp_get_code":{"code_sha256":"e03cb2df2255bfe4"}},{"arxiv_id":"2207.07802","arxiv_id_is_arxiv":true,"paper":"/paper/learning-granularity-unified-representations","title":"Learning Granularity-Unified Representations for Text-to-Image Person Re-identification","date":"2022-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiyinshao-h/lgur","path":"train_mydecoder_pixelvit_txtimg_3_bert.py","file_url":"https://github.com/zhiyinshao-h/lgur/blob/HEAD/train_mydecoder_pixelvit_txtimg_3_bert.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhiyinshao-h/lgur when it was checked","code_sha256":"070096906fcee351","code_sha256_prefix":"070096906fcee351","mcp_get_code":{"code_sha256":"070096906fcee351"}},{"arxiv_id":"2206.07796","arxiv_id_is_arxiv":true,"paper":"/paper/fixeval-execution-based-evaluation-of-program","title":"FixEval: Execution-based Evaluation of Program Fixes for Programming Problems","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahimanzum/fixeval","path":"src/split.py","file_url":"https://github.com/mahimanzum/fixeval/blob/HEAD/src/split.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":"2bd99fb1f49c213d","code_sha256_prefix":"2bd99fb1f49c213d","mcp_get_code":{"code_sha256":"2bd99fb1f49c213d"}},{"arxiv_id":"2025.findings-acl.193","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.193","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THUDM/SWE-Dev","path":"swedev/utils/extract_signs.py","file_url":"https://github.com/THUDM/SWE-Dev/blob/HEAD/swedev/utils/extract_signs.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":"bcdc78f209dfe277","code_sha256_prefix":"bcdc78f209dfe277","mcp_get_code":{"code_sha256":"bcdc78f209dfe277"}},{"arxiv_id":"136950719","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136950719 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Suo-Wei/SRCF","path":"src/loss/RankingLoss.py","file_url":"https://github.com/Suo-Wei/SRCF/blob/HEAD/src/loss/RankingLoss.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":"ae3aaa105d7d6077","code_sha256_prefix":"ae3aaa105d7d6077","mcp_get_code":{"code_sha256":"ae3aaa105d7d6077"}}],"record_sha256":"d4f0034fc21786c27c2df32bcaf4f66be8dbcb74e8c4224976c60444a7364a63","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}