{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4TE5V34UM374ZOSLJFPERADY4K","short_pith_number":"pith:4TE5V34U","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"},"canonical_sha256":"e4c9daef9466ffccba4b495e488078e2b1a7c4aba3d27bfe4d5118eb015ec2ae","source":{"kind":"arxiv","id":"2603.18077","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4TE5V34UM374ZOSLJFPERADY4K","target":"record","payload":{"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"},"canonical_sha256":"e4c9daef9466ffccba4b495e488078e2b1a7c4aba3d27bfe4d5118eb015ec2ae","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"},"source_kind":"arxiv","source_id":"2603.18077","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T02:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ffHon8OYJivr22w8V3B4Qij+ZxTZmms/VqQcA7jP6Gq3PP6Mnp4Lk/QhyhKtY6FxjHAq4o1OgRGHD21pmkaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:43:17.654597Z"},"content_sha256":"c6ebc14c45153edda8a9d02888f19eb49dd308ac037a6b9c14745db23517e186","schema_version":"1.0","event_id":"sha256:c6ebc14c45153edda8a9d02888f19eb49dd308ac037a6b9c14745db23517e186"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4TE5V34UM374ZOSLJFPERADY4K","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T02:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYk8mBi4yG4D6FE/05UhAXLYnMbiNUNs3C7c8hqwZGmnB7QhDmdpaaLfJRTHlg8DcMXWGKCdl64oiQ2JsVetAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:43:17.655329Z"},"content_sha256":"f850c9e239cc953184efc664221b78a4f29ffcfecec758d4da2af0f3a8cb40f9","schema_version":"1.0","event_id":"sha256:f850c9e239cc953184efc664221b78a4f29ffcfecec758d4da2af0f3a8cb40f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/bundle.json","state_url":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TE5V34UM374ZOSLJFPERADY4K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T06:43:17Z","links":{"resolver":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K","bundle":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/bundle.json","state":"https://pith.science/pith/4TE5V34UM374ZOSLJFPERADY4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TE5V34UM374ZOSLJFPERADY4K/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxhWgH/67ttbdcMD1dRVE28FAYNbJct5vC/dTxDSrPqCnPfUvM5uH4s1hM5jxTEq2GsNByW8A5u9yKamGSoAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:43:17.658914Z","bundle_sha256":"410d2e2e00ac18f3ed978018046c711c042b90b765b73fd3681a1a8f688b00c5"}}