{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OHTZHG5OT57MHUQXCUIFEJSPRE","short_pith_number":"pith:OHTZHG5O","schema_version":"1.0","canonical_sha256":"71e7939bae9f7ec3d217151052264f89393c270baded84449c63dd9ca66e2434","source":{"kind":"arxiv","id":"1904.10331","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.10331","created_at":"2026-05-17T23:47:54.414065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10331v1","created_at":"2026-05-17T23:47:54.414065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10331","created_at":"2026-05-17T23:47:54.414065+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHTZHG5OT57M","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHTZHG5OT57MHUQX","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHTZHG5O","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE","json":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE.json","graph_json":"https://pith.science/api/pith-number/OHTZHG5OT57MHUQXCUIFEJSPRE/graph.json","events_json":"https://pith.science/api/pith-number/OHTZHG5OT57MHUQXCUIFEJSPRE/events.json","paper":"https://pith.science/paper/OHTZHG5O"},"agent_actions":{"view_html":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE","download_json":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE.json","view_paper":"https://pith.science/paper/OHTZHG5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10331&json=true","fetch_graph":"https://pith.science/api/pith-number/OHTZHG5OT57MHUQXCUIFEJSPRE/graph.json","fetch_events":"https://pith.science/api/pith-number/OHTZHG5OT57MHUQXCUIFEJSPRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/action/storage_attestation","attest_author":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/action/author_attestation","sign_citation":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/action/citation_signature","submit_replication":"https://pith.science/pith/OHTZHG5OT57MHUQXCUIFEJSPRE/action/replication_record"}},"created_at":"2026-05-17T23:47:54.414065+00:00","updated_at":"2026-05-17T23:47:54.414065+00:00"}