{"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/cos-sim","entry":"cos_sim","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":34,"n_papers_ran":31,"n_papers_ran_no_instrument_failure":28,"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":25,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":19,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":21,"n_places":34,"n_places_pointer_only":7,"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":4,"ran_violates":2,"ran_draft_wrong":2,"ran_fixture":1,"ran":13,"unverified":3},"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":"2609.12454","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12454","title":"Bridging Vision Foundation Model Priors with CLIP for Spatial-aware Few-shot Anomaly Detection in Medical Images","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"JuzhengMiao/Spatial-FAD","path":"custom_utils.py","file_url":"https://github.com/JuzhengMiao/Spatial-FAD/blob/HEAD/custom_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":"80d50221b83e3ef4","code_sha256_prefix":"80d50221b83e3ef4","mcp_get_code":{"code_sha256":"80d50221b83e3ef4"}},{"arxiv_id":"2607.21274","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-21274","title":"A Comparative Evaluation of Embeddings and LLMs in a Greek Book Publisher Setting -The CUP Dataset","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"beir-cellar/beir","path":"beir/util.py","file_url":"https://github.com/beir-cellar/beir/blob/HEAD/beir/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"2601.12407","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12407","title":"De-Anonymization at Scale via Tournament-Style Attribution","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"shibing624/text2vec","path":"text2vec/similarity.py","file_url":"https://github.com/shibing624/text2vec/blob/HEAD/text2vec/similarity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"62871271d7551ed6","code_sha256_prefix":"62871271d7551ed6","mcp_get_code":{"code_sha256":"62871271d7551ed6"}},{"arxiv_id":"2411.00680","arxiv_id_is_arxiv":true,"paper":"/paper/zipfian-whitening","title":"Zipfian Whitening","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cl-tohoku/zipfian-whitening","path":"src/calc_isotropy_score.py","file_url":"https://github.com/cl-tohoku/zipfian-whitening/blob/HEAD/src/calc_isotropy_score.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, cl-tohoku/zipfian-whitening when it was checked","code_sha256":"de1b89dc518ebc26","code_sha256_prefix":"de1b89dc518ebc26","mcp_get_code":{"code_sha256":"de1b89dc518ebc26"}},{"arxiv_id":"2407.02883","arxiv_id_is_arxiv":true,"paper":"/paper/coir-a-comprehensive-benchmark-for-code","title":"CoIR: A Comprehensive Benchmark for Code Information Retrieval Models","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coir-team/coir","path":"coir/beir/util.py","file_url":"https://github.com/coir-team/coir/blob/HEAD/coir/beir/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"2406.14277","arxiv_id_is_arxiv":true,"paper":"/paper/augmenting-query-and-passage-for-retrieval","title":"QPaug: Question and Passage Augmentation for Open-Domain Question Answering of LLMs","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kmswin1/qpaug","path":"beir/util.py","file_url":"https://github.com/kmswin1/qpaug/blob/HEAD/beir/util.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, kmswin1/qpaug when it was checked","code_sha256":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"2406.10209","arxiv_id_is_arxiv":true,"paper":"/paper/be-like-a-goldfish-don-t-memorize-mitigating","title":"Be like a Goldfish, Don't Memorize! Mitigating Memorization in Generative LLMs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahans30/goldfish-loss","path":"lit_gpt/multiple_negative_ranking_loss.py","file_url":"https://github.com/ahans30/goldfish-loss/blob/HEAD/lit_gpt/multiple_negative_ranking_loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a8052087ba311802","code_sha256_prefix":"a8052087ba311802","mcp_get_code":{"code_sha256":"a8052087ba311802"}},{"arxiv_id":"2405.16089","arxiv_id_is_arxiv":true,"paper":"/paper/colt-towards-completeness-oriented-tool","title":"Towards Completeness-Oriented Tool Retrieval for Large Language Models","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quchangle1/colt","path":"models/COLT.py","file_url":"https://github.com/quchangle1/colt/blob/HEAD/models/COLT.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, quchangle1/colt when it was checked","code_sha256":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"2404.18185","arxiv_id_is_arxiv":true,"paper":"/paper/ranked-list-truncation-for-large-language","title":"Ranked List Truncation for Large Language Model-based Re-Ranking","date":"2024-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuanmeng/rlt4reranking","path":"rlt/features.py","file_url":"https://github.com/chuanmeng/rlt4reranking/blob/HEAD/rlt/features.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, chuanmeng/rlt4reranking when it was checked","code_sha256":"2adba2137f0c99d0","code_sha256_prefix":"2adba2137f0c99d0","mcp_get_code":{"code_sha256":"2adba2137f0c99d0"}},{"arxiv_id":"2403.12570","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-visual-language-models-for","title":"Adapting Visual-Language Models for Generalizable Anomaly Detection in Medical Images","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/mvfa-ad","path":"utils.py","file_url":"https://github.com/mediabrain-sjtu/mvfa-ad/blob/HEAD/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":"80d50221b83e3ef4","code_sha256_prefix":"80d50221b83e3ef4","mcp_get_code":{"code_sha256":"80d50221b83e3ef4"}},{"arxiv_id":"2402.04105","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-implicit-bias-in-explicitly","title":"Measuring Implicit Bias in Explicitly Unbiased Large Language Models","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baixuechunzi/llm-implicit-bias","path":"analysis/weat.py","file_url":"https://github.com/baixuechunzi/llm-implicit-bias/blob/HEAD/analysis/weat.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef8f74084d195a43","code_sha256_prefix":"ef8f74084d195a43","mcp_get_code":{"code_sha256":"ef8f74084d195a43"}},{"arxiv_id":"2401.17230","arxiv_id_is_arxiv":true,"paper":"/paper/espnet-spk-full-pipeline-speaker-embedding","title":"ESPnet-SPK: full pipeline speaker embedding toolkit with reproducible recipes, self-supervised front-ends, and off-the-shelf models","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jungjee/RawNet","path":"python/RawNet1/Keras/01-trn_RawNet.py","file_url":"https://github.com/Jungjee/RawNet/blob/HEAD/python/RawNet1/Keras/01-trn_RawNet.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":"5eaddc98390802b9","code_sha256_prefix":"5eaddc98390802b9","mcp_get_code":{"code_sha256":"5eaddc98390802b9"}},{"arxiv_id":"2312.13401","arxiv_id_is_arxiv":true,"paper":"/paper/time-is-encoded-in-the-weights-of-finetuned","title":"Time is Encoded in the Weights of Finetuned Language Models","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaiNylund/lm-weights-encode-time","path":"misc_analysis_and_figures/get_closest_month_time_vec_combo.py","file_url":"https://github.com/KaiNylund/lm-weights-encode-time/blob/HEAD/misc_analysis_and_figures/get_closest_month_time_vec_combo.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":"5cf053908b10bc25","code_sha256_prefix":"5cf053908b10bc25","mcp_get_code":{"code_sha256":"5cf053908b10bc25"}},{"arxiv_id":"2310.20501","arxiv_id_is_arxiv":true,"paper":"/paper/llms-may-dominate-information-access-neural","title":"Neural Retrievers are Biased Towards LLM-Generated Content","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kid-22/llm4ir-bias","path":"beir/util.py","file_url":"https://github.com/kid-22/llm4ir-bias/blob/HEAD/beir/util.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, kid-22/llm4ir-bias when it was checked","code_sha256":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"2310.11501","arxiv_id_is_arxiv":true,"paper":"/paper/compost-characterizing-and-evaluating","title":"CoMPosT: Characterizing and Evaluating Caricature in LLM Simulations","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"myracheng/lm_caricature","path":"helper_functions.py","file_url":"https://github.com/myracheng/lm_caricature/blob/HEAD/helper_functions.py","status":"ran","verification_level":1,"contract_check":null,"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, myracheng/lm_caricature when it was checked","code_sha256":"127d362dad7ba4e2","code_sha256_prefix":"127d362dad7ba4e2","mcp_get_code":{"code_sha256":"127d362dad7ba4e2"}},{"arxiv_id":"2309.15965","arxiv_id_is_arxiv":true,"paper":"/paper/trace-trajectory-counterfactual-explanation","title":"TraCE: Trajectory Counterfactual Explanation Scores","date":"2023-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeffnclark/trace","path":"helpers/funcs.py","file_url":"https://github.com/jeffnclark/trace/blob/HEAD/helpers/funcs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bff9357caec21792","code_sha256_prefix":"bff9357caec21792","mcp_get_code":{"code_sha256":"bff9357caec21792"}},{"arxiv_id":"2307.10037","arxiv_id_is_arxiv":true,"paper":"/paper/single-cell-rna-seq-data-imputation-using","title":"Single-cell RNA-seq data imputation using Feature Propagation","date":null,"month_inferred_from_arxiv_id":"2023-07","title_source":"archive","repo":"Junseok0207/scFP","path":"misc/utils.py","file_url":"https://github.com/Junseok0207/scFP/blob/HEAD/misc/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, Junseok0207/scFP when it was checked","code_sha256":"8d0890891bb21d75","code_sha256_prefix":"8d0890891bb21d75","mcp_get_code":{"code_sha256":"8d0890891bb21d75"}},{"arxiv_id":"2306.00526","arxiv_id_is_arxiv":true,"paper":"/paper/layout-and-task-aware-instruction-prompt-for","title":"Layout and Task Aware Instruction Prompt for Zero-shot Document Image Question Answering","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenjinw/latin-prompt","path":"utils/util.py","file_url":"https://github.com/wenjinw/latin-prompt/blob/HEAD/utils/util.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":"c480c7bac03cd36f","code_sha256_prefix":"c480c7bac03cd36f","mcp_get_code":{"code_sha256":"c480c7bac03cd36f"}},{"arxiv_id":"2303.03320","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-backdoor-federated-learning","title":"Learning to Backdoor Federated Learning","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HengerLi/RLBackdoorFL","path":"Util.py","file_url":"https://github.com/HengerLi/RLBackdoorFL/blob/HEAD/Util.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":"ea6f4a59cd65daf9","code_sha256_prefix":"ea6f4a59cd65daf9","mcp_get_code":{"code_sha256":"ea6f4a59cd65daf9"}},{"arxiv_id":"2212.13738","arxiv_id_is_arxiv":true,"paper":"/paper/tempclr-temporal-alignment-representation","title":"TempCLR: Temporal Alignment Representation with Contrastive Learning","date":"2022-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyuncong/tempclr","path":"tempclr/tasks/alignlocaltask.py","file_url":"https://github.com/yyuncong/tempclr/blob/HEAD/tempclr/tasks/alignlocaltask.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":"c13027eea5c9509f","code_sha256_prefix":"c13027eea5c9509f","mcp_get_code":{"code_sha256":"c13027eea5c9509f"}},{"arxiv_id":"2205.11981","arxiv_id_is_arxiv":true,"paper":"/paper/opom-customized-invisible-cloak-towards-face","title":"OPOM: Customized Invisible Cloak towards Face Privacy Protection","date":"2022-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyy/opom","path":"code/generation/attack/privacy.py","file_url":"https://github.com/zhongyy/opom/blob/HEAD/code/generation/attack/privacy.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":"0c9fa2d51db35a2a","code_sha256_prefix":"0c9fa2d51db35a2a","mcp_get_code":{"code_sha256":"0c9fa2d51db35a2a"}},{"arxiv_id":"2203.03463","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-sketch-induction-for-paraphrase","title":"Hierarchical Sketch Induction for Paraphrase Generation","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomhosking/hrq-vae","path":"src/hrq_vae.py","file_url":"https://github.com/tomhosking/hrq-vae/blob/HEAD/src/hrq_vae.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":"af51b6b925efb7fe","code_sha256_prefix":"af51b6b925efb7fe","mcp_get_code":{"code_sha256":"af51b6b925efb7fe"}},{"arxiv_id":"2111.04706","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-framework-for-gradient-leakage-1","title":"Bayesian Framework for Gradient Leakage","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/bayes-framework-leakage","path":"bayes_optimal_attack/utils/flax_losses.py","file_url":"https://github.com/eth-sri/bayes-framework-leakage/blob/HEAD/bayes_optimal_attack/utils/flax_losses.py","status":"unverified","verification_level":0,"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":"3f3c599d7fe199df","code_sha256_prefix":"3f3c599d7fe199df","mcp_get_code":{"code_sha256":"3f3c599d7fe199df"}},{"arxiv_id":"2104.08663","arxiv_id_is_arxiv":true,"paper":"/paper/beir-a-heterogenous-benchmark-for-zero-shot","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","date":"2021-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/beir","path":"beir/util.py","file_url":"https://github.com/UKPLab/beir/blob/HEAD/beir/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"2011.01536","arxiv_id_is_arxiv":true,"paper":"/paper/transquest-translation-quality-estimation","title":"TransQuest: Translation Quality Estimation with Cross-lingual Transformers","date":"2020-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tharindudr/transQuest","path":"transquest/algo/sentence_level/siamesetransquest/util.py","file_url":"https://github.com/tharindudr/transQuest/blob/HEAD/transquest/algo/sentence_level/siamesetransquest/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19d2149e7c25cfe7","code_sha256_prefix":"19d2149e7c25cfe7","mcp_get_code":{"code_sha256":"19d2149e7c25cfe7"}},{"arxiv_id":"2009.12534","arxiv_id_is_arxiv":true,"paper":"/paper/inltk-natural-language-toolkit-for-indic","title":"iNLTK: Natural Language Toolkit for Indic Languages","date":"2020-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goru001/inltk","path":"inltk/utils.py","file_url":"https://github.com/goru001/inltk/blob/HEAD/inltk/utils.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":"e332284c5d26af5e","code_sha256_prefix":"e332284c5d26af5e","mcp_get_code":{"code_sha256":"e332284c5d26af5e"}},{"arxiv_id":"2003.07496","arxiv_id_is_arxiv":true,"paper":"/paper/depara-deep-attribution-graph-for-deep","title":"DEPARA: Deep Attribution Graph for Deep Knowledge Transferability","date":"2020-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zju-vipa/DEPARA","path":"tools/layer_select.py","file_url":"https://github.com/zju-vipa/DEPARA/blob/HEAD/tools/layer_select.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8d6ce3b84fb3895f","code_sha256_prefix":"8d6ce3b84fb3895f","mcp_get_code":{"code_sha256":"8d6ce3b84fb3895f"}},{"arxiv_id":"1907.11692","arxiv_id_is_arxiv":true,"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"viethoang1512/kpa","path":"qs_kpa/losses/multiple_negatives_ranking_loss.py","file_url":"https://github.com/viethoang1512/kpa/blob/HEAD/qs_kpa/losses/multiple_negatives_ranking_loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"Niss_The_Inter-Intra_Modal_Measure_A_Predictive_Lens_on_Fine-Tuning_Outcomes_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Niss_The_Inter-Intra_Modal_Measure_A_Predictive_Lens_on_Fine-Tuning_Outcomes_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mit-ll/IIMM","path":"metrics.py","file_url":"https://github.com/mit-ll/IIMM/blob/HEAD/metrics.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":"5335f606aea003bc","code_sha256_prefix":"5335f606aea003bc","mcp_get_code":{"code_sha256":"5335f606aea003bc"}},{"arxiv_id":"2025.emnlp-main.840","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.840","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"starsuzi/DAQu","path":"daqu/retrieval.py","file_url":"https://github.com/starsuzi/DAQu/blob/HEAD/daqu/retrieval.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":"8f553ad75f773b63","code_sha256_prefix":"8f553ad75f773b63","mcp_get_code":{"code_sha256":"8f553ad75f773b63"}},{"arxiv_id":"2024.findings-acl.421","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-acl.421","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KID-22/Cocktail","path":"benchmark/beir/util.py","file_url":"https://github.com/KID-22/Cocktail/blob/HEAD/benchmark/beir/util.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":"8ca90d5388372be5","code_sha256_prefix":"8ca90d5388372be5","mcp_get_code":{"code_sha256":"8ca90d5388372be5"}},{"arxiv_id":"2023.findings-acl.892","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.892","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TharinduDR/TransQuest","path":"transquest/algo/sentence_level/siamesetransquest/util.py","file_url":"https://github.com/TharinduDR/TransQuest/blob/HEAD/transquest/algo/sentence_level/siamesetransquest/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19d2149e7c25cfe7","code_sha256_prefix":"19d2149e7c25cfe7","mcp_get_code":{"code_sha256":"19d2149e7c25cfe7"}},{"arxiv_id":"2022.findings-naacl.156","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-naacl.156","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MJ-Jang/beyond-distributional","path":"src/analysis/wordvector_analysis.py","file_url":"https://github.com/MJ-Jang/beyond-distributional/blob/HEAD/src/analysis/wordvector_analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"870a647e1092cb36","code_sha256_prefix":"870a647e1092cb36","mcp_get_code":{"code_sha256":"870a647e1092cb36"}},{"arxiv_id":"2022.acl-long.230","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.acl-long.230","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"microsoft/adatest","path":"adaptivetesting/embedders.py","file_url":"https://github.com/microsoft/adatest/blob/HEAD/adaptivetesting/embedders.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":"b5742d5ed6baa215","code_sha256_prefix":"b5742d5ed6baa215","mcp_get_code":{"code_sha256":"b5742d5ed6baa215"}}],"record_sha256":"039273898f0544ed13e52d3850a1eae28f8261a9a02afa9cfc6af59d4e19a27f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}