{"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/fft","entry":"fft","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":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":7,"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":2,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":2},"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":"2604.11101","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11101","title":"Generating Hadamard matrices with transformers","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"pzinn/hadamard","path":"params.py","file_url":"https://github.com/pzinn/hadamard/blob/HEAD/params.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, pzinn/hadamard when it was checked","code_sha256":"467e5b54e5cd31f2","code_sha256_prefix":"467e5b54e5cd31f2","mcp_get_code":{"code_sha256":"467e5b54e5cd31f2"}},{"arxiv_id":"2604.06662","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06662","title":"Towards Robust Content Watermarking Against Removal and Forgery Attacks","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"hala64/ISTS","path":"various_watermark/ringid.py","file_url":"https://github.com/hala64/ISTS/blob/HEAD/various_watermark/ringid.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, hala64/ISTS when it was checked","code_sha256":"ed91fcbe9c5f65d3","code_sha256_prefix":"ed91fcbe9c5f65d3","mcp_get_code":{"code_sha256":"ed91fcbe9c5f65d3"}},{"arxiv_id":"2410.03052","arxiv_id_is_arxiv":true,"paper":"/paper/learning-structured-representations-by","title":"Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uiuctml/OTCPCC","path":"loss.py","file_url":"https://github.com/uiuctml/OTCPCC/blob/HEAD/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c731bf6abcb63504","code_sha256_prefix":"c731bf6abcb63504","mcp_get_code":{"code_sha256":"c731bf6abcb63504"}},{"arxiv_id":"2403.08728","arxiv_id_is_arxiv":true,"paper":"/paper/ambient-diffusion-posterior-sampling-solving","title":"Ambient Diffusion Posterior Sampling: Solving Inverse Problems with Diffusion Models trained on Corrupted Data","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utcsilab/ambient-diffusion-mri","path":"solve_inverse_adps.py","file_url":"https://github.com/utcsilab/ambient-diffusion-mri/blob/HEAD/solve_inverse_adps.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, utcsilab/ambient-diffusion-mri when it was checked","code_sha256":"fbfab7977067c5c5","code_sha256_prefix":"fbfab7977067c5c5","mcp_get_code":{"code_sha256":"fbfab7977067c5c5"}},{"arxiv_id":"2107.07405","arxiv_id_is_arxiv":true,"paper":"/paper/lossless-scalable-implicit-likelihood","title":"Lossless, Scalable Implicit Likelihood Inference for Cosmological Fields","date":null,"month_inferred_from_arxiv_id":"2021-07","title_source":"archive","repo":"tlmakinen/powerbox-jax","path":"powerbox_jax/dft.py","file_url":"https://github.com/tlmakinen/powerbox-jax/blob/HEAD/powerbox_jax/dft.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f4891cdc0e79720","code_sha256_prefix":"5f4891cdc0e79720","mcp_get_code":{"code_sha256":"5f4891cdc0e79720"}},{"arxiv_id":"1911.03221","arxiv_id_is_arxiv":true,"paper":"/paper/dreem-open-datasets-multi-scored-sleep","title":"Dreem Open Datasets: Multi-Scored Sleep Datasets to compare Human and Automated sleep staging","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dreem-Organization/dreem-learning-open","path":"dreem_learning_open/preprocessings/epoch_features_processing.py","file_url":"https://github.com/Dreem-Organization/dreem-learning-open/blob/HEAD/dreem_learning_open/preprocessings/epoch_features_processing.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":"17f77ead9e021fe4","code_sha256_prefix":"17f77ead9e021fe4","mcp_get_code":{"code_sha256":"17f77ead9e021fe4"}},{"arxiv_id":"1905.13545","arxiv_id_is_arxiv":true,"paper":"/paper/190513545","title":"High Frequency Component Helps Explain the Generalization of Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaohanWang/HFC","path":"scripts/resnet.py","file_url":"https://github.com/HaohanWang/HFC/blob/HEAD/scripts/resnet.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, HaohanWang/HFC when it was checked","code_sha256":"25125b2d8701886c","code_sha256_prefix":"25125b2d8701886c","mcp_get_code":{"code_sha256":"25125b2d8701886c"}}],"record_sha256":"74c0ffceb95cc885fe1421342064bb9c0bb58ed3017d01ac84472b6bec12082f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}