{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:533K7IAY2ZNLCXPQBRDZ3K7OPG","short_pith_number":"pith:533K7IAY","schema_version":"1.0","canonical_sha256":"eef6afa018d65ab15df00c479dabee79876d4ba481a52137e63c6292f2664247","source":{"kind":"arxiv","id":"1202.1596","version":1},"attestation_state":"computed","paper":{"title":"Allocations for Heterogenous 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, Giuseppe Caire, Vasileios Ntranos","submitted_at":"2012-02-08T04:18:14Z","abstract_excerpt":"We study the problem of storing a data object in a set of data nodes that fail independently with given probabilities. Our problem is a natural generalization of a homogenous storage allocation problem where all the nodes had the same reliability and is naturally motivated for peer-to-peer and cloud storage systems with different types of nodes. Assuming optimal erasure coding (MDS), the goal is to find a storage allocation (i.e, how much to store in each node) to maximize the probability of successful recovery. This problem turns out to be a challenging combinatorial optimization problem. In "},"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":"1202.1596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T04:18:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9d15781e6ef804dcb212bc87862d368186b80c4faef515e51b023b90ad06874","abstract_canon_sha256":"57515aaf62b88b0981fd3de26157c4f607e88468db886a368c41966af71d48e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:51.894781Z","signature_b64":"cZFfNyfquhpflKHTExTq9XXXebnW0kJECgfYvk+1ZHlPMKpRuChKM1NXNsVWAYlVUAHJ7AVZbgbxoEuAOpxzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef6afa018d65ab15df00c479dabee79876d4ba481a52137e63c6292f2664247","last_reissued_at":"2026-05-18T04:02:51.893906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:51.893906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Allocations for Heterogenous 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, Giuseppe Caire, Vasileios Ntranos","submitted_at":"2012-02-08T04:18:14Z","abstract_excerpt":"We study the problem of storing a data object in a set of data nodes that fail independently with given probabilities. Our problem is a natural generalization of a homogenous storage allocation problem where all the nodes had the same reliability and is naturally motivated for peer-to-peer and cloud storage systems with different types of nodes. Assuming optimal erasure coding (MDS), the goal is to find a storage allocation (i.e, how much to store in each node) to maximize the probability of successful recovery. This problem turns out to be a challenging combinatorial optimization problem. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1596","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":"1202.1596","created_at":"2026-05-18T04:02:51.894050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1596v1","created_at":"2026-05-18T04:02:51.894050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1596","created_at":"2026-05-18T04:02:51.894050+00:00"},{"alias_kind":"pith_short_12","alias_value":"533K7IAY2ZNL","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"533K7IAY2ZNLCXPQ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"533K7IAY","created_at":"2026-05-18T12:26:53.410803+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/533K7IAY2ZNLCXPQBRDZ3K7OPG","json":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG.json","graph_json":"https://pith.science/api/pith-number/533K7IAY2ZNLCXPQBRDZ3K7OPG/graph.json","events_json":"https://pith.science/api/pith-number/533K7IAY2ZNLCXPQBRDZ3K7OPG/events.json","paper":"https://pith.science/paper/533K7IAY"},"agent_actions":{"view_html":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG","download_json":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG.json","view_paper":"https://pith.science/paper/533K7IAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1596&json=true","fetch_graph":"https://pith.science/api/pith-number/533K7IAY2ZNLCXPQBRDZ3K7OPG/graph.json","fetch_events":"https://pith.science/api/pith-number/533K7IAY2ZNLCXPQBRDZ3K7OPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG/action/storage_attestation","attest_author":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG/action/author_attestation","sign_citation":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG/action/citation_signature","submit_replication":"https://pith.science/pith/533K7IAY2ZNLCXPQBRDZ3K7OPG/action/replication_record"}},"created_at":"2026-05-18T04:02:51.894050+00:00","updated_at":"2026-05-18T04:02:51.894050+00:00"}