{"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/precision-at-k","entry":"precision_at_k","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":27,"n_papers_ran":17,"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":21,"n_samples_ran":12,"n_samples_fingerprinted":0,"n_places":29,"n_places_pointer_only":14,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":11,"unverified":9},"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.23468","paper":"/paper/arxiv-2608-23468","title":"RAD: Rule-Augmented Relational Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"noahd15/RAD_RelationalAnomalyDetection","path":"lanl/rdl_lanl.py","file_url":"https://github.com/noahd15/RAD_RelationalAnomalyDetection/blob/HEAD/lanl/rdl_lanl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bae4a501c3f70a8b","mcp_get_code":{"code_sha256":"bae4a501c3f70a8b"}},{"arxiv_id":"2608.23468","paper":"/paper/arxiv-2608-23468","title":"RAD: Rule-Augmented Relational Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"noahd15/RAD_RelationalAnomalyDetection","path":"lanl/run_lanl_six_ablations.py","file_url":"https://github.com/noahd15/RAD_RelationalAnomalyDetection/blob/HEAD/lanl/run_lanl_six_ablations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7c231f23664d3721","mcp_get_code":{"code_sha256":"7c231f23664d3721"}},{"arxiv_id":"2608.23468","paper":"/paper/arxiv-2608-23468","title":"RAD: Rule-Augmented Relational Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"noahd15/RAD_RelationalAnomalyDetection","path":"lanl/run_lanl_tabular_baselines.py","file_url":"https://github.com/noahd15/RAD_RelationalAnomalyDetection/blob/HEAD/lanl/run_lanl_tabular_baselines.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"182af392557eb6ac","mcp_get_code":{"code_sha256":"182af392557eb6ac"}},{"arxiv_id":"2606.06840","paper":"/paper/arxiv-2606-06840","title":"Characterize Then Distill: Mechanistic Reasoning in Large Output Spaces","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"research-anon-487/xcube","path":"xcube/metrics.py","file_url":"https://github.com/research-anon-487/xcube/blob/HEAD/xcube/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"111d946b6f9de033","mcp_get_code":{"code_sha256":"111d946b6f9de033"}},{"arxiv_id":"2606.03463","paper":"/paper/arxiv-2606-03463","title":"DMF: A Deterministic Memory Framework for Conversational AI Agents","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"matstech/dmf-benchmarks","path":"dmf_bench/benchmarks/locomo/ablation.py","file_url":"https://github.com/matstech/dmf-benchmarks/blob/HEAD/dmf_bench/benchmarks/locomo/ablation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1c147c09654b3caa","mcp_get_code":{"code_sha256":"1c147c09654b3caa"}},{"arxiv_id":"2604.14169","paper":"/paper/arxiv-2604-14169","title":"Chronological Knowledge Retrieval: A Retrieval-Augmented Generation Approach to Construction Project Documentation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ikostis-ucl/bpc_meeting_assistant","path":"eval/eval_metrics.py","file_url":"https://github.com/ikostis-ucl/bpc_meeting_assistant/blob/HEAD/eval/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"40c1dfca52af20fa","mcp_get_code":{"code_sha256":"40c1dfca52af20fa"}},{"arxiv_id":"2506.15862","paper":null,"title":"arXiv:2506.15862","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"Josh1108/MixtureRetrievers","path":"core/evaluate_runs.py","file_url":"https://github.com/Josh1108/MixtureRetrievers/blob/HEAD/core/evaluate_runs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"88d3febe26a5da23","mcp_get_code":{"code_sha256":"88d3febe26a5da23"}},{"arxiv_id":"2505.19764","paper":"/paper/agentic-predictor-performance-prediction-for","title":"Agentic Predictor: Performance Prediction for Agentic Workflows via Multi-View Encoding","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepauto-ai/agentic-predictor","path":"agent_predictor/evaluate_mvgnn.py","file_url":"https://github.com/deepauto-ai/agentic-predictor/blob/HEAD/agent_predictor/evaluate_mvgnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71461b8aea1df5e2","mcp_get_code":{"code_sha256":"71461b8aea1df5e2"}},{"arxiv_id":"2406.03210","paper":"/paper/text-like-encoding-of-collaborative","title":"Text-like Encoding of Collaborative Information in Large Language Models for Recommendation","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyang1580/binllm","path":"used_metrics.py","file_url":"https://github.com/zyang1580/binllm/blob/HEAD/used_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ca85fc22ecc0f5f8","mcp_get_code":{"code_sha256":"ca85fc22ecc0f5f8"}},{"arxiv_id":"2405.20790","paper":"/paper/intersectional-unfairness-discovery","title":"Intersectional Unfairness Discovery","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xugezheng/bggn","path":"engine/engine_vae_bias.py","file_url":"https://github.com/xugezheng/bggn/blob/HEAD/engine/engine_vae_bias.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4800aa7f52553655","mcp_get_code":{"code_sha256":"4800aa7f52553655"}},{"arxiv_id":"2404.10321","paper":"/paper/cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhao254014/clustergcf","path":"ClusterGCF/utility/metrics.py","file_url":"https://github.com/zhao254014/clustergcf/blob/HEAD/ClusterGCF/utility/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2403.06659","paper":"/paper/zero-shot-ecg-classification-with-multimodal","title":"Zero-Shot ECG Classification with Multimodal Learning and Test-time Clinical Knowledge Enhancement","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cheliu-computation/merl","path":"utils/utils_loss.py","file_url":"https://github.com/cheliu-computation/merl/blob/HEAD/utils/utils_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e5487ec054cd281e","mcp_get_code":{"code_sha256":"e5487ec054cd281e"}},{"arxiv_id":"2403.01931","paper":"/paper/varierr-nli-separating-annotation-error-from","title":"VariErr NLI: Separating Annotation Error from Human Label Variation","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mainlp/VariErr-NLI","path":"build_score_table.py","file_url":"https://github.com/mainlp/VariErr-NLI/blob/HEAD/build_score_table.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"04aa42119c9d143f","mcp_get_code":{"code_sha256":"04aa42119c9d143f"}},{"arxiv_id":"2402.17188","paper":"/paper/promptmm-multi-modal-knowledge-distillation","title":"PromptMM: Multi-Modal Knowledge Distillation for Recommendation with Prompt-Tuning","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/promptmm","path":"codes/utility/metrics.py","file_url":"https://github.com/hkuds/promptmm/blob/HEAD/codes/utility/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2402.12370","paper":"/paper/analobench-benchmarking-the-identification-of","title":"AnaloBench: Benchmarking the Identification of Abstract and Long-context Analogies","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JHU-CLSP/AnaloBench","path":"code/t2_evaluation.py","file_url":"https://github.com/JHU-CLSP/AnaloBench/blob/HEAD/code/t2_evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1ce58e28d1fcc2b4","mcp_get_code":{"code_sha256":"1ce58e28d1fcc2b4"}},{"arxiv_id":"2312.16203","paper":"/paper/user-consented-federated-recommender-system","title":"User Consented Federated Recommender System Against Personalized Attribute Inference Attack","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/uc-fedrec","path":"utility/metric.py","file_url":"https://github.com/hkust-knowcomp/uc-fedrec/blob/HEAD/utility/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2312.01522","paper":"/paper/g2d-from-global-to-dense-radiography","title":"G2D: From Global to Dense Radiography Representation Learning via Vision-Language Pre-training","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cheliu-computation/g2d-neurips24","path":"PRETRAIN/utils/loss.py","file_url":"https://github.com/cheliu-computation/g2d-neurips24/blob/HEAD/PRETRAIN/utils/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e5487ec054cd281e","mcp_get_code":{"code_sha256":"e5487ec054cd281e"}},{"arxiv_id":"2311.00423","paper":"/paper/llmrec-large-language-models-with-graph","title":"LLMRec: Large Language Models with Graph Augmentation for Recommendation","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/llmrec","path":"utility/metrics.py","file_url":"https://github.com/hkuds/llmrec/blob/HEAD/utility/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2310.04678","paper":"/paper/doris-mae-scientific-document-retrieval-using","title":"DORIS-MAE: Scientific Document Retrieval using Multi-level Aspect-based Queries","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Real-Doris-Mae/Doris-Mae-Dataset","path":"benchmarking/rank_performance_util.py","file_url":"https://github.com/Real-Doris-Mae/Doris-Mae-Dataset/blob/HEAD/benchmarking/rank_performance_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"bf3c7a72444f860f","mcp_get_code":{"code_sha256":"bf3c7a72444f860f"}},{"arxiv_id":"2309.17133","paper":"/paper/fine-grained-late-interaction-multi-modal-1","title":"Fine-grained Late-interaction Multi-modal Retrieval for Retrieval Augmented Visual Question Answering","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LinWeizheDragon/Retrieval-Augmented-Visual-Question-Answering","path":"src/utils/retrieval_metrics.py","file_url":"https://github.com/LinWeizheDragon/Retrieval-Augmented-Visual-Question-Answering/blob/HEAD/src/utils/retrieval_metrics.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":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2309.10376","paper":"/paper/graph-contrastive-learning-meets-graph-meta","title":"Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks","date":"2023-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoliu-cola/cola","path":"utils.py","file_url":"https://github.com/haoliu-cola/cola/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"38fbd0da1b22801d","mcp_get_code":{"code_sha256":"38fbd0da1b22801d"}},{"arxiv_id":"2110.10803","paper":"/paper/propensity-scored-probabilistic-label-trees","title":"Propensity-scored Probabilistic Label Trees","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mwydmuch/napkinXC","path":"python/napkinxc/metrics.py","file_url":"https://github.com/mwydmuch/napkinXC/blob/HEAD/python/napkinxc/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1b53d35e01074c8","mcp_get_code":{"code_sha256":"b1b53d35e01074c8"}},{"arxiv_id":"1911.08621","paper":"/paper/open-cross-domain-visual-search","title":"Open Cross-Domain Visual Search","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twuilliam/open-search","path":"metrics.py","file_url":"https://github.com/twuilliam/open-search/blob/HEAD/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b5204fbf39cb428","mcp_get_code":{"code_sha256":"0b5204fbf39cb428"}},{"arxiv_id":"1909.03601","paper":"/paper/relevance-matrix-factorization","title":"Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usaito/unbiased-implicit-rec","path":"src/utils/metrics.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"67693b649c55a340","mcp_get_code":{"code_sha256":"67693b649c55a340"}},{"arxiv_id":"1906.09217","paper":"/paper/hierarchical-gating-networks-for-sequential","title":"Hierarchical Gating Networks for Sequential Recommendation","date":"2019-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenjack/HGN","path":"eval_metrics.py","file_url":"https://github.com/allenjack/HGN/blob/HEAD/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7dd87d91e291a646","mcp_get_code":{"code_sha256":"7dd87d91e291a646"}},{"arxiv_id":"1905.08108","paper":"/paper/neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"immabe/NGCF_pytorch","path":"NGCF/utility/metrics.py","file_url":"https://github.com/immabe/NGCF_pytorch/blob/HEAD/NGCF/utility/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"1905.07854","paper":"/paper/kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zju-dbl/metakg","path":"utility/metrics.py","file_url":"https://github.com/zju-dbl/metakg/blob/HEAD/utility/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"1702.01417","paper":"/paper/all-but-the-top-simple-and-effective","title":"All-but-the-Top: Simple and Effective Postprocessing for Word Representations","date":"2017-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lgalke/vec4ir","path":"vec4ir/rank_metrics.py","file_url":"https://github.com/lgalke/vec4ir/blob/HEAD/vec4ir/rank_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b5204fbf39cb428","mcp_get_code":{"code_sha256":"0b5204fbf39cb428"}},{"arxiv_id":"2025.findings-acl.433","paper":null,"title":"arXiv:2025.findings-acl.433","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"haon-chen/mmE5","path":"evaluation/eval_utils.py","file_url":"https://github.com/haon-chen/mmE5/blob/HEAD/evaluation/eval_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d422331a5419580e","mcp_get_code":{"code_sha256":"d422331a5419580e"}}]}