{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:RNUWZSYCEIL25XFDSGB6S7S4KS","short_pith_number":"pith:RNUWZSYC","schema_version":"1.0","canonical_sha256":"8b696ccb022217aedca39183e97e5c54b5494f9f47129a386db98e136b231229","source":{"kind":"arxiv","id":"cs/0606049","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Erasure Codes for Distributed Networked Storage","license":"","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Kannan Ramchandran, Vinod Prabhakaran","submitted_at":"2006-06-12T15:35:01Z","abstract_excerpt":"We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k<n sources generating the data. We want a data collector, who can appear anywhere in the network, to query any k storage nodes and be able to retrieve the data. We introduce Decentralized Erasure Codes, which are linear codes with a specific randomized structure inspired by network coding on random bipartite graphs. We show that decentralized erasure codes are optimally sparse, and lead to reduc"},"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":"cs/0606049","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-06-12T15:35:01Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"16a9039961633c8da5afbbe2c3ad7931182113b7b523191a6e0bae39d80e8aab","abstract_canon_sha256":"873c65e6bd916c52621bef7ffef3ee2eac2ea12b208433c6f5f5cb23bfda4df7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:56.276188Z","signature_b64":"ZFGue7BrbhtvBUJlge3v1FNYxI7edc6Q6MEF9AKAqzpPqKczh4xVqPtFDqoCGViJYm40M8rbysqc5IBoTCwQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b696ccb022217aedca39183e97e5c54b5494f9f47129a386db98e136b231229","last_reissued_at":"2026-05-18T00:58:56.275545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:56.275545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Erasure Codes for Distributed Networked Storage","license":"","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Kannan Ramchandran, Vinod Prabhakaran","submitted_at":"2006-06-12T15:35:01Z","abstract_excerpt":"We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k<n sources generating the data. We want a data collector, who can appear anywhere in the network, to query any k storage nodes and be able to retrieve the data. We introduce Decentralized Erasure Codes, which are linear codes with a specific randomized structure inspired by network coding on random bipartite graphs. We show that decentralized erasure codes are optimally sparse, and lead to reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0606049","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":"cs/0606049","created_at":"2026-05-18T00:58:56.275667+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0606049v1","created_at":"2026-05-18T00:58:56.275667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0606049","created_at":"2026-05-18T00:58:56.275667+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNUWZSYCEIL2","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNUWZSYCEIL25XFD","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNUWZSYC","created_at":"2026-05-18T12:25:54.717736+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/RNUWZSYCEIL25XFDSGB6S7S4KS","json":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS.json","graph_json":"https://pith.science/api/pith-number/RNUWZSYCEIL25XFDSGB6S7S4KS/graph.json","events_json":"https://pith.science/api/pith-number/RNUWZSYCEIL25XFDSGB6S7S4KS/events.json","paper":"https://pith.science/paper/RNUWZSYC"},"agent_actions":{"view_html":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS","download_json":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS.json","view_paper":"https://pith.science/paper/RNUWZSYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0606049&json=true","fetch_graph":"https://pith.science/api/pith-number/RNUWZSYCEIL25XFDSGB6S7S4KS/graph.json","fetch_events":"https://pith.science/api/pith-number/RNUWZSYCEIL25XFDSGB6S7S4KS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS/action/storage_attestation","attest_author":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS/action/author_attestation","sign_citation":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS/action/citation_signature","submit_replication":"https://pith.science/pith/RNUWZSYCEIL25XFDSGB6S7S4KS/action/replication_record"}},"created_at":"2026-05-18T00:58:56.275667+00:00","updated_at":"2026-05-18T00:58:56.275667+00:00"}