{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MBTP5ALB6SETDKQU247FLQDTXC","short_pith_number":"pith:MBTP5ALB","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"},"canonical_sha256":"6066fe8161f48931aa14d73e55c073b89f5ab9d5cbb10bde0b5be21a07da1b99","source":{"kind":"arxiv","id":"1901.02399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02399","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02399v1","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02399","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"MBTP5ALB6SET","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBTP5ALB6SETDKQU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBTP5ALB","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MBTP5ALB6SETDKQU247FLQDTXC","target":"record","payload":{"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"},"canonical_sha256":"6066fe8161f48931aa14d73e55c073b89f5ab9d5cbb10bde0b5be21a07da1b99","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"},"source_kind":"arxiv","source_id":"1901.02399","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-17T23:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeATkCDjRoNEJfyfAIrFa5UTyp8F0snfNVuAb6+wgIFoIEEi+gBstCvXILNEa0ySshFqlKC54XuWKhSSxIQODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:22:09.887399Z"},"content_sha256":"fa392080f393cfc100faeb7798174c7ae2b32536bebbb448ccdc402ff157c707","schema_version":"1.0","event_id":"sha256:fa392080f393cfc100faeb7798174c7ae2b32536bebbb448ccdc402ff157c707"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MBTP5ALB6SETDKQU247FLQDTXC","target":"graph","payload":{"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"},"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-17T23:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKpXICtsquQiFG+WLi4ZS9/fJ7JR7hImjFCv4x/miZecYLLBToWY8GGfZLJnU9wKSG3JtOJS5JfDhqIgncYJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:22:09.888056Z"},"content_sha256":"4d493258abbaf2d3cb4c77c3d6368922acad18f97e8f0c23f7dae028247b7210","schema_version":"1.0","event_id":"sha256:4d493258abbaf2d3cb4c77c3d6368922acad18f97e8f0c23f7dae028247b7210"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/bundle.json","state_url":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBTP5ALB6SETDKQU247FLQDTXC/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-25T10:22:09Z","links":{"resolver":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC","bundle":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/bundle.json","state":"https://pith.science/pith/MBTP5ALB6SETDKQU247FLQDTXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBTP5ALB6SETDKQU247FLQDTXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MBTP5ALB6SETDKQU247FLQDTXC","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":"8556c5ff8c8dca1b4cbb7561f1d8255b61613b611e3ba9abefd141d1856eb4e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T16:51:40Z","title_canon_sha256":"515aa520304687c4076997ebfbb70fa696a42df0d3b95c7297f7f289c5856440"},"schema_version":"1.0","source":{"id":"1901.02399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02399","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02399v1","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02399","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"MBTP5ALB6SET","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBTP5ALB6SETDKQU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBTP5ALB","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:4d493258abbaf2d3cb4c77c3d6368922acad18f97e8f0c23f7dae028247b7210","target":"graph","created_at":"2026-05-17T23:56:43Z","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":"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","authors_text":"Ann Johnston, Carolyn Mayer, Emina Soljanin, Gauri Joshi, Gretchen Matthews, Sarah Anderson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T16:51:40Z","title":"Service Rate Region of Content Access from Erasure Coded Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02399","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:fa392080f393cfc100faeb7798174c7ae2b32536bebbb448ccdc402ff157c707","target":"record","created_at":"2026-05-17T23:56:43Z","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":"8556c5ff8c8dca1b4cbb7561f1d8255b61613b611e3ba9abefd141d1856eb4e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T16:51:40Z","title_canon_sha256":"515aa520304687c4076997ebfbb70fa696a42df0d3b95c7297f7f289c5856440"},"schema_version":"1.0","source":{"id":"1901.02399","kind":"arxiv","version":1}},"canonical_sha256":"6066fe8161f48931aa14d73e55c073b89f5ab9d5cbb10bde0b5be21a07da1b99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6066fe8161f48931aa14d73e55c073b89f5ab9d5cbb10bde0b5be21a07da1b99","first_computed_at":"2026-05-17T23:56:43.440411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:43.440411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4b3+BFTX9pVl4rIXE7rcnOmuIMoINS5kI0DsRO/m6P7FZfAqP2lP9GwrOC3W0G4t9DM4TjveyoN3iV0htGuRDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:43.440752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa392080f393cfc100faeb7798174c7ae2b32536bebbb448ccdc402ff157c707","sha256:4d493258abbaf2d3cb4c77c3d6368922acad18f97e8f0c23f7dae028247b7210"],"state_sha256":"111d87a79f34b9e169d94128e8491cc8c7e659f40a7e275708e9b7ee824f1899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMsvvjvf1J2+aMof0fPCTs44L//uMhdri2Gy13LhT/7L3CyVH0pIlM3xZFd3mehjkBbYHQzXTB48TOufLie5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:22:09.891463Z","bundle_sha256":"05a0ecd7468303af9a8f8bbba4e2656a842feaa53175ab8f69dbcfc36d84a145"}}