{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3OZAYUOMPHYKXFZFBWCSNG2JHU","short_pith_number":"pith:3OZAYUOM","canonical_record":{"source":{"id":"1311.4096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-16T21:05:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9c98af561beecd54563579fa00763f851d1a22a3b5fe7ff6c2fdb98db4c9cd5a","abstract_canon_sha256":"58784925915087a9678e5790d1262c8825991046fda25abf55da9c5ffc5fd62f"},"schema_version":"1.0"},"canonical_sha256":"dbb20c51cc79f0ab97250d85269b493d3a91fe2468f6fa91cfb9f3cfe5f9a353","source":{"kind":"arxiv","id":"1311.4096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4096","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4096v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4096","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"3OZAYUOMPHYK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3OZAYUOMPHYKXFZF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3OZAYUOM","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3OZAYUOMPHYKXFZFBWCSNG2JHU","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-16T21:05:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9c98af561beecd54563579fa00763f851d1a22a3b5fe7ff6c2fdb98db4c9cd5a","abstract_canon_sha256":"58784925915087a9678e5790d1262c8825991046fda25abf55da9c5ffc5fd62f"},"schema_version":"1.0"},"canonical_sha256":"dbb20c51cc79f0ab97250d85269b493d3a91fe2468f6fa91cfb9f3cfe5f9a353","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.362061Z","signature_b64":"Z4GgaaM6JA/NtBhwoX5H/M5q9tNQVSa8WRCCj8yMFeuL3Wex7gnVm9kO/z4FwHkv9RWxI8z6RI3NUF9b6HvKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb20c51cc79f0ab97250d85269b493d3a91fe2468f6fa91cfb9f3cfe5f9a353","last_reissued_at":"2026-05-18T00:38:44.361405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.361405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4096","source_version":2,"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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"808Bsu72b+rj3zggDSGWaduYyFcnzpqUef47Kdp5CPs8CuF/JbDi4j35Q1opt1U+vhoOg639Z2UUlK+qbyp+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:04:53.187549Z"},"content_sha256":"0436197c9186ab4ee5c59e524159c86016097bbb6b32f390ccfbe91a2012a624","schema_version":"1.0","event_id":"sha256:0436197c9186ab4ee5c59e524159c86016097bbb6b32f390ccfbe91a2012a624"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3OZAYUOMPHYKXFZFBWCSNG2JHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Data Storage Systems with Opportunistic Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Vaneet Aggarwal, Vinay A. Vaishampayan, Yih-Farn R. Chen","submitted_at":"2013-11-16T21:05:32Z","abstract_excerpt":"The reliability of erasure-coded distributed storage systems, as measured by the mean time to data loss (MTTDL), depends on the repair bandwidth of the code. Repair-efficient codes provide reliability values several orders of magnitude better than conventional erasure codes. Current state of the art codes fix the number of helper nodes (nodes participating in repair) a priori. In practice, however, it is desirable to allow the number of helper nodes to be adaptively determined by the network traffic conditions. In this work, we propose an opportunistic repair framework to address this issue. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4096","kind":"arxiv","version":2},"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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPRMJRB4ChP2Cx82McOtA/UMk5otuPDqGvwFihu2pOxdZ/+N6wsKtTXuq6k3DOgBxTg/iZxe04q1la6UXEJeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:04:53.187899Z"},"content_sha256":"68c86fb12d26520c5ba5e69414b34ec614789e4a0892d9678af958b8207a3af9","schema_version":"1.0","event_id":"sha256:68c86fb12d26520c5ba5e69414b34ec614789e4a0892d9678af958b8207a3af9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/bundle.json","state_url":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/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-03T02:04:53Z","links":{"resolver":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU","bundle":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/bundle.json","state":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3OZAYUOMPHYKXFZFBWCSNG2JHU","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":"58784925915087a9678e5790d1262c8825991046fda25abf55da9c5ffc5fd62f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-16T21:05:32Z","title_canon_sha256":"9c98af561beecd54563579fa00763f851d1a22a3b5fe7ff6c2fdb98db4c9cd5a"},"schema_version":"1.0","source":{"id":"1311.4096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4096","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4096v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4096","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"3OZAYUOMPHYK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3OZAYUOMPHYKXFZF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3OZAYUOM","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:68c86fb12d26520c5ba5e69414b34ec614789e4a0892d9678af958b8207a3af9","target":"graph","created_at":"2026-05-18T00:38:44Z","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":"The reliability of erasure-coded distributed storage systems, as measured by the mean time to data loss (MTTDL), depends on the repair bandwidth of the code. Repair-efficient codes provide reliability values several orders of magnitude better than conventional erasure codes. Current state of the art codes fix the number of helper nodes (nodes participating in repair) a priori. In practice, however, it is desirable to allow the number of helper nodes to be adaptively determined by the network traffic conditions. In this work, we propose an opportunistic repair framework to address this issue. I","authors_text":"Chao Tian, Vaneet Aggarwal, Vinay A. Vaishampayan, Yih-Farn R. Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-16T21:05:32Z","title":"Distributed Data Storage Systems with Opportunistic Repair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4096","kind":"arxiv","version":2},"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:0436197c9186ab4ee5c59e524159c86016097bbb6b32f390ccfbe91a2012a624","target":"record","created_at":"2026-05-18T00:38:44Z","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":"58784925915087a9678e5790d1262c8825991046fda25abf55da9c5ffc5fd62f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-16T21:05:32Z","title_canon_sha256":"9c98af561beecd54563579fa00763f851d1a22a3b5fe7ff6c2fdb98db4c9cd5a"},"schema_version":"1.0","source":{"id":"1311.4096","kind":"arxiv","version":2}},"canonical_sha256":"dbb20c51cc79f0ab97250d85269b493d3a91fe2468f6fa91cfb9f3cfe5f9a353","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbb20c51cc79f0ab97250d85269b493d3a91fe2468f6fa91cfb9f3cfe5f9a353","first_computed_at":"2026-05-18T00:38:44.361405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.361405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z4GgaaM6JA/NtBhwoX5H/M5q9tNQVSa8WRCCj8yMFeuL3Wex7gnVm9kO/z4FwHkv9RWxI8z6RI3NUF9b6HvKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.362061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0436197c9186ab4ee5c59e524159c86016097bbb6b32f390ccfbe91a2012a624","sha256:68c86fb12d26520c5ba5e69414b34ec614789e4a0892d9678af958b8207a3af9"],"state_sha256":"4cae1ac7c7c6a2b559d35c6c954645ed669267c5aa8f398aa64781ec40eb206d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5U0i9qj9HyNx8u2nfEMtTeRDYMT3rQGUg6vKOe80sDek2+HFKnEOQVq4UhDGRE773UrdkodxLFYUinDjcWmaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:04:53.189855Z","bundle_sha256":"284f8d11fe688f280e0a8d127323de32318cc79f743dc725ce515b3d74a5e894"}}