{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CQ32LXI6KFJ4YTXQMMKS7FLRVO","short_pith_number":"pith:CQ32LXI6","canonical_record":{"source":{"id":"1701.06506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T17:04:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7faa306fef66d019f9add2ed1a32b54ab42ce548e53ae507c673a9a644ca37f","abstract_canon_sha256":"84ee2d61a83e67f3a371a28845abf2868aa9125b20bb8412fc9353a29eaafaad"},"schema_version":"1.0"},"canonical_sha256":"1437a5dd1e5153cc4ef063152f9571aba7c7472d014c37d159fec294d4c86a7d","source":{"kind":"arxiv","id":"1701.06506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06506","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06506v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06506","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"CQ32LXI6KFJ4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CQ32LXI6KFJ4YTXQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CQ32LXI6","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CQ32LXI6KFJ4YTXQMMKS7FLRVO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T17:04:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7faa306fef66d019f9add2ed1a32b54ab42ce548e53ae507c673a9a644ca37f","abstract_canon_sha256":"84ee2d61a83e67f3a371a28845abf2868aa9125b20bb8412fc9353a29eaafaad"},"schema_version":"1.0"},"canonical_sha256":"1437a5dd1e5153cc4ef063152f9571aba7c7472d014c37d159fec294d4c86a7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.184344Z","signature_b64":"BjxHNLwbMzDV00pLW69aIjTiVAEJlPxszbapNtQSnUb2QXIxahehtYzC5RCZxO+ikdQjvu8aI9SaydEug8V6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1437a5dd1e5153cc4ef063152f9571aba7c7472d014c37d159fec294d4c86a7d","last_reissued_at":"2026-05-18T00:52:18.183751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.183751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06506","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+SAeGY9z6/p3t663D9ZkGddWBM/ZEGh6IlK//jky2QZt90virCP8xF70wUQq/UsQMQ+hEzHA4TeioP4IgrEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:43:37.386109Z"},"content_sha256":"050ea2fcf58a7e5d8ae3c432228deaa3016f1dcccb44eeeb81edb04615accd5d","schema_version":"1.0","event_id":"sha256:050ea2fcf58a7e5d8ae3c432228deaa3016f1dcccb44eeeb81edb04615accd5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CQ32LXI6KFJ4YTXQMMKS7FLRVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Storage Allocation for Multi-Class Distributed Data Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chintha Tellambura, Koosha Pourtahmasi Roshandeh, Masoud Ardakani, Moslem Noori","submitted_at":"2017-01-23T17:04:24Z","abstract_excerpt":"Distributed storage systems (DSSs) provide a scalable solution for reliably storing massive amounts of data coming from various sources. Heterogeneity of these data sources often means different data classes (types) exist in a DSS, each needing a different level of quality of service (QoS). As a result, efficient data storage and retrieval processes that satisfy various QoS requirements are needed. This paper studies storage allocation, meaning how data of different classes must be spread over the set of storage nodes of a DSS. More specifically, assuming a probabilistic access to the storage "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06506","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cEysaMNxpkpvNpTFP7fW7ttagRLEoNMHas7++6J31FyiRkUQhzpiL60GGfGXgi3V2Y306Zsq8DIEEyOqFxIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:43:37.386628Z"},"content_sha256":"957980cc1aa5bd25e4ee2ea4e2099d6290ef5d8fa0ae8dfa08edbab5ed1168f4","schema_version":"1.0","event_id":"sha256:957980cc1aa5bd25e4ee2ea4e2099d6290ef5d8fa0ae8dfa08edbab5ed1168f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQ32LXI6KFJ4YTXQMMKS7FLRVO/bundle.json","state_url":"https://pith.science/pith/CQ32LXI6KFJ4YTXQMMKS7FLRVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQ32LXI6KFJ4YTXQMMKS7FLRVO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T00:43:37Z","links":{"resolver":"https://pith.science/pith/CQ32LXI6KFJ4YTXQMMKS7FLRVO","bundle":"https://pith.science/pith/CQ32LXI6KFJ4YTXQMMKS7FLRVO/bundle.json","state":"https://pith.science/pith/CQ32LXI6KFJ4YTXQMMKS7FLRVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQ32LXI6KFJ4YTXQMMKS7FLRVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CQ32LXI6KFJ4YTXQMMKS7FLRVO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"84ee2d61a83e67f3a371a28845abf2868aa9125b20bb8412fc9353a29eaafaad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T17:04:24Z","title_canon_sha256":"a7faa306fef66d019f9add2ed1a32b54ab42ce548e53ae507c673a9a644ca37f"},"schema_version":"1.0","source":{"id":"1701.06506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06506","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06506v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06506","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"CQ32LXI6KFJ4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CQ32LXI6KFJ4YTXQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CQ32LXI6","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:957980cc1aa5bd25e4ee2ea4e2099d6290ef5d8fa0ae8dfa08edbab5ed1168f4","target":"graph","created_at":"2026-05-18T00:52:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Distributed storage systems (DSSs) provide a scalable solution for reliably storing massive amounts of data coming from various sources. Heterogeneity of these data sources often means different data classes (types) exist in a DSS, each needing a different level of quality of service (QoS). As a result, efficient data storage and retrieval processes that satisfy various QoS requirements are needed. This paper studies storage allocation, meaning how data of different classes must be spread over the set of storage nodes of a DSS. More specifically, assuming a probabilistic access to the storage ","authors_text":"Chintha Tellambura, Koosha Pourtahmasi Roshandeh, Masoud Ardakani, Moslem Noori","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T17:04:24Z","title":"Storage Allocation for Multi-Class Distributed Data Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06506","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:050ea2fcf58a7e5d8ae3c432228deaa3016f1dcccb44eeeb81edb04615accd5d","target":"record","created_at":"2026-05-18T00:52:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"84ee2d61a83e67f3a371a28845abf2868aa9125b20bb8412fc9353a29eaafaad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T17:04:24Z","title_canon_sha256":"a7faa306fef66d019f9add2ed1a32b54ab42ce548e53ae507c673a9a644ca37f"},"schema_version":"1.0","source":{"id":"1701.06506","kind":"arxiv","version":1}},"canonical_sha256":"1437a5dd1e5153cc4ef063152f9571aba7c7472d014c37d159fec294d4c86a7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1437a5dd1e5153cc4ef063152f9571aba7c7472d014c37d159fec294d4c86a7d","first_computed_at":"2026-05-18T00:52:18.183751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.183751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BjxHNLwbMzDV00pLW69aIjTiVAEJlPxszbapNtQSnUb2QXIxahehtYzC5RCZxO+ikdQjvu8aI9SaydEug8V6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.184344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:050ea2fcf58a7e5d8ae3c432228deaa3016f1dcccb44eeeb81edb04615accd5d","sha256:957980cc1aa5bd25e4ee2ea4e2099d6290ef5d8fa0ae8dfa08edbab5ed1168f4"],"state_sha256":"89f086173d6c08e1abd4f3fbb446eae5e7f0ac975df4f5d17dc2f1741b6a30bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2dpSQJ1+iiJqkUzl3r4UVEIuL/25DF/uoo96ZkhhaRXd3YESztMFMTLcl3E5gAIy5xlyuI5/LcscUYbUrnyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:43:37.389260Z","bundle_sha256":"4ac1194c7f07e5ed810c101dca58d784036d8cd7aa25b6ddf3b3c12332197ca8"}}