{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AKZRULWTOKE4A6YIIE3XZPJCXI","short_pith_number":"pith:AKZRULWT","canonical_record":{"source":{"id":"1710.03376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T02:09:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89b4433cd6c4df6215081ba3ff4d230bba70c83b61f6fe446c5b4102bd59d9b6","abstract_canon_sha256":"f828d4bb45b286864e5153fa919faf336e7cb706dade28202ee40374a40dd223"},"schema_version":"1.0"},"canonical_sha256":"02b31a2ed37289c07b0841377cbd22ba14d5e5ef5074960439821e8cb1fb98f2","source":{"kind":"arxiv","id":"1710.03376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03376","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03376v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03376","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"AKZRULWTOKE4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKZRULWTOKE4A6YI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKZRULWT","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AKZRULWTOKE4A6YIIE3XZPJCXI","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T02:09:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"89b4433cd6c4df6215081ba3ff4d230bba70c83b61f6fe446c5b4102bd59d9b6","abstract_canon_sha256":"f828d4bb45b286864e5153fa919faf336e7cb706dade28202ee40374a40dd223"},"schema_version":"1.0"},"canonical_sha256":"02b31a2ed37289c07b0841377cbd22ba14d5e5ef5074960439821e8cb1fb98f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:12.143427Z","signature_b64":"P2e4IXKm6GPK7FUu8Z7SOCCQZ2z9OtDt5vsBLygwkZET9lFtHtmBoj1/EfhfifHr1g582F+3bE941uGW9AxrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02b31a2ed37289c07b0841377cbd22ba14d5e5ef5074960439821e8cb1fb98f2","last_reissued_at":"2026-05-18T00:33:12.142713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:12.142713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03376","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LVo4T99cklqqBNXfkBD8NuG3iLgIkCMU3RdTonNPNtiBmvbez1UrZPMOwi8Ndi9XyHBTES0dS1sk7qP1NUONBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:19:42.012167Z"},"content_sha256":"7978f6912c317b50ad2c14906fd2951800cf2d4bb1570eae99ebc6a4d353d7b9","schema_version":"1.0","event_id":"sha256:7978f6912c317b50ad2c14906fd2951800cf2d4bb1570eae99ebc6a4d353d7b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AKZRULWTOKE4A6YIIE3XZPJCXI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Service Capacity Region of Accessing Erasure Coded Content","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ann Johnston, Carolyn Mayer, Emina Soljanin, Gauri Joshi, Gretchen L. Matthews, Mehmet Aktas, Sarah E. Anderson, Swanand Kadhe","submitted_at":"2017-10-10T02:09:55Z","abstract_excerpt":"Cloud storage systems generally add redundancy in storing content files such that $K$ files are replicated or erasure coded and stored on $N > K$ nodes. In addition to providing reliability against failures, the redundant copies can be used to serve a larger volume of content access requests. A request for one of the files can be either be sent to a systematic node, or one of the repair groups. In this paper, we seek to maximize the service capacity region, that is, the set of request arrival rates for the $K$ files that can be supported by a coded storage system. We explore two aspects of thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03376","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DfvfEcWZ4nrX/InY0oW8bdnsCn5OwYLN0PLOrRs8IzwoE51YeBt6EyJEsLAbvdJp+U1Z5jFSL41kvnBPw7gBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:19:42.012832Z"},"content_sha256":"db55eb8110e265c8296de1b569f0b984640d136302204991172aebe11a2f8f7e","schema_version":"1.0","event_id":"sha256:db55eb8110e265c8296de1b569f0b984640d136302204991172aebe11a2f8f7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/bundle.json","state_url":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/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-25T18:19:42Z","links":{"resolver":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI","bundle":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/bundle.json","state":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AKZRULWTOKE4A6YIIE3XZPJCXI","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":"f828d4bb45b286864e5153fa919faf336e7cb706dade28202ee40374a40dd223","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T02:09:55Z","title_canon_sha256":"89b4433cd6c4df6215081ba3ff4d230bba70c83b61f6fe446c5b4102bd59d9b6"},"schema_version":"1.0","source":{"id":"1710.03376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03376","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03376v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03376","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"AKZRULWTOKE4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKZRULWTOKE4A6YI","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKZRULWT","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:db55eb8110e265c8296de1b569f0b984640d136302204991172aebe11a2f8f7e","target":"graph","created_at":"2026-05-18T00:33:12Z","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":"Cloud storage systems generally add redundancy in storing content files such that $K$ files are replicated or erasure coded and stored on $N > K$ nodes. In addition to providing reliability against failures, the redundant copies can be used to serve a larger volume of content access requests. A request for one of the files can be either be sent to a systematic node, or one of the repair groups. In this paper, we seek to maximize the service capacity region, that is, the set of request arrival rates for the $K$ files that can be supported by a coded storage system. We explore two aspects of thi","authors_text":"Ann Johnston, Carolyn Mayer, Emina Soljanin, Gauri Joshi, Gretchen L. Matthews, Mehmet Aktas, Sarah E. Anderson, Swanand Kadhe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T02:09:55Z","title":"On the Service Capacity Region of Accessing Erasure Coded Content"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03376","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:7978f6912c317b50ad2c14906fd2951800cf2d4bb1570eae99ebc6a4d353d7b9","target":"record","created_at":"2026-05-18T00:33:12Z","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":"f828d4bb45b286864e5153fa919faf336e7cb706dade28202ee40374a40dd223","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-10T02:09:55Z","title_canon_sha256":"89b4433cd6c4df6215081ba3ff4d230bba70c83b61f6fe446c5b4102bd59d9b6"},"schema_version":"1.0","source":{"id":"1710.03376","kind":"arxiv","version":1}},"canonical_sha256":"02b31a2ed37289c07b0841377cbd22ba14d5e5ef5074960439821e8cb1fb98f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02b31a2ed37289c07b0841377cbd22ba14d5e5ef5074960439821e8cb1fb98f2","first_computed_at":"2026-05-18T00:33:12.142713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:12.142713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P2e4IXKm6GPK7FUu8Z7SOCCQZ2z9OtDt5vsBLygwkZET9lFtHtmBoj1/EfhfifHr1g582F+3bE941uGW9AxrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:12.143427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7978f6912c317b50ad2c14906fd2951800cf2d4bb1570eae99ebc6a4d353d7b9","sha256:db55eb8110e265c8296de1b569f0b984640d136302204991172aebe11a2f8f7e"],"state_sha256":"ee4f1f03ae97f338b254c1040e137de6082affadc41ad0feb3815781dc5bb98a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2a3PIDMgRbpwJnVDLEH9wRGNGZ9KDWuPggseAv3dVp/Fa0njz5Xn/22ZgvMZQZBmCf71Uffpf+OvVpsg9opCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:19:42.016992Z","bundle_sha256":"1ad8a75fb47527cd8da767486a740cb5c0ab3d744bf80b4c8906061f8e1bfc7e"}}