{"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/ndcg-at-k","entry":"ndcg_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":15,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":7,"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":13,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":15,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":5,"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":"2608.20801","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-20801","title":"Profiling What Matters: Context-Aware Item Profiles from Large-Scale Metadata for LLM Recommenders","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rgbeing/CAIRO","path":"reranking/metrics.py","file_url":"https://github.com/rgbeing/CAIRO/blob/HEAD/reranking/metrics.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, rgbeing/CAIRO when it was checked","code_sha256":"2316bc18e4899b65","code_sha256_prefix":"2316bc18e4899b65","mcp_get_code":{"code_sha256":"2316bc18e4899b65"}},{"arxiv_id":"2607.24165","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-24165","title":"Do Current Retrievers Cover All the Evidence? A Controlled Study of Conjunctive Cross-Page Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"sunggukcha/n_clue","path":"code/evaluate.py","file_url":"https://github.com/sunggukcha/n_clue/blob/HEAD/code/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sunggukcha/n_clue (NOASSERTION)","code_sha256":"60f0ae5569f7e873","code_sha256_prefix":"60f0ae5569f7e873","mcp_get_code":{"code_sha256":"60f0ae5569f7e873"}},{"arxiv_id":"2607.15562","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15562","title":"Hard Rules, Soft Preferences: Bridging Reasoning, Learning, and Optimization for Personalized Packing Checklist Generation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Official529Tech/rlo-checklist","path":"src/combined_model.py","file_url":"https://github.com/Official529Tech/rlo-checklist/blob/HEAD/src/combined_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a701c8684d370539","code_sha256_prefix":"a701c8684d370539","mcp_get_code":{"code_sha256":"a701c8684d370539"}},{"arxiv_id":"2606.28620","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-28620","title":"Reproducing FACTER: Fairness via Conformal Thresholding and Prompt Repair","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"oscar-omlf/facter-repr","path":"src/facter/eval/metrics.py","file_url":"https://github.com/oscar-omlf/facter-repr/blob/HEAD/src/facter/eval/metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ddd6cf5eafddd4a5","code_sha256_prefix":"ddd6cf5eafddd4a5","mcp_get_code":{"code_sha256":"ddd6cf5eafddd4a5"}},{"arxiv_id":"2506.19993","arxiv_id_is_arxiv":true,"paper":"/paper/cove-compressed-vocabulary-expansion-makes","title":"CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems","date":"2025-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haochenzhang717/cove-official-repo","path":"finetune-evaluate-no-text.py","file_url":"https://github.com/haochenzhang717/cove-official-repo/blob/HEAD/finetune-evaluate-no-text.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, haochenzhang717/cove-official-repo when it was checked","code_sha256":"b3486df183098e00","code_sha256_prefix":"b3486df183098e00","mcp_get_code":{"code_sha256":"b3486df183098e00"}},{"arxiv_id":"2411.02537","arxiv_id_is_arxiv":true,"paper":"/paper/inquire-a-natural-world-text-to-image","title":"INQUIRE: A Natural World Text-to-Image Retrieval Benchmark","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"inquire-benchmark/INQUIRE","path":"src/metrics.py","file_url":"https://github.com/inquire-benchmark/INQUIRE/blob/HEAD/src/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":"8b7cbc085fe9dfdf","code_sha256_prefix":"8b7cbc085fe9dfdf","mcp_get_code":{"code_sha256":"8b7cbc085fe9dfdf"}},{"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":"d12e2622a49a925e","code_sha256_prefix":"d12e2622a49a925e","mcp_get_code":{"code_sha256":"d12e2622a49a925e"}},{"arxiv_id":"2405.16871","arxiv_id_is_arxiv":true,"paper":"/paper/multi-behavior-generative-recommendation","title":"Multi-Behavior Generative Recommendation","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anananan116/MBGen","path":"trainer/evaluation.py","file_url":"https://github.com/anananan116/MBGen/blob/HEAD/trainer/evaluation.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":"03b5c20db7051800","code_sha256_prefix":"03b5c20db7051800","mcp_get_code":{"code_sha256":"03b5c20db7051800"}},{"arxiv_id":"2404.14243","arxiv_id_is_arxiv":true,"paper":"/paper/turbo-cf-matrix-decomposition-free-graph","title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jindeok/turbo-cf","path":"utils.py","file_url":"https://github.com/jindeok/turbo-cf/blob/HEAD/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":"c40d2e31695c2960","code_sha256_prefix":"c40d2e31695c2960","mcp_get_code":{"code_sha256":"c40d2e31695c2960"}},{"arxiv_id":"2310.14481","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CrawlScript/RpHGNN","path":"rphgnn/utils/metrics_utils.py","file_url":"https://github.com/CrawlScript/RpHGNN/blob/HEAD/rphgnn/utils/metrics_utils.py","status":"unverified","verification_level":0,"contract_check":null,"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, CrawlScript/RpHGNN, is not in the permissive set Syntology serves inline","code_sha256":"46e47a2c4cf98c1f","code_sha256_prefix":"46e47a2c4cf98c1f","mcp_get_code":{"code_sha256":"46e47a2c4cf98c1f"}},{"arxiv_id":"2309.15560","arxiv_id_is_arxiv":true,"paper":"/paper/identifiability-matters-revealing-the-hidden","title":"Identifiability Matters: Revealing the Hidden Recoverable Condition in Unbiased Learning to Rank","date":"2023-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keytoyze/ultr-identifiability","path":"test_fully_simulation.py","file_url":"https://github.com/keytoyze/ultr-identifiability/blob/HEAD/test_fully_simulation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, keytoyze/ultr-identifiability when it was checked","code_sha256":"acf4370d26be8e86","code_sha256_prefix":"acf4370d26be8e86","mcp_get_code":{"code_sha256":"acf4370d26be8e86"}},{"arxiv_id":"2006.15437","arxiv_id_is_arxiv":true,"paper":"/paper/gpt-gnn-generative-pre-training-of-graph","title":"GPT-GNN: Generative Pre-Training of Graph Neural Networks","date":"2020-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acbull/GPT-GNN","path":"GPT_GNN/utils.py","file_url":"https://github.com/acbull/GPT-GNN/blob/HEAD/GPT_GNN/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 CrawlScript/RpHGNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"46e47a2c4cf98c1f","code_sha256_prefix":"46e47a2c4cf98c1f","mcp_get_code":{"code_sha256":"46e47a2c4cf98c1f"}},{"arxiv_id":"2003.01332","arxiv_id_is_arxiv":true,"paper":"/paper/heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acbull/pyHGT","path":"pyHGT/utils.py","file_url":"https://github.com/acbull/pyHGT/blob/HEAD/pyHGT/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 CrawlScript/RpHGNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"46e47a2c4cf98c1f","code_sha256_prefix":"46e47a2c4cf98c1f","mcp_get_code":{"code_sha256":"46e47a2c4cf98c1f"}},{"arxiv_id":"1910.07295","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptation-meets-offline","title":"Towards Resolving Propensity Contradiction in Offline Recommender Learning","date":"2019-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usaito/ijcai2022-adversarial-mf","path":"src/evaluate/evaluator.py","file_url":"https://github.com/usaito/ijcai2022-adversarial-mf/blob/HEAD/src/evaluate/evaluator.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":"fee1fe126261da74","code_sha256_prefix":"fee1fe126261da74","mcp_get_code":{"code_sha256":"fee1fe126261da74"}},{"arxiv_id":"1312.6114","arxiv_id_is_arxiv":true,"paper":"/paper/auto-encoding-variational-bayes","title":"Auto-Encoding Variational Bayes","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/recommenders","path":"recommenders/models/vae/multinomial_vae.py","file_url":"https://github.com/microsoft/recommenders/blob/HEAD/recommenders/models/vae/multinomial_vae.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":"1da6c9d7223514d3","code_sha256_prefix":"1da6c9d7223514d3","mcp_get_code":{"code_sha256":"1da6c9d7223514d3"}}],"record_sha256":"20f3538f5b878e7637c366936223302762ee981dcd9db3b2d96bb83a3f90c02d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}