{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CNF2IWV4KMGMYGFFGN52AB2ZSD","short_pith_number":"pith:CNF2IWV4","schema_version":"1.0","canonical_sha256":"134ba45abc530ccc18a5337ba0075990c26978d206cbd99ee0a94d241bed743b","source":{"kind":"arxiv","id":"1511.06034","version":1},"attestation_state":"computed","paper":{"title":"Binary Locally Repairable Codes ---Sequential Repair for Multiple Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Wentu Song","submitted_at":"2015-11-19T00:51:23Z","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"},"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":"1511.06034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-19T00:51:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1636d964d00b5f666e39b08aea70d07c934126329844941582940153f4bfb046","abstract_canon_sha256":"7de5234c888515c55c3d3700cc294eac8c5cb928a1b594f7818df51ff4af1a19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:26.379679Z","signature_b64":"CY6UP/ON98JsLpJg7ePBIgcmVGY6k0Tdwft3BbTufmupQGaCyhrP76rFHyqDVqEVGhkjB0NH5X6MScVnGDaQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"134ba45abc530ccc18a5337ba0075990c26978d206cbd99ee0a94d241bed743b","last_reissued_at":"2026-05-18T01:26:26.379158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:26.379158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Locally Repairable Codes ---Sequential Repair for Multiple Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Wentu Song","submitted_at":"2015-11-19T00:51:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06034","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":"1511.06034","created_at":"2026-05-18T01:26:26.379220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06034v1","created_at":"2026-05-18T01:26:26.379220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06034","created_at":"2026-05-18T01:26:26.379220+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNF2IWV4KMGM","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNF2IWV4KMGMYGFF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNF2IWV4","created_at":"2026-05-18T12:29:17.054201+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/CNF2IWV4KMGMYGFFGN52AB2ZSD","json":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD.json","graph_json":"https://pith.science/api/pith-number/CNF2IWV4KMGMYGFFGN52AB2ZSD/graph.json","events_json":"https://pith.science/api/pith-number/CNF2IWV4KMGMYGFFGN52AB2ZSD/events.json","paper":"https://pith.science/paper/CNF2IWV4"},"agent_actions":{"view_html":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD","download_json":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD.json","view_paper":"https://pith.science/paper/CNF2IWV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06034&json=true","fetch_graph":"https://pith.science/api/pith-number/CNF2IWV4KMGMYGFFGN52AB2ZSD/graph.json","fetch_events":"https://pith.science/api/pith-number/CNF2IWV4KMGMYGFFGN52AB2ZSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD/action/storage_attestation","attest_author":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD/action/author_attestation","sign_citation":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD/action/citation_signature","submit_replication":"https://pith.science/pith/CNF2IWV4KMGMYGFFGN52AB2ZSD/action/replication_record"}},"created_at":"2026-05-18T01:26:26.379220+00:00","updated_at":"2026-05-18T01:26:26.379220+00:00"}