{"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/gaussian-noise","entry":"gaussian_noise","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":9,"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":2,"ran_fixture":2,"ran":4,"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":"2603.06781","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-06781","title":"xaitimesynth: Evaluating Attribution Methods with Synthetic Ground Truth xaitimesynth: A Python Package for Evaluating Attribution Methods for Time Series with Synthetic Ground Truth","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"gregorbaer/xaitimesynth","path":"xaitimesynth/components.py","file_url":"https://github.com/gregorbaer/xaitimesynth/blob/HEAD/xaitimesynth/components.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da7dcee3e68705cc","code_sha256_prefix":"da7dcee3e68705cc","mcp_get_code":{"code_sha256":"da7dcee3e68705cc"}},{"arxiv_id":"2505.13662","arxiv_id_is_arxiv":true,"paper":"/paper/differentially-private-quantiles-with-smaller","title":"Differentially Private Quantiles with Smaller Error","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":"archive","repo":"nynsenfaber/dp_cc_quantiles","path":"DP_AQ/approximate_quantiles_algo.py","file_url":"https://github.com/nynsenfaber/dp_cc_quantiles/blob/HEAD/DP_AQ/approximate_quantiles_algo.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nynsenfaber/dp_cc_quantiles when it was checked","code_sha256":"1e0948b9ea245170","code_sha256_prefix":"1e0948b9ea245170","mcp_get_code":{"code_sha256":"1e0948b9ea245170"}},{"arxiv_id":"2406.16540","arxiv_id_is_arxiv":true,"paper":"/paper/improving-robustness-to-corruptions-with","title":"Improving robustness to corruptions with multiplicative weight perturbations","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trungtrinh44/damp","path":"randaugment/augment.py","file_url":"https://github.com/trungtrinh44/damp/blob/HEAD/randaugment/augment.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, trungtrinh44/damp when it was checked","code_sha256":"8cbf8b03fdf303a9","code_sha256_prefix":"8cbf8b03fdf303a9","mcp_get_code":{"code_sha256":"8cbf8b03fdf303a9"}},{"arxiv_id":"2406.04845","arxiv_id_is_arxiv":true,"paper":"/paper/fedllm-bench-realistic-benchmarks-for","title":"FedLLM-Bench: Realistic Benchmarks for Federated Learning of Large Language Models","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rui-ye/fedllm-bench","path":"federated_learning/fed_global.py","file_url":"https://github.com/rui-ye/fedllm-bench/blob/HEAD/federated_learning/fed_global.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rui-ye/fedllm-bench (NOASSERTION)","code_sha256":"89b2eb0c997d6cbb","code_sha256_prefix":"89b2eb0c997d6cbb","mcp_get_code":{"code_sha256":"89b2eb0c997d6cbb"}},{"arxiv_id":"2211.10024","arxiv_id_is_arxiv":true,"paper":"/paper/diagnostics-for-deep-neural-networks-with","title":"Diagnostics for Deep Neural Networks with Automated Copy/Paste Attacks","date":"2022-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thestephencasper/snafue","path":"cp_attack.py","file_url":"https://github.com/thestephencasper/snafue/blob/HEAD/cp_attack.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","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, thestephencasper/snafue when it was checked","code_sha256":"2d28d9090d816977","code_sha256_prefix":"2d28d9090d816977","mcp_get_code":{"code_sha256":"2d28d9090d816977"}},{"arxiv_id":"2210.12945","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-sparse-convolutional-model-for","title":"Revisiting Sparse Convolutional Model for Visual Recognition","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"delay-xili/sdnet","path":"robust_inference.py","file_url":"https://github.com/delay-xili/sdnet/blob/HEAD/robust_inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a306bcde26b520ba","code_sha256_prefix":"a306bcde26b520ba","mcp_get_code":{"code_sha256":"a306bcde26b520ba"}},{"arxiv_id":"2205.10920","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-robust-personalization-for","title":"Test-Time Robust Personalization for Federated Learning","date":"2022-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LINs-lab/FedTHE","path":"BRFL/corr_data.py","file_url":"https://github.com/LINs-lab/FedTHE/blob/HEAD/BRFL/corr_data.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":"aa8d742f576ad186","code_sha256_prefix":"aa8d742f576ad186","mcp_get_code":{"code_sha256":"aa8d742f576ad186"}},{"arxiv_id":"2204.04360","arxiv_id_is_arxiv":true,"paper":"/paper/data-augmentation-for-electrocardiograms","title":"Data Augmentation for Electrocardiograms","date":"2022-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aniruddhraghu/ecg_aug","path":"functional.py","file_url":"https://github.com/aniruddhraghu/ecg_aug/blob/HEAD/functional.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":"16242b2c7a63e743","code_sha256_prefix":"16242b2c7a63e743","mcp_get_code":{"code_sha256":"16242b2c7a63e743"}},{"arxiv_id":"1911.07850","arxiv_id_is_arxiv":true,"paper":"/paper/frequency-separation-for-real-world-super","title":"Frequency Separation for Real-World Super-Resolution","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ManuelFritsche/real-world-sr","path":"dsgan/utils.py","file_url":"https://github.com/ManuelFritsche/real-world-sr/blob/HEAD/dsgan/utils.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":"fddd828ae0d50eb8","code_sha256_prefix":"fddd828ae0d50eb8","mcp_get_code":{"code_sha256":"fddd828ae0d50eb8"}}],"record_sha256":"8a87d64a87153491c17307644e0fef894ea1f2568f8f97159b37f19471f51578","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}