{"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/helper-load","entry":"helper_load","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":"2407.05441","paper":"/paper/language-models-encode-collaborative-signals","title":"Language Representations Can be What Recommenders Need: Findings and Potentials","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lehengthu/alpharec","path":"models/General/base/abstract_data.py","file_url":"https://github.com/lehengthu/alpharec/blob/HEAD/models/General/base/abstract_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"029327c4f6fb55d0","mcp_get_code":{"code_sha256":"029327c4f6fb55d0"}},{"arxiv_id":"2310.18700","paper":"/paper/empowering-collaborative-filtering-with","title":"Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LehengTHU/AdvInfoNCE","path":"data.py","file_url":"https://github.com/LehengTHU/AdvInfoNCE/blob/HEAD/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"029327c4f6fb55d0","mcp_get_code":{"code_sha256":"029327c4f6fb55d0"}},{"arxiv_id":"2310.10696","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":"data.py","file_url":"https://github.com/anzhang314/popgo/blob/HEAD/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57bbfa9f416dce5e","mcp_get_code":{"code_sha256":"57bbfa9f416dce5e"}},{"arxiv_id":"2310.10108","paper":"/paper/on-generative-agents-in-recommendation","title":"On Generative Agents in Recommendation","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LehengTHU/Agent4Rec","path":"recommenders/data.py","file_url":"https://github.com/LehengTHU/Agent4Rec/blob/HEAD/recommenders/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"029327c4f6fb55d0","mcp_get_code":{"code_sha256":"029327c4f6fb55d0"}},{"arxiv_id":"2302.05328","paper":"/paper/invariant-collaborative-filtering-to","title":"Invariant Collaborative Filtering to Popularity Distribution Shift","date":"2023-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anzhang314/invcf","path":"data.py","file_url":"https://github.com/anzhang314/invcf/blob/HEAD/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"029327c4f6fb55d0","mcp_get_code":{"code_sha256":"029327c4f6fb55d0"}},{"arxiv_id":"2210.11054","paper":"/paper/incorporating-bias-aware-margins-into","title":"Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filtering","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anzhang314/BC-Loss","path":"data.py","file_url":"https://github.com/anzhang314/BC-Loss/blob/HEAD/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"029327c4f6fb55d0","mcp_get_code":{"code_sha256":"029327c4f6fb55d0"}}]}