{"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/trunc","entry":"trunc","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":5,"n_papers_ran":4,"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":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2605.27374","paper":"/paper/arxiv-2605-27374","title":"ICG: Improving Cover Image Generation via MLLM-based Prompting and Personalized Preference Alignment","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"westlake-repl/PixelRec","path":"code/REC/evaluator/utils.py","file_url":"https://github.com/westlake-repl/PixelRec/blob/HEAD/code/REC/evaluator/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27b14a758e6ddd4c","mcp_get_code":{"code_sha256":"27b14a758e6ddd4c"}},{"arxiv_id":"2505.10940","paper":"/paper/2505-10940","title":"Who You Are Matters: Bridging Topics and Social Roles via LLM-Enhanced Logical Recommendation","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Code2Q/TagCF","path":"recbole/evaluator/utils.py","file_url":"https://github.com/Code2Q/TagCF/blob/HEAD/recbole/evaluator/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27b14a758e6ddd4c","mcp_get_code":{"code_sha256":"27b14a758e6ddd4c"}},{"arxiv_id":"2309.06789","paper":"/paper/an-image-dataset-for-benchmarking-recommender","title":"An Image Dataset for Benchmarking Recommender Systems with Raw Pixels","date":"2023-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"westlake-repl/pixelrec","path":"code/REC/evaluator/utils.py","file_url":"https://github.com/westlake-repl/pixelrec/blob/HEAD/code/REC/evaluator/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27b14a758e6ddd4c","mcp_get_code":{"code_sha256":"27b14a758e6ddd4c"}},{"arxiv_id":"2204.11046","paper":"/paper/decoupled-side-information-fusion-for","title":"Decoupled Side Information Fusion for Sequential Recommendation","date":"2022-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIM-SE/DIF-SR","path":"recbole/evaluator/utils.py","file_url":"https://github.com/AIM-SE/DIF-SR/blob/HEAD/recbole/evaluator/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"27b14a758e6ddd4c","mcp_get_code":{"code_sha256":"27b14a758e6ddd4c"}},{"arxiv_id":"2203.01110","paper":"/paper/the-optimal-noise-in-noise-contrastive","title":"The Optimal Noise in Noise-Contrastive Learning Is Not What You Think","date":"2022-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l-omar-chehab/nce-noise-var","path":"experiments/plot_optimal_noise.py","file_url":"https://github.com/l-omar-chehab/nce-noise-var/blob/HEAD/experiments/plot_optimal_noise.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d3a157623cdc357b","mcp_get_code":{"code_sha256":"d3a157623cdc357b"}}]}