{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PMOUZWX537C47DTK2RL6DEXO5P","short_pith_number":"pith:PMOUZWX5","schema_version":"1.0","canonical_sha256":"7b1d4cdafddfc5cf8e6ad457e192eeebdf9769450236b1a04dc8a2904226e7a0","source":{"kind":"arxiv","id":"1609.03547","version":2},"attestation_state":"computed","paper":{"title":"Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hana Ando, Peter Vandendriessche, Yuichiro Fujiwara, Yu Tsunoda","submitted_at":"2016-09-12T19:39:34Z","abstract_excerpt":"An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes, it is also known that any linear code allows for first correcting errors and then erasures in two-step decoding. In particular, a carefully designed parity-check matrix not only allows for separating erasures from errors but also makes it possible to efficiently correct erasures. The separating redundancy of a linear code is the number of parity-check equations in a smallest parity-check matrix that has the require"},"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":"1609.03547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-12T19:39:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0110cd039b2ecf66a7eb59dcb709eadb7e3edaa839cd0ee2215dd3c27173a9b3","abstract_canon_sha256":"7a27ad26c44933d9ee57aa6933758b5b7c030d1d859d3d88e3b3ea1a9833c88f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:06.405597Z","signature_b64":"M+/EZBkpDM4jCjmZicQOiSi5tBgAlS3lZWV82xC6T8tVR/YKcR8r0Az+L7Fjq0vuOTSDIMklVVahpPFLIqiSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b1d4cdafddfc5cf8e6ad457e192eeebdf9769450236b1a04dc8a2904226e7a0","last_reissued_at":"2026-05-17T23:51:06.405064Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:06.405064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hana Ando, Peter Vandendriessche, Yuichiro Fujiwara, Yu Tsunoda","submitted_at":"2016-09-12T19:39:34Z","abstract_excerpt":"An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes, it is also known that any linear code allows for first correcting errors and then erasures in two-step decoding. In particular, a carefully designed parity-check matrix not only allows for separating erasures from errors but also makes it possible to efficiently correct erasures. The separating redundancy of a linear code is the number of parity-check equations in a smallest parity-check matrix that has the require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03547","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":""},"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":"1609.03547","created_at":"2026-05-17T23:51:06.405152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03547v2","created_at":"2026-05-17T23:51:06.405152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03547","created_at":"2026-05-17T23:51:06.405152+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMOUZWX537C4","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMOUZWX537C47DTK","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMOUZWX5","created_at":"2026-05-18T12:30:39.010887+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/PMOUZWX537C47DTK2RL6DEXO5P","json":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P.json","graph_json":"https://pith.science/api/pith-number/PMOUZWX537C47DTK2RL6DEXO5P/graph.json","events_json":"https://pith.science/api/pith-number/PMOUZWX537C47DTK2RL6DEXO5P/events.json","paper":"https://pith.science/paper/PMOUZWX5"},"agent_actions":{"view_html":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P","download_json":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P.json","view_paper":"https://pith.science/paper/PMOUZWX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03547&json=true","fetch_graph":"https://pith.science/api/pith-number/PMOUZWX537C47DTK2RL6DEXO5P/graph.json","fetch_events":"https://pith.science/api/pith-number/PMOUZWX537C47DTK2RL6DEXO5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/action/storage_attestation","attest_author":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/action/author_attestation","sign_citation":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/action/citation_signature","submit_replication":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/action/replication_record"}},"created_at":"2026-05-17T23:51:06.405152+00:00","updated_at":"2026-05-17T23:51:06.405152+00:00"}