{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AKZRULWTOKE4A6YIIE3XZPJCXI","short_pith_number":"pith:AKZRULWT","schema_version":"1.0","canonical_sha256":"02b31a2ed37289c07b0841377cbd22ba14d5e5ef5074960439821e8cb1fb98f2","source":{"kind":"arxiv","id":"1710.03376","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.03376","created_at":"2026-05-18T00:33:12.142837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03376v1","created_at":"2026-05-18T00:33:12.142837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03376","created_at":"2026-05-18T00:33:12.142837+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKZRULWTOKE4","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKZRULWTOKE4A6YI","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKZRULWT","created_at":"2026-05-18T12:31:05.417338+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/AKZRULWTOKE4A6YIIE3XZPJCXI","json":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI.json","graph_json":"https://pith.science/api/pith-number/AKZRULWTOKE4A6YIIE3XZPJCXI/graph.json","events_json":"https://pith.science/api/pith-number/AKZRULWTOKE4A6YIIE3XZPJCXI/events.json","paper":"https://pith.science/paper/AKZRULWT"},"agent_actions":{"view_html":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI","download_json":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI.json","view_paper":"https://pith.science/paper/AKZRULWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03376&json=true","fetch_graph":"https://pith.science/api/pith-number/AKZRULWTOKE4A6YIIE3XZPJCXI/graph.json","fetch_events":"https://pith.science/api/pith-number/AKZRULWTOKE4A6YIIE3XZPJCXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/action/storage_attestation","attest_author":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/action/author_attestation","sign_citation":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/action/citation_signature","submit_replication":"https://pith.science/pith/AKZRULWTOKE4A6YIIE3XZPJCXI/action/replication_record"}},"created_at":"2026-05-18T00:33:12.142837+00:00","updated_at":"2026-05-18T00:33:12.142837+00:00"}