{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5NW5FBI3VSZKNCOGGEEKHLY6DA","short_pith_number":"pith:5NW5FBI3","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"},"canonical_sha256":"eb6dd2851bacb2a689c63108a3af1e181eb7b0413548efaaf03ef364369400f6","source":{"kind":"arxiv","id":"1610.03541","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03541","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03541v5","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03541","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"5NW5FBI3VSZK","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5NW5FBI3VSZKNCOG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5NW5FBI3","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5NW5FBI3VSZKNCOGGEEKHLY6DA","target":"record","payload":{"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"},"canonical_sha256":"eb6dd2851bacb2a689c63108a3af1e181eb7b0413548efaaf03ef364369400f6","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"},"source_kind":"arxiv","source_id":"1610.03541","source_version":5,"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-18T00:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pg97zPOxgLe+Wp2q7r/AT6/ssZuVyEJ6o8IGglSpmv229utv59uhqhE37M5ZLpxTcwe6SWM8rm2AgAP8qFv8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:22:36.812696Z"},"content_sha256":"21bc02525d2cd9dfe68ae0123e67bf619dbfc6f935c2db961d409a4b92a1d8d1","schema_version":"1.0","event_id":"sha256:21bc02525d2cd9dfe68ae0123e67bf619dbfc6f935c2db961d409a4b92a1d8d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5NW5FBI3VSZKNCOGGEEKHLY6DA","target":"graph","payload":{"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"},"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-18T00:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzatYxMiVeaJMF7itvGqJE/baA4HYtdthc+wHIXTcqaexrqAUeScmpgk9oabwl9iYqKQ+ed6NdkSZF2aVkmzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:22:36.813049Z"},"content_sha256":"e59caa0161407874a5d67baf86bc9684f0149811f667a38318da9b5f8b541e24","schema_version":"1.0","event_id":"sha256:e59caa0161407874a5d67baf86bc9684f0149811f667a38318da9b5f8b541e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/bundle.json","state_url":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/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-28T05:22:36Z","links":{"resolver":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA","bundle":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/bundle.json","state":"https://pith.science/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NW5FBI3VSZKNCOGGEEKHLY6DA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5NW5FBI3VSZKNCOGGEEKHLY6DA","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":"8d4cd9538e9dca376e41bbc8ac4ad6b976cccdb52710cec7da1a4a7f9510815e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-11T21:36:20Z","title_canon_sha256":"5f00685d4bc957ea97a0eeb174b9dac35a2078812b2df5203ae120e0d5cd30a9"},"schema_version":"1.0","source":{"id":"1610.03541","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03541","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03541v5","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03541","created_at":"2026-05-18T00:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"5NW5FBI3VSZK","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5NW5FBI3VSZKNCOG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5NW5FBI3","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:e59caa0161407874a5d67baf86bc9684f0149811f667a38318da9b5f8b541e24","target":"graph","created_at":"2026-05-18T00:18:41Z","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":"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","authors_text":"Michael Luby","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-11T21:36:20Z","title":"Capacity bounds for distributed storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03541","kind":"arxiv","version":5},"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:21bc02525d2cd9dfe68ae0123e67bf619dbfc6f935c2db961d409a4b92a1d8d1","target":"record","created_at":"2026-05-18T00:18:41Z","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":"8d4cd9538e9dca376e41bbc8ac4ad6b976cccdb52710cec7da1a4a7f9510815e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-11T21:36:20Z","title_canon_sha256":"5f00685d4bc957ea97a0eeb174b9dac35a2078812b2df5203ae120e0d5cd30a9"},"schema_version":"1.0","source":{"id":"1610.03541","kind":"arxiv","version":5}},"canonical_sha256":"eb6dd2851bacb2a689c63108a3af1e181eb7b0413548efaaf03ef364369400f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb6dd2851bacb2a689c63108a3af1e181eb7b0413548efaaf03ef364369400f6","first_computed_at":"2026-05-18T00:18:41.652156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:41.652156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FxkrYtgHq4kKL3o1mkhzKnX2Zg/mRVs1EZ04PlCV7reEgxJobk4SuKsoOJXzYPzFr3imS3e9PH3KG7NbJbZDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:41.652607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03541","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21bc02525d2cd9dfe68ae0123e67bf619dbfc6f935c2db961d409a4b92a1d8d1","sha256:e59caa0161407874a5d67baf86bc9684f0149811f667a38318da9b5f8b541e24"],"state_sha256":"a640760defd6c86fd51fd901372fbbd7d2f2ccd825febc37248344d0e1a333cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roHfhguAUpWxvohgf9aEQl0Z3unFX7c/2tWLBn5cSqla/VUG11AqSsLIfnCzUPkKCvUVA4Ej01NXdx8NdfclCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:22:36.815099Z","bundle_sha256":"36923c995d94db30410968c14b16570bc57dbca0bb33f97d6ac740792072f8ae"}}