{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PMOUZWX537C47DTK2RL6DEXO5P","short_pith_number":"pith:PMOUZWX5","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"},"canonical_sha256":"7b1d4cdafddfc5cf8e6ad457e192eeebdf9769450236b1a04dc8a2904226e7a0","source":{"kind":"arxiv","id":"1609.03547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03547","created_at":"2026-05-17T23:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03547v2","created_at":"2026-05-17T23:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03547","created_at":"2026-05-17T23:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"PMOUZWX537C4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PMOUZWX537C47DTK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PMOUZWX5","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PMOUZWX537C47DTK2RL6DEXO5P","target":"record","payload":{"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"},"canonical_sha256":"7b1d4cdafddfc5cf8e6ad457e192eeebdf9769450236b1a04dc8a2904226e7a0","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"},"source_kind":"arxiv","source_id":"1609.03547","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-05-17T23:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tm1z3kJ/FgFxxj0NUVbiQBYdSu2UUWJF5xNi3UAIdV2IX8M9oQ9XeE1jLD7i8u5p+gZ8IcYbF+bOlt/qoXUJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:58:02.118627Z"},"content_sha256":"1ac67f5a885d54f05e9d49588fc802a9a512a88b49848f501335dbb1c281ba5d","schema_version":"1.0","event_id":"sha256:1ac67f5a885d54f05e9d49588fc802a9a512a88b49848f501335dbb1c281ba5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PMOUZWX537C47DTK2RL6DEXO5P","target":"graph","payload":{"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"},"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-17T23:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUq3Ru2OBShY1uF4LRZKkEISQvTpir/7K/FQ9R5vIhewJXt+uXwnvEUPNAROwcmtJu4p+CxgqBG9dVZpm/LDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:58:02.118972Z"},"content_sha256":"731e3c01e06705ea0b80239deade30e74084bb79aa390f7cbfb7c6a7790e38a1","schema_version":"1.0","event_id":"sha256:731e3c01e06705ea0b80239deade30e74084bb79aa390f7cbfb7c6a7790e38a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/bundle.json","state_url":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMOUZWX537C47DTK2RL6DEXO5P/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-08T14:58:02Z","links":{"resolver":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P","bundle":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/bundle.json","state":"https://pith.science/pith/PMOUZWX537C47DTK2RL6DEXO5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMOUZWX537C47DTK2RL6DEXO5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PMOUZWX537C47DTK2RL6DEXO5P","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":"7a27ad26c44933d9ee57aa6933758b5b7c030d1d859d3d88e3b3ea1a9833c88f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-12T19:39:34Z","title_canon_sha256":"0110cd039b2ecf66a7eb59dcb709eadb7e3edaa839cd0ee2215dd3c27173a9b3"},"schema_version":"1.0","source":{"id":"1609.03547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03547","created_at":"2026-05-17T23:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03547v2","created_at":"2026-05-17T23:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03547","created_at":"2026-05-17T23:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"PMOUZWX537C4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PMOUZWX537C47DTK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PMOUZWX5","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:731e3c01e06705ea0b80239deade30e74084bb79aa390f7cbfb7c6a7790e38a1","target":"graph","created_at":"2026-05-17T23:51:06Z","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":"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","authors_text":"Hana Ando, Peter Vandendriessche, Yuichiro Fujiwara, Yu Tsunoda","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-12T19:39:34Z","title":"Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03547","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:1ac67f5a885d54f05e9d49588fc802a9a512a88b49848f501335dbb1c281ba5d","target":"record","created_at":"2026-05-17T23:51:06Z","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":"7a27ad26c44933d9ee57aa6933758b5b7c030d1d859d3d88e3b3ea1a9833c88f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-12T19:39:34Z","title_canon_sha256":"0110cd039b2ecf66a7eb59dcb709eadb7e3edaa839cd0ee2215dd3c27173a9b3"},"schema_version":"1.0","source":{"id":"1609.03547","kind":"arxiv","version":2}},"canonical_sha256":"7b1d4cdafddfc5cf8e6ad457e192eeebdf9769450236b1a04dc8a2904226e7a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b1d4cdafddfc5cf8e6ad457e192eeebdf9769450236b1a04dc8a2904226e7a0","first_computed_at":"2026-05-17T23:51:06.405064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:06.405064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M+/EZBkpDM4jCjmZicQOiSi5tBgAlS3lZWV82xC6T8tVR/YKcR8r0Az+L7Fjq0vuOTSDIMklVVahpPFLIqiSBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:06.405597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ac67f5a885d54f05e9d49588fc802a9a512a88b49848f501335dbb1c281ba5d","sha256:731e3c01e06705ea0b80239deade30e74084bb79aa390f7cbfb7c6a7790e38a1"],"state_sha256":"61a669ff56d29bcfa4c3dc95dcede7fe1614e3a234dee2ce160f1311d8706aa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQ9aTax4MMb5MGpyjKEOnSGafVn4QnyO9o36wKed2xckggRO1W+ciOuJ59bkBVzD8B2xakEUdQzbmPbk/WMsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:58:02.120849Z","bundle_sha256":"6716f7bd28c9562424711b5e8ecfb6576ef968f781cec2e0fd13ed1a95dc81eb"}}