{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VJE4G7Z2QKI3PWTBXTYC4X472H","short_pith_number":"pith:VJE4G7Z2","schema_version":"1.0","canonical_sha256":"aa49c37f3a8291b7da61bcf02e5f9fd1c590fc585f128abd1ea9da810f012c78","source":{"kind":"arxiv","id":"1007.5044","version":1},"attestation_state":"computed","paper":{"title":"Symmetric Allocations for Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Derek Leong, Tracey Ho","submitted_at":"2010-07-28T18:40:20Z","abstract_excerpt":"We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of storage nodes; it is allowed to store any amount of coded data in each node, as long as the total amount of storage used does not exceed the given budget. A data collector subsequently attempts to recover the original data object by accessing each of the nodes independently with some constant probability. By using an appropriate code, successful recovery occurs when the total amount of data in the accessed nodes is at"},"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":"1007.5044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-28T18:40:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28a963d6fece38ae0b05c7e54a4a607e6093c082537765583e19c63d931759d4","abstract_canon_sha256":"b76c7bdf45602d06583e411597801712bae4fde8413cf1867e7305b12383f566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.791996Z","signature_b64":"K7/fFtQDC+CZ7PYHJZVvop/NolJ47iGaYwezow1kb9rKiTFQL60s403YVatlW9Wx78k9qrYNLoGmpuiEpuWMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa49c37f3a8291b7da61bcf02e5f9fd1c590fc585f128abd1ea9da810f012c78","last_reissued_at":"2026-05-18T00:59:10.791429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.791429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Allocations for Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Derek Leong, Tracey Ho","submitted_at":"2010-07-28T18:40:20Z","abstract_excerpt":"We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of storage nodes; it is allowed to store any amount of coded data in each node, as long as the total amount of storage used does not exceed the given budget. A data collector subsequently attempts to recover the original data object by accessing each of the nodes independently with some constant probability. By using an appropriate code, successful recovery occurs when the total amount of data in the accessed nodes is at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5044","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":"1007.5044","created_at":"2026-05-18T00:59:10.791530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.5044v1","created_at":"2026-05-18T00:59:10.791530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5044","created_at":"2026-05-18T00:59:10.791530+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJE4G7Z2QKI3","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJE4G7Z2QKI3PWTB","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJE4G7Z2","created_at":"2026-05-18T12:26:15.391820+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/VJE4G7Z2QKI3PWTBXTYC4X472H","json":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H.json","graph_json":"https://pith.science/api/pith-number/VJE4G7Z2QKI3PWTBXTYC4X472H/graph.json","events_json":"https://pith.science/api/pith-number/VJE4G7Z2QKI3PWTBXTYC4X472H/events.json","paper":"https://pith.science/paper/VJE4G7Z2"},"agent_actions":{"view_html":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H","download_json":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H.json","view_paper":"https://pith.science/paper/VJE4G7Z2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.5044&json=true","fetch_graph":"https://pith.science/api/pith-number/VJE4G7Z2QKI3PWTBXTYC4X472H/graph.json","fetch_events":"https://pith.science/api/pith-number/VJE4G7Z2QKI3PWTBXTYC4X472H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H/action/storage_attestation","attest_author":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H/action/author_attestation","sign_citation":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H/action/citation_signature","submit_replication":"https://pith.science/pith/VJE4G7Z2QKI3PWTBXTYC4X472H/action/replication_record"}},"created_at":"2026-05-18T00:59:10.791530+00:00","updated_at":"2026-05-18T00:59:10.791530+00:00"}