{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S5Z6OPITA7YEXY6AWRH6FTEASN","short_pith_number":"pith:S5Z6OPIT","schema_version":"1.0","canonical_sha256":"9773e73d1307f04be3c0b44fe2cc809352be1976ce74efd6e88621eea3844955","source":{"kind":"arxiv","id":"1605.05968","version":2},"attestation_state":"computed","paper":{"title":"Large-scale Join-Idle-Queue system with general service times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Stolyar, Sergey Foss","submitted_at":"2016-05-19T14:19:30Z","abstract_excerpt":"A parallel server system with $n$ identical servers is considered. The service time distribution has a finite mean $1/\\mu$, but otherwise is arbitrary. Arriving customers are be routed to one of the servers immediately upon arrival. Join-Idle-Queue routing algorithm is studied, under which an arriving customer is sent to an idle server, if such is available, and to a randomly uniformly chosen server, otherwise. We consider the asymptotic regime where $n\\to\\infty$ and the customer input flow rate is $\\lambda n$. Under the condition $\\lambda/\\mu<1/2$, we prove that, as $n\\to\\infty$, the sequence"},"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":"1605.05968","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-19T14:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"39719fbc652eb9384d48af4aa7fadc4f784ac75e3422b430d8360a9545d946ab","abstract_canon_sha256":"287e51a0e5193dd323ca4fc5344c6e400ac2e12df0a2c9c9174c990886ce2719"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:52.217751Z","signature_b64":"/bvILGdymE8V1yCgg3kJuJPqvSE5VdY/52z/LWeaEmBVEp7SDKhygJ6acTmHPTh7NqX+9msMhg2FeMAFpKULCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9773e73d1307f04be3c0b44fe2cc809352be1976ce74efd6e88621eea3844955","last_reissued_at":"2026-05-18T00:50:52.217170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:52.217170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-scale Join-Idle-Queue system with general service times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Stolyar, Sergey Foss","submitted_at":"2016-05-19T14:19:30Z","abstract_excerpt":"A parallel server system with $n$ identical servers is considered. The service time distribution has a finite mean $1/\\mu$, but otherwise is arbitrary. Arriving customers are be routed to one of the servers immediately upon arrival. Join-Idle-Queue routing algorithm is studied, under which an arriving customer is sent to an idle server, if such is available, and to a randomly uniformly chosen server, otherwise. We consider the asymptotic regime where $n\\to\\infty$ and the customer input flow rate is $\\lambda n$. Under the condition $\\lambda/\\mu<1/2$, we prove that, as $n\\to\\infty$, the sequence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05968","kind":"arxiv","version":2},"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":"1605.05968","created_at":"2026-05-18T00:50:52.217242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05968v2","created_at":"2026-05-18T00:50:52.217242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05968","created_at":"2026-05-18T00:50:52.217242+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5Z6OPITA7YE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5Z6OPITA7YEXY6A","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5Z6OPIT","created_at":"2026-05-18T12:30:44.179134+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/S5Z6OPITA7YEXY6AWRH6FTEASN","json":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN.json","graph_json":"https://pith.science/api/pith-number/S5Z6OPITA7YEXY6AWRH6FTEASN/graph.json","events_json":"https://pith.science/api/pith-number/S5Z6OPITA7YEXY6AWRH6FTEASN/events.json","paper":"https://pith.science/paper/S5Z6OPIT"},"agent_actions":{"view_html":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN","download_json":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN.json","view_paper":"https://pith.science/paper/S5Z6OPIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05968&json=true","fetch_graph":"https://pith.science/api/pith-number/S5Z6OPITA7YEXY6AWRH6FTEASN/graph.json","fetch_events":"https://pith.science/api/pith-number/S5Z6OPITA7YEXY6AWRH6FTEASN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/action/storage_attestation","attest_author":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/action/author_attestation","sign_citation":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/action/citation_signature","submit_replication":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/action/replication_record"}},"created_at":"2026-05-18T00:50:52.217242+00:00","updated_at":"2026-05-18T00:50:52.217242+00:00"}