{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6KY7HT5NZXMQFNKJXWL7FZBIKM","short_pith_number":"pith:6KY7HT5N","canonical_record":{"source":{"id":"1506.03171","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T05:29:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e14b628027609aedf134685ef054202a32df60bfa0ed74f527b548f56986d42e","abstract_canon_sha256":"13aabcb1dc81b5b072651c7329f71e96c8cbb787fb6074e8fe09167794a920b5"},"schema_version":"1.0"},"canonical_sha256":"f2b1f3cfadcdd902b549bd97f2e4285319a76502808e0c2e92484dfd94dc4122","source":{"kind":"arxiv","id":"1506.03171","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03171","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03171v4","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03171","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"6KY7HT5NZXMQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6KY7HT5NZXMQFNKJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6KY7HT5N","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6KY7HT5NZXMQFNKJXWL7FZBIKM","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03171","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T05:29:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e14b628027609aedf134685ef054202a32df60bfa0ed74f527b548f56986d42e","abstract_canon_sha256":"13aabcb1dc81b5b072651c7329f71e96c8cbb787fb6074e8fe09167794a920b5"},"schema_version":"1.0"},"canonical_sha256":"f2b1f3cfadcdd902b549bd97f2e4285319a76502808e0c2e92484dfd94dc4122","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:09.940493Z","signature_b64":"HSRGa9AiKzKqart2sYYSiNbAYuL618qM3h5qxAMOT5PVl0Zca3DybdmEPP0REpMyyPhjqTD89F/Oz9IxSVktCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2b1f3cfadcdd902b549bd97f2e4285319a76502808e0c2e92484dfd94dc4122","last_reissued_at":"2026-05-18T00:16:09.939727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:09.939727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03171","source_version":4,"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-05-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlugqIlPwXdPqjz7PbEfwh7a6M49WJiaAalp+JSkJLXEYbLB7G6jJwRYuNejMVZpgtvkJfu3sgx8JSq0gdWWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:00:32.023159Z"},"content_sha256":"ac226dceeadf6291882d90d696c97ff35bf7d578139b70927d3829d9e0025d3f","schema_version":"1.0","event_id":"sha256:ac226dceeadf6291882d90d696c97ff35bf7d578139b70927d3829d9e0025d3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6KY7HT5NZXMQFNKJXWL7FZBIKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Correction by Structural Simplicity: Correcting Samplable Additive Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenji Yasunaga","submitted_at":"2015-06-10T05:29:24Z","abstract_excerpt":"This paper explores the possibilities and limitations of error correction by the structural simplicity of error mechanisms. Specifically, we consider channel models, called \\emph{samplable additive channels}, in which (a) errors are efficiently sampled without the knowledge of the coding scheme or the transmitted codeword; (b) the entropy of the error distribution is bounded; and (c) the number of errors introduced by the channel is unbounded. For the channels, several negative and positive results are provided. Assuming the existence of one-way functions, there are samplable additive errors o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03171","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPHsXpmUML09Uu6WOiD3NFpG7b4fQJWtI96kAr3OX/csZrJAILtZ5xd5aYns3jYrDxbe4iGkyuk4sIw4YrunDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:00:32.023516Z"},"content_sha256":"0b54149ad931f8197dfbac8b35625a08aea7a664d6afb5c50170b70b5e352691","schema_version":"1.0","event_id":"sha256:0b54149ad931f8197dfbac8b35625a08aea7a664d6afb5c50170b70b5e352691"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/bundle.json","state_url":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/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-25T20:00:32Z","links":{"resolver":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM","bundle":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/bundle.json","state":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6KY7HT5NZXMQFNKJXWL7FZBIKM","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":"13aabcb1dc81b5b072651c7329f71e96c8cbb787fb6074e8fe09167794a920b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T05:29:24Z","title_canon_sha256":"e14b628027609aedf134685ef054202a32df60bfa0ed74f527b548f56986d42e"},"schema_version":"1.0","source":{"id":"1506.03171","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03171","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03171v4","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03171","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"6KY7HT5NZXMQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6KY7HT5NZXMQFNKJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6KY7HT5N","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:0b54149ad931f8197dfbac8b35625a08aea7a664d6afb5c50170b70b5e352691","target":"graph","created_at":"2026-05-18T00:16:09Z","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"},"paper":{"abstract_excerpt":"This paper explores the possibilities and limitations of error correction by the structural simplicity of error mechanisms. Specifically, we consider channel models, called \\emph{samplable additive channels}, in which (a) errors are efficiently sampled without the knowledge of the coding scheme or the transmitted codeword; (b) the entropy of the error distribution is bounded; and (c) the number of errors introduced by the channel is unbounded. For the channels, several negative and positive results are provided. Assuming the existence of one-way functions, there are samplable additive errors o","authors_text":"Kenji Yasunaga","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T05:29:24Z","title":"Error Correction by Structural Simplicity: Correcting Samplable Additive Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03171","kind":"arxiv","version":4},"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:ac226dceeadf6291882d90d696c97ff35bf7d578139b70927d3829d9e0025d3f","target":"record","created_at":"2026-05-18T00:16:09Z","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":"13aabcb1dc81b5b072651c7329f71e96c8cbb787fb6074e8fe09167794a920b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T05:29:24Z","title_canon_sha256":"e14b628027609aedf134685ef054202a32df60bfa0ed74f527b548f56986d42e"},"schema_version":"1.0","source":{"id":"1506.03171","kind":"arxiv","version":4}},"canonical_sha256":"f2b1f3cfadcdd902b549bd97f2e4285319a76502808e0c2e92484dfd94dc4122","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2b1f3cfadcdd902b549bd97f2e4285319a76502808e0c2e92484dfd94dc4122","first_computed_at":"2026-05-18T00:16:09.939727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:09.939727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HSRGa9AiKzKqart2sYYSiNbAYuL618qM3h5qxAMOT5PVl0Zca3DybdmEPP0REpMyyPhjqTD89F/Oz9IxSVktCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:09.940493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03171","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac226dceeadf6291882d90d696c97ff35bf7d578139b70927d3829d9e0025d3f","sha256:0b54149ad931f8197dfbac8b35625a08aea7a664d6afb5c50170b70b5e352691"],"state_sha256":"5bdd6b25922ae12a5b28a67ac482cc5588db384c1ef0f9766b63aefdd3a5c1f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vl19SGF/qu1zFrtM9qWnitBRs5A4KSU6cnOGd8OAR4YhMCh604B7iAo9oO3sDOKKY8e7uk+2fyp5C4L4TusWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:00:32.025491Z","bundle_sha256":"6aff83373cdadfda0f2dca7f9c0d65aa76dc9a51a8420d4b8d4654e5bb1a97f4"}}