{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QPYKWTL6DCHHF2KMTQGHKRGW5G","short_pith_number":"pith:QPYKWTL6","canonical_record":{"source":{"id":"1512.07873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-24T18:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"378812e5aeaf78d59bcbedb4868ed528f35f6138c7c0878f2b545e2762c1171d","abstract_canon_sha256":"70fb2fc772fe9b5e02637cdd2e5a3ae0fd41e50d3fd34a8ac7517f8e28eff2b2"},"schema_version":"1.0"},"canonical_sha256":"83f0ab4d7e188e72e94c9c0c7544d6e996cf09d67c0812e82908de3e280f327b","source":{"kind":"arxiv","id":"1512.07873","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07873","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07873v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07873","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"QPYKWTL6DCHH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QPYKWTL6DCHHF2KM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QPYKWTL6","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QPYKWTL6DCHHF2KMTQGHKRGW5G","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-24T18:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"378812e5aeaf78d59bcbedb4868ed528f35f6138c7c0878f2b545e2762c1171d","abstract_canon_sha256":"70fb2fc772fe9b5e02637cdd2e5a3ae0fd41e50d3fd34a8ac7517f8e28eff2b2"},"schema_version":"1.0"},"canonical_sha256":"83f0ab4d7e188e72e94c9c0c7544d6e996cf09d67c0812e82908de3e280f327b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.821000Z","signature_b64":"oElSbxaRS24iuew4UTGXY/JgH7h9JFmRZATFAbnaRDe/WnLp60xOj/Jb5YMAigdFVcHomrQMvJHiKdUm5qdlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83f0ab4d7e188e72e94c9c0c7544d6e996cf09d67c0812e82908de3e280f327b","last_reissued_at":"2026-05-18T01:09:55.820169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.820169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07873","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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1ELlzpiYoe4V1OtVN/lXWagrNgO26+uOiYOObLRlaRi6e5dfg9jKQGevK7MDriew5mnqzzM5Sc4V1iAwThjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:01:56.116716Z"},"content_sha256":"61ebc54a1ca08b6899f3489c6681d1b0c158f76f96ecb8b2bc8529fb6b72eb90","schema_version":"1.0","event_id":"sha256:61ebc54a1ca08b6899f3489c6681d1b0c158f76f96ecb8b2bc8529fb6b72eb90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QPYKWTL6DCHHF2KMTQGHKRGW5G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Stolyar","submitted_at":"2015-12-24T18:04:30Z","abstract_excerpt":"The model is a service system, consisting of several large server pools. A server processing speed and buffer size (which may be finite or infinite) depend on the pool. The input flow of customers is split equally among a fixed number of routers, which must assign customers to the servers immediately upon arrival. We consider an asymptotic regime in which the customer total arrival rate and pool sizes scale to infinity simultaneously, in proportion to a scaling parameter $n$, while the number of routers remains fixed.\n  We define and study a multi-router generalization of the pull-based custom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07873","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-18T01:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDr4tNEQgOysyWpPN7/5bNRgusM2HlnjdxXIWuC/dHSgkrISETl0Me2BRCifFqzxeX2jpGmRdIo+OtV3hBeNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:01:56.117445Z"},"content_sha256":"99e384694c102b47032b13cc052c35af1d6f0b4969aa8707163c94a091cfc40f","schema_version":"1.0","event_id":"sha256:99e384694c102b47032b13cc052c35af1d6f0b4969aa8707163c94a091cfc40f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPYKWTL6DCHHF2KMTQGHKRGW5G/bundle.json","state_url":"https://pith.science/pith/QPYKWTL6DCHHF2KMTQGHKRGW5G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPYKWTL6DCHHF2KMTQGHKRGW5G/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-06-11T03:01:56Z","links":{"resolver":"https://pith.science/pith/QPYKWTL6DCHHF2KMTQGHKRGW5G","bundle":"https://pith.science/pith/QPYKWTL6DCHHF2KMTQGHKRGW5G/bundle.json","state":"https://pith.science/pith/QPYKWTL6DCHHF2KMTQGHKRGW5G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPYKWTL6DCHHF2KMTQGHKRGW5G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QPYKWTL6DCHHF2KMTQGHKRGW5G","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":"70fb2fc772fe9b5e02637cdd2e5a3ae0fd41e50d3fd34a8ac7517f8e28eff2b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-24T18:04:30Z","title_canon_sha256":"378812e5aeaf78d59bcbedb4868ed528f35f6138c7c0878f2b545e2762c1171d"},"schema_version":"1.0","source":{"id":"1512.07873","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07873","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07873v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07873","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"QPYKWTL6DCHH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QPYKWTL6DCHHF2KM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QPYKWTL6","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:99e384694c102b47032b13cc052c35af1d6f0b4969aa8707163c94a091cfc40f","target":"graph","created_at":"2026-05-18T01:09:55Z","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 model is a service system, consisting of several large server pools. A server processing speed and buffer size (which may be finite or infinite) depend on the pool. The input flow of customers is split equally among a fixed number of routers, which must assign customers to the servers immediately upon arrival. We consider an asymptotic regime in which the customer total arrival rate and pool sizes scale to infinity simultaneously, in proportion to a scaling parameter $n$, while the number of routers remains fixed.\n  We define and study a multi-router generalization of the pull-based custom","authors_text":"Alexander Stolyar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-24T18:04:30Z","title":"Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07873","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:61ebc54a1ca08b6899f3489c6681d1b0c158f76f96ecb8b2bc8529fb6b72eb90","target":"record","created_at":"2026-05-18T01:09:55Z","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":"70fb2fc772fe9b5e02637cdd2e5a3ae0fd41e50d3fd34a8ac7517f8e28eff2b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-24T18:04:30Z","title_canon_sha256":"378812e5aeaf78d59bcbedb4868ed528f35f6138c7c0878f2b545e2762c1171d"},"schema_version":"1.0","source":{"id":"1512.07873","kind":"arxiv","version":2}},"canonical_sha256":"83f0ab4d7e188e72e94c9c0c7544d6e996cf09d67c0812e82908de3e280f327b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83f0ab4d7e188e72e94c9c0c7544d6e996cf09d67c0812e82908de3e280f327b","first_computed_at":"2026-05-18T01:09:55.820169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:55.820169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oElSbxaRS24iuew4UTGXY/JgH7h9JFmRZATFAbnaRDe/WnLp60xOj/Jb5YMAigdFVcHomrQMvJHiKdUm5qdlDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:55.821000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07873","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61ebc54a1ca08b6899f3489c6681d1b0c158f76f96ecb8b2bc8529fb6b72eb90","sha256:99e384694c102b47032b13cc052c35af1d6f0b4969aa8707163c94a091cfc40f"],"state_sha256":"1bbb865234e4d4919b397bb846158eeb0e7d19cddc8660196a210c1a72963780"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMGnGTEgqNdqUIGjXmy/ta9vw06k3qOkhwRTVkoIYZQSRp3UJVsKbCqoXmXhA3Saeq7bHWkBHzbMz/sCmjx7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:01:56.121732Z","bundle_sha256":"73e0ea678a911b3a03d33ee4f554314e660b8cbfe87d848171f9d63a1b2f6b1c"}}