{"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/hit","entry":"hit","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":5,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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.22920","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-22920","title":"Beyond Observed Auxiliary Relations: Environment-Conditioned Modeling for Multi-Behavior Recommendation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"LSH0411/BOAR","path":"src/model/trainer.py","file_url":"https://github.com/LSH0411/BOAR/blob/HEAD/src/model/trainer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, LSH0411/BOAR when it was checked","code_sha256":"fccf97ef0ebf50e6","code_sha256_prefix":"fccf97ef0ebf50e6","mcp_get_code":{"code_sha256":"fccf97ef0ebf50e6"}},{"arxiv_id":"2509.16112","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-16112","title":"CodeRAG: Finding Relevant and Necessary Knowledge for Retrieval-Augmented Repository-Level Code Completion","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"KDEGroup/CodeRAG","path":"coderag/evaluation/metrics.py","file_url":"https://github.com/KDEGroup/CodeRAG/blob/HEAD/coderag/evaluation/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":"e3a7eba104f010a8","code_sha256_prefix":"e3a7eba104f010a8","mcp_get_code":{"code_sha256":"e3a7eba104f010a8"}},{"arxiv_id":"2408.14393","arxiv_id_is_arxiv":true,"paper":"/paper/cure4rec-a-benchmark-for-recommendation","title":"CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiye7lai/CURE4Rec","path":"utils.py","file_url":"https://github.com/xiye7lai/CURE4Rec/blob/HEAD/utils.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, xiye7lai/CURE4Rec when it was checked","code_sha256":"c498be7e96bf0f2a","code_sha256_prefix":"c498be7e96bf0f2a","mcp_get_code":{"code_sha256":"c498be7e96bf0f2a"}},{"arxiv_id":"2403.13574","arxiv_id_is_arxiv":true,"paper":"/paper/a-large-language-model-enhanced-sequential","title":"A Large Language Model Enhanced Sequential Recommender for Joint Video and Comment Recommendation","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/lsvcr","path":"metrics.py","file_url":"https://github.com/rucaibox/lsvcr/blob/HEAD/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, rucaibox/lsvcr when it was checked","code_sha256":"537a8f2181136526","code_sha256_prefix":"537a8f2181136526","mcp_get_code":{"code_sha256":"537a8f2181136526"}},{"arxiv_id":"2310.10696","arxiv_id_is_arxiv":true,"paper":"/paper/robust-collaborative-filtering-to-popularity","title":"Robust Collaborative Filtering to Popularity Distribution Shift","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anzhang314/popgo","path":"evaluator/backend/python/metric.py","file_url":"https://github.com/anzhang314/popgo/blob/HEAD/evaluator/backend/python/metric.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, anzhang314/popgo when it was checked","code_sha256":"67500e6f6a1284df","code_sha256_prefix":"67500e6f6a1284df","mcp_get_code":{"code_sha256":"67500e6f6a1284df"}},{"arxiv_id":"2309.01103","arxiv_id_is_arxiv":true,"paper":"/paper/multi-relational-contrastive-learning-for","title":"Multi-Relational Contrastive Learning for Recommendation","date":"2023-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUDS/RCL","path":"evaluate.py","file_url":"https://github.com/HKUDS/RCL/blob/HEAD/evaluate.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, HKUDS/RCL when it was checked","code_sha256":"be5c206a816aad41","code_sha256_prefix":"be5c206a816aad41","mcp_get_code":{"code_sha256":"be5c206a816aad41"}},{"arxiv_id":"aaai_17676","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_17676","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/AdversarialTaboo","path":"chat_utils.py","file_url":"https://github.com/thunlp/AdversarialTaboo/blob/HEAD/chat_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":"eba3b86cdb1e54dc","code_sha256_prefix":"eba3b86cdb1e54dc","mcp_get_code":{"code_sha256":"eba3b86cdb1e54dc"}}],"record_sha256":"bbcbda7ac0ab46e72a34e62bfe6ea43ae4d2d10864ec1ad6348a6399fb02bbac","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}