{"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/random-neq","entry":"random_neq","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":8,"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":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2405.10436","arxiv_id_is_arxiv":true,"paper":"/paper/positional-encoding-is-not-the-same-as","title":"Positional encoding is not the same as context: A study on positional encoding for sequential recommendation","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"researcher1741/position_encoding_srs","path":"src/sampler.py","file_url":"https://github.com/researcher1741/position_encoding_srs/blob/HEAD/src/sampler.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, researcher1741/position_encoding_srs when it was checked","code_sha256":"2660cad125666143","code_sha256_prefix":"2660cad125666143","mcp_get_code":{"code_sha256":"2660cad125666143"}},{"arxiv_id":"2404.11343","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ghdtjr/a-llmrec when it was checked","code_sha256":"13e1db5681123f3a","code_sha256_prefix":"13e1db5681123f3a","mcp_get_code":{"code_sha256":"13e1db5681123f3a"}},{"arxiv_id":"2403.16371","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nancheng58/recmamba when it was checked","code_sha256":"13e1db5681123f3a","code_sha256_prefix":"13e1db5681123f3a","mcp_get_code":{"code_sha256":"13e1db5681123f3a"}},{"arxiv_id":"2401.02913","arxiv_id_is_arxiv":true,"paper":"/paper/plug-in-diffusion-model-for-sequential","title":"Plug-in Diffusion Model for Sequential Recommendation","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hulkima/pdrec","path":"utils/utils.py","file_url":"https://github.com/hulkima/pdrec/blob/HEAD/utils/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hulkima/pdrec when it was checked","code_sha256":"13e1db5681123f3a","code_sha256_prefix":"13e1db5681123f3a","mcp_get_code":{"code_sha256":"13e1db5681123f3a"}},{"arxiv_id":"2204.06517","arxiv_id_is_arxiv":true,"paper":"/paper/learning-self-modulating-attention-in","title":"Learning Self-Modulating Attention in Continuous Time Space with Applications to Sequential Recommendation","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"statsdlmathsrecomsys/self-attention-with-functional-time-representation-learning","path":"run_so.py","file_url":"https://github.com/statsdlmathsrecomsys/self-attention-with-functional-time-representation-learning/blob/HEAD/run_so.py","status":"unverified","verification_level":0,"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, statsdlmathsrecomsys/self-attention-with-functional-time-representation-learning when it was checked","code_sha256":"053088fa09bda3bd","code_sha256_prefix":"053088fa09bda3bd","mcp_get_code":{"code_sha256":"053088fa09bda3bd"}},{"arxiv_id":"2002.07962","arxiv_id_is_arxiv":true,"paper":"/paper/inductive-representation-learning-on-temporal-1","title":"Inductive Representation Learning on Temporal Graphs","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"053088fa09bda3bd","code_sha256_prefix":"053088fa09bda3bd","mcp_get_code":{"code_sha256":"053088fa09bda3bd"}},{"arxiv_id":"1808.09781","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from nancheng58/recmamba, and GitHub detected no licence in that repository when it was checked","code_sha256":"13e1db5681123f3a","code_sha256_prefix":"13e1db5681123f3a","mcp_get_code":{"code_sha256":"13e1db5681123f3a"}},{"arxiv_id":"2025.findings-emnlp.538","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nancheng58/recmamba, and GitHub detected no licence in that repository when it was checked","code_sha256":"13e1db5681123f3a","code_sha256_prefix":"13e1db5681123f3a","mcp_get_code":{"code_sha256":"13e1db5681123f3a"}}],"record_sha256":"aed02de57dc1ef47036b11c1cd02f081fcce0e242f092fb442fa0880bf149a50","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}