{"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/pairwise-cosine-similarity","entry":"pairwise_cosine_similarity","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":5,"n_papers_ran":1,"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":4,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":3},"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":"2605.06943","paper":"/paper/arxiv-2605-06943","title":"ProtoSSL: Interpretable Prototype Learning from Unlabeled Time-Series Data","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"StevenSong/ProtoSSL","path":"protossl/models/_prototype_classifier.py","file_url":"https://github.com/StevenSong/ProtoSSL/blob/HEAD/protossl/models/_prototype_classifier.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"39e13ad9ee67b106","mcp_get_code":{"code_sha256":"39e13ad9ee67b106"}},{"arxiv_id":"2510.22897","paper":"/paper/arxiv-2510-22897","title":"Charting the Design Space of Neural Graph Representations for Subgraph Matching","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"structlearning/neural-subm-design-space","path":"GMN/graphmatchingnetwork.py","file_url":"https://github.com/structlearning/neural-subm-design-space/blob/HEAD/GMN/graphmatchingnetwork.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b0a1692650a31872","mcp_get_code":{"code_sha256":"b0a1692650a31872"}},{"arxiv_id":"2409.17687","paper":"/paper/graph-edit-distance-with-general-costs-using","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"structlearning/GraphEdX","path":"GMN/fast_graphmatchingnetwork.py","file_url":"https://github.com/structlearning/GraphEdX/blob/HEAD/GMN/fast_graphmatchingnetwork.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0a1692650a31872","mcp_get_code":{"code_sha256":"b0a1692650a31872"}},{"arxiv_id":"2302.12028","paper":"/paper/novel-class-discovery-an-introduction-and-key","title":"Novel Class Discovery: an Introduction and Key Concepts","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orange-opensource/practicalncd","path":"src/utils.py","file_url":"https://github.com/orange-opensource/practicalncd/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"96052c7ae3b2180e","mcp_get_code":{"code_sha256":"96052c7ae3b2180e"}},{"arxiv_id":"2020.acl-main.192","paper":null,"title":"arXiv:2020.acl-main.192","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"neulab/cmu-multinlp","path":"brat_multitask/models/brat_multitask.py","file_url":"https://github.com/neulab/cmu-multinlp/blob/HEAD/brat_multitask/models/brat_multitask.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"84d45db5bc373c2f","mcp_get_code":{"code_sha256":"84d45db5bc373c2f"}}]}