{"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/smoothing","entry":"smoothing","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":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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":0,"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":2,"ran":3,"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":"2407.03241","arxiv_id_is_arxiv":true,"paper":"/paper/terrain-classification-enhanced-with","title":"Terrain Classification Enhanced with Uncertainty for Space Exploration Robots from Proprioceptive Data","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/HpBandSter","path":"hpbandster/optimizers/config_generators/lcnet.py","file_url":"https://github.com/automl/HpBandSter/blob/HEAD/hpbandster/optimizers/config_generators/lcnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a133ad9110a7e2c","code_sha256_prefix":"4a133ad9110a7e2c","mcp_get_code":{"code_sha256":"4a133ad9110a7e2c"}},{"arxiv_id":"2306.02913","arxiv_id_is_arxiv":true,"paper":"/paper/decentralized-sgd-and-average-direction-sam","title":"Decentralized SGD and Average-direction SAM are Asymptotically Equivalent","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raiden-zhu/icml-2023-dsgd-and-sam","path":"plots/plot_cifar10_alexnet.py","file_url":"https://github.com/raiden-zhu/icml-2023-dsgd-and-sam/blob/HEAD/plots/plot_cifar10_alexnet.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":"c6becdc07e1b2c30","code_sha256_prefix":"c6becdc07e1b2c30","mcp_get_code":{"code_sha256":"c6becdc07e1b2c30"}},{"arxiv_id":"2303.15286","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-adaptation-from-repeated","title":"Unsupervised Adaptation from Repeated Traversals for Autonomous Driving","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yurongyou/rote-da","path":"p2_score/utils/clustering_utils.py","file_url":"https://github.com/yurongyou/rote-da/blob/HEAD/p2_score/utils/clustering_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":"c65d0ed036471f5d","code_sha256_prefix":"c65d0ed036471f5d","mcp_get_code":{"code_sha256":"c65d0ed036471f5d"}},{"arxiv_id":"2106.00225","arxiv_id_is_arxiv":true,"paper":"/paper/locally-valid-and-discriminative-confidence","title":"Locally Valid and Discriminative Prediction Intervals for Deep Learning Models","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zlin7/LVD","path":"utils/eval_utils.py","file_url":"https://github.com/zlin7/LVD/blob/HEAD/utils/eval_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":"a08c0e709979c15a","code_sha256_prefix":"a08c0e709979c15a","mcp_get_code":{"code_sha256":"a08c0e709979c15a"}},{"arxiv_id":"2103.13646","arxiv_id_is_arxiv":true,"paper":"/paper/contrast-to-divide-self-supervised-pre-1","title":"Contrast to Divide: Self-Supervised Pre-Training for Learning with Noisy Labels","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ContrastToDivide/C2D","path":"cross_entropy.py","file_url":"https://github.com/ContrastToDivide/C2D/blob/HEAD/cross_entropy.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"46e004362de7a8d3","code_sha256_prefix":"46e004362de7a8d3","mcp_get_code":{"code_sha256":"46e004362de7a8d3"}},{"arxiv_id":"2022.naacl-main.111","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.naacl-main.111","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"EleanorJiang/BlonDe","path":"blonde/dBlonDe.py","file_url":"https://github.com/EleanorJiang/BlonDe/blob/HEAD/blonde/dBlonDe.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":"aa47d347c364f0bc","code_sha256_prefix":"aa47d347c364f0bc","mcp_get_code":{"code_sha256":"aa47d347c364f0bc"}}],"record_sha256":"93a15508a8c11386868ca2fb5beceaa9b42e8c89675a186abc4a92de793c409d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}