{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AUYYGCPBFGUHEVA4EW3P4KWEIN","short_pith_number":"pith:AUYYGCPB","canonical_record":{"source":{"id":"1504.04137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-16T08:31:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad777dc86c0284f028dcc391ac9e771e5271e7409cb15eb79df6388158d3523b","abstract_canon_sha256":"a9a304b3dbe1f85dd7f3a5d3072b55c367024fd267aff642efa3145fd376ee57"},"schema_version":"1.0"},"canonical_sha256":"05318309e129a872541c25b6fe2ac4434c03d8c0ca2f3a42320c7724bc83a88e","source":{"kind":"arxiv","id":"1504.04137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04137","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04137v1","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04137","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"AUYYGCPBFGUH","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AUYYGCPBFGUHEVA4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AUYYGCPB","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AUYYGCPBFGUHEVA4EW3P4KWEIN","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-16T08:31:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad777dc86c0284f028dcc391ac9e771e5271e7409cb15eb79df6388158d3523b","abstract_canon_sha256":"a9a304b3dbe1f85dd7f3a5d3072b55c367024fd267aff642efa3145fd376ee57"},"schema_version":"1.0"},"canonical_sha256":"05318309e129a872541c25b6fe2ac4434c03d8c0ca2f3a42320c7724bc83a88e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:39.709977Z","signature_b64":"2UpQPj2dstpVHVPZmhX+bt3M4s6oFZdKNb3Jcabslvh+5sO0GnznJjcr06y9gqCe8mys3k/bJ3QyqiKUvRrMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05318309e129a872541c25b6fe2ac4434c03d8c0ca2f3a42320c7724bc83a88e","last_reissued_at":"2026-05-18T02:18:39.709268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:39.709268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04137","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-18T02:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3zNq2BRiEvxlUOcdU1MBpZXPLHZ7fdL7vlr8OjGbHhSFOfNLg1N9WcSetUmfrfzanEkSlGXEVVa2Vctp5A7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:49:35.370886Z"},"content_sha256":"9a818d445e0b7b2728276d02c0239b49700febc7d182ee1e92e37d30d2c246bf","schema_version":"1.0","event_id":"sha256:9a818d445e0b7b2728276d02c0239b49700febc7d182ee1e92e37d30d2c246bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AUYYGCPBFGUHEVA4EW3P4KWEIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Distributed Storage Allocations for Memory-Limited Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Iryna Andriyanova, Pablo M. Olmos","submitted_at":"2015-04-16T08:31:51Z","abstract_excerpt":"In this paper we consider distributed allocation problems with memory constraint limits. Firstly, we propose a tractable relaxation to the problem of optimal symmetric allocations from [1]. The approximated problem is based on the Q-error function, and its solution approaches the solution of the initial problem, as the number of storage nodes in the network grows. Secondly, exploiting this relaxation, we are able to formulate and to solve the problem for storage allocations for memory-limited DSS storing and arbitrary memory profiles. Finally, we discuss the extension to the case of multiple d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04137","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-18T02:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIOD4X7Ii/k2XCfZTsMGl8UOA8YRv8NJyml5PmIS/sKBo2x11pa9QQ6MUUFbjv+P07Z0SQ5US141K3prWak8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:49:35.371638Z"},"content_sha256":"48a478adb6ffff53d47418ace94863f005afe2ec668bfbb8be5fa6c41b4a6066","schema_version":"1.0","event_id":"sha256:48a478adb6ffff53d47418ace94863f005afe2ec668bfbb8be5fa6c41b4a6066"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUYYGCPBFGUHEVA4EW3P4KWEIN/bundle.json","state_url":"https://pith.science/pith/AUYYGCPBFGUHEVA4EW3P4KWEIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUYYGCPBFGUHEVA4EW3P4KWEIN/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-31T06:49:35Z","links":{"resolver":"https://pith.science/pith/AUYYGCPBFGUHEVA4EW3P4KWEIN","bundle":"https://pith.science/pith/AUYYGCPBFGUHEVA4EW3P4KWEIN/bundle.json","state":"https://pith.science/pith/AUYYGCPBFGUHEVA4EW3P4KWEIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUYYGCPBFGUHEVA4EW3P4KWEIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AUYYGCPBFGUHEVA4EW3P4KWEIN","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":"a9a304b3dbe1f85dd7f3a5d3072b55c367024fd267aff642efa3145fd376ee57","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-16T08:31:51Z","title_canon_sha256":"ad777dc86c0284f028dcc391ac9e771e5271e7409cb15eb79df6388158d3523b"},"schema_version":"1.0","source":{"id":"1504.04137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04137","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04137v1","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04137","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"AUYYGCPBFGUH","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AUYYGCPBFGUHEVA4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AUYYGCPB","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:48a478adb6ffff53d47418ace94863f005afe2ec668bfbb8be5fa6c41b4a6066","target":"graph","created_at":"2026-05-18T02:18:39Z","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":"In this paper we consider distributed allocation problems with memory constraint limits. Firstly, we propose a tractable relaxation to the problem of optimal symmetric allocations from [1]. The approximated problem is based on the Q-error function, and its solution approaches the solution of the initial problem, as the number of storage nodes in the network grows. Secondly, exploiting this relaxation, we are able to formulate and to solve the problem for storage allocations for memory-limited DSS storing and arbitrary memory profiles. Finally, we discuss the extension to the case of multiple d","authors_text":"Iryna Andriyanova, Pablo M. Olmos","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-16T08:31:51Z","title":"On Distributed Storage Allocations for Memory-Limited Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04137","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:9a818d445e0b7b2728276d02c0239b49700febc7d182ee1e92e37d30d2c246bf","target":"record","created_at":"2026-05-18T02:18:39Z","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":"a9a304b3dbe1f85dd7f3a5d3072b55c367024fd267aff642efa3145fd376ee57","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-16T08:31:51Z","title_canon_sha256":"ad777dc86c0284f028dcc391ac9e771e5271e7409cb15eb79df6388158d3523b"},"schema_version":"1.0","source":{"id":"1504.04137","kind":"arxiv","version":1}},"canonical_sha256":"05318309e129a872541c25b6fe2ac4434c03d8c0ca2f3a42320c7724bc83a88e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05318309e129a872541c25b6fe2ac4434c03d8c0ca2f3a42320c7724bc83a88e","first_computed_at":"2026-05-18T02:18:39.709268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:39.709268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2UpQPj2dstpVHVPZmhX+bt3M4s6oFZdKNb3Jcabslvh+5sO0GnznJjcr06y9gqCe8mys3k/bJ3QyqiKUvRrMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:39.709977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a818d445e0b7b2728276d02c0239b49700febc7d182ee1e92e37d30d2c246bf","sha256:48a478adb6ffff53d47418ace94863f005afe2ec668bfbb8be5fa6c41b4a6066"],"state_sha256":"08185f1439a4f084dd858dd44aaf18f5a3e48c36b75ef2bdad7de00260fa5b68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwrXzq5qtOmFA5d53tMGz9/0qOXEgtnfhrghKseM0ApDlaIKiRXUBoYLVneaDqMb+gw2Ur8qtk3NCEK9Z/MdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:49:35.375438Z","bundle_sha256":"182e105c2d04957e8ca78e4c85591eccd05b62b0597210ac11ce4188a6a38c34"}}