{"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/calculate-cosine-similarity","entry":"calculate_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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":3,"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":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":"2601.11161","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pascalschlachter/GMM-COMET when it was checked","code_sha256":"887b390277e82962","code_sha256_prefix":"887b390277e82962","mcp_get_code":{"code_sha256":"887b390277e82962"}},{"arxiv_id":"2511.01293","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c50a5cf11b9ea3b0","code_sha256_prefix":"c50a5cf11b9ea3b0","mcp_get_code":{"code_sha256":"c50a5cf11b9ea3b0"}},{"arxiv_id":"2505.07437","arxiv_id_is_arxiv":true,"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":"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":"0228778589332787","code_sha256_prefix":"0228778589332787","mcp_get_code":{"code_sha256":"0228778589332787"}},{"arxiv_id":"2412.05897","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"77b509a67b73959b","code_sha256_prefix":"77b509a67b73959b","mcp_get_code":{"code_sha256":"77b509a67b73959b"}},{"arxiv_id":"2407.15240","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, bigbench2024/bigbench2024, is not in the permissive set Syntology serves inline","code_sha256":"1cfda480b860f7a7","code_sha256_prefix":"1cfda480b860f7a7","mcp_get_code":{"code_sha256":"1cfda480b860f7a7"}},{"arxiv_id":"2407.11277","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a0208c2aa866774d","code_sha256_prefix":"a0208c2aa866774d","mcp_get_code":{"code_sha256":"a0208c2aa866774d"}},{"arxiv_id":"2405.17814","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, astarojth/faintbench-v1, is not in the permissive set Syntology serves inline","code_sha256":"1cfda480b860f7a7","code_sha256_prefix":"1cfda480b860f7a7","mcp_get_code":{"code_sha256":"1cfda480b860f7a7"}},{"arxiv_id":"2403.14774","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e53cbc1ee35936a","code_sha256_prefix":"3e53cbc1ee35936a","mcp_get_code":{"code_sha256":"3e53cbc1ee35936a"}},{"arxiv_id":"2025.emnlp-main.67","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24eb913d16fbf46e","code_sha256_prefix":"24eb913d16fbf46e","mcp_get_code":{"code_sha256":"24eb913d16fbf46e"}}],"record_sha256":"a027776955b688f70d28e2c1d4a2fb8f05b16ed7b3cb8a1daa1036ecffa45d96","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}