{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3OZAYUOMPHYKXFZFBWCSNG2JHU","short_pith_number":"pith:3OZAYUOM","schema_version":"1.0","canonical_sha256":"dbb20c51cc79f0ab97250d85269b493d3a91fe2468f6fa91cfb9f3cfe5f9a353","source":{"kind":"arxiv","id":"1311.4096","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.4096","created_at":"2026-05-18T00:38:44.361508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4096v2","created_at":"2026-05-18T00:38:44.361508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4096","created_at":"2026-05-18T00:38:44.361508+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OZAYUOMPHYK","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OZAYUOMPHYKXFZF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OZAYUOM","created_at":"2026-05-18T12:27:32.513160+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/3OZAYUOMPHYKXFZFBWCSNG2JHU","json":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU.json","graph_json":"https://pith.science/api/pith-number/3OZAYUOMPHYKXFZFBWCSNG2JHU/graph.json","events_json":"https://pith.science/api/pith-number/3OZAYUOMPHYKXFZFBWCSNG2JHU/events.json","paper":"https://pith.science/paper/3OZAYUOM"},"agent_actions":{"view_html":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU","download_json":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU.json","view_paper":"https://pith.science/paper/3OZAYUOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4096&json=true","fetch_graph":"https://pith.science/api/pith-number/3OZAYUOMPHYKXFZFBWCSNG2JHU/graph.json","fetch_events":"https://pith.science/api/pith-number/3OZAYUOMPHYKXFZFBWCSNG2JHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/action/storage_attestation","attest_author":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/action/author_attestation","sign_citation":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/action/citation_signature","submit_replication":"https://pith.science/pith/3OZAYUOMPHYKXFZFBWCSNG2JHU/action/replication_record"}},"created_at":"2026-05-18T00:38:44.361508+00:00","updated_at":"2026-05-18T00:38:44.361508+00:00"}