{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UW45GL3XQODXRWJNY7DVRARK7D","short_pith_number":"pith:UW45GL3X","schema_version":"1.0","canonical_sha256":"a5b9d32f77838778d92dc7c758822af8f28c9e6176c49dac410a72663632631b","source":{"kind":"arxiv","id":"1507.02796","version":3},"attestation_state":"computed","paper":{"title":"Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance","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-07-10T07:50:09Z","abstract_excerpt":"We consider the problem of designing [n; k] linear codes for distributed storage systems (DSS) that satisfy the (r, t)-Local Repair Property, where any t'(<=t) simultaneously failed nodes can be locally repaired, each with locality r. The parameters n, k, r, t are positive integers such that r<k<n and t <= n-k. We consider the functional repair model and the sequential approach for repairing multiple failed nodes. By functional repair, we mean that the packet stored in each newcomer is not necessarily an exact copy of the lost data but a symbol that keep the (r, t)-local repair property. By th"},"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":"1507.02796","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T07:50:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"195a4bc8be005d897fcd9ec130d977b35e9254cdc3d472355c4fe9cad6ade54f","abstract_canon_sha256":"81d2a8a715506b43e47aa86c5f134f2974591306b9cbabff849d362c37173357"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:08.967115Z","signature_b64":"LyECRW7m51S/oE1AUrEfuRu0c0Alig+4u7xnlDItgOLl+rugrEZbM6pc8pXQKqPnnkcUnxsTU8lzg10NGvHKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5b9d32f77838778d92dc7c758822af8f28c9e6176c49dac410a72663632631b","last_reissued_at":"2026-05-18T01:36:08.966490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:08.966490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance","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-07-10T07:50:09Z","abstract_excerpt":"We consider the problem of designing [n; k] linear codes for distributed storage systems (DSS) that satisfy the (r, t)-Local Repair Property, where any t'(<=t) simultaneously failed nodes can be locally repaired, each with locality r. The parameters n, k, r, t are positive integers such that r<k<n and t <= n-k. We consider the functional repair model and the sequential approach for repairing multiple failed nodes. By functional repair, we mean that the packet stored in each newcomer is not necessarily an exact copy of the lost data but a symbol that keep the (r, t)-local repair property. By th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02796","kind":"arxiv","version":3},"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":"1507.02796","created_at":"2026-05-18T01:36:08.966604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02796v3","created_at":"2026-05-18T01:36:08.966604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02796","created_at":"2026-05-18T01:36:08.966604+00:00"},{"alias_kind":"pith_short_12","alias_value":"UW45GL3XQODX","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UW45GL3XQODXRWJN","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UW45GL3X","created_at":"2026-05-18T12:29:44.643036+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/UW45GL3XQODXRWJNY7DVRARK7D","json":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D.json","graph_json":"https://pith.science/api/pith-number/UW45GL3XQODXRWJNY7DVRARK7D/graph.json","events_json":"https://pith.science/api/pith-number/UW45GL3XQODXRWJNY7DVRARK7D/events.json","paper":"https://pith.science/paper/UW45GL3X"},"agent_actions":{"view_html":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D","download_json":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D.json","view_paper":"https://pith.science/paper/UW45GL3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02796&json=true","fetch_graph":"https://pith.science/api/pith-number/UW45GL3XQODXRWJNY7DVRARK7D/graph.json","fetch_events":"https://pith.science/api/pith-number/UW45GL3XQODXRWJNY7DVRARK7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D/action/storage_attestation","attest_author":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D/action/author_attestation","sign_citation":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D/action/citation_signature","submit_replication":"https://pith.science/pith/UW45GL3XQODXRWJNY7DVRARK7D/action/replication_record"}},"created_at":"2026-05-18T01:36:08.966604+00:00","updated_at":"2026-05-18T01:36:08.966604+00:00"}