{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4TE5V34UM374ZOSLJFPERADY4K","short_pith_number":"pith:4TE5V34U","schema_version":"1.0","canonical_sha256":"e4c9daef9466ffccba4b495e488078e2b1a7c4aba3d27bfe4d5118eb015ec2ae","source":{"kind":"arxiv","id":"2603.18077","version":2},"attestation_state":"computed","paper":{"title":"A New Approach to Code Smoothing Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Katsuyuki Takashima, Tsuyoshi Miezaki, Yusaku Nishimura","submitted_at":"2026-03-18T06:56:21Z","abstract_excerpt":"Code smoothing is a phenomenon in which an error distribution makes a code statistically close to the uniform distribution over the ambient space. This closeness is measured by total variation distance. Recently, Debris-Alazard et al.\\ introduced a smoothing bound, which is an upper bound on this total variation distance. Although the smoothing bound evaluates how the error distribution smooths a code, this bound applies only to linear codes. In this paper, we generalize this bound to not only linear codes but also specific non-linear codes. While the smoothing bound in previous work was obtai"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2603.18077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-18T06:56:21Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"cfcb0ad654d428e53f0c6acb6aa0c8c82c04cd944e1dbe86d5f631d02852f9a5","abstract_canon_sha256":"8c4f5f399d4401d7cff2679ee204ca93385a266e37a534bd7917ed565b48e023"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:24.350640Z","signature_b64":"y4/vbkL1N61RkedAVm8L6rJV49Te/QLVRZ2T81Jg3jDzKVJUfYGhk9076CQ8GwnzY+00gzNOc6hJg5MDSm07AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c9daef9466ffccba4b495e488078e2b1a7c4aba3d27bfe4d5118eb015ec2ae","last_reissued_at":"2026-06-09T02:07:24.349619Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:24.349619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach to Code Smoothing Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Katsuyuki Takashima, Tsuyoshi Miezaki, Yusaku Nishimura","submitted_at":"2026-03-18T06:56:21Z","abstract_excerpt":"Code smoothing is a phenomenon in which an error distribution makes a code statistically close to the uniform distribution over the ambient space. This closeness is measured by total variation distance. Recently, Debris-Alazard et al.\\ introduced a smoothing bound, which is an upper bound on this total variation distance. Although the smoothing bound evaluates how the error distribution smooths a code, this bound applies only to linear codes. In this paper, we generalize this bound to not only linear codes but also specific non-linear codes. While the smoothing bound in previous work was obtai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.18077","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.18077/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.18077","created_at":"2026-06-09T02:07:24.349753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.18077v2","created_at":"2026-06-09T02:07:24.349753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18077","created_at":"2026-06-09T02:07:24.349753+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TE5V34UM374","created_at":"2026-06-09T02:07:24.349753+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TE5V34UM374ZOSL","created_at":"2026-06-09T02:07:24.349753+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TE5V34U","created_at":"2026-06-09T02:07:24.349753+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K","json":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K.json","graph_json":"https://pith.science/api/pith-number/4TE5V34UM374ZOSLJFPERADY4K/graph.json","events_json":"https://pith.science/api/pith-number/4TE5V34UM374ZOSLJFPERADY4K/events.json","paper":"https://pith.science/paper/4TE5V34U"},"agent_actions":{"view_html":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K","download_json":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K.json","view_paper":"https://pith.science/paper/4TE5V34U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.18077&json=true","fetch_graph":"https://pith.science/api/pith-number/4TE5V34UM374ZOSLJFPERADY4K/graph.json","fetch_events":"https://pith.science/api/pith-number/4TE5V34UM374ZOSLJFPERADY4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/action/storage_attestation","attest_author":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/action/author_attestation","sign_citation":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/action/citation_signature","submit_replication":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/action/replication_record"}},"created_at":"2026-06-09T02:07:24.349753+00:00","updated_at":"2026-06-09T02:07:24.349753+00:00"}