{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SXU7HKRLCMNBQNKA3VSE4YEPXL","short_pith_number":"pith:SXU7HKRL","schema_version":"1.0","canonical_sha256":"95e9f3aa2b131a183540dd644e608fbac276ba05ea1b1d20f533a51cd7ae0218","source":{"kind":"arxiv","id":"1105.0379","version":1},"attestation_state":"computed","paper":{"title":"Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Frederique Oggier","submitted_at":"2011-05-02T16:54:17Z","abstract_excerpt":"Self-Repairing Codes (SRC) are codes designed to suit the need of coding for distributed networked storage: they not only allow stored data to be recovered even in the presence of node failures, they also provide a repair mechanism where as little as two live nodes can be contacted to regenerate the data of a failed node. In this paper, we propose a new instance of self-repairing codes, based on constructions of spreads coming from projective geometry. We study some of their properties to demonstrate the suitability of these codes for distributed networked storage."},"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":"1105.0379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-02T16:54:17Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dd6d299dc79b234c673bd39caddc98b1f1ff7fb49a88f1dc97136741ade752ea","abstract_canon_sha256":"9df0c0f0746736caf88c9bc0fac424a989f65b727fa8ed22bdca47a2580652eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.968017Z","signature_b64":"CXd5/NYVNgve4wPtkJ1cJalejklwUne46nMt9rKe5qEm3M5HeZw3zm37njByNqcVy0pLn22MwwCTiMDzMgTVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95e9f3aa2b131a183540dd644e608fbac276ba05ea1b1d20f533a51cd7ae0218","last_reissued_at":"2026-05-18T04:23:11.967340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.967340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Anwitaman Datta, Frederique Oggier","submitted_at":"2011-05-02T16:54:17Z","abstract_excerpt":"Self-Repairing Codes (SRC) are codes designed to suit the need of coding for distributed networked storage: they not only allow stored data to be recovered even in the presence of node failures, they also provide a repair mechanism where as little as two live nodes can be contacted to regenerate the data of a failed node. In this paper, we propose a new instance of self-repairing codes, based on constructions of spreads coming from projective geometry. We study some of their properties to demonstrate the suitability of these codes for distributed networked storage."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0379","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":"1105.0379","created_at":"2026-05-18T04:23:11.967440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0379v1","created_at":"2026-05-18T04:23:11.967440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0379","created_at":"2026-05-18T04:23:11.967440+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXU7HKRLCMNB","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXU7HKRLCMNBQNKA","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXU7HKRL","created_at":"2026-05-18T12:26:41.206345+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/SXU7HKRLCMNBQNKA3VSE4YEPXL","json":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL.json","graph_json":"https://pith.science/api/pith-number/SXU7HKRLCMNBQNKA3VSE4YEPXL/graph.json","events_json":"https://pith.science/api/pith-number/SXU7HKRLCMNBQNKA3VSE4YEPXL/events.json","paper":"https://pith.science/paper/SXU7HKRL"},"agent_actions":{"view_html":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL","download_json":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL.json","view_paper":"https://pith.science/paper/SXU7HKRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0379&json=true","fetch_graph":"https://pith.science/api/pith-number/SXU7HKRLCMNBQNKA3VSE4YEPXL/graph.json","fetch_events":"https://pith.science/api/pith-number/SXU7HKRLCMNBQNKA3VSE4YEPXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL/action/storage_attestation","attest_author":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL/action/author_attestation","sign_citation":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL/action/citation_signature","submit_replication":"https://pith.science/pith/SXU7HKRLCMNBQNKA3VSE4YEPXL/action/replication_record"}},"created_at":"2026-05-18T04:23:11.967440+00:00","updated_at":"2026-05-18T04:23:11.967440+00:00"}