{"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/cosine-similarity-matrix","entry":"cosine_similarity_matrix","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":8,"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":2,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":0,"ran":1,"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":"2607.10910","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-10910","title":"ZoRRO: A Zero-Weight Personalized Recommender System for Scalable News Recommendation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"johanneskruse/zorro","path":"src/zorro/model/zorro_numpy.py","file_url":"https://github.com/johanneskruse/zorro/blob/HEAD/src/zorro/model/zorro_numpy.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7fb6848dd8717d7c","code_sha256_prefix":"7fb6848dd8717d7c","mcp_get_code":{"code_sha256":"7fb6848dd8717d7c"}},{"arxiv_id":"2510.10963","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-10963","title":"APLOT: Robust Reward Modeling via Adaptive Preference Learning with Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"BIRlz/APLOT","path":"reward_models/aplot_trainer.py","file_url":"https://github.com/BIRlz/APLOT/blob/HEAD/reward_models/aplot_trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, BIRlz/APLOT when it was checked","code_sha256":"9eb0f896e194e1da","code_sha256_prefix":"9eb0f896e194e1da","mcp_get_code":{"code_sha256":"9eb0f896e194e1da"}},{"arxiv_id":"2412.14995","arxiv_id_is_arxiv":true,"paper":"/paper/hsevo-elevating-automatic-heuristic-design","title":"HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs","date":"2024-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datphamvn/hsevo","path":"diversity/metrics.py","file_url":"https://github.com/datphamvn/hsevo/blob/HEAD/diversity/metrics.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":"1b64542a1f3acc78","code_sha256_prefix":"1b64542a1f3acc78","mcp_get_code":{"code_sha256":"1b64542a1f3acc78"}},{"arxiv_id":"2402.14007","arxiv_id_is_arxiv":true,"paper":"/paper/can-watermarks-survive-translation-on-the","title":"Can Watermarks Survive Translation? On the Cross-lingual Consistency of Text Watermark for Large Language Models","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwhe99/x-sir","path":"src_watermark/xsir/analysis_transform_model.py","file_url":"https://github.com/zwhe99/x-sir/blob/HEAD/src_watermark/xsir/analysis_transform_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, zwhe99/x-sir when it was checked","code_sha256":"dbede5fea315d93e","code_sha256_prefix":"dbede5fea315d93e","mcp_get_code":{"code_sha256":"dbede5fea315d93e"}},{"arxiv_id":"2312.13032","arxiv_id_is_arxiv":true,"paper":"/paper/nodemixup-tackling-under-reaching-for-graph","title":"NodeMixup: Tackling Under-Reaching for Graph Neural Networks","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiganglu/nodemixup","path":"mixer.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/mixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"463f1b1322eb1a81","code_sha256_prefix":"463f1b1322eb1a81","mcp_get_code":{"code_sha256":"463f1b1322eb1a81"}},{"arxiv_id":"2310.17468","arxiv_id_is_arxiv":true,"paper":"/paper/cross-modal-active-complementary-learning-1","title":"Cross-modal Active Complementary Learning with Self-refining Correspondence","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qinyang79/crcl","path":"CRCL_NeurIPS23/model/CRCL.py","file_url":"https://github.com/qinyang79/crcl/blob/HEAD/CRCL_NeurIPS23/model/CRCL.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, qinyang79/crcl when it was checked","code_sha256":"7b18bd64b585e4d2","code_sha256_prefix":"7b18bd64b585e4d2","mcp_get_code":{"code_sha256":"7b18bd64b585e4d2"}},{"arxiv_id":"2106.05319","arxiv_id_is_arxiv":true,"paper":"/paper/stein-latent-optimization-for-gans","title":"Stein Latent Optimization for Generative Adversarial Networks","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shinyflight/SLOGAN","path":"slogan_cifar2.py","file_url":"https://github.com/shinyflight/SLOGAN/blob/HEAD/slogan_cifar2.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, shinyflight/SLOGAN (NOASSERTION)","code_sha256":"5ab5c90dcea6bcef","code_sha256_prefix":"5ab5c90dcea6bcef","mcp_get_code":{"code_sha256":"5ab5c90dcea6bcef"}},{"arxiv_id":"aaai_29328","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29328","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WeigangLu/NodeMixup","path":"mixer.py","file_url":"https://github.com/WeigangLu/NodeMixup/blob/HEAD/mixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"463f1b1322eb1a81","code_sha256_prefix":"463f1b1322eb1a81","mcp_get_code":{"code_sha256":"463f1b1322eb1a81"}}],"record_sha256":"3f770946bf379967b5a14ef5a2610d64cef8cdb7f8008c2411f4ea8f0b599c46","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}