{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5NW5FBI3VSZKNCOGGEEKHLY6DA","short_pith_number":"pith:5NW5FBI3","schema_version":"1.0","canonical_sha256":"eb6dd2851bacb2a689c63108a3af1e181eb7b0413548efaaf03ef364369400f6","source":{"kind":"arxiv","id":"1610.03541","version":5},"attestation_state":"computed","paper":{"title":"Capacity bounds for distributed storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Luby","submitted_at":"2016-10-11T21:36:20Z","abstract_excerpt":"One of the primary objectives of a distributed storage system is to reliably store large amounts of source data for long durations using a large number $N$ of unreliable storage nodes, each with $c$ bits of storage capacity. Storage nodes fail randomly over time and are replaced with nodes of equal capacity initialized to zeroes, and thus bits are erased at some rate $E$. To maintain recoverability of the source data, a repairer continually reads data over a network from nodes at a rate $R$, and generates and writes data to nodes based on the read data.\n  The distributed storage source data ca"},"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":"1610.03541","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-11T21:36:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f00685d4bc957ea97a0eeb174b9dac35a2078812b2df5203ae120e0d5cd30a9","abstract_canon_sha256":"8d4cd9538e9dca376e41bbc8ac4ad6b976cccdb52710cec7da1a4a7f9510815e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:41.652607Z","signature_b64":"FxkrYtgHq4kKL3o1mkhzKnX2Zg/mRVs1EZ04PlCV7reEgxJobk4SuKsoOJXzYPzFr3imS3e9PH3KG7NbJbZDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb6dd2851bacb2a689c63108a3af1e181eb7b0413548efaaf03ef364369400f6","last_reissued_at":"2026-05-18T00:18:41.652156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:41.652156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity bounds for distributed storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Luby","submitted_at":"2016-10-11T21:36:20Z","abstract_excerpt":"One of the primary objectives of a distributed storage system is to reliably store large amounts of source data for long durations using a large number $N$ of unreliable storage nodes, each with $c$ bits of storage capacity. Storage nodes fail randomly over time and are replaced with nodes of equal capacity initialized to zeroes, and thus bits are erased at some rate $E$. To maintain recoverability of the source data, a repairer continually reads data over a network from nodes at a rate $R$, and generates and writes data to nodes based on the read data.\n  The distributed storage source data ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03541","kind":"arxiv","version":5},"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":"1610.03541","created_at":"2026-05-18T00:18:41.652221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03541v5","created_at":"2026-05-18T00:18:41.652221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03541","created_at":"2026-05-18T00:18:41.652221+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NW5FBI3VSZK","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NW5FBI3VSZKNCOG","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NW5FBI3","created_at":"2026-05-18T12:30:01.593930+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/5NW5FBI3VSZKNCOGGEEKHLY6DA","json":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA.json","graph_json":"https://pith.science/api/pith-number/5NW5FBI3VSZKNCOGGEEKHLY6DA/graph.json","events_json":"https://pith.science/api/pith-number/5NW5FBI3VSZKNCOGGEEKHLY6DA/events.json","paper":"https://pith.science/paper/5NW5FBI3"},"agent_actions":{"view_html":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA","download_json":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA.json","view_paper":"https://pith.science/paper/5NW5FBI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03541&json=true","fetch_graph":"https://pith.science/api/pith-number/5NW5FBI3VSZKNCOGGEEKHLY6DA/graph.json","fetch_events":"https://pith.science/api/pith-number/5NW5FBI3VSZKNCOGGEEKHLY6DA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/action/storage_attestation","attest_author":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/action/author_attestation","sign_citation":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/action/citation_signature","submit_replication":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/action/replication_record"}},"created_at":"2026-05-18T00:18:41.652221+00:00","updated_at":"2026-05-18T00:18:41.652221+00:00"}