{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:E7A54WW7SMROQ7FHMGIQCAOSD3","short_pith_number":"pith:E7A54WW7","canonical_record":{"source":{"id":"1011.4135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-18T04:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"ae206bbfd2ccd18b875a2fa388d523c44e40d955285f51468d3c7bd8dc6767f7","abstract_canon_sha256":"a94fe78174504bce1db72ba350988ddb9d3e525eb5497fb36e266371d43fa1d0"},"schema_version":"1.0"},"canonical_sha256":"27c1de5adf9322e87ca761910101d21ee9d8a7b5a37b50273a5309ed19d9aff4","source":{"kind":"arxiv","id":"1011.4135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4135","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4135v1","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4135","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"E7A54WW7SMRO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"E7A54WW7SMROQ7FH","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"E7A54WW7","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:E7A54WW7SMROQ7FHMGIQCAOSD3","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-18T04:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"ae206bbfd2ccd18b875a2fa388d523c44e40d955285f51468d3c7bd8dc6767f7","abstract_canon_sha256":"a94fe78174504bce1db72ba350988ddb9d3e525eb5497fb36e266371d43fa1d0"},"schema_version":"1.0"},"canonical_sha256":"27c1de5adf9322e87ca761910101d21ee9d8a7b5a37b50273a5309ed19d9aff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:46.567103Z","signature_b64":"nTSbc/Z+zmXsvPvc9I4XegdZYNU3ANSnsGg2sPoEHv9n/51b6jOybhGpsbhKAfV0eyCFCaE236Ox/HDK3KArCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27c1de5adf9322e87ca761910101d21ee9d8a7b5a37b50273a5309ed19d9aff4","last_reissued_at":"2026-05-18T04:35:46.566461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:46.566461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4135","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-18T04:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBXPpD53ymJRES1wb/wXeCBSkWv5q8Mbb6N86h76cYKad5q7Uqu8VidCLRMIOD6Aff1Y6bDe6CLm8lS8W2OWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:27.110389Z"},"content_sha256":"5cf513eda125958046837b3d4e4a9300b8a43e188edba8dba67dc2758f1ea24e","schema_version":"1.0","event_id":"sha256:5cf513eda125958046837b3d4e4a9300b8a43e188edba8dba67dc2758f1ea24e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:E7A54WW7SMROQ7FHMGIQCAOSD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Progressive Decoding for Data Availability and Reliability in Distributed Networked Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Rong Zheng, Soji Omiwade, Yunghsiang Han","submitted_at":"2010-11-18T04:47:28Z","abstract_excerpt":"To harness the ever growing capacity and decreasing cost of storage, providing an abstraction of dependable storage in the presence of crash-stop and Byzantine failures is compulsory. We propose a decentralized Reed Solomon coding mechanism with minimum communication overhead. Using a progressive data retrieval scheme, a data collector contacts only the necessary number of storage nodes needed to guarantee data integrity. The scheme gracefully adapts the cost of successful data retrieval to the number of storage node failures. Moreover, by leveraging the Welch-Berlekamp algorithm, it avoids un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4135","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-18T04:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Z2dcHfr1j2TUlfGrgDxV32XrjFuzMxrDE411Kk4694PoUuNK8Bvq1Ov2t993L8xJDDeyT1/djlGre3qZwWWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:27.111092Z"},"content_sha256":"51d3de76312d87fc7967577bd68b84fe9860f05eba3ca7b5fad5b1d78550c143","schema_version":"1.0","event_id":"sha256:51d3de76312d87fc7967577bd68b84fe9860f05eba3ca7b5fad5b1d78550c143"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7A54WW7SMROQ7FHMGIQCAOSD3/bundle.json","state_url":"https://pith.science/pith/E7A54WW7SMROQ7FHMGIQCAOSD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7A54WW7SMROQ7FHMGIQCAOSD3/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-06-05T19:58:27Z","links":{"resolver":"https://pith.science/pith/E7A54WW7SMROQ7FHMGIQCAOSD3","bundle":"https://pith.science/pith/E7A54WW7SMROQ7FHMGIQCAOSD3/bundle.json","state":"https://pith.science/pith/E7A54WW7SMROQ7FHMGIQCAOSD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7A54WW7SMROQ7FHMGIQCAOSD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:E7A54WW7SMROQ7FHMGIQCAOSD3","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":"a94fe78174504bce1db72ba350988ddb9d3e525eb5497fb36e266371d43fa1d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-18T04:47:28Z","title_canon_sha256":"ae206bbfd2ccd18b875a2fa388d523c44e40d955285f51468d3c7bd8dc6767f7"},"schema_version":"1.0","source":{"id":"1011.4135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4135","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4135v1","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4135","created_at":"2026-05-18T04:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"E7A54WW7SMRO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"E7A54WW7SMROQ7FH","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"E7A54WW7","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:51d3de76312d87fc7967577bd68b84fe9860f05eba3ca7b5fad5b1d78550c143","target":"graph","created_at":"2026-05-18T04:35:46Z","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":"To harness the ever growing capacity and decreasing cost of storage, providing an abstraction of dependable storage in the presence of crash-stop and Byzantine failures is compulsory. We propose a decentralized Reed Solomon coding mechanism with minimum communication overhead. Using a progressive data retrieval scheme, a data collector contacts only the necessary number of storage nodes needed to guarantee data integrity. The scheme gracefully adapts the cost of successful data retrieval to the number of storage node failures. Moreover, by leveraging the Welch-Berlekamp algorithm, it avoids un","authors_text":"Rong Zheng, Soji Omiwade, Yunghsiang Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-18T04:47:28Z","title":"Progressive Decoding for Data Availability and Reliability in Distributed Networked Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4135","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:5cf513eda125958046837b3d4e4a9300b8a43e188edba8dba67dc2758f1ea24e","target":"record","created_at":"2026-05-18T04:35:46Z","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":"a94fe78174504bce1db72ba350988ddb9d3e525eb5497fb36e266371d43fa1d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-18T04:47:28Z","title_canon_sha256":"ae206bbfd2ccd18b875a2fa388d523c44e40d955285f51468d3c7bd8dc6767f7"},"schema_version":"1.0","source":{"id":"1011.4135","kind":"arxiv","version":1}},"canonical_sha256":"27c1de5adf9322e87ca761910101d21ee9d8a7b5a37b50273a5309ed19d9aff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27c1de5adf9322e87ca761910101d21ee9d8a7b5a37b50273a5309ed19d9aff4","first_computed_at":"2026-05-18T04:35:46.566461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:46.566461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nTSbc/Z+zmXsvPvc9I4XegdZYNU3ANSnsGg2sPoEHv9n/51b6jOybhGpsbhKAfV0eyCFCaE236Ox/HDK3KArCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:46.567103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cf513eda125958046837b3d4e4a9300b8a43e188edba8dba67dc2758f1ea24e","sha256:51d3de76312d87fc7967577bd68b84fe9860f05eba3ca7b5fad5b1d78550c143"],"state_sha256":"eb5221bce9d58f167ebb317d26a665d73b962ba1fee46f916d11cb64d6eff4ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVtFvuOy2R92iWt8IvUIv1arBlOA9AK5dc09/zPlHwypHYHuMYtjIqEa9YgTc3wmuVNuqLaTh7Tq4tgKL1WpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:58:27.114845Z","bundle_sha256":"7e4dc0b75fcd873051eba1818ee4fb9e11a71c1bbe339e5fd885156f88cef9fb"}}