{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S5Z6OPITA7YEXY6AWRH6FTEASN","short_pith_number":"pith:S5Z6OPIT","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"},"canonical_sha256":"9773e73d1307f04be3c0b44fe2cc809352be1976ce74efd6e88621eea3844955","source":{"kind":"arxiv","id":"1605.05968","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05968","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05968v2","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05968","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"S5Z6OPITA7YE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S5Z6OPITA7YEXY6A","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S5Z6OPIT","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S5Z6OPITA7YEXY6AWRH6FTEASN","target":"record","payload":{"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"},"canonical_sha256":"9773e73d1307f04be3c0b44fe2cc809352be1976ce74efd6e88621eea3844955","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"},"source_kind":"arxiv","source_id":"1605.05968","source_version":2,"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:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07VdWvSozTOCSywvUN65/BM0K4rmcvbqVRGS8PbruA4sjmkt38nDztqqJjfZdNHyyuMf2954D+Y8cTpp3AL/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T15:49:02.883256Z"},"content_sha256":"7aa66b7c39fb17d7dbf6530690da8b93ea661d9cd3a3f8b7ab63de3bd92488e9","schema_version":"1.0","event_id":"sha256:7aa66b7c39fb17d7dbf6530690da8b93ea661d9cd3a3f8b7ab63de3bd92488e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S5Z6OPITA7YEXY6AWRH6FTEASN","target":"graph","payload":{"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"},"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:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wM2fmebW6ZGy41GtkBw8c4pVytM0hJB+9LfVB1nv6jlDLXjE2OeBNR2n50Q3c43bAic2+ZFwySf/uJdQxzmEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T15:49:02.883640Z"},"content_sha256":"161469806012a416f2e28aa123e2535a8f01d935baaad0336d91658ad209411f","schema_version":"1.0","event_id":"sha256:161469806012a416f2e28aa123e2535a8f01d935baaad0336d91658ad209411f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/bundle.json","state_url":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/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-20T15:49:02Z","links":{"resolver":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN","bundle":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/bundle.json","state":"https://pith.science/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5Z6OPITA7YEXY6AWRH6FTEASN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S5Z6OPITA7YEXY6AWRH6FTEASN","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":"287e51a0e5193dd323ca4fc5344c6e400ac2e12df0a2c9c9174c990886ce2719","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-19T14:19:30Z","title_canon_sha256":"39719fbc652eb9384d48af4aa7fadc4f784ac75e3422b430d8360a9545d946ab"},"schema_version":"1.0","source":{"id":"1605.05968","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05968","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05968v2","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05968","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"S5Z6OPITA7YE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S5Z6OPITA7YEXY6A","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S5Z6OPIT","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:161469806012a416f2e28aa123e2535a8f01d935baaad0336d91658ad209411f","target":"graph","created_at":"2026-05-18T00:50:52Z","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":"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","authors_text":"Alexander Stolyar, Sergey Foss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-19T14:19:30Z","title":"Large-scale Join-Idle-Queue system with general service times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05968","kind":"arxiv","version":2},"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:7aa66b7c39fb17d7dbf6530690da8b93ea661d9cd3a3f8b7ab63de3bd92488e9","target":"record","created_at":"2026-05-18T00:50:52Z","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":"287e51a0e5193dd323ca4fc5344c6e400ac2e12df0a2c9c9174c990886ce2719","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-19T14:19:30Z","title_canon_sha256":"39719fbc652eb9384d48af4aa7fadc4f784ac75e3422b430d8360a9545d946ab"},"schema_version":"1.0","source":{"id":"1605.05968","kind":"arxiv","version":2}},"canonical_sha256":"9773e73d1307f04be3c0b44fe2cc809352be1976ce74efd6e88621eea3844955","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9773e73d1307f04be3c0b44fe2cc809352be1976ce74efd6e88621eea3844955","first_computed_at":"2026-05-18T00:50:52.217170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:52.217170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/bvILGdymE8V1yCgg3kJuJPqvSE5VdY/52z/LWeaEmBVEp7SDKhygJ6acTmHPTh7NqX+9msMhg2FeMAFpKULCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:52.217751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05968","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aa66b7c39fb17d7dbf6530690da8b93ea661d9cd3a3f8b7ab63de3bd92488e9","sha256:161469806012a416f2e28aa123e2535a8f01d935baaad0336d91658ad209411f"],"state_sha256":"ed2e6f3c7bcd763e4eb59d10819e5cf20df72d3ff92aa3dfda6c6e9cfaef5bc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mbulh7qhvcW0tUavWlTRFJdNBuifpolLhSE6NyUw4fIvh1hT0Qy2ryAkk5O8giXJ0oYRmqclt6vq4vQqGmQICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T15:49:02.885794Z","bundle_sha256":"8f564ca4c3c5b9424dfa4ffa7abf0a9fd6b75e7ac8ded7318d0c9a2768c0dabc"}}