{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4TE5V34UM374ZOSLJFPERADY4K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8c4f5f399d4401d7cff2679ee204ca93385a266e37a534bd7917ed565b48e023","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-18T06:56:21Z","title_canon_sha256":"cfcb0ad654d428e53f0c6acb6aa0c8c82c04cd944e1dbe86d5f631d02852f9a5"},"schema_version":"1.0","source":{"id":"2603.18077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.18077","created_at":"2026-06-09T02:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"2603.18077v2","created_at":"2026-06-09T02:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18077","created_at":"2026-06-09T02:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"4TE5V34UM374","created_at":"2026-06-09T02:07:24Z"},{"alias_kind":"pith_short_16","alias_value":"4TE5V34UM374ZOSL","created_at":"2026-06-09T02:07:24Z"},{"alias_kind":"pith_short_8","alias_value":"4TE5V34U","created_at":"2026-06-09T02:07:24Z"}],"graph_snapshots":[{"event_id":"sha256:f850c9e239cc953184efc664221b78a4f29ffcfecec758d4da2af0f3a8cb40f9","target":"graph","created_at":"2026-06-09T02:07:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.18077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Katsuyuki Takashima, Tsuyoshi Miezaki, Yusaku Nishimura","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-18T06:56:21Z","title":"A New Approach to Code Smoothing Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.18077","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6ebc14c45153edda8a9d02888f19eb49dd308ac037a6b9c14745db23517e186","target":"record","created_at":"2026-06-09T02:07:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8c4f5f399d4401d7cff2679ee204ca93385a266e37a534bd7917ed565b48e023","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-18T06:56:21Z","title_canon_sha256":"cfcb0ad654d428e53f0c6acb6aa0c8c82c04cd944e1dbe86d5f631d02852f9a5"},"schema_version":"1.0","source":{"id":"2603.18077","kind":"arxiv","version":2}},"canonical_sha256":"e4c9daef9466ffccba4b495e488078e2b1a7c4aba3d27bfe4d5118eb015ec2ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4c9daef9466ffccba4b495e488078e2b1a7c4aba3d27bfe4d5118eb015ec2ae","first_computed_at":"2026-06-09T02:07:24.349619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:07:24.349619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y4/vbkL1N61RkedAVm8L6rJV49Te/QLVRZ2T81Jg3jDzKVJUfYGhk9076CQ8GwnzY+00gzNOc6hJg5MDSm07AA==","signature_status":"signed_v1","signed_at":"2026-06-09T02:07:24.350640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.18077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6ebc14c45153edda8a9d02888f19eb49dd308ac037a6b9c14745db23517e186","sha256:f850c9e239cc953184efc664221b78a4f29ffcfecec758d4da2af0f3a8cb40f9"],"state_sha256":"4e3ab1d8c2f39b9851c3f25f4222b1aae3709dc3ef3e4e50348f9679c229d5cd"}