{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2QAUXIS6KXKF5LZZNLPJTNALKS","short_pith_number":"pith:2QAUXIS6","schema_version":"1.0","canonical_sha256":"d4014ba25e55d45eaf396ade99b40b54873a16b863ad70663149c5b4b461ca3f","source":{"kind":"arxiv","id":"1107.3129","version":1},"attestation_state":"computed","paper":{"title":"Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Frederique Oggier","submitted_at":"2011-07-15T18:46:33Z","abstract_excerpt":"Distributed data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in terms of storage space and maintenance bandwidth requirements. Erasure codes, originally designed for communication over lossy channels, provide a storage efficient alternative to replication based redundancy, however entailing high communication overhead for maintenance, when some of the encoded fragments need to be replenished in news ones after failure o"},"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":"1107.3129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-15T18:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"e0e69392cfe1d08b3addca81b857fbee29f649f18e52661518009e3ec38f51ff","abstract_canon_sha256":"0ac1d10733e118d66505ee9ff9a77cebf27b22a469c6cc83972d0b7dae6256f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:47.214835Z","signature_b64":"YmIkfDHC1AH4nbvGUsKHcQgjXH6DlvkXNeY5Bh5/kdl4yNii0sS/m4eqsXP50ZfED9qS68NBatd2X/eqfe8jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4014ba25e55d45eaf396ade99b40b54873a16b863ad70663149c5b4b461ca3f","last_reissued_at":"2026-05-18T04:05:47.214447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:47.214447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Frederique Oggier","submitted_at":"2011-07-15T18:46:33Z","abstract_excerpt":"Distributed data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in terms of storage space and maintenance bandwidth requirements. Erasure codes, originally designed for communication over lossy channels, provide a storage efficient alternative to replication based redundancy, however entailing high communication overhead for maintenance, when some of the encoded fragments need to be replenished in news ones after failure o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3129","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":"1107.3129","created_at":"2026-05-18T04:05:47.214509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3129v1","created_at":"2026-05-18T04:05:47.214509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3129","created_at":"2026-05-18T04:05:47.214509+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QAUXIS6KXKF","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QAUXIS6KXKF5LZZ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QAUXIS6","created_at":"2026-05-18T12:26:18.847500+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/2QAUXIS6KXKF5LZZNLPJTNALKS","json":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS.json","graph_json":"https://pith.science/api/pith-number/2QAUXIS6KXKF5LZZNLPJTNALKS/graph.json","events_json":"https://pith.science/api/pith-number/2QAUXIS6KXKF5LZZNLPJTNALKS/events.json","paper":"https://pith.science/paper/2QAUXIS6"},"agent_actions":{"view_html":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS","download_json":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS.json","view_paper":"https://pith.science/paper/2QAUXIS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3129&json=true","fetch_graph":"https://pith.science/api/pith-number/2QAUXIS6KXKF5LZZNLPJTNALKS/graph.json","fetch_events":"https://pith.science/api/pith-number/2QAUXIS6KXKF5LZZNLPJTNALKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/action/storage_attestation","attest_author":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/action/author_attestation","sign_citation":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/action/citation_signature","submit_replication":"https://pith.science/pith/2QAUXIS6KXKF5LZZNLPJTNALKS/action/replication_record"}},"created_at":"2026-05-18T04:05:47.214509+00:00","updated_at":"2026-05-18T04:05:47.214509+00:00"}