{"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/sinusoidalpositionembeddings","entry":"SinusoidalPositionEmbeddings","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":8,"n_papers_ran_no_instrument_failure":8,"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":8,"n_samples_ran":8,"n_samples_constructed":3,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"unverified":0},"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":"2410.13117","arxiv_id_is_arxiv":true,"paper":"/paper/preference-diffusion-for-recommendation","title":"Preference Diffusion for Recommendation","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lswhim/preferdiff","path":"models/PreferDiff/_model.py","file_url":"https://github.com/lswhim/preferdiff/blob/HEAD/models/PreferDiff/_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lswhim/preferdiff when it was checked","code_sha256":"2b5245040c13c182","code_sha256_prefix":"2b5245040c13c182","mcp_get_code":{"code_sha256":"2b5245040c13c182"}},{"arxiv_id":"2406.08773","arxiv_id_is_arxiv":true,"paper":"/paper/denoisereid-denoising-model-for","title":"DenoiseRep: Denoising Model for Representation Learning","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangguanan/denoiserep","path":"denoiserep_op/denoiserep/denoise_layer.py","file_url":"https://github.com/wangguanan/denoiserep/blob/HEAD/denoiserep_op/denoiserep/denoise_layer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86b013bf84701f06","code_sha256_prefix":"86b013bf84701f06","mcp_get_code":{"code_sha256":"86b013bf84701f06"}},{"arxiv_id":"2405.03987","arxiv_id_is_arxiv":true,"paper":"/paper/navigating-chemical-space-with-latent-flows","title":"Navigating Chemical Space with Latent Flows","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"garywei944/chemflow","path":"src/pinn/pde/wavepde.py","file_url":"https://github.com/garywei944/chemflow/blob/HEAD/src/pinn/pde/wavepde.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0847b98175b96a63","code_sha256_prefix":"0847b98175b96a63","mcp_get_code":{"code_sha256":"0847b98175b96a63"}},{"arxiv_id":"2312.02966","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-ss3d-diffusion-model-for-semi-1","title":"Diffusion-SS3D: Diffusion Model for Semi-supervised 3D Object Detection","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luluho1208/diffusion-ss3d","path":"models/diffusion_proposal_module.py","file_url":"https://github.com/luluho1208/diffusion-ss3d/blob/HEAD/models/diffusion_proposal_module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, luluho1208/diffusion-ss3d when it was checked","code_sha256":"d5b5086713ef6444","code_sha256_prefix":"d5b5086713ef6444","mcp_get_code":{"code_sha256":"d5b5086713ef6444"}},{"arxiv_id":"2304.12944","arxiv_id_is_arxiv":true,"paper":"/paper/latent-traversals-in-generative-models-as","title":"Latent Traversals in Generative Models as Potential Flows","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kingjamessong/pdetraversal","path":"lib/WavePDE.py","file_url":"https://github.com/kingjamessong/pdetraversal/blob/HEAD/lib/WavePDE.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c04f520f6e97ec1b","code_sha256_prefix":"c04f520f6e97ec1b","mcp_get_code":{"code_sha256":"c04f520f6e97ec1b"}},{"arxiv_id":"2303.17839","arxiv_id_is_arxiv":true,"paper":"/paper/learning-procedure-aware-video-representation","title":"Learning Procedure-aware Video Representation from Instructional Videos and Their Narrations","date":"2023-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/ProcedureVRL","path":"lib/models/tfm_model.py","file_url":"https://github.com/facebookresearch/ProcedureVRL/blob/HEAD/lib/models/tfm_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/ProcedureVRL (NOASSERTION)","code_sha256":"a8e06e074c8ee49d","code_sha256_prefix":"a8e06e074c8ee49d","mcp_get_code":{"code_sha256":"a8e06e074c8ee49d"}},{"arxiv_id":"2301.10857","arxiv_id_is_arxiv":true,"paper":"/paper/improving-graph-generation-by-restricting","title":"Improving Graph Generation by Restricting Graph Bandwidth","date":"2023-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"genentech/bandwidth-graph-generation","path":"graph_gen/models/gine_stack_score_matching.py","file_url":"https://github.com/genentech/bandwidth-graph-generation/blob/HEAD/graph_gen/models/gine_stack_score_matching.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, genentech/bandwidth-graph-generation (NOASSERTION)","code_sha256":"603a0a61606c983d","code_sha256_prefix":"603a0a61606c983d","mcp_get_code":{"code_sha256":"603a0a61606c983d"}},{"arxiv_id":"2006.11239","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-probabilistic-models","title":"Denoising Diffusion Probabilistic Models","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjfghk5697/Pytorch-Research-Paper-Implementations","path":"Diffusion/DDPM/models/model.py","file_url":"https://github.com/cjfghk5697/Pytorch-Research-Paper-Implementations/blob/HEAD/Diffusion/DDPM/models/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52bb9e202a8ce9ef","code_sha256_prefix":"52bb9e202a8ce9ef","mcp_get_code":{"code_sha256":"52bb9e202a8ce9ef"}}],"record_sha256":"bab3222d0d5554b7d87614770392e0a235dfcc5c8d2bbf5fda0ec7b876338236","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}