{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NTXVIK7BFXBTZ52SAV2CNRUGHK","short_pith_number":"pith:NTXVIK7B","schema_version":"1.0","canonical_sha256":"6cef542be12dc33cf752057426c6863a81d558e5455b707f27bb4a5625a84ab2","source":{"kind":"arxiv","id":"1402.2011","version":1},"attestation_state":"computed","paper":{"title":"Locality and Availability in Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Ankit Singh Rawat, Dimitris S. Papailiopoulos, Sriram Vishwanath","submitted_at":"2014-02-10T00:51:10Z","abstract_excerpt":"This paper studies the problem of code symbol availability: a code symbol is said to have $(r, t)$-availability if it can be reconstructed from $t$ disjoint groups of other symbols, each of size at most $r$. For example, $3$-replication supports $(1, 2)$-availability as each symbol can be read from its $t= 2$ other (disjoint) replicas, i.e., $r=1$. However, the rate of replication must vanish like $\\frac{1}{t+1}$ as the availability increases.\n  This paper shows that it is possible to construct codes that can support a scaling number of parallel reads while keeping the rate to be an arbitraril"},"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":"1402.2011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-10T00:51:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a605b23ea9f58a16440789a3401b0f3cc9c603f3af82dc3aeb926b5106abe147","abstract_canon_sha256":"ff2c7fe32b2de32c18a937f0db3193a4235b51d555094c98d03e1132cbeba1c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:32.699288Z","signature_b64":"+nbcu8d+I0H/ozBe27HUAAMxRSu1kA32aXETF4IIwXN9VytZMWYvHIq9bJEKQ11+wT2vRx+WUhj1/p9sm5xbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cef542be12dc33cf752057426c6863a81d558e5455b707f27bb4a5625a84ab2","last_reissued_at":"2026-05-18T02:59:32.698512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:32.698512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality and Availability in Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Ankit Singh Rawat, Dimitris S. Papailiopoulos, Sriram Vishwanath","submitted_at":"2014-02-10T00:51:10Z","abstract_excerpt":"This paper studies the problem of code symbol availability: a code symbol is said to have $(r, t)$-availability if it can be reconstructed from $t$ disjoint groups of other symbols, each of size at most $r$. For example, $3$-replication supports $(1, 2)$-availability as each symbol can be read from its $t= 2$ other (disjoint) replicas, i.e., $r=1$. However, the rate of replication must vanish like $\\frac{1}{t+1}$ as the availability increases.\n  This paper shows that it is possible to construct codes that can support a scaling number of parallel reads while keeping the rate to be an arbitraril"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2011","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":"1402.2011","created_at":"2026-05-18T02:59:32.698653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2011v1","created_at":"2026-05-18T02:59:32.698653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2011","created_at":"2026-05-18T02:59:32.698653+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTXVIK7BFXBT","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTXVIK7BFXBTZ52S","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTXVIK7B","created_at":"2026-05-18T12:28:41.024544+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/NTXVIK7BFXBTZ52SAV2CNRUGHK","json":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK.json","graph_json":"https://pith.science/api/pith-number/NTXVIK7BFXBTZ52SAV2CNRUGHK/graph.json","events_json":"https://pith.science/api/pith-number/NTXVIK7BFXBTZ52SAV2CNRUGHK/events.json","paper":"https://pith.science/paper/NTXVIK7B"},"agent_actions":{"view_html":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK","download_json":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK.json","view_paper":"https://pith.science/paper/NTXVIK7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2011&json=true","fetch_graph":"https://pith.science/api/pith-number/NTXVIK7BFXBTZ52SAV2CNRUGHK/graph.json","fetch_events":"https://pith.science/api/pith-number/NTXVIK7BFXBTZ52SAV2CNRUGHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/action/storage_attestation","attest_author":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/action/author_attestation","sign_citation":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/action/citation_signature","submit_replication":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/action/replication_record"}},"created_at":"2026-05-18T02:59:32.698653+00:00","updated_at":"2026-05-18T02:59:32.698653+00:00"}