{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IBOFCL72EXN725SMEOKPEU5WAS","short_pith_number":"pith:IBOFCL72","canonical_record":{"source":{"id":"1801.06794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T09:20:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10db2239b2628f12bb6cdb432a5bad281999283ba1b867e9a466ca2084e60820","abstract_canon_sha256":"fa4a9a3f2e23643d41a66b003b4535bfc85913b5ad79d676ea38e80ae8dfc2b9"},"schema_version":"1.0"},"canonical_sha256":"405c512ffa25dbfd764c2394f253b604ba905c452d0118956a7133150607df5c","source":{"kind":"arxiv","id":"1801.06794","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06794","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06794v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06794","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"IBOFCL72EXN7","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IBOFCL72EXN725SM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IBOFCL72","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IBOFCL72EXN725SMEOKPEU5WAS","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T09:20:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10db2239b2628f12bb6cdb432a5bad281999283ba1b867e9a466ca2084e60820","abstract_canon_sha256":"fa4a9a3f2e23643d41a66b003b4535bfc85913b5ad79d676ea38e80ae8dfc2b9"},"schema_version":"1.0"},"canonical_sha256":"405c512ffa25dbfd764c2394f253b604ba905c452d0118956a7133150607df5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.709564Z","signature_b64":"9BIrXYzfQRUSONIqQ+jRPKi1hXzjjI+gbakBM2J1Ro8tU8rPxwAdwy+8MH8GT8P1eJrRFzxMliNeOxYcJcIADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405c512ffa25dbfd764c2394f253b604ba905c452d0118956a7133150607df5c","last_reissued_at":"2026-05-18T00:25:27.708952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.708952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06794","source_version":1,"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:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBGuUCW8yxZmPcUn+hZNBKmptugkg1WPz+HCwSOFskqcZPwyqoXpYtgWX7ESupNTeHfTgBArGwm1FPI08x7IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:16:07.504848Z"},"content_sha256":"229f705031129b6707faaf5cf144d71650df4b6fa8dc130b9eaa59954e92c1c3","schema_version":"1.0","event_id":"sha256:229f705031129b6707faaf5cf144d71650df4b6fa8dc130b9eaa59954e92c1c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IBOFCL72EXN725SMEOKPEU5WAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Balaji Srinivasan Babu, Ganesh R.Kini, P. Vijay Kumar","submitted_at":"2018-01-21T09:20:29Z","abstract_excerpt":"An erasure code is said to be a code with sequential recovery with parameters $r$ and $t$, if for any $s \\leq t$ erased code symbols, there is an $s$-step recovery process in which at each step we recover exactly one erased code symbol by contacting at most $r$ other code symbols. In earlier work by the same authors, presented at ISIT 2017, we had given a construction for binary codes with sequential recovery from $t$ erasures, with locality parameter $r$, which were optimal in terms of code rate for given $r,t$, but where the block length was large, on the order of $r^{c^t}$, for some constan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06794","kind":"arxiv","version":1},"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:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0chW9xPWhuZh5bBrzxbU5bBl2inK5WAcECRUUyxk6rJeb8x3+lCZ4ZvLdycLbPw82INs0lLeD5350Y/M/j5MAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:16:07.505543Z"},"content_sha256":"a370e39bf2f323c9f17c05f065e25c88ba124d7696ca1a762976888f2be41285","schema_version":"1.0","event_id":"sha256:a370e39bf2f323c9f17c05f065e25c88ba124d7696ca1a762976888f2be41285"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/bundle.json","state_url":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBOFCL72EXN725SMEOKPEU5WAS/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-05-31T08:16:07Z","links":{"resolver":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS","bundle":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/bundle.json","state":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBOFCL72EXN725SMEOKPEU5WAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IBOFCL72EXN725SMEOKPEU5WAS","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":"fa4a9a3f2e23643d41a66b003b4535bfc85913b5ad79d676ea38e80ae8dfc2b9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T09:20:29Z","title_canon_sha256":"10db2239b2628f12bb6cdb432a5bad281999283ba1b867e9a466ca2084e60820"},"schema_version":"1.0","source":{"id":"1801.06794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06794","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06794v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06794","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"IBOFCL72EXN7","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IBOFCL72EXN725SM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IBOFCL72","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:a370e39bf2f323c9f17c05f065e25c88ba124d7696ca1a762976888f2be41285","target":"graph","created_at":"2026-05-18T00:25:27Z","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 erasure code is said to be a code with sequential recovery with parameters $r$ and $t$, if for any $s \\leq t$ erased code symbols, there is an $s$-step recovery process in which at each step we recover exactly one erased code symbol by contacting at most $r$ other code symbols. In earlier work by the same authors, presented at ISIT 2017, we had given a construction for binary codes with sequential recovery from $t$ erasures, with locality parameter $r$, which were optimal in terms of code rate for given $r,t$, but where the block length was large, on the order of $r^{c^t}$, for some constan","authors_text":"Balaji Srinivasan Babu, Ganesh R.Kini, P. Vijay Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T09:20:29Z","title":"A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06794","kind":"arxiv","version":1},"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:229f705031129b6707faaf5cf144d71650df4b6fa8dc130b9eaa59954e92c1c3","target":"record","created_at":"2026-05-18T00:25:27Z","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":"fa4a9a3f2e23643d41a66b003b4535bfc85913b5ad79d676ea38e80ae8dfc2b9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-21T09:20:29Z","title_canon_sha256":"10db2239b2628f12bb6cdb432a5bad281999283ba1b867e9a466ca2084e60820"},"schema_version":"1.0","source":{"id":"1801.06794","kind":"arxiv","version":1}},"canonical_sha256":"405c512ffa25dbfd764c2394f253b604ba905c452d0118956a7133150607df5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405c512ffa25dbfd764c2394f253b604ba905c452d0118956a7133150607df5c","first_computed_at":"2026-05-18T00:25:27.708952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:27.708952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9BIrXYzfQRUSONIqQ+jRPKi1hXzjjI+gbakBM2J1Ro8tU8rPxwAdwy+8MH8GT8P1eJrRFzxMliNeOxYcJcIADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:27.709564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:229f705031129b6707faaf5cf144d71650df4b6fa8dc130b9eaa59954e92c1c3","sha256:a370e39bf2f323c9f17c05f065e25c88ba124d7696ca1a762976888f2be41285"],"state_sha256":"1c99dcd242513ccec5db536786906fafdcb660755885cb19f9ac29dea49278f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wYe6nM7GX7R6MaqQyFdutnxYYuZcDRKzvWU4ebGB1GN8/fbYi32PS6ZVst9v1R1pj6HOS6wQGHw49Ol66e/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:16:07.509185Z","bundle_sha256":"5508990f7018f3095aa33736465e50720675c00585d5119c4f669a0979b7562d"}}