{"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/compute-sim","entry":"compute_sim","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":7,"n_papers_ran":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":7,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":4},"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":"2601.20283","paper":"/paper/arxiv-2601-20283","title":"One Word is Enough: Minimal Adversarial Perturbations for Neural Text Ranking","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Tanmay-Karmakar/one_word","path":"get_query_center.py","file_url":"https://github.com/Tanmay-Karmakar/one_word/blob/HEAD/get_query_center.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a7af8c2daac3bb09","mcp_get_code":{"code_sha256":"a7af8c2daac3bb09"}},{"arxiv_id":"2502.13308","paper":"/paper/a-label-free-heterophily-guided-approach-for","title":"A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"campanulabells/huge-gad","path":"modules/loss.py","file_url":"https://github.com/campanulabells/huge-gad/blob/HEAD/modules/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5daea2629cef25a2","mcp_get_code":{"code_sha256":"5daea2629cef25a2"}},{"arxiv_id":"2407.17396","paper":"/paper/systematic-reasoning-about-relational-domains","title":"Systematic Reasoning About Relational Domains With Graph Neural Networks","date":"2024-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erg0dic/gnn-sg","path":"src/model_nbf_general.py","file_url":"https://github.com/erg0dic/gnn-sg/blob/HEAD/src/model_nbf_general.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"450e7e3a9b1078da","mcp_get_code":{"code_sha256":"450e7e3a9b1078da"}},{"arxiv_id":"2404.17273","paper":"/paper/3shnet-boosting-image-sentence-retrieval-via","title":"3SHNet: Boosting Image-Sentence Retrieval via Visual Semantic-Spatial Self-Highlighting","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xurige1995/3shnet","path":"lib/evaluation_rgn_seg_sp_se.py","file_url":"https://github.com/xurige1995/3shnet/blob/HEAD/lib/evaluation_rgn_seg_sp_se.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"92939f518491d46a","mcp_get_code":{"code_sha256":"92939f518491d46a"}},{"arxiv_id":"2305.06152","paper":"/paper/structure-clip-enhance-multi-modal-language","title":"Structure-CLIP: Towards Scene Graph Knowledge to Enhance Multi-modal Structured Representations","date":"2023-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/DUET","path":"model/util.py","file_url":"https://github.com/zjukg/DUET/blob/HEAD/model/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cad018a9a75d5d4b","mcp_get_code":{"code_sha256":"cad018a9a75d5d4b"}},{"arxiv_id":"2111.03628","paper":"/paper/exploiting-a-zoo-of-checkpoints-for-unseen","title":"Exploiting a Zoo of Checkpoints for Unseen Tasks","date":"2021-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baidu-research/task_space","path":"vision/admin_computes_agent_sim.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/admin_computes_agent_sim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1255577a1db4160b","mcp_get_code":{"code_sha256":"1255577a1db4160b"}},{"arxiv_id":"2010.04119","paper":"/paper/leakage-adjusted-simulatability-can-models","title":"Leakage-Adjusted Simulatability: Can Models Generate Non-Trivial Explanations of Their Behavior in Natural Language?","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterbhase/LAS-NL-Explanations","path":"sim_experiments/compute_sim.py","file_url":"https://github.com/peterbhase/LAS-NL-Explanations/blob/HEAD/sim_experiments/compute_sim.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed6535cbd4e23c72","mcp_get_code":{"code_sha256":"ed6535cbd4e23c72"}}]}