{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CNF2IWV4KMGMYGFFGN52AB2ZSD","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":"7de5234c888515c55c3d3700cc294eac8c5cb928a1b594f7818df51ff4af1a19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-19T00:51:23Z","title_canon_sha256":"1636d964d00b5f666e39b08aea70d07c934126329844941582940153f4bfb046"},"schema_version":"1.0","source":{"id":"1511.06034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06034","created_at":"2026-05-18T01:26:26Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06034v1","created_at":"2026-05-18T01:26:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06034","created_at":"2026-05-18T01:26:26Z"},{"alias_kind":"pith_short_12","alias_value":"CNF2IWV4KMGM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CNF2IWV4KMGMYGFF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CNF2IWV4","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:3470ef50068e0c13a090ab6e31609651407072d0061a475f3cd113261082ed5c","target":"graph","created_at":"2026-05-18T01:26:26Z","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":"Locally repairable codes (LRC) for distribute storage allow two approaches to locally repair multiple failed nodes: 1) parallel approach, by which each newcomer access a set of $r$ live nodes $(r$ is the repair locality$)$ to download data and recover the lost packet; and 2) sequential approach, by which the newcomers are properly ordered and each newcomer access a set of $r$ other nodes, which can be either a live node or a newcomer ordered before it. An $[n,k]$ linear code with locality $r$ and allows local repair for up to $t$ failed nodes by sequential approach is called an $(n,k,r,t)$-exa","authors_text":"Chau Yuen, Wentu Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-19T00:51:23Z","title":"Binary Locally Repairable Codes ---Sequential Repair for Multiple Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06034","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:e55d817aecd19d6dfd906d0c47eeedaac512e401e062e148987be372a02741f1","target":"record","created_at":"2026-05-18T01:26:26Z","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":"7de5234c888515c55c3d3700cc294eac8c5cb928a1b594f7818df51ff4af1a19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-19T00:51:23Z","title_canon_sha256":"1636d964d00b5f666e39b08aea70d07c934126329844941582940153f4bfb046"},"schema_version":"1.0","source":{"id":"1511.06034","kind":"arxiv","version":1}},"canonical_sha256":"134ba45abc530ccc18a5337ba0075990c26978d206cbd99ee0a94d241bed743b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"134ba45abc530ccc18a5337ba0075990c26978d206cbd99ee0a94d241bed743b","first_computed_at":"2026-05-18T01:26:26.379158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:26.379158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CY6UP/ON98JsLpJg7ePBIgcmVGY6k0Tdwft3BbTufmupQGaCyhrP76rFHyqDVqEVGhkjB0NH5X6MScVnGDaQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:26.379679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e55d817aecd19d6dfd906d0c47eeedaac512e401e062e148987be372a02741f1","sha256:3470ef50068e0c13a090ab6e31609651407072d0061a475f3cd113261082ed5c"],"state_sha256":"f53cfc636b6904b5020df7e45f6bb9a97a188e0be8e42e3f074c43c953ebc4c0"}