{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VCGTBRGKGROHN4XTUUH7FG3BVR","short_pith_number":"pith:VCGTBRGK","schema_version":"1.0","canonical_sha256":"a88d30c4ca345c76f2f3a50ff29b61ac42c77af145388f1adc369e3c97581057","source":{"kind":"arxiv","id":"1206.2187","version":1},"attestation_state":"computed","paper":{"title":"An Empirical Study of the Repair Performance of Novel Coding Schemes for Networked Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Fr\\'ed\\'erique Oggier, Lluis Pamies-Juarez","submitted_at":"2012-06-11T12:55:53Z","abstract_excerpt":"Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through repair mechanisms, which may entail large network resource overheads. In recent years, several novel codes tailor-made for distributed storage have been proposed to optimize storage overhead and repair, such as Regenerating Codes that minimize the per repair traffic, or Self-Repairing Codes which minimize the number of nodes contacted per repair. Existing studie"},"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":"1206.2187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-11T12:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"4d708d9c526aabec987afe95a86c874bb8de4745786fbceecc3422ae90c47ade","abstract_canon_sha256":"f9bb2d7381a4900ec5bf3df06d2899030e90043b6f9ba7a8ec0ea835a2efff51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:53.253912Z","signature_b64":"7CIBJspRBUIZv+N2FldobgaIbKQUddeD2WavWMV4nsrGl4TEvi5cKMa4cSowUvjwmnXApavLGw96Ri5LJY5KCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a88d30c4ca345c76f2f3a50ff29b61ac42c77af145388f1adc369e3c97581057","last_reissued_at":"2026-05-18T03:53:53.253433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:53.253433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Empirical Study of the Repair Performance of Novel Coding Schemes for Networked Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Fr\\'ed\\'erique Oggier, Lluis Pamies-Juarez","submitted_at":"2012-06-11T12:55:53Z","abstract_excerpt":"Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through repair mechanisms, which may entail large network resource overheads. In recent years, several novel codes tailor-made for distributed storage have been proposed to optimize storage overhead and repair, such as Regenerating Codes that minimize the per repair traffic, or Self-Repairing Codes which minimize the number of nodes contacted per repair. Existing studie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2187","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.2187","created_at":"2026-05-18T03:53:53.253508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.2187v1","created_at":"2026-05-18T03:53:53.253508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2187","created_at":"2026-05-18T03:53:53.253508+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCGTBRGKGROH","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCGTBRGKGROHN4XT","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCGTBRGK","created_at":"2026-05-18T12:27:25.539911+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/VCGTBRGKGROHN4XTUUH7FG3BVR","json":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR.json","graph_json":"https://pith.science/api/pith-number/VCGTBRGKGROHN4XTUUH7FG3BVR/graph.json","events_json":"https://pith.science/api/pith-number/VCGTBRGKGROHN4XTUUH7FG3BVR/events.json","paper":"https://pith.science/paper/VCGTBRGK"},"agent_actions":{"view_html":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR","download_json":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR.json","view_paper":"https://pith.science/paper/VCGTBRGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.2187&json=true","fetch_graph":"https://pith.science/api/pith-number/VCGTBRGKGROHN4XTUUH7FG3BVR/graph.json","fetch_events":"https://pith.science/api/pith-number/VCGTBRGKGROHN4XTUUH7FG3BVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR/action/storage_attestation","attest_author":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR/action/author_attestation","sign_citation":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR/action/citation_signature","submit_replication":"https://pith.science/pith/VCGTBRGKGROHN4XTUUH7FG3BVR/action/replication_record"}},"created_at":"2026-05-18T03:53:53.253508+00:00","updated_at":"2026-05-18T03:53:53.253508+00:00"}