{"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/dcg","entry":"dcg","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":14,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"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":9,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":5,"n_places":15,"n_places_pointer_only":6,"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":0,"ran_violates":3,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"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.21702","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-21702","title":"From Association to Causation: Improving Retrieval Precision of Retrieval-Augmented Generation via Causal Relations and an Attention Mechanism","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Silk-Road/causal-rag-rerank","path":"experiment_reranker.py","file_url":"https://github.com/Silk-Road/causal-rag-rerank/blob/HEAD/experiment_reranker.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Silk-Road/causal-rag-rerank (NOASSERTION)","code_sha256":"3c39341b2d76ace9","code_sha256_prefix":"3c39341b2d76ace9","mcp_get_code":{"code_sha256":"3c39341b2d76ace9"}},{"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":"reproduce.py","file_url":"https://github.com/sunggukcha/n_clue/blob/HEAD/reproduce.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"6eb3f7d87356d97a","code_sha256_prefix":"6eb3f7d87356d97a","mcp_get_code":{"code_sha256":"6eb3f7d87356d97a"}},{"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"c266a10d274e0294","code_sha256_prefix":"c266a10d274e0294","mcp_get_code":{"code_sha256":"c266a10d274e0294"}},{"arxiv_id":"2606.15903","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15903","title":"Control-Plane Placement Shapes Forgetting: An Architectural Study of Agent Memory Across Thirteen System Configurations","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"deeplethe/lethe","path":"bench/mempalace_bench.py","file_url":"https://github.com/deeplethe/lethe/blob/HEAD/bench/mempalace_bench.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":"d57d8272b00e38b9","code_sha256_prefix":"d57d8272b00e38b9","mcp_get_code":{"code_sha256":"d57d8272b00e38b9"}},{"arxiv_id":"2601.06966","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-06966","title":"RealMem: Benchmarking LLMs in Real-World Memory-Driven Interaction","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"AvatarMemory/RealMemBench","path":"eval/compute_auto_metrics_for_realmem.py","file_url":"https://github.com/AvatarMemory/RealMemBench/blob/HEAD/eval/compute_auto_metrics_for_realmem.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":"c8f76a04b5265a70","code_sha256_prefix":"c8f76a04b5265a70","mcp_get_code":{"code_sha256":"c8f76a04b5265a70"}},{"arxiv_id":"2601.01280","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-01280","title":"Does Memory Need Graphs? A Unified Framework and Empirical Analysis for Long-Term Dialog Memory","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"AvatarMemory/UnifiedMem","path":"evals/lme_eval_utils.py","file_url":"https://github.com/AvatarMemory/UnifiedMem/blob/HEAD/evals/lme_eval_utils.py","status":"unverified","verification_level":0,"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, AvatarMemory/UnifiedMem when it was checked","code_sha256":"c8f76a04b5265a70","code_sha256_prefix":"c8f76a04b5265a70","mcp_get_code":{"code_sha256":"c8f76a04b5265a70"}},{"arxiv_id":"2509.01337","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-01337","title":"LLM-Guided Semantic Relational Reasoning for Multimodal Intent Recognition","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"thuiar/LGSRR","path":"methods/LGSRR/loss.py","file_url":"https://github.com/thuiar/LGSRR/blob/HEAD/methods/LGSRR/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":"9b090a000fcecd10","code_sha256_prefix":"9b090a000fcecd10","mcp_get_code":{"code_sha256":"9b090a000fcecd10"}},{"arxiv_id":"2410.11502","arxiv_id_is_arxiv":true,"paper":"/paper/offline-model-based-optimization-by-learning","title":"Offline Model-Based Optimization by Learning to Rank","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/Offline-RaM","path":"losses/neuralNDCG.py","file_url":"https://github.com/lamda-bbo/Offline-RaM/blob/HEAD/losses/neuralNDCG.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, lamda-bbo/Offline-RaM when it was checked","code_sha256":"f40a7926c73e49c1","code_sha256_prefix":"f40a7926c73e49c1","mcp_get_code":{"code_sha256":"f40a7926c73e49c1"}},{"arxiv_id":"2410.10813","arxiv_id_is_arxiv":true,"paper":"/paper/longmemeval-benchmarking-chat-assistants-on","title":"LongMemEval: Benchmarking Chat Assistants on Long-Term Interactive Memory","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaowu0162/longmemeval","path":"src/retrieval/eval_utils.py","file_url":"https://github.com/xiaowu0162/longmemeval/blob/HEAD/src/retrieval/eval_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":"c8f76a04b5265a70","code_sha256_prefix":"c8f76a04b5265a70","mcp_get_code":{"code_sha256":"c8f76a04b5265a70"}},{"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":"5ebb9e3fd5b4a503","code_sha256_prefix":"5ebb9e3fd5b4a503","mcp_get_code":{"code_sha256":"5ebb9e3fd5b4a503"}},{"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/retrieval_labels.py","file_url":"https://github.com/chuanmeng/rlt4reranking/blob/HEAD/rlt/retrieval_labels.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, chuanmeng/rlt4reranking when it was checked","code_sha256":"f4a6bc68677e0d0a","code_sha256_prefix":"f4a6bc68677e0d0a","mcp_get_code":{"code_sha256":"f4a6bc68677e0d0a"}},{"arxiv_id":"2202.06602","arxiv_id_is_arxiv":true,"paper":"/paper/neural-re-ranking-in-multi-stage-recommender","title":"Neural Re-ranking in Multi-stage Recommender Systems: A Review","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"librerank-community/librerank","path":"librerank/ranker.py","file_url":"https://github.com/librerank-community/librerank/blob/HEAD/librerank/ranker.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":"004233e23c2f2f2c","code_sha256_prefix":"004233e23c2f2f2c","mcp_get_code":{"code_sha256":"004233e23c2f2f2c"}},{"arxiv_id":"1803.11175","arxiv_id_is_arxiv":true,"paper":"/paper/universal-sentence-encoder","title":"Universal Sentence Encoder","date":"2018-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MirkoLenz/ReCAP-Argument-Graph-Retrieval","path":"recap_agr/libs/ndcg.py","file_url":"https://github.com/MirkoLenz/ReCAP-Argument-Graph-Retrieval/blob/HEAD/recap_agr/libs/ndcg.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":"b21be746b7a81ea3","code_sha256_prefix":"b21be746b7a81ea3","mcp_get_code":{"code_sha256":"b21be746b7a81ea3"}},{"arxiv_id":"1802.05814","arxiv_id_is_arxiv":true,"paper":"/paper/variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amoussawi/recoder","path":"recoder/metrics.py","file_url":"https://github.com/amoussawi/recoder/blob/HEAD/recoder/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":"ff00d18b0b2b2c4e","code_sha256_prefix":"ff00d18b0b2b2c4e","mcp_get_code":{"code_sha256":"ff00d18b0b2b2c4e"}},{"arxiv_id":"0705.2011","arxiv_id_is_arxiv":true,"paper":"/paper/multi-dimensional-recurrent-neural-networks","title":"Multi-Dimensional Recurrent Neural Networks","date":"2007-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzbjyb/rri_match","path":"metric.py","file_url":"https://github.com/jzbjyb/rri_match/blob/HEAD/metric.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":"34a2a38a33c779ed","code_sha256_prefix":"34a2a38a33c779ed","mcp_get_code":{"code_sha256":"34a2a38a33c779ed"}}],"record_sha256":"467fb2ed879a463dc47db4428cea55995e4409582f3bd4205832a82472effd3b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}