{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7KTBUIAY54SCBM5V3IBKXAJWGT","short_pith_number":"pith:7KTBUIAY","canonical_record":{"source":{"id":"1801.02979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-06T19:16:35Z","cross_cats_sorted":[],"title_canon_sha256":"d5031c5b29f7ef0dccd1fe428c7dabd51e7f43f7f888e2bd22e1e6033c5506eb","abstract_canon_sha256":"1fdf3672cafff7448e7aa9f52fe2d590bfecfd05b774af8503b3a1a37b1393c6"},"schema_version":"1.0"},"canonical_sha256":"faa61a2018ef2420b3b5da02ab813634ff63dad876df004a35845c578209e799","source":{"kind":"arxiv","id":"1801.02979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02979","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02979v1","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02979","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"7KTBUIAY54SC","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7KTBUIAY54SCBM5V","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7KTBUIAY","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7KTBUIAY54SCBM5V3IBKXAJWGT","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-06T19:16:35Z","cross_cats_sorted":[],"title_canon_sha256":"d5031c5b29f7ef0dccd1fe428c7dabd51e7f43f7f888e2bd22e1e6033c5506eb","abstract_canon_sha256":"1fdf3672cafff7448e7aa9f52fe2d590bfecfd05b774af8503b3a1a37b1393c6"},"schema_version":"1.0"},"canonical_sha256":"faa61a2018ef2420b3b5da02ab813634ff63dad876df004a35845c578209e799","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:21.839457Z","signature_b64":"tii1/Mhp8AiRK10eS+ijdZo0nnpHEEcjKG3HlyfMJw0zPH+jY9ITWrFylUMqDIvoymJ46spIc9udAfbBORe9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa61a2018ef2420b3b5da02ab813634ff63dad876df004a35845c578209e799","last_reissued_at":"2026-05-18T00:26:21.838758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:21.838758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02979","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:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJeEavrITu8FwoYmrH6AF2jAyQJC6WwENjYt2qbnjOTKeHijWNDrft1khsl4Fp9x/dEZtd04tVAMAfJgXMi/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:54:57.420504Z"},"content_sha256":"6e8606e13eb6d5c4b5d251cdb440b83fc2bba7fbae2c459b3f409e0d1e24a5ca","schema_version":"1.0","event_id":"sha256:6e8606e13eb6d5c4b5d251cdb440b83fc2bba7fbae2c459b3f409e0d1e24a5ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7KTBUIAY54SCBM5V3IBKXAJWGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Steady-State Behavior of Some Load Balancing Mechanisms in Cloud Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eric Friedlander","submitted_at":"2018-01-06T19:16:35Z","abstract_excerpt":"In large storage systems, files are often coded across several servers to improve reliability and retrieval speed. We consider a system of $n$ servers storing files using a Maximum Distance Separable code (cf. \\cite{li2016mean}). Specifically, each file is stored in equally sized pieces across $L$ servers such that any $k$ pieces can reconstruct the original file. File requests are routed using the Batch Sampling routing scheme. I.e. when a request for a file is received, a centralized dispatcher routes the job into the $k$-shortest queues among the $L$ for which the corresponding server conta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02979","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:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4xzXZMIh+ootE9B0oLPZbY1fG3kvL1VsBHwDhP51qnjZfbI+HwR0oC33EiUPVbwuB/EEr0fTIF4qco5WSIQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:54:57.421103Z"},"content_sha256":"307c767296a12160c53255eb4a1c16f885e5ba2677a63f7e83bdcd55316690f9","schema_version":"1.0","event_id":"sha256:307c767296a12160c53255eb4a1c16f885e5ba2677a63f7e83bdcd55316690f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KTBUIAY54SCBM5V3IBKXAJWGT/bundle.json","state_url":"https://pith.science/pith/7KTBUIAY54SCBM5V3IBKXAJWGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KTBUIAY54SCBM5V3IBKXAJWGT/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-27T15:54:57Z","links":{"resolver":"https://pith.science/pith/7KTBUIAY54SCBM5V3IBKXAJWGT","bundle":"https://pith.science/pith/7KTBUIAY54SCBM5V3IBKXAJWGT/bundle.json","state":"https://pith.science/pith/7KTBUIAY54SCBM5V3IBKXAJWGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KTBUIAY54SCBM5V3IBKXAJWGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7KTBUIAY54SCBM5V3IBKXAJWGT","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":"1fdf3672cafff7448e7aa9f52fe2d590bfecfd05b774af8503b3a1a37b1393c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-06T19:16:35Z","title_canon_sha256":"d5031c5b29f7ef0dccd1fe428c7dabd51e7f43f7f888e2bd22e1e6033c5506eb"},"schema_version":"1.0","source":{"id":"1801.02979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02979","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02979v1","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02979","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"7KTBUIAY54SC","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7KTBUIAY54SCBM5V","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7KTBUIAY","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:307c767296a12160c53255eb4a1c16f885e5ba2677a63f7e83bdcd55316690f9","target":"graph","created_at":"2026-05-18T00:26:21Z","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":"In large storage systems, files are often coded across several servers to improve reliability and retrieval speed. We consider a system of $n$ servers storing files using a Maximum Distance Separable code (cf. \\cite{li2016mean}). Specifically, each file is stored in equally sized pieces across $L$ servers such that any $k$ pieces can reconstruct the original file. File requests are routed using the Batch Sampling routing scheme. I.e. when a request for a file is received, a centralized dispatcher routes the job into the $k$-shortest queues among the $L$ for which the corresponding server conta","authors_text":"Eric Friedlander","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-06T19:16:35Z","title":"Steady-State Behavior of Some Load Balancing Mechanisms in Cloud Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02979","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:6e8606e13eb6d5c4b5d251cdb440b83fc2bba7fbae2c459b3f409e0d1e24a5ca","target":"record","created_at":"2026-05-18T00:26:21Z","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":"1fdf3672cafff7448e7aa9f52fe2d590bfecfd05b774af8503b3a1a37b1393c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-06T19:16:35Z","title_canon_sha256":"d5031c5b29f7ef0dccd1fe428c7dabd51e7f43f7f888e2bd22e1e6033c5506eb"},"schema_version":"1.0","source":{"id":"1801.02979","kind":"arxiv","version":1}},"canonical_sha256":"faa61a2018ef2420b3b5da02ab813634ff63dad876df004a35845c578209e799","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faa61a2018ef2420b3b5da02ab813634ff63dad876df004a35845c578209e799","first_computed_at":"2026-05-18T00:26:21.838758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:21.838758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tii1/Mhp8AiRK10eS+ijdZo0nnpHEEcjKG3HlyfMJw0zPH+jY9ITWrFylUMqDIvoymJ46spIc9udAfbBORe9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:21.839457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e8606e13eb6d5c4b5d251cdb440b83fc2bba7fbae2c459b3f409e0d1e24a5ca","sha256:307c767296a12160c53255eb4a1c16f885e5ba2677a63f7e83bdcd55316690f9"],"state_sha256":"a13ee685beaefb075e3d5d9753fc2b9b61d59f2b51620eaa0d8700bc82f5d1fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GH86sTgT0AEC9g1+GZW6SoiNCU56muKtX35ApukZYbffqnhOq+1h4qL9HDM1HR/lIgfangeyLoMhpIhoi25CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:54:57.424739Z","bundle_sha256":"c3a73a5c5daf390dc2a82cdc7a3d7673f5ad8cf98dd8fdb25f21d247624609b3"}}