{"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/calculate-cosine-similarity","entry":"calculate_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":9,"n_papers_ran":7,"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":8,"n_samples_ran":6,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":2},"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":"2601.11161","paper":"/paper/arxiv-2601-11161","title":"GMM-COMET: Continual Source-Free Universal Domain Adaptation via a Mean Teacher and Gaussian Mixture Model-Based Pseudo-Labeling","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"pascalschlachter/GMM-COMET","path":"adaptation.py","file_url":"https://github.com/pascalschlachter/GMM-COMET/blob/HEAD/adaptation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"887b390277e82962","mcp_get_code":{"code_sha256":"887b390277e82962"}},{"arxiv_id":"2511.01293","paper":"/paper/arxiv-2511-01293","title":"Detecting Generated Images by Fitting Natural Image Distributions","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"tmlr-group/ConV","path":"srcs/ConV.py","file_url":"https://github.com/tmlr-group/ConV/blob/HEAD/srcs/ConV.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c50a5cf11b9ea3b0","mcp_get_code":{"code_sha256":"c50a5cf11b9ea3b0"}},{"arxiv_id":"2505.07437","paper":"/paper/lead-iterative-data-selection-for-efficient","title":"LEAD: Iterative Data Selection for Efficient LLM Instruction Tuning","date":"2025-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUSTDial/LEAD","path":"src/online/utilityChange.py","file_url":"https://github.com/HKUSTDial/LEAD/blob/HEAD/src/online/utilityChange.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0228778589332787","mcp_get_code":{"code_sha256":"0228778589332787"}},{"arxiv_id":"2412.05897","paper":"/paper/detecting-discrepancies-between-ai-generated","title":"Detecting Discrepancies Between AI-Generated and Natural Images Using Uncertainty","date":"2024-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/WePe","path":"wepe.py","file_url":"https://github.com/tmlr-group/WePe/blob/HEAD/wepe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77b509a67b73959b","mcp_get_code":{"code_sha256":"77b509a67b73959b"}},{"arxiv_id":"2407.15240","paper":"/paper/bigbench-a-unified-benchmark-for-social-bias","title":"BIGbench: A Unified Benchmark for Evaluating Multi-dimensional Social Biases in Text-to-Image Models","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigbench2024/bigbench2024","path":"benchmark/evaluate/implicit.py","file_url":"https://github.com/bigbench2024/bigbench2024/blob/HEAD/benchmark/evaluate/implicit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"1cfda480b860f7a7","mcp_get_code":{"code_sha256":"1cfda480b860f7a7"}},{"arxiv_id":"2407.11277","paper":"/paper/target-conversation-extraction-source","title":"Target conversation extraction: Source separation using turn-taking dynamics","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chentuochao/target-conversation-extraction","path":"eval_conversation.py","file_url":"https://github.com/chentuochao/target-conversation-extraction/blob/HEAD/eval_conversation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a0208c2aa866774d","mcp_get_code":{"code_sha256":"a0208c2aa866774d"}},{"arxiv_id":"2405.17814","paper":"/paper/faintbench-a-holistic-and-precise-benchmark","title":"FAIntbench: A Holistic and Precise Benchmark for Bias Evaluation in Text-to-Image Models","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astarojth/faintbench-v1","path":"eval/implicit/implicit.py","file_url":"https://github.com/astarojth/faintbench-v1/blob/HEAD/eval/implicit/implicit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"1cfda480b860f7a7","mcp_get_code":{"code_sha256":"1cfda480b860f7a7"}},{"arxiv_id":"2403.14774","paper":"/paper/few-shot-adversarial-prompt-learning-on","title":"Few-Shot Adversarial Prompt Learning on Vision-Language Models","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lionel-w2/fap","path":"trainers/fap.py","file_url":"https://github.com/lionel-w2/fap/blob/HEAD/trainers/fap.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e53cbc1ee35936a","mcp_get_code":{"code_sha256":"3e53cbc1ee35936a"}},{"arxiv_id":"2025.emnlp-main.67","paper":null,"title":"arXiv:2025.emnlp-main.67","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"isyuhaochen/RRC-DSCD","path":"code/eval/cal_sim.py","file_url":"https://github.com/isyuhaochen/RRC-DSCD/blob/HEAD/code/eval/cal_sim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"24eb913d16fbf46e","mcp_get_code":{"code_sha256":"24eb913d16fbf46e"}}]}