{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2G2W7VPTJWTPHXWTQMZWP3XWWC","short_pith_number":"pith:2G2W7VPT","schema_version":"1.0","canonical_sha256":"d1b56fd5f34da6f3ded3833367eef6b0989c5a11022b9c30a371e2c1f0d735c6","source":{"kind":"arxiv","id":"2603.24761","version":2},"attestation_state":"computed","paper":{"title":"eAID: Elastic Asynchronous Information Dispersal with Post-Dissemination Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amit Wieder, Dahlia Malkhi, Divyakant Agrawal, Michael K. Reiter, Rithwik Kerur","submitted_at":"2026-03-25T19:35:23Z","abstract_excerpt":"Spreading and storing erasure-coded data effectively in distributed systems is challenging in practical settings. The dissemination of erasure-coded information is typically designed to complete only after receiving messages from $(N-F)$ nodes, thereby preparing for the worst-case, but rare, scenario of $F$ failures. In steady state, the remaining $F$ nodes may in fact be healthy, but their resources are not counted. This leads to over-provisioning of storage for encoded data.\n  This paper introduces eAID, a novel elastic information dispersal algorithm that addresses this conundrum through a "},"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":"2603.24761","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-03-25T19:35:23Z","cross_cats_sorted":[],"title_canon_sha256":"48dfe446cfee8c9c7e8598ff2817b80bbd32ecb859ef486f1be8a11c26b07e04","abstract_canon_sha256":"46ef634076ef4ac1393c684dad54b2b9f70af35ab2ccec242adb401d4342dff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:05:47.182389Z","signature_b64":"aEb4faVVVEaDvQmmJmq9NJ+yZVbqCvD7ANH4d8UzGNkqKnPsw9iEXmJtSF+hYI07LynaYQ+7hvyYP3unIKzjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1b56fd5f34da6f3ded3833367eef6b0989c5a11022b9c30a371e2c1f0d735c6","last_reissued_at":"2026-06-03T02:05:47.181747Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:05:47.181747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"eAID: Elastic Asynchronous Information Dispersal with Post-Dissemination Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amit Wieder, Dahlia Malkhi, Divyakant Agrawal, Michael K. Reiter, Rithwik Kerur","submitted_at":"2026-03-25T19:35:23Z","abstract_excerpt":"Spreading and storing erasure-coded data effectively in distributed systems is challenging in practical settings. The dissemination of erasure-coded information is typically designed to complete only after receiving messages from $(N-F)$ nodes, thereby preparing for the worst-case, but rare, scenario of $F$ failures. In steady state, the remaining $F$ nodes may in fact be healthy, but their resources are not counted. This leads to over-provisioning of storage for encoded data.\n  This paper introduces eAID, a novel elastic information dispersal algorithm that addresses this conundrum through a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.24761","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.24761/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2603.24761","created_at":"2026-06-03T02:05:47.181832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.24761v2","created_at":"2026-06-03T02:05:47.181832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.24761","created_at":"2026-06-03T02:05:47.181832+00:00"},{"alias_kind":"pith_short_12","alias_value":"2G2W7VPTJWTP","created_at":"2026-06-03T02:05:47.181832+00:00"},{"alias_kind":"pith_short_16","alias_value":"2G2W7VPTJWTPHXWT","created_at":"2026-06-03T02:05:47.181832+00:00"},{"alias_kind":"pith_short_8","alias_value":"2G2W7VPT","created_at":"2026-06-03T02:05:47.181832+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/2G2W7VPTJWTPHXWTQMZWP3XWWC","json":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC.json","graph_json":"https://pith.science/api/pith-number/2G2W7VPTJWTPHXWTQMZWP3XWWC/graph.json","events_json":"https://pith.science/api/pith-number/2G2W7VPTJWTPHXWTQMZWP3XWWC/events.json","paper":"https://pith.science/paper/2G2W7VPT"},"agent_actions":{"view_html":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC","download_json":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC.json","view_paper":"https://pith.science/paper/2G2W7VPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.24761&json=true","fetch_graph":"https://pith.science/api/pith-number/2G2W7VPTJWTPHXWTQMZWP3XWWC/graph.json","fetch_events":"https://pith.science/api/pith-number/2G2W7VPTJWTPHXWTQMZWP3XWWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC/action/storage_attestation","attest_author":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC/action/author_attestation","sign_citation":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC/action/citation_signature","submit_replication":"https://pith.science/pith/2G2W7VPTJWTPHXWTQMZWP3XWWC/action/replication_record"}},"created_at":"2026-06-03T02:05:47.181832+00:00","updated_at":"2026-06-03T02:05:47.181832+00:00"}