{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NTXVIK7BFXBTZ52SAV2CNRUGHK","short_pith_number":"pith:NTXVIK7B","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"},"canonical_sha256":"6cef542be12dc33cf752057426c6863a81d558e5455b707f27bb4a5625a84ab2","source":{"kind":"arxiv","id":"1402.2011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2011","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2011v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2011","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"NTXVIK7BFXBT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NTXVIK7BFXBTZ52S","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NTXVIK7B","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NTXVIK7BFXBTZ52SAV2CNRUGHK","target":"record","payload":{"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"},"canonical_sha256":"6cef542be12dc33cf752057426c6863a81d558e5455b707f27bb4a5625a84ab2","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"},"source_kind":"arxiv","source_id":"1402.2011","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVnfXSBrDk+yXe50U6f7lh1uG/iwuFfptvZlA1lhudn9bp/FzQEcJ0srl8hPndiegOulTlPidDPti8muGk75Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:43.560794Z"},"content_sha256":"1f36af8a65e5a2efaacee10cebb6fa68d8ded19c9c81431331e74c09c9bdcc2c","schema_version":"1.0","event_id":"sha256:1f36af8a65e5a2efaacee10cebb6fa68d8ded19c9c81431331e74c09c9bdcc2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NTXVIK7BFXBTZ52SAV2CNRUGHK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nx9c8fnJ5z3U2dStnKn4sSskpmXCqZfBCZbdAS1UIgaHl1vA0SU+9ijIf0lphR/Oq/OH3jmwW0ueKGyxdoerBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:43.561430Z"},"content_sha256":"d66ecc5558178186afec6853971212a93b5f2d9354b2918f3272f7630f7f5c46","schema_version":"1.0","event_id":"sha256:d66ecc5558178186afec6853971212a93b5f2d9354b2918f3272f7630f7f5c46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/bundle.json","state_url":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T12:08:43Z","links":{"resolver":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK","bundle":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/bundle.json","state":"https://pith.science/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTXVIK7BFXBTZ52SAV2CNRUGHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NTXVIK7BFXBTZ52SAV2CNRUGHK","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":"ff2c7fe32b2de32c18a937f0db3193a4235b51d555094c98d03e1132cbeba1c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-10T00:51:10Z","title_canon_sha256":"a605b23ea9f58a16440789a3401b0f3cc9c603f3af82dc3aeb926b5106abe147"},"schema_version":"1.0","source":{"id":"1402.2011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2011","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2011v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2011","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"NTXVIK7BFXBT","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NTXVIK7BFXBTZ52S","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NTXVIK7B","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d66ecc5558178186afec6853971212a93b5f2d9354b2918f3272f7630f7f5c46","target":"graph","created_at":"2026-05-18T02:59:32Z","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":"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","authors_text":"Alexandros G. Dimakis, Ankit Singh Rawat, Dimitris S. Papailiopoulos, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-10T00:51:10Z","title":"Locality and Availability in Distributed Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2011","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:1f36af8a65e5a2efaacee10cebb6fa68d8ded19c9c81431331e74c09c9bdcc2c","target":"record","created_at":"2026-05-18T02:59:32Z","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":"ff2c7fe32b2de32c18a937f0db3193a4235b51d555094c98d03e1132cbeba1c1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-10T00:51:10Z","title_canon_sha256":"a605b23ea9f58a16440789a3401b0f3cc9c603f3af82dc3aeb926b5106abe147"},"schema_version":"1.0","source":{"id":"1402.2011","kind":"arxiv","version":1}},"canonical_sha256":"6cef542be12dc33cf752057426c6863a81d558e5455b707f27bb4a5625a84ab2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cef542be12dc33cf752057426c6863a81d558e5455b707f27bb4a5625a84ab2","first_computed_at":"2026-05-18T02:59:32.698512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:32.698512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+nbcu8d+I0H/ozBe27HUAAMxRSu1kA32aXETF4IIwXN9VytZMWYvHIq9bJEKQ11+wT2vRx+WUhj1/p9sm5xbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:32.699288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f36af8a65e5a2efaacee10cebb6fa68d8ded19c9c81431331e74c09c9bdcc2c","sha256:d66ecc5558178186afec6853971212a93b5f2d9354b2918f3272f7630f7f5c46"],"state_sha256":"dd3ca529283851d52fafb0f9cd3fd92ae3b28892eb45765f1cbf849d208c7014"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjWA5KKgoY5L3KUTw4pmyOJVWilNp3VP/Dy4aajSWf8XNxAW1uXPVykCg26OXO/cPETM+JKLmwX3uPbMD8R9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:08:43.564580Z","bundle_sha256":"6814a90a48807a58906c2c372030b52985d207eda2d7c575b89e1e73e0228a61"}}