{"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/pairwise-cosine-similarity","entry":"pairwise_cosine_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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":0,"ran":2,"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":"2605.06943","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39e13ad9ee67b106","code_sha256_prefix":"39e13ad9ee67b106","mcp_get_code":{"code_sha256":"39e13ad9ee67b106"}},{"arxiv_id":"2510.22897","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, structlearning/neural-subm-design-space when it was checked","code_sha256":"b0a1692650a31872","code_sha256_prefix":"b0a1692650a31872","mcp_get_code":{"code_sha256":"b0a1692650a31872"}},{"arxiv_id":"2409.17687","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from structlearning/neural-subm-design-space, and GitHub detected no licence in that repository when it was checked","code_sha256":"b0a1692650a31872","code_sha256_prefix":"b0a1692650a31872","mcp_get_code":{"code_sha256":"b0a1692650a31872"}},{"arxiv_id":"2302.12028","arxiv_id_is_arxiv":true,"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":"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":"96052c7ae3b2180e","code_sha256_prefix":"96052c7ae3b2180e","mcp_get_code":{"code_sha256":"96052c7ae3b2180e"}},{"arxiv_id":"2020.acl-main.192","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d45db5bc373c2f","code_sha256_prefix":"84d45db5bc373c2f","mcp_get_code":{"code_sha256":"84d45db5bc373c2f"}}],"record_sha256":"452a46061d86e28cde6dd56cda659f13bb479a6c639636057292beb909084de8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}