{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FXZ2ASHNWRFWWJZ536AU6JX7WZ","short_pith_number":"pith:FXZ2ASHN","schema_version":"1.0","canonical_sha256":"2df3a048edb44b6b273ddf814f26ffb67b44454f2af14cd173fc8ece560f4c53","source":{"kind":"arxiv","id":"1810.02974","version":1},"attestation_state":"computed","paper":{"title":"Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"2), 2000 Neuch\\^atel, (2) University of California, (3) University of Houston, CA 95064, Ethan Miller (2), Houston, Jehan-Fran\\c{c}ois P\\^aris (3) ((1) University of Neuch\\^atel, Pascal Felber (1), Santa Cruz, Switzerland, TX 77204-3010, USA, USA), Vero Estrada-Gali\\~nanes (1","submitted_at":"2018-10-06T10:32:33Z","abstract_excerpt":"Data centres that use consumer-grade disks drives and distributed peer-to-peer systems are unreliable environments to archive data without enough redundancy. Most redundancy schemes are not completely effective for providing high availability, durability and integrity in the long-term. We propose alpha entanglement codes, a mechanism that creates a virtual layer of highly interconnected storage devices to propagate redundant information across a large scale storage system. Our motivation is to design flexible and practical erasure codes with high fault-tolerance to improve data durability and "},"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":"1810.02974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-06T10:32:33Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"129f151e68fa34081b6b97a0c786856cfe7a0e951fb6c991c918227d5f863951","abstract_canon_sha256":"4047c7811d4cdeee72b1bed1796867bf8fa115cf7b6b45b07fd38142150fcc8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:54.980916Z","signature_b64":"HEbnZXOJNyM/JV8ElUktELgrn4Ks7G8BWOSG+4XC9udN5wTdoUJAZqdi3Fxz73bRRVf+Z9SnNXm8QFpFq/oyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2df3a048edb44b6b273ddf814f26ffb67b44454f2af14cd173fc8ece560f4c53","last_reissued_at":"2026-05-18T00:03:54.980154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:54.980154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"2), 2000 Neuch\\^atel, (2) University of California, (3) University of Houston, CA 95064, Ethan Miller (2), Houston, Jehan-Fran\\c{c}ois P\\^aris (3) ((1) University of Neuch\\^atel, Pascal Felber (1), Santa Cruz, Switzerland, TX 77204-3010, USA, USA), Vero Estrada-Gali\\~nanes (1","submitted_at":"2018-10-06T10:32:33Z","abstract_excerpt":"Data centres that use consumer-grade disks drives and distributed peer-to-peer systems are unreliable environments to archive data without enough redundancy. Most redundancy schemes are not completely effective for providing high availability, durability and integrity in the long-term. We propose alpha entanglement codes, a mechanism that creates a virtual layer of highly interconnected storage devices to propagate redundant information across a large scale storage system. Our motivation is to design flexible and practical erasure codes with high fault-tolerance to improve data durability and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02974","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":"1810.02974","created_at":"2026-05-18T00:03:54.980282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02974v1","created_at":"2026-05-18T00:03:54.980282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02974","created_at":"2026-05-18T00:03:54.980282+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXZ2ASHNWRFW","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXZ2ASHNWRFWWJZ5","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXZ2ASHN","created_at":"2026-05-18T12:32:25.280505+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/FXZ2ASHNWRFWWJZ536AU6JX7WZ","json":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ.json","graph_json":"https://pith.science/api/pith-number/FXZ2ASHNWRFWWJZ536AU6JX7WZ/graph.json","events_json":"https://pith.science/api/pith-number/FXZ2ASHNWRFWWJZ536AU6JX7WZ/events.json","paper":"https://pith.science/paper/FXZ2ASHN"},"agent_actions":{"view_html":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ","download_json":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ.json","view_paper":"https://pith.science/paper/FXZ2ASHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02974&json=true","fetch_graph":"https://pith.science/api/pith-number/FXZ2ASHNWRFWWJZ536AU6JX7WZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FXZ2ASHNWRFWWJZ536AU6JX7WZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ/action/storage_attestation","attest_author":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ/action/author_attestation","sign_citation":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ/action/citation_signature","submit_replication":"https://pith.science/pith/FXZ2ASHNWRFWWJZ536AU6JX7WZ/action/replication_record"}},"created_at":"2026-05-18T00:03:54.980282+00:00","updated_at":"2026-05-18T00:03:54.980282+00:00"}