{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OHTZHG5OT57MHUQXCUIFEJSPRE","short_pith_number":"pith:OHTZHG5O","canonical_record":{"source":{"id":"1904.10331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-23T13:49:57Z","cross_cats_sorted":[],"title_canon_sha256":"555f4591d9078c48ed9e2fb651972a3d224f4004f93611cfbd68f8b2fd8ea00a","abstract_canon_sha256":"41ac6050df80037a5c60552760accb894e3c3e320a2850ccd87746295e09c988"},"schema_version":"1.0"},"canonical_sha256":"71e7939bae9f7ec3d217151052264f89393c270baded84449c63dd9ca66e2434","source":{"kind":"arxiv","id":"1904.10331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10331","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10331v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10331","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"OHTZHG5OT57M","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHTZHG5OT57MHUQX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHTZHG5O","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OHTZHG5OT57MHUQXCUIFEJSPRE","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-23T13:49:57Z","cross_cats_sorted":[],"title_canon_sha256":"555f4591d9078c48ed9e2fb651972a3d224f4004f93611cfbd68f8b2fd8ea00a","abstract_canon_sha256":"41ac6050df80037a5c60552760accb894e3c3e320a2850ccd87746295e09c988"},"schema_version":"1.0"},"canonical_sha256":"71e7939bae9f7ec3d217151052264f89393c270baded84449c63dd9ca66e2434","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:54.414543Z","signature_b64":"DnE+zFdioBbsr5a9Ac72vYlmwoPmL1sOYQJ6veOZIFNutVPbjJEhHdlz9HpK18mA1AYem87f1JSVEm+X9BPlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71e7939bae9f7ec3d217151052264f89393c270baded84449c63dd9ca66e2434","last_reissued_at":"2026-05-17T23:47:54.413970Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:54.413970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10331","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:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBHC+WVLgIUw+gijhw76ktUmiQcck2oHs+UfOk58+1zeis0THjjZVSc001BSJTJ6H2y4LcskQ/WUurVt9yU5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:12:18.834911Z"},"content_sha256":"0b27b8e623086684f8b3327a1ce36cc84fe99f8ab4db7f2f7e9ff9eacc454c10","schema_version":"1.0","event_id":"sha256:0b27b8e623086684f8b3327a1ce36cc84fe99f8ab4db7f2f7e9ff9eacc454c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OHTZHG5OT57MHUQXCUIFEJSPRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability of Parallel Server Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ohad Perry, Pascal Moyal","submitted_at":"2019-04-23T13:49:57Z","abstract_excerpt":"The fundamental problem in the study of parallel-server systems is that of finding and analyzing `good' routing policies of arriving jobs to the servers. It is well known that, if full information regarding the workload process is available to a central dispatcher, then the {\\em join the shortest workload} (JSW) policy, which assigns jobs to the server with the least workload, is the optimal assignment policy, in that it maximizes server utilization, and thus minimizes sojourn times. The {\\em join the shortest queue} (JSQ) policy is an efficient dispatching policy when information is available"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10331","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:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5o1M/1hJVxHSqI224gOtPDBsgoP08r4+awH3uhWuVLm9WE+3dMxtMcH9ProTCH2hj6jWaF+8VfRRYNckbtaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:12:18.835629Z"},"content_sha256":"ee402fbc90e9fce2b8657c4e7e3b0d8c855673809ba8fd0fc09cf764e195c343","schema_version":"1.0","event_id":"sha256:ee402fbc90e9fce2b8657c4e7e3b0d8c855673809ba8fd0fc09cf764e195c343"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/bundle.json","state_url":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/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-07-02T14:12:18Z","links":{"resolver":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE","bundle":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/bundle.json","state":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OHTZHG5OT57MHUQXCUIFEJSPRE","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":"41ac6050df80037a5c60552760accb894e3c3e320a2850ccd87746295e09c988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-23T13:49:57Z","title_canon_sha256":"555f4591d9078c48ed9e2fb651972a3d224f4004f93611cfbd68f8b2fd8ea00a"},"schema_version":"1.0","source":{"id":"1904.10331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10331","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10331v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10331","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"OHTZHG5OT57M","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHTZHG5OT57MHUQX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHTZHG5O","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:ee402fbc90e9fce2b8657c4e7e3b0d8c855673809ba8fd0fc09cf764e195c343","target":"graph","created_at":"2026-05-17T23:47:54Z","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 fundamental problem in the study of parallel-server systems is that of finding and analyzing `good' routing policies of arriving jobs to the servers. It is well known that, if full information regarding the workload process is available to a central dispatcher, then the {\\em join the shortest workload} (JSW) policy, which assigns jobs to the server with the least workload, is the optimal assignment policy, in that it maximizes server utilization, and thus minimizes sojourn times. The {\\em join the shortest queue} (JSQ) policy is an efficient dispatching policy when information is available","authors_text":"Ohad Perry, Pascal Moyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-23T13:49:57Z","title":"Stability of Parallel Server Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10331","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:0b27b8e623086684f8b3327a1ce36cc84fe99f8ab4db7f2f7e9ff9eacc454c10","target":"record","created_at":"2026-05-17T23:47:54Z","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":"41ac6050df80037a5c60552760accb894e3c3e320a2850ccd87746295e09c988","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-04-23T13:49:57Z","title_canon_sha256":"555f4591d9078c48ed9e2fb651972a3d224f4004f93611cfbd68f8b2fd8ea00a"},"schema_version":"1.0","source":{"id":"1904.10331","kind":"arxiv","version":1}},"canonical_sha256":"71e7939bae9f7ec3d217151052264f89393c270baded84449c63dd9ca66e2434","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71e7939bae9f7ec3d217151052264f89393c270baded84449c63dd9ca66e2434","first_computed_at":"2026-05-17T23:47:54.413970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:54.413970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DnE+zFdioBbsr5a9Ac72vYlmwoPmL1sOYQJ6veOZIFNutVPbjJEhHdlz9HpK18mA1AYem87f1JSVEm+X9BPlCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:54.414543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b27b8e623086684f8b3327a1ce36cc84fe99f8ab4db7f2f7e9ff9eacc454c10","sha256:ee402fbc90e9fce2b8657c4e7e3b0d8c855673809ba8fd0fc09cf764e195c343"],"state_sha256":"8cab0bef69b509110dd7ed6acb6057198985bfe1268d683b071c72892836814a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9A+TZneIpfv5b3BKo56VEljzYI2X24DxKdee/l4RxWW91fSJHAFJyOXwex1Hd2fyAAoHLk43NO1g6PELD7eWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T14:12:18.838753Z","bundle_sha256":"7fdae3fbdde4fa9f6883b9d0953433520cc9cef58c326f41e75f58f692f2144a"}}