{"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/precision-at-k","entry":"precision_at_k","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":27,"n_papers_ran":26,"n_papers_ran_no_instrument_failure":18,"n_papers_ran_instrument_only":8,"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":20,"n_samples_constructed":0,"n_samples_ran_checked":16,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":29,"n_places_pointer_only":17,"n_places_pointer_only_link_open":3,"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":3,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":13,"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.23468","arxiv_id_is_arxiv":true,"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_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, noahd15/RAD_RelationalAnomalyDetection when it was checked","code_sha256":"bae4a501c3f70a8b","code_sha256_prefix":"bae4a501c3f70a8b","mcp_get_code":{"code_sha256":"bae4a501c3f70a8b"}},{"arxiv_id":"2608.23468","arxiv_id_is_arxiv":true,"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_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, noahd15/RAD_RelationalAnomalyDetection when it was checked","code_sha256":"7c231f23664d3721","code_sha256_prefix":"7c231f23664d3721","mcp_get_code":{"code_sha256":"7c231f23664d3721"}},{"arxiv_id":"2608.23468","arxiv_id_is_arxiv":true,"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_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, noahd15/RAD_RelationalAnomalyDetection when it was checked","code_sha256":"182af392557eb6ac","code_sha256_prefix":"182af392557eb6ac","mcp_get_code":{"code_sha256":"182af392557eb6ac"}},{"arxiv_id":"2606.06840","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"111d946b6f9de033","code_sha256_prefix":"111d946b6f9de033","mcp_get_code":{"code_sha256":"111d946b6f9de033"}},{"arxiv_id":"2606.03463","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c147c09654b3caa","code_sha256_prefix":"1c147c09654b3caa","mcp_get_code":{"code_sha256":"1c147c09654b3caa"}},{"arxiv_id":"2604.14169","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"40c1dfca52af20fa","code_sha256_prefix":"40c1dfca52af20fa","mcp_get_code":{"code_sha256":"40c1dfca52af20fa"}},{"arxiv_id":"2506.15862","arxiv_id_is_arxiv":true,"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":"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":"88d3febe26a5da23","code_sha256_prefix":"88d3febe26a5da23","mcp_get_code":{"code_sha256":"88d3febe26a5da23"}},{"arxiv_id":"2505.19764","arxiv_id_is_arxiv":true,"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":"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":"71461b8aea1df5e2","code_sha256_prefix":"71461b8aea1df5e2","mcp_get_code":{"code_sha256":"71461b8aea1df5e2"}},{"arxiv_id":"2406.03210","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zyang1580/binllm when it was checked","code_sha256":"ca85fc22ecc0f5f8","code_sha256_prefix":"ca85fc22ecc0f5f8","mcp_get_code":{"code_sha256":"ca85fc22ecc0f5f8"}},{"arxiv_id":"2405.20790","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xugezheng/bggn when it was checked","code_sha256":"4800aa7f52553655","code_sha256_prefix":"4800aa7f52553655","mcp_get_code":{"code_sha256":"4800aa7f52553655"}},{"arxiv_id":"2404.10321","arxiv_id_is_arxiv":true,"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_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, zhao254014/clustergcf when it was checked","code_sha256":"de0d0e47ac6bbe6c","code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2403.06659","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5487ec054cd281e","code_sha256_prefix":"e5487ec054cd281e","mcp_get_code":{"code_sha256":"e5487ec054cd281e"}},{"arxiv_id":"2403.01931","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mainlp/VariErr-NLI when it was checked","code_sha256":"04aa42119c9d143f","code_sha256_prefix":"04aa42119c9d143f","mcp_get_code":{"code_sha256":"04aa42119c9d143f"}},{"arxiv_id":"2402.17188","arxiv_id_is_arxiv":true,"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_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, hkuds/promptmm when it was checked","code_sha256":"de0d0e47ac6bbe6c","code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2402.12370","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JHU-CLSP/AnaloBench when it was checked","code_sha256":"1ce58e28d1fcc2b4","code_sha256_prefix":"1ce58e28d1fcc2b4","mcp_get_code":{"code_sha256":"1ce58e28d1fcc2b4"}},{"arxiv_id":"2312.16203","arxiv_id_is_arxiv":true,"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_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, hkust-knowcomp/uc-fedrec when it was checked","code_sha256":"de0d0e47ac6bbe6c","code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2312.01522","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cheliu-computation/g2d-neurips24 when it was checked","code_sha256":"e5487ec054cd281e","code_sha256_prefix":"e5487ec054cd281e","mcp_get_code":{"code_sha256":"e5487ec054cd281e"}},{"arxiv_id":"2311.00423","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zhao254014/clustergcf, and GitHub detected no licence in that repository when it was checked","code_sha256":"de0d0e47ac6bbe6c","code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2310.04678","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Real-Doris-Mae/Doris-Mae-Dataset (NOASSERTION)","code_sha256":"bf3c7a72444f860f","code_sha256_prefix":"bf3c7a72444f860f","mcp_get_code":{"code_sha256":"bf3c7a72444f860f"}},{"arxiv_id":"2309.17133","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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, LinWeizheDragon/Retrieval-Augmented-Visual-Question-Answering, is not in the permissive set Syntology serves inline","code_sha256":"de0d0e47ac6bbe6c","code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"2309.10376","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, haoliu-cola/cola when it was checked","code_sha256":"38fbd0da1b22801d","code_sha256_prefix":"38fbd0da1b22801d","mcp_get_code":{"code_sha256":"38fbd0da1b22801d"}},{"arxiv_id":"2110.10803","arxiv_id_is_arxiv":true,"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":"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":"b1b53d35e01074c8","code_sha256_prefix":"b1b53d35e01074c8","mcp_get_code":{"code_sha256":"b1b53d35e01074c8"}},{"arxiv_id":"1911.08621","arxiv_id_is_arxiv":true,"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":"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":"0b5204fbf39cb428","code_sha256_prefix":"0b5204fbf39cb428","mcp_get_code":{"code_sha256":"0b5204fbf39cb428"}},{"arxiv_id":"1909.03601","arxiv_id_is_arxiv":true,"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":"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":"67693b649c55a340","code_sha256_prefix":"67693b649c55a340","mcp_get_code":{"code_sha256":"67693b649c55a340"}},{"arxiv_id":"1906.09217","arxiv_id_is_arxiv":true,"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":"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":"7dd87d91e291a646","code_sha256_prefix":"7dd87d91e291a646","mcp_get_code":{"code_sha256":"7dd87d91e291a646"}},{"arxiv_id":"1905.08108","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"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 zhao254014/clustergcf, and GitHub detected no licence in that repository when it was checked","code_sha256":"de0d0e47ac6bbe6c","code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"1905.07854","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zhao254014/clustergcf, and GitHub detected no licence in that repository when it was checked","code_sha256":"de0d0e47ac6bbe6c","code_sha256_prefix":"de0d0e47ac6bbe6c","mcp_get_code":{"code_sha256":"de0d0e47ac6bbe6c"}},{"arxiv_id":"1702.01417","arxiv_id_is_arxiv":true,"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":"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":"0b5204fbf39cb428","code_sha256_prefix":"0b5204fbf39cb428","mcp_get_code":{"code_sha256":"0b5204fbf39cb428"}},{"arxiv_id":"2025.findings-acl.433","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"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":"d422331a5419580e","code_sha256_prefix":"d422331a5419580e","mcp_get_code":{"code_sha256":"d422331a5419580e"}}],"record_sha256":"512b71efc7c61b17b49ca385af58d5b0135fb9ae61b4446c71c0ebaf0d292036","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}