{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6KY7HT5NZXMQFNKJXWL7FZBIKM","short_pith_number":"pith:6KY7HT5N","schema_version":"1.0","canonical_sha256":"f2b1f3cfadcdd902b549bd97f2e4285319a76502808e0c2e92484dfd94dc4122","source":{"kind":"arxiv","id":"1506.03171","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.03171","created_at":"2026-05-18T00:16:09.939861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03171v4","created_at":"2026-05-18T00:16:09.939861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03171","created_at":"2026-05-18T00:16:09.939861+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KY7HT5NZXMQ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KY7HT5NZXMQFNKJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KY7HT5N","created_at":"2026-05-18T12:29:07.941421+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/6KY7HT5NZXMQFNKJXWL7FZBIKM","json":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM.json","graph_json":"https://pith.science/api/pith-number/6KY7HT5NZXMQFNKJXWL7FZBIKM/graph.json","events_json":"https://pith.science/api/pith-number/6KY7HT5NZXMQFNKJXWL7FZBIKM/events.json","paper":"https://pith.science/paper/6KY7HT5N"},"agent_actions":{"view_html":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM","download_json":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM.json","view_paper":"https://pith.science/paper/6KY7HT5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03171&json=true","fetch_graph":"https://pith.science/api/pith-number/6KY7HT5NZXMQFNKJXWL7FZBIKM/graph.json","fetch_events":"https://pith.science/api/pith-number/6KY7HT5NZXMQFNKJXWL7FZBIKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/action/storage_attestation","attest_author":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/action/author_attestation","sign_citation":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/action/citation_signature","submit_replication":"https://pith.science/pith/6KY7HT5NZXMQFNKJXWL7FZBIKM/action/replication_record"}},"created_at":"2026-05-18T00:16:09.939861+00:00","updated_at":"2026-05-18T00:16:09.939861+00:00"}