{"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/compute-cosine-similarity","entry":"compute_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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":5,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":13,"n_places_pointer_only":8,"n_places_pointer_only_link_open":4,"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":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":4,"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":"2608.23358","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23358","title":"The Geometry of Low-Resource Language Representations","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"francois-meyer/cpt-geometry","path":"compute_geometric_metrics.py","file_url":"https://github.com/francois-meyer/cpt-geometry/blob/HEAD/compute_geometric_metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, francois-meyer/cpt-geometry when it was checked","code_sha256":"166d870e3582c505","code_sha256_prefix":"166d870e3582c505","mcp_get_code":{"code_sha256":"166d870e3582c505"}},{"arxiv_id":"2606.12789","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12789","title":"How Fine-Grained Should a RAG Benchmark Be? A Hierarchical Framework for Synthetic Question Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"fensorechase/rag-diverse-benchmarks-synthetic-qa","path":"rag_system/generate/complete_analysis.py","file_url":"https://github.com/fensorechase/rag-diverse-benchmarks-synthetic-qa/blob/HEAD/rag_system/generate/complete_analysis.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd72ebfca815d89f","code_sha256_prefix":"dd72ebfca815d89f","mcp_get_code":{"code_sha256":"dd72ebfca815d89f"}},{"arxiv_id":"2605.12370","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12370","title":"Context Convergence Improves Answering Inferential Questions","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DataScienceUIBK/Context-Convergence-Inferential-QA","path":"dataset/compute_similarities.py","file_url":"https://github.com/DataScienceUIBK/Context-Convergence-Inferential-QA/blob/HEAD/dataset/compute_similarities.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"14faf83badd94cc4","code_sha256_prefix":"14faf83badd94cc4","mcp_get_code":{"code_sha256":"14faf83badd94cc4"}},{"arxiv_id":"2603.12296","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-12296","title":"Synthetic Data Generation for Brain-Computer Interfaces: Overview, Benchmarking, and Future Directions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"wzwvv/DG4BCI","path":"Synthetic_Data_Evaluation/CosineSim.py","file_url":"https://github.com/wzwvv/DG4BCI/blob/HEAD/Synthetic_Data_Evaluation/CosineSim.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":"fe86c613fc8212a2","code_sha256_prefix":"fe86c613fc8212a2","mcp_get_code":{"code_sha256":"fe86c613fc8212a2"}},{"arxiv_id":"2510.02392","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-02392","title":"KnowledgeSmith: Uncovering Knowledge Updating in LLMs with Model Editing and Unlearning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"AIFrontierLab/KnowledgeSmith","path":"training/unlearn/baselines/src/memflex_trainer.py","file_url":"https://github.com/AIFrontierLab/KnowledgeSmith/blob/HEAD/training/unlearn/baselines/src/memflex_trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, AIFrontierLab/KnowledgeSmith when it was checked","code_sha256":"835be88a656b57c2","code_sha256_prefix":"835be88a656b57c2","mcp_get_code":{"code_sha256":"835be88a656b57c2"}},{"arxiv_id":"2502.11190","arxiv_id_is_arxiv":true,"paper":"/paper/relearn-unlearning-via-learning-for-large","title":"ReLearn: Unlearning via Learning for Large Language Models","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/unlearn","path":"baselines/src/memflex_trainer.py","file_url":"https://github.com/zjunlp/unlearn/blob/HEAD/baselines/src/memflex_trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 AIFrontierLab/KnowledgeSmith, and GitHub detected no licence in that repository when it was checked","code_sha256":"835be88a656b57c2","code_sha256_prefix":"835be88a656b57c2","mcp_get_code":{"code_sha256":"835be88a656b57c2"}},{"arxiv_id":"2410.14649","arxiv_id_is_arxiv":true,"paper":"/paper/evopress-towards-optimal-dynamic-model","title":"EvoPress: Towards Optimal Dynamic Model Compression via Evolutionary Search","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IST-DASLab/EvoPress","path":"drop_scoring.py","file_url":"https://github.com/IST-DASLab/EvoPress/blob/HEAD/drop_scoring.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":"224d81b67a1c2965","code_sha256_prefix":"224d81b67a1c2965","mcp_get_code":{"code_sha256":"224d81b67a1c2965"}},{"arxiv_id":"2407.01920","arxiv_id_is_arxiv":true,"paper":"/paper/to-forget-or-not-towards-practical-knowledge","title":"To Forget or Not? Towards Practical Knowledge Unlearning for Large Language Models","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/knowundo","path":"pretrain/localization.py","file_url":"https://github.com/zjunlp/knowundo/blob/HEAD/pretrain/localization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 AIFrontierLab/KnowledgeSmith, and GitHub detected no licence in that repository when it was checked","code_sha256":"835be88a656b57c2","code_sha256_prefix":"835be88a656b57c2","mcp_get_code":{"code_sha256":"835be88a656b57c2"}},{"arxiv_id":"2311.05729","arxiv_id_is_arxiv":true,"paper":"/paper/gipcol-graph-injected-soft-prompting-for","title":"GIPCOL: Graph-Injected Soft Prompting for Compositional Zero-Shot Learning","date":"2023-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hlr/gipcol","path":"DataSet/compute_feasibility.py","file_url":"https://github.com/hlr/gipcol/blob/HEAD/DataSet/compute_feasibility.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, hlr/gipcol when it was checked","code_sha256":"f104560916c04c5d","code_sha256_prefix":"f104560916c04c5d","mcp_get_code":{"code_sha256":"f104560916c04c5d"}},{"arxiv_id":"2309.14859","arxiv_id_is_arxiv":true,"paper":"/paper/navigating-text-to-image-customization-from","title":"Navigating Text-To-Image Customization: From LyCORIS Fine-Tuning to Model Evaluation","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyber-meow/LyCORIS-evaluation","path":"lycoris_eval/evaluation/eval_text_similarity.py","file_url":"https://github.com/cyber-meow/LyCORIS-evaluation/blob/HEAD/lycoris_eval/evaluation/eval_text_similarity.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":"151339910eede7bb","code_sha256_prefix":"151339910eede7bb","mcp_get_code":{"code_sha256":"151339910eede7bb"}},{"arxiv_id":"2303.15111","arxiv_id_is_arxiv":true,"paper":"/paper/learning-attention-as-disentangler-for","title":"Learning Attention as Disentangler for Compositional Zero-shot Learning","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoosz/ade-czsl","path":"models/ade.py","file_url":"https://github.com/haoosz/ade-czsl/blob/HEAD/models/ade.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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 xduxyli/scen-master, and GitHub detected no licence in that repository when it was checked","code_sha256":"7388b930197b0c81","code_sha256_prefix":"7388b930197b0c81","mcp_get_code":{"code_sha256":"7388b930197b0c81"}},{"arxiv_id":"2211.10681","arxiv_id_is_arxiv":true,"paper":"/paper/decomposed-soft-prompt-guided-fusion","title":"Decomposed Soft Prompt Guided Fusion Enhancing for Compositional Zero-Shot Learning","date":"2022-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forest-art/dfsp","path":"download_data/feasibility.py","file_url":"https://github.com/forest-art/dfsp/blob/HEAD/download_data/feasibility.py","status":"ran","verification_level":1,"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 hlr/gipcol, and GitHub detected no licence in that repository when it was checked","code_sha256":"f104560916c04c5d","code_sha256_prefix":"f104560916c04c5d","mcp_get_code":{"code_sha256":"f104560916c04c5d"}},{"arxiv_id":"2206.14475","arxiv_id_is_arxiv":true,"paper":"/paper/siamese-contrastive-embedding-network-for-1","title":"Siamese Contrastive Embedding Network for Compositional Zero-Shot Learning","date":"2022-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xduxyli/scen-master","path":"models/scen.py","file_url":"https://github.com/xduxyli/scen-master/blob/HEAD/models/scen.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xduxyli/scen-master when it was checked","code_sha256":"7388b930197b0c81","code_sha256_prefix":"7388b930197b0c81","mcp_get_code":{"code_sha256":"7388b930197b0c81"}}],"record_sha256":"10acb0d7b66d949aa478ca4dd650c6c67fce9550214d914a5a7a20171adc081d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}