{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MH6Y62SMS25KAFKUNPWHQBKKPG","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":"be118be4eecf48c4783666454da1347a1a1a4aa6440f6f9435971798e0471e30","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-23T18:58:15Z","title_canon_sha256":"ac8374c61e104674591a2663fb15b593b3cb12c22d5a3acb5892addbc014550b"},"schema_version":"1.0","source":{"id":"2010.12614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12614","created_at":"2026-07-05T01:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12614v1","created_at":"2026-07-05T01:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12614","created_at":"2026-07-05T01:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"MH6Y62SMS25K","created_at":"2026-07-05T01:45:46Z"},{"alias_kind":"pith_short_16","alias_value":"MH6Y62SMS25KAFKU","created_at":"2026-07-05T01:45:46Z"},{"alias_kind":"pith_short_8","alias_value":"MH6Y62SM","created_at":"2026-07-05T01:45:46Z"}],"graph_snapshots":[{"event_id":"sha256:aeb170b40b7a9d7c9d2807380b2923dea853f1d6d1a7c50251a3de5177eae961","target":"graph","created_at":"2026-07-05T01:45:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.12614/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A major concern in cloud/edge storage systems is serving a large number of users simultaneously. The service rate region is introduced recently as an important performance metric for coded distributed systems, which is defined as the set of all data access requests that can be simultaneously handled by the system. This paper studies the problem of designing a coded distributed storage system storing k files where a desired service rate region R of the system is given and the goal is 1) to determine the minimum number of storage nodes n(R) (or a lower bound on n(R)) for serving all demand vecto","authors_text":"Alex Sprintson, Emina Soljanin, Fatemeh Kazemi, Sascha Kurz","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-23T18:58:15Z","title":"Efficient Storage Schemes for Desired Service Rate Regions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12614","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:52e982b522032a31e820df1dff6b1f0f561565636cd015abb3e9f7c6534d4bdb","target":"record","created_at":"2026-07-05T01:45:46Z","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":"be118be4eecf48c4783666454da1347a1a1a4aa6440f6f9435971798e0471e30","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-23T18:58:15Z","title_canon_sha256":"ac8374c61e104674591a2663fb15b593b3cb12c22d5a3acb5892addbc014550b"},"schema_version":"1.0","source":{"id":"2010.12614","kind":"arxiv","version":1}},"canonical_sha256":"61fd8f6a4c96baa015546bec78054a798dd48fc79468ea2bf6c696a924882748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61fd8f6a4c96baa015546bec78054a798dd48fc79468ea2bf6c696a924882748","first_computed_at":"2026-07-05T01:45:46.465027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:46.465027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LFoh4kppu0Ic+XayilE3sIfR4QLnPk5PGolu70Bal0o16wsM541sIFG+qCUShU1Ga8cKy1UJXPgXLsOOguOqAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:46.465542Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.12614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52e982b522032a31e820df1dff6b1f0f561565636cd015abb3e9f7c6534d4bdb","sha256:aeb170b40b7a9d7c9d2807380b2923dea853f1d6d1a7c50251a3de5177eae961"],"state_sha256":"5a8d22bcd6e872f07edf0aa04d06f53ad663d877e8e1fb050eb2baf6e8e24b83"}