{"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/recallprecision-atk","entry":"RecallPrecision_ATk","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":6,"n_papers_ran":6,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":0},"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":"2401.06982","paper":"/paper/denoising-diffusion-recommender-model","title":"Denoising Diffusion Recommender Model","date":"2024-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"polaris-jz/ddrm","path":"DDRM_LightGCN/utils.py","file_url":"https://github.com/polaris-jz/ddrm/blob/HEAD/DDRM_LightGCN/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c0552ff020ee687b","mcp_get_code":{"code_sha256":"c0552ff020ee687b"}},{"arxiv_id":"2308.11288","paper":"/paper/test-time-embedding-normalization-for","title":"Test Time Embedding Normalization for Popularity Bias Mitigation","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-postech/tten","path":"utils.py","file_url":"https://github.com/ml-postech/tten/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":"0cfdc37b514d7cce","mcp_get_code":{"code_sha256":"0cfdc37b514d7cce"}},{"arxiv_id":"2211.09324","paper":"/paper/perturbation-recovery-method-for","title":"Blurring-Sharpening Process Models for Collaborative Filtering","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/bspm","path":"bspm/utils.py","file_url":"https://github.com/jeongwhanchoi/bspm/blob/HEAD/bspm/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c0552ff020ee687b","mcp_get_code":{"code_sha256":"c0552ff020ee687b"}},{"arxiv_id":"2208.06794","paper":"/paper/disenhcn-disentangled-hypergraph","title":"DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction","date":"2022-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yf-li15/DisenHCN","path":"src/utils.py","file_url":"https://github.com/yf-li15/DisenHCN/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c0552ff020ee687b","mcp_get_code":{"code_sha256":"c0552ff020ee687b"}},{"arxiv_id":"2111.07265","paper":"/paper/linear-or-non-linear-that-is-the-question","title":"Linear, or Non-Linear, That is the Question!","date":"2021-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/HMLET","path":"utils.py","file_url":"https://github.com/jeongwhanchoi/HMLET/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c0552ff020ee687b","mcp_get_code":{"code_sha256":"c0552ff020ee687b"}},{"arxiv_id":"2108.05552","paper":"/paper/graph-trend-networks-for-recommendations","title":"Graph Trend Filtering Networks for Recommendations","date":"2021-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenqifan03/gtn-sigir2022","path":"code/utils.py","file_url":"https://github.com/wenqifan03/gtn-sigir2022/blob/HEAD/code/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c0552ff020ee687b","mcp_get_code":{"code_sha256":"c0552ff020ee687b"}}]}