{"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/fourierfeatures","entry":"FourierFeatures","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":7,"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":7,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":2,"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":6,"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":"2608.01839","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-01839","title":"tFUSOperator: Operator Learning for Transcranial Focused Ultrasound Digital Twins","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"CMME-Lab/tFUSOperator","path":"models/model.py","file_url":"https://github.com/CMME-Lab/tFUSOperator/blob/HEAD/models/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9b82c60619bb1b19","code_sha256_prefix":"9b82c60619bb1b19","mcp_get_code":{"code_sha256":"9b82c60619bb1b19"}},{"arxiv_id":"2607.08091","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-08091","title":"Deep Learning Method for Stationary Distribution of Reflected Brownian Motion","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"zhangz73/NN4MGF","path":"fit_mgf.py","file_url":"https://github.com/zhangz73/NN4MGF/blob/HEAD/fit_mgf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f7fad700764bd0c","code_sha256_prefix":"3f7fad700764bd0c","mcp_get_code":{"code_sha256":"3f7fad700764bd0c"}},{"arxiv_id":"2606.20756","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20756","title":"A large-scale foundation model enables simulation-to-real adaptation for nuclear magnetic resonance-based molecular structure analysis","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wuycM/UltraNMR","path":"models/UltraNMR.py","file_url":"https://github.com/wuycM/UltraNMR/blob/HEAD/models/UltraNMR.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":"4081b7f0e775805f","code_sha256_prefix":"4081b7f0e775805f","mcp_get_code":{"code_sha256":"4081b7f0e775805f"}},{"arxiv_id":"2506.21427","arxiv_id_is_arxiv":true,"paper":"/paper/flow-based-single-step-completion-for","title":"Flow-Based Single-Step Completion for Efficient and Expressive Policy Learning","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrajwalKoirala/SSCP-Single-Step-Completion-Policy","path":"SSCQL/agents/ssc_flow_policy.py","file_url":"https://github.com/PrajwalKoirala/SSCP-Single-Step-Completion-Policy/blob/HEAD/SSCQL/agents/ssc_flow_policy.py","status":"ran","verification_level":1,"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, PrajwalKoirala/SSCP-Single-Step-Completion-Policy when it was checked","code_sha256":"933088029683db94","code_sha256_prefix":"933088029683db94","mcp_get_code":{"code_sha256":"933088029683db94"}},{"arxiv_id":"2502.11612","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-entropy-reinforcement-learning-with-1","title":"Maximum Entropy Reinforcement Learning with Diffusion Policy","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffusionyes/maxentdp","path":"jaxrl5/agents/score_matching/max_entropy_learner.py","file_url":"https://github.com/diffusionyes/maxentdp/blob/HEAD/jaxrl5/agents/score_matching/max_entropy_learner.py","status":"ran","verification_level":1,"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, diffusionyes/maxentdp when it was checked","code_sha256":"137f7334fa321901","code_sha256_prefix":"137f7334fa321901","mcp_get_code":{"code_sha256":"137f7334fa321901"}},{"arxiv_id":"2312.10431","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-diffusion-for-mixed-type-tabular","title":"Continuous Diffusion for Mixed-Type Tabular Data","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muellermarkus/cdtd","path":"mixed_type_diffusion.py","file_url":"https://github.com/muellermarkus/cdtd/blob/HEAD/mixed_type_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85ee87ab75e3b36b","code_sha256_prefix":"85ee87ab75e3b36b","mcp_get_code":{"code_sha256":"85ee87ab75e3b36b"}},{"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":"crowsonkb/v-diffusion-jax","path":"diffusion/models/danbooru_128.py","file_url":"https://github.com/crowsonkb/v-diffusion-jax/blob/HEAD/diffusion/models/danbooru_128.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a640022279fbd102","code_sha256_prefix":"a640022279fbd102","mcp_get_code":{"code_sha256":"a640022279fbd102"}}],"record_sha256":"9b315563009964f2b7353944ceb458f35023029fa3fb69081e21986ac72a46fe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}