{"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/sample-function","entry":"sample_function","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":7,"n_papers_ran":2,"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":9,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":7},"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":"2404.11343","paper":"/paper/large-language-models-meet-collaborative","title":"Large Language Models meet Collaborative Filtering: An Efficient All-round LLM-based Recommender System","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghdtjr/a-llmrec","path":"pre_train/sasrec/utils.py","file_url":"https://github.com/ghdtjr/a-llmrec/blob/HEAD/pre_train/sasrec/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed413c5d2cc8afc9","mcp_get_code":{"code_sha256":"ed413c5d2cc8afc9"}},{"arxiv_id":"2403.16371","paper":"/paper/uncovering-selective-state-space-model-s","title":"Uncovering Selective State Space Model's Capabilities in Lifelong Sequential Recommendation","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nancheng58/recmamba","path":"utils.py","file_url":"https://github.com/nancheng58/recmamba/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ea2f06927b8d7ee4","mcp_get_code":{"code_sha256":"ea2f06927b8d7ee4"}},{"arxiv_id":"2312.02852","paper":"/paper/expert-guided-bayesian-optimisation-for-human","title":"Expert-guided Bayesian Optimisation for Human-in-the-loop Experimental Design of Known Systems","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trsav/hitl-bo","path":"bo/utils.py","file_url":"https://github.com/trsav/hitl-bo/blob/HEAD/bo/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"283aeb93a0f20a70","mcp_get_code":{"code_sha256":"283aeb93a0f20a70"}},{"arxiv_id":"2311.10822","paper":"/paper/gradients-and-frequency-profiles-of-quantum","title":"Gradients and frequency profiles of quantum re-uploading models","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"adrianperezsalinas/qru_average","path":"IC_aux.py","file_url":"https://github.com/adrianperezsalinas/qru_average/blob/HEAD/IC_aux.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6190caee771fcd0d","mcp_get_code":{"code_sha256":"6190caee771fcd0d"}},{"arxiv_id":"1902.09362","paper":"/paper/session-based-social-recommendation-via","title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepGraphLearning/RecommenderSystems","path":"sequentialRec/markovChains/sampler.py","file_url":"https://github.com/DeepGraphLearning/RecommenderSystems/blob/HEAD/sequentialRec/markovChains/sampler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b01f6945cb2516d1","mcp_get_code":{"code_sha256":"b01f6945cb2516d1"}},{"arxiv_id":"1902.09362","paper":"/paper/session-based-social-recommendation-via","title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepGraphLearning/RecommenderSystems","path":"sequentialRec/neural/sampler.py","file_url":"https://github.com/DeepGraphLearning/RecommenderSystems/blob/HEAD/sequentialRec/neural/sampler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b56c59b03c1ee8bd","mcp_get_code":{"code_sha256":"b56c59b03c1ee8bd"}},{"arxiv_id":"1808.09781","paper":"/paper/180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kang205/SASRec","path":"sampler.py","file_url":"https://github.com/kang205/SASRec/blob/HEAD/sampler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ed413c5d2cc8afc9","mcp_get_code":{"code_sha256":"ed413c5d2cc8afc9"}},{"arxiv_id":"1808.09781","paper":"/paper/180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paddorch/SASRec.paddle","path":"sasrec/data.py","file_url":"https://github.com/paddorch/SASRec.paddle/blob/HEAD/sasrec/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f54d868213b75be7","mcp_get_code":{"code_sha256":"f54d868213b75be7"}},{"arxiv_id":"1808.09781","paper":"/paper/180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmixer/SASRec.pytorch","path":"python/utils.py","file_url":"https://github.com/pmixer/SASRec.pytorch/blob/HEAD/python/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d64812b980f1617e","mcp_get_code":{"code_sha256":"d64812b980f1617e"}},{"arxiv_id":"2025.findings-emnlp.538","paper":null,"title":"arXiv:2025.findings-emnlp.538","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SOLAR2025ARR/SOLAR","path":"datagen/utils.py","file_url":"https://github.com/SOLAR2025ARR/SOLAR/blob/HEAD/datagen/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"407a2c94fe4e74bb","mcp_get_code":{"code_sha256":"407a2c94fe4e74bb"}}]}