{"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/rms","entry":"rms","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":4,"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":"2407.17465","arxiv_id_is_arxiv":true,"paper":"/paper/u-m-p-the-unit-scaled-maximal-update","title":"u-$μ$P: The Unit-Scaled Maximal Update Parametrization","date":"2024-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphcore-research/unit-scaling","path":"unit_scaling/core/functional.py","file_url":"https://github.com/graphcore-research/unit-scaling/blob/HEAD/unit_scaling/core/functional.py","status":"ran","verification_level":1,"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":"7f174b2d78b36837","code_sha256_prefix":"7f174b2d78b36837","mcp_get_code":{"code_sha256":"7f174b2d78b36837"}},{"arxiv_id":"2401.14444","arxiv_id_is_arxiv":true,"paper":"/paper/icassp-2024-speech-signal-improvement","title":"ICASSP 2024 Speech Signal Improvement Challenge","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/sig-challenge","path":"ICASSP2024/demo_synthesizer/synthesizer.py","file_url":"https://github.com/microsoft/sig-challenge/blob/HEAD/ICASSP2024/demo_synthesizer/synthesizer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19e4f79d50ec3ee2","code_sha256_prefix":"19e4f79d50ec3ee2","mcp_get_code":{"code_sha256":"19e4f79d50ec3ee2"}},{"arxiv_id":"2311.18505","arxiv_id_is_arxiv":true,"paper":"/paper/string-sound-synthesizer-on-gpu-accelerated","title":"String Sound Synthesizer on GPU-accelerated Finite Difference Scheme","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"jin-woo-lee/torch-fdtd-string","path":"src/task/process_training_data.py","file_url":"https://github.com/jin-woo-lee/torch-fdtd-string/blob/HEAD/src/task/process_training_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, jin-woo-lee/torch-fdtd-string, is not in the permissive set Syntology serves inline","code_sha256":"c843b14e0b0a798b","code_sha256_prefix":"c843b14e0b0a798b","mcp_get_code":{"code_sha256":"c843b14e0b0a798b"}},{"arxiv_id":"2311.06558","arxiv_id_is_arxiv":true,"paper":"/paper/convolve-and-conquer-data-comparison-with","title":"Convolve and Conquer: Data Comparison with Wiener Filters","date":"2023-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dpelacani/AWLoss","path":"wiener_loss/wiener_loss.py","file_url":"https://github.com/dpelacani/AWLoss/blob/HEAD/wiener_loss/wiener_loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"563dcaf0ca0ac558","code_sha256_prefix":"563dcaf0ca0ac558","mcp_get_code":{"code_sha256":"563dcaf0ca0ac558"}},{"arxiv_id":"2006.08437","arxiv_id_is_arxiv":true,"paper":"/paper/depth-uncertainty-in-neural-networks","title":"Depth Uncertainty in Neural Networks","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/DUN","path":"src/utils.py","file_url":"https://github.com/cambridge-mlg/DUN/blob/HEAD/src/utils.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":"d77ddd0ac2760948","code_sha256_prefix":"d77ddd0ac2760948","mcp_get_code":{"code_sha256":"d77ddd0ac2760948"}},{"arxiv_id":"2005.08138","arxiv_id_is_arxiv":true,"paper":"/paper/an-open-source-implementation-of-itu-t","title":"An Open source Implementation of ITU-T Recommendation P.808 with Validation","date":"2020-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/P.808","path":"src/utils/create_bandwidth_check_clips.py","file_url":"https://github.com/microsoft/P.808/blob/HEAD/src/utils/create_bandwidth_check_clips.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":"7c90db5cb9981e1a","code_sha256_prefix":"7c90db5cb9981e1a","mcp_get_code":{"code_sha256":"7c90db5cb9981e1a"}}],"record_sha256":"a8febdce13d4381b919567f16b824eb1bbf629671f4402b2c644c1c2e8df5841","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}