{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IBOFCL72EXN725SMEOKPEU5WAS","short_pith_number":"pith:IBOFCL72","schema_version":"1.0","canonical_sha256":"405c512ffa25dbfd764c2394f253b604ba905c452d0118956a7133150607df5c","source":{"kind":"arxiv","id":"1801.06794","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.06794","created_at":"2026-05-18T00:25:27.709045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06794v1","created_at":"2026-05-18T00:25:27.709045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06794","created_at":"2026-05-18T00:25:27.709045+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBOFCL72EXN7","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBOFCL72EXN725SM","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBOFCL72","created_at":"2026-05-18T12:32:28.185984+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/IBOFCL72EXN725SMEOKPEU5WAS","json":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS.json","graph_json":"https://pith.science/api/pith-number/IBOFCL72EXN725SMEOKPEU5WAS/graph.json","events_json":"https://pith.science/api/pith-number/IBOFCL72EXN725SMEOKPEU5WAS/events.json","paper":"https://pith.science/paper/IBOFCL72"},"agent_actions":{"view_html":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS","download_json":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS.json","view_paper":"https://pith.science/paper/IBOFCL72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06794&json=true","fetch_graph":"https://pith.science/api/pith-number/IBOFCL72EXN725SMEOKPEU5WAS/graph.json","fetch_events":"https://pith.science/api/pith-number/IBOFCL72EXN725SMEOKPEU5WAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/action/storage_attestation","attest_author":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/action/author_attestation","sign_citation":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/action/citation_signature","submit_replication":"https://pith.science/pith/IBOFCL72EXN725SMEOKPEU5WAS/action/replication_record"}},"created_at":"2026-05-18T00:25:27.709045+00:00","updated_at":"2026-05-18T00:25:27.709045+00:00"}