{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ASKN64JO3WDCSPTCLT3HHC332J","short_pith_number":"pith:ASKN64JO","canonical_record":{"source":{"id":"1805.07686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-05-20T01:07:03Z","cross_cats_sorted":[],"title_canon_sha256":"cb5b01fd3b3cca3f55d458fbeab8f4583bc9b9e80730c073299daec298a37034","abstract_canon_sha256":"9267ff0133012f4011e2a817dabeaabfee55ef13639ff2f718abfd939f7ffbea"},"schema_version":"1.0"},"canonical_sha256":"0494df712edd86293e625cf6738b7bd267d41b6738ac5ce0383c1b94e1cca39e","source":{"kind":"arxiv","id":"1805.07686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07686","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07686v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07686","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"ASKN64JO3WDC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASKN64JO3WDCSPTC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASKN64JO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ASKN64JO3WDCSPTCLT3HHC332J","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-05-20T01:07:03Z","cross_cats_sorted":[],"title_canon_sha256":"cb5b01fd3b3cca3f55d458fbeab8f4583bc9b9e80730c073299daec298a37034","abstract_canon_sha256":"9267ff0133012f4011e2a817dabeaabfee55ef13639ff2f718abfd939f7ffbea"},"schema_version":"1.0"},"canonical_sha256":"0494df712edd86293e625cf6738b7bd267d41b6738ac5ce0383c1b94e1cca39e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.833694Z","signature_b64":"Ye2zE5qC/f0PbZDcjeRy/un+qj34NioivOgWZxNVJWTwWhQETdRjUA2lD4AW7LMYSQGMHVpbYjuS/bWr6IfjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0494df712edd86293e625cf6738b7bd267d41b6738ac5ce0383c1b94e1cca39e","last_reissued_at":"2026-05-18T00:15:32.833110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.833110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07686","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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtUeZgT1Tc4CbZXShqrFjsuVxmKFHKuDZsX9QFPV/eQ5ldZcQ7RC3NRyMAXdK3nTo2Y2yBwc4oGLpc9HMHhZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:03:33.292626Z"},"content_sha256":"9c22b4d9a8a2a235a6e0a12951b99229c0a2d81f266fccaf0b0af97c16267c3d","schema_version":"1.0","event_id":"sha256:9c22b4d9a8a2a235a6e0a12951b99229c0a2d81f266fccaf0b0af97c16267c3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ASKN64JO3WDCSPTCLT3HHC332J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SRPT for Multiserver Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Isaac Grosof, Mor Harchol-Balter, Ziv Scully","submitted_at":"2018-05-20T01:07:03Z","abstract_excerpt":"The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings. While beautiful results are known for single-server SRPT, much less is known for multiserver SRPT. In particular, stochastic analysis of the M/G/k under multiserver SRPT is entirely open. Intuition suggests that multiserver SRPT should be optimal or near-optimal for minimizing mean response time. However, the only known analysis of multiserver SRPT is in the worst-case adversarial setting, where SRPT can be far from optimal. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07686","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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHKcIjIgkpgFEuqjcsogUIvJOIMVFTplADVW3eZRNb1XyCWXP6QGGQ/K1rGXr0TRPnOWjDRwo3LBiovlgg0eAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:03:33.293303Z"},"content_sha256":"10dbbd52bbad4cd624a33c8c3579a90d4e703894be91285260298a5401392200","schema_version":"1.0","event_id":"sha256:10dbbd52bbad4cd624a33c8c3579a90d4e703894be91285260298a5401392200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASKN64JO3WDCSPTCLT3HHC332J/bundle.json","state_url":"https://pith.science/pith/ASKN64JO3WDCSPTCLT3HHC332J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASKN64JO3WDCSPTCLT3HHC332J/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-18T20:03:33Z","links":{"resolver":"https://pith.science/pith/ASKN64JO3WDCSPTCLT3HHC332J","bundle":"https://pith.science/pith/ASKN64JO3WDCSPTCLT3HHC332J/bundle.json","state":"https://pith.science/pith/ASKN64JO3WDCSPTCLT3HHC332J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASKN64JO3WDCSPTCLT3HHC332J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ASKN64JO3WDCSPTCLT3HHC332J","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":"9267ff0133012f4011e2a817dabeaabfee55ef13639ff2f718abfd939f7ffbea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-05-20T01:07:03Z","title_canon_sha256":"cb5b01fd3b3cca3f55d458fbeab8f4583bc9b9e80730c073299daec298a37034"},"schema_version":"1.0","source":{"id":"1805.07686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07686","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07686v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07686","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"ASKN64JO3WDC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASKN64JO3WDCSPTC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASKN64JO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:10dbbd52bbad4cd624a33c8c3579a90d4e703894be91285260298a5401392200","target":"graph","created_at":"2026-05-18T00:15:32Z","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":"The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings. While beautiful results are known for single-server SRPT, much less is known for multiserver SRPT. In particular, stochastic analysis of the M/G/k under multiserver SRPT is entirely open. Intuition suggests that multiserver SRPT should be optimal or near-optimal for minimizing mean response time. However, the only known analysis of multiserver SRPT is in the worst-case adversarial setting, where SRPT can be far from optimal. In this paper, w","authors_text":"Isaac Grosof, Mor Harchol-Balter, Ziv Scully","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-05-20T01:07:03Z","title":"SRPT for Multiserver Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07686","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:9c22b4d9a8a2a235a6e0a12951b99229c0a2d81f266fccaf0b0af97c16267c3d","target":"record","created_at":"2026-05-18T00:15:32Z","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":"9267ff0133012f4011e2a817dabeaabfee55ef13639ff2f718abfd939f7ffbea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-05-20T01:07:03Z","title_canon_sha256":"cb5b01fd3b3cca3f55d458fbeab8f4583bc9b9e80730c073299daec298a37034"},"schema_version":"1.0","source":{"id":"1805.07686","kind":"arxiv","version":1}},"canonical_sha256":"0494df712edd86293e625cf6738b7bd267d41b6738ac5ce0383c1b94e1cca39e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0494df712edd86293e625cf6738b7bd267d41b6738ac5ce0383c1b94e1cca39e","first_computed_at":"2026-05-18T00:15:32.833110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:32.833110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ye2zE5qC/f0PbZDcjeRy/un+qj34NioivOgWZxNVJWTwWhQETdRjUA2lD4AW7LMYSQGMHVpbYjuS/bWr6IfjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:32.833694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c22b4d9a8a2a235a6e0a12951b99229c0a2d81f266fccaf0b0af97c16267c3d","sha256:10dbbd52bbad4cd624a33c8c3579a90d4e703894be91285260298a5401392200"],"state_sha256":"bb079fe766430a3d37a8046e3814326c12184f21c1c44aab8611247200dfed51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEVpXkHHvPuHjmqa1xm+PT5+jf1hwfZGp11fWqDNnQKgH1RNOSwF43faBUqJYwwAkgU0KW/So5fX5wuLsD2gCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:03:33.295525Z","bundle_sha256":"158b113d6da990ecf54ddbdfb5fa3d533034c88814f70e490e9d81ccfccc6b32"}}