{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MBTP5ALB6SETDKQU247FLQDTXC","short_pith_number":"pith:MBTP5ALB","schema_version":"1.0","canonical_sha256":"6066fe8161f48931aa14d73e55c073b89f5ab9d5cbb10bde0b5be21a07da1b99","source":{"kind":"arxiv","id":"1901.02399","version":1},"attestation_state":"computed","paper":{"title":"Service Rate Region of Content Access from Erasure Coded Storage","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 Matthews, Sarah Anderson","submitted_at":"2019-01-08T16:51:40Z","abstract_excerpt":"We consider storage systems in which $K$ files are stored over $N$ nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file $f_k$ arrive at rate $\\lambda_k$, and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a $3$-file coded storage system. We also provide an algorithm to m"},"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":"1901.02399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T16:51:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"515aa520304687c4076997ebfbb70fa696a42df0d3b95c7297f7f289c5856440","abstract_canon_sha256":"8556c5ff8c8dca1b4cbb7561f1d8255b61613b611e3ba9abefd141d1856eb4e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:43.440752Z","signature_b64":"4b3+BFTX9pVl4rIXE7rcnOmuIMoINS5kI0DsRO/m6P7FZfAqP2lP9GwrOC3W0G4t9DM4TjveyoN3iV0htGuRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6066fe8161f48931aa14d73e55c073b89f5ab9d5cbb10bde0b5be21a07da1b99","last_reissued_at":"2026-05-17T23:56:43.440411Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:43.440411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Service Rate Region of Content Access from Erasure Coded Storage","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 Matthews, Sarah Anderson","submitted_at":"2019-01-08T16:51:40Z","abstract_excerpt":"We consider storage systems in which $K$ files are stored over $N$ nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file $f_k$ arrive at rate $\\lambda_k$, and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a $3$-file coded storage system. We also provide an algorithm to m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02399","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":"1901.02399","created_at":"2026-05-17T23:56:43.440466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02399v1","created_at":"2026-05-17T23:56:43.440466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02399","created_at":"2026-05-17T23:56:43.440466+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBTP5ALB6SET","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBTP5ALB6SETDKQU","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBTP5ALB","created_at":"2026-05-18T12:33:21.387695+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/MBTP5ALB6SETDKQU247FLQDTXC","json":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC.json","graph_json":"https://pith.science/api/pith-number/MBTP5ALB6SETDKQU247FLQDTXC/graph.json","events_json":"https://pith.science/api/pith-number/MBTP5ALB6SETDKQU247FLQDTXC/events.json","paper":"https://pith.science/paper/MBTP5ALB"},"agent_actions":{"view_html":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC","download_json":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC.json","view_paper":"https://pith.science/paper/MBTP5ALB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02399&json=true","fetch_graph":"https://pith.science/api/pith-number/MBTP5ALB6SETDKQU247FLQDTXC/graph.json","fetch_events":"https://pith.science/api/pith-number/MBTP5ALB6SETDKQU247FLQDTXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/action/storage_attestation","attest_author":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/action/author_attestation","sign_citation":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/action/citation_signature","submit_replication":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/action/replication_record"}},"created_at":"2026-05-17T23:56:43.440466+00:00","updated_at":"2026-05-17T23:56:43.440466+00:00"}