{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ILF665GQZBDGGB4ODPF6DD2OP3","short_pith_number":"pith:ILF665GQ","canonical_record":{"source":{"id":"1010.1749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-08T17:48:40Z","cross_cats_sorted":[],"title_canon_sha256":"b2f0b3eb47fe960f5f69f1706f804f7f432decfed8d390b48b76192f54d10682","abstract_canon_sha256":"a496dbe3cf0bb91bd06d40f071d56a2645ad65e4dc5a3aff1c558de282a6ad59"},"schema_version":"1.0"},"canonical_sha256":"42cbef74d0c84663078e1bcbe18f4e7ec16d9ff9fcbf4dc553e47d410312d571","source":{"kind":"arxiv","id":"1010.1749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1749","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1749v1","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1749","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"ILF665GQZBDG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILF665GQZBDGGB4O","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILF665GQ","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ILF665GQZBDGGB4ODPF6DD2OP3","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-08T17:48:40Z","cross_cats_sorted":[],"title_canon_sha256":"b2f0b3eb47fe960f5f69f1706f804f7f432decfed8d390b48b76192f54d10682","abstract_canon_sha256":"a496dbe3cf0bb91bd06d40f071d56a2645ad65e4dc5a3aff1c558de282a6ad59"},"schema_version":"1.0"},"canonical_sha256":"42cbef74d0c84663078e1bcbe18f4e7ec16d9ff9fcbf4dc553e47d410312d571","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:39.739918Z","signature_b64":"z4GCWJ9MEM8ys2D7uScpRDJBIROuLaUQpGkuD1poek4D3Z87s/sSfaSIZ2ZtOv8/g4sVXtvdhSmMTykIr7ynBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42cbef74d0c84663078e1bcbe18f4e7ec16d9ff9fcbf4dc553e47d410312d571","last_reissued_at":"2026-05-18T04:39:39.739293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:39.739293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1749","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-18T04:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCy6TmiHCTyBr27wcGswo/yIXR5hPb6Xxuarwvydoom/ZAA3qREBR+GBSq3iOYt+87l3+8CeLJfJZgTdYwSxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:51:25.081518Z"},"content_sha256":"bc25ae6a62a6440dfc61c77c54031d3b4c117a040f818c21c7d42ee641a966ec","schema_version":"1.0","event_id":"sha256:bc25ae6a62a6440dfc61c77c54031d3b4c117a040f818c21c7d42ee641a966ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ILF665GQZBDGGB4ODPF6DD2OP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability of Join the Shortest Queue Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Maury Bramson","submitted_at":"2010-10-08T17:48:40Z","abstract_excerpt":"Join the shortest queue (JSQ) refers to networks whose incoming jobs are assigned to the shortest queue from among a randomly chosen subset of the queues in the system. After completion of service at the queue, a job leaves the network. We show that, for all non- idling service disciplines and for general interarrival and service time distributions, such networks are stable when they are subcritical. We then obtain uniform bounds on the tails of the marginal distributions of the equilibria for families of such networks; these bounds are employed to show relative compactness of the marginal dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1749","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-18T04:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AF0Odi9Po0FKg+/4i35iV9mBklMCODw3PZ2/hAMEItU5QKL6i3aqj4Apiuo+SmiimUyDKgADMZqOy00bA0EWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:51:25.081950Z"},"content_sha256":"5c656d73fe5d07b3e4675c275abc56e06d6fc90663062fb7fe527a783da3f96f","schema_version":"1.0","event_id":"sha256:5c656d73fe5d07b3e4675c275abc56e06d6fc90663062fb7fe527a783da3f96f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILF665GQZBDGGB4ODPF6DD2OP3/bundle.json","state_url":"https://pith.science/pith/ILF665GQZBDGGB4ODPF6DD2OP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILF665GQZBDGGB4ODPF6DD2OP3/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-30T16:51:25Z","links":{"resolver":"https://pith.science/pith/ILF665GQZBDGGB4ODPF6DD2OP3","bundle":"https://pith.science/pith/ILF665GQZBDGGB4ODPF6DD2OP3/bundle.json","state":"https://pith.science/pith/ILF665GQZBDGGB4ODPF6DD2OP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILF665GQZBDGGB4ODPF6DD2OP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ILF665GQZBDGGB4ODPF6DD2OP3","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":"a496dbe3cf0bb91bd06d40f071d56a2645ad65e4dc5a3aff1c558de282a6ad59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-08T17:48:40Z","title_canon_sha256":"b2f0b3eb47fe960f5f69f1706f804f7f432decfed8d390b48b76192f54d10682"},"schema_version":"1.0","source":{"id":"1010.1749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1749","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1749v1","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1749","created_at":"2026-05-18T04:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"ILF665GQZBDG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILF665GQZBDGGB4O","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILF665GQ","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:5c656d73fe5d07b3e4675c275abc56e06d6fc90663062fb7fe527a783da3f96f","target":"graph","created_at":"2026-05-18T04:39:39Z","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":"Join the shortest queue (JSQ) refers to networks whose incoming jobs are assigned to the shortest queue from among a randomly chosen subset of the queues in the system. After completion of service at the queue, a job leaves the network. We show that, for all non- idling service disciplines and for general interarrival and service time distributions, such networks are stable when they are subcritical. We then obtain uniform bounds on the tails of the marginal distributions of the equilibria for families of such networks; these bounds are employed to show relative compactness of the marginal dis","authors_text":"Maury Bramson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-08T17:48:40Z","title":"Stability of Join the Shortest Queue Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1749","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:bc25ae6a62a6440dfc61c77c54031d3b4c117a040f818c21c7d42ee641a966ec","target":"record","created_at":"2026-05-18T04:39:39Z","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":"a496dbe3cf0bb91bd06d40f071d56a2645ad65e4dc5a3aff1c558de282a6ad59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-08T17:48:40Z","title_canon_sha256":"b2f0b3eb47fe960f5f69f1706f804f7f432decfed8d390b48b76192f54d10682"},"schema_version":"1.0","source":{"id":"1010.1749","kind":"arxiv","version":1}},"canonical_sha256":"42cbef74d0c84663078e1bcbe18f4e7ec16d9ff9fcbf4dc553e47d410312d571","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42cbef74d0c84663078e1bcbe18f4e7ec16d9ff9fcbf4dc553e47d410312d571","first_computed_at":"2026-05-18T04:39:39.739293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:39.739293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z4GCWJ9MEM8ys2D7uScpRDJBIROuLaUQpGkuD1poek4D3Z87s/sSfaSIZ2ZtOv8/g4sVXtvdhSmMTykIr7ynBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:39.739918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc25ae6a62a6440dfc61c77c54031d3b4c117a040f818c21c7d42ee641a966ec","sha256:5c656d73fe5d07b3e4675c275abc56e06d6fc90663062fb7fe527a783da3f96f"],"state_sha256":"480370342895db4650f29a4149b560ee1188b50a5d7255dd05ec99cdcf891f00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7cNwCQkvctDK9r0KuVPu8bnR37ViDYdPKZtqeAUhJdveoLpJoOoEM4+tYOy071+jvGcQimCSSnItCYi0UtZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:51:25.085302Z","bundle_sha256":"d1ff9781d0db1d5f0d70c9fd6af007ea2efcd23b861db6c928025253da92cb99"}}