{"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/cal-similarity","entry":"cal_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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":9,"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":1,"ran_fixture":1,"ran":7,"unverified":0},"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":"2502.20332","arxiv_id_is_arxiv":true,"paper":"/paper/emergent-symbolic-mechanisms-support-abstract","title":"Emergent Symbolic Mechanisms Support Abstract Reasoning in Large Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukang123/LLMSymbMech","path":"tasks/identity_rules/rsa.py","file_url":"https://github.com/yukang123/LLMSymbMech/blob/HEAD/tasks/identity_rules/rsa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, yukang123/LLMSymbMech when it was checked","code_sha256":"bb921e3c42f12f1c","code_sha256_prefix":"bb921e3c42f12f1c","mcp_get_code":{"code_sha256":"bb921e3c42f12f1c"}},{"arxiv_id":"2410.23904","arxiv_id_is_arxiv":true,"paper":"/paper/ez-hoi-vlm-adaptation-via-guided-prompt","title":"EZ-HOI: VLM Adaptation via Guided Prompt Learning for Zero-Shot HOI Detection","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChelsieLei/EZ-HOI","path":"upt_tip_cache_model_free_finetune_distillself.py","file_url":"https://github.com/ChelsieLei/EZ-HOI/blob/HEAD/upt_tip_cache_model_free_finetune_distillself.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, ChelsieLei/EZ-HOI when it was checked","code_sha256":"208dc30343c2fb3e","code_sha256_prefix":"208dc30343c2fb3e","mcp_get_code":{"code_sha256":"208dc30343c2fb3e"}},{"arxiv_id":"2408.07246","arxiv_id_is_arxiv":true,"paper":"/paper/seeing-and-understanding-bridging-vision-with","title":"ChemVLM: Exploring the Power of Multimodal Large Language Models in Chemistry Area","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4Chem/ChemVlm","path":"cal_sim.py","file_url":"https://github.com/AI4Chem/ChemVlm/blob/HEAD/cal_sim.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, AI4Chem/ChemVlm when it was checked","code_sha256":"9c3bca95c1f7acc2","code_sha256_prefix":"9c3bca95c1f7acc2","mcp_get_code":{"code_sha256":"9c3bca95c1f7acc2"}},{"arxiv_id":"2309.13625","arxiv_id_is_arxiv":true,"paper":"/paper/graphadapter-tuning-vision-language-models-1","title":"GraphAdapter: Tuning Vision-Language Models With Dual Knowledge Graph","date":"2023-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixinustc/graphadapter","path":"baseclip_graph_v1.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/baseclip_graph_v1.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, lixinustc/graphadapter when it was checked","code_sha256":"cb9f8a1583e97c3a","code_sha256_prefix":"cb9f8a1583e97c3a","mcp_get_code":{"code_sha256":"cb9f8a1583e97c3a"}},{"arxiv_id":"2306.11087","arxiv_id_is_arxiv":true,"paper":"/paper/primitive-generation-and-semantic-related-1","title":"Primitive Generation and Semantic-related Alignment for Universal Zero-Shot Segmentation","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heshuting555/PADing","path":"PADing/PADing_model.py","file_url":"https://github.com/heshuting555/PADing/blob/HEAD/PADing/PADing_model.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":"1a82e80d6ff663fd","code_sha256_prefix":"1a82e80d6ff663fd","mcp_get_code":{"code_sha256":"1a82e80d6ff663fd"}},{"arxiv_id":"2304.08408","arxiv_id_is_arxiv":true,"paper":"/paper/ovtrack-open-vocabulary-multiple-object","title":"OVTrack: Open-Vocabulary Multiple Object Tracking","date":"2023-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syscv/ovtrack","path":"ovtrack/core/track/similarity.py","file_url":"https://github.com/syscv/ovtrack/blob/HEAD/ovtrack/core/track/similarity.py","status":"ran","verification_level":1,"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":"f35b1bad8be372aa","code_sha256_prefix":"f35b1bad8be372aa","mcp_get_code":{"code_sha256":"f35b1bad8be372aa"}},{"arxiv_id":"2210.06984","arxiv_id_is_arxiv":true,"paper":"/paper/qdtrack-quasi-dense-similarity-learning-for","title":"QDTrack: Quasi-Dense Similarity Learning for Appearance-Only Multiple Object Tracking","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethvis/qd-track","path":"qdtrack/core/track/similarity.py","file_url":"https://github.com/ethvis/qd-track/blob/HEAD/qdtrack/core/track/similarity.py","status":"ran","verification_level":1,"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":"9971851d5c0043b1","code_sha256_prefix":"9971851d5c0043b1","mcp_get_code":{"code_sha256":"9971851d5c0043b1"}},{"arxiv_id":"2106.11958","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-cross-attention-networks-for","title":"Prototypical Cross-Attention Networks for Multiple Object Tracking and Segmentation","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SysCV/pcan","path":"pcan/core/track/similarity.py","file_url":"https://github.com/SysCV/pcan/blob/HEAD/pcan/core/track/similarity.py","status":"ran","verification_level":1,"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":"ecbbdf2760634c6f","code_sha256_prefix":"ecbbdf2760634c6f","mcp_get_code":{"code_sha256":"ecbbdf2760634c6f"}},{"arxiv_id":"aaai_16593","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16593","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamHaoYuan/DSANForAAAI2021","path":"baselines/CoSAN/dataloader.py","file_url":"https://github.com/SamHaoYuan/DSANForAAAI2021/blob/HEAD/baselines/CoSAN/dataloader.py","status":"ran","verification_level":1,"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":"77328d97c857a533","code_sha256_prefix":"77328d97c857a533","mcp_get_code":{"code_sha256":"77328d97c857a533"}}],"record_sha256":"5bb23e05774d8bb018081c5919f1e396ebc9e4392ed04151cddee1d2cab8747d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}