{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KVMF7BATWCCAS355ZBCS4YEALT","short_pith_number":"pith:KVMF7BAT","canonical_record":{"source":{"id":"1509.03535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-11T14:35:27Z","cross_cats_sorted":[],"title_canon_sha256":"30accb477b169cebb82021a6e2ffd471e200a7aac997259bb1a7492725f5bd5b","abstract_canon_sha256":"601d51f5d3d73f5428bbd077bd145e459e1c4d0e7385f0639e8506eae6d9b6c4"},"schema_version":"1.0"},"canonical_sha256":"55585f8413b084096fbdc8452e60805cdd963b2a472d99d8fe2c1f2060a1ec9b","source":{"kind":"arxiv","id":"1509.03535","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03535","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03535v3","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03535","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"KVMF7BATWCCA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KVMF7BATWCCAS355","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KVMF7BAT","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KVMF7BATWCCAS355ZBCS4YEALT","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-11T14:35:27Z","cross_cats_sorted":[],"title_canon_sha256":"30accb477b169cebb82021a6e2ffd471e200a7aac997259bb1a7492725f5bd5b","abstract_canon_sha256":"601d51f5d3d73f5428bbd077bd145e459e1c4d0e7385f0639e8506eae6d9b6c4"},"schema_version":"1.0"},"canonical_sha256":"55585f8413b084096fbdc8452e60805cdd963b2a472d99d8fe2c1f2060a1ec9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:33.139207Z","signature_b64":"LUrGYvb/v8GxxCUKLThB9p73o/0TRFQzHj+tzNDukCOL9eeiNppNCdhZGvMK6Q8SmWn8YfMtwjRJilMr74GXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55585f8413b084096fbdc8452e60805cdd963b2a472d99d8fe2c1f2060a1ec9b","last_reissued_at":"2026-05-18T00:48:33.138554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:33.138554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03535","source_version":3,"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:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrECWzPRGCnhSLCXfjQhqlnCGGj+3Gyf+3sWQ/Jh829/TUFcmOXfvbY4/SYHX7Nml/1crN9NoXgjtJJY28GWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:55:24.331192Z"},"content_sha256":"1c20d9708ffcc63528d91f082613561f100ca3c02afc479f6a912a5fd8a437e6","schema_version":"1.0","event_id":"sha256:1c20d9708ffcc63528d91f082613561f100ca3c02afc479f6a912a5fd8a437e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KVMF7BATWCCAS355ZBCS4YEALT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Steady-state analysis of shortest expected delay routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ivo J.B.F. Adan, Johan S.H. van Leeuwaarden, Jori Selen, Stella Kapodistria","submitted_at":"2015-09-11T14:35:27Z","abstract_excerpt":"We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue promising the shortest expected delay, which is a natural and near-optimal policy for systems with non-identical servers. This system can be modeled as an inhomogeneous random walk in the quadrant. By stretching the boundaries of the compensation approach we prove that the equilibrium distribution of this random walk can be expressed as a series of product-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03535","kind":"arxiv","version":3},"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:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7quT5akDTNVy+VZbew70+nwwMF91OTBkoek9DjyRRvoj87Dx455bva9wdaaSmPRlMR+klJlPx3hPLcTllvvCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:55:24.331549Z"},"content_sha256":"667d8a63f9bef614fabd1cae3d9d7d6674ab4f2cabb0959e2458b31d2074fa1f","schema_version":"1.0","event_id":"sha256:667d8a63f9bef614fabd1cae3d9d7d6674ab4f2cabb0959e2458b31d2074fa1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVMF7BATWCCAS355ZBCS4YEALT/bundle.json","state_url":"https://pith.science/pith/KVMF7BATWCCAS355ZBCS4YEALT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVMF7BATWCCAS355ZBCS4YEALT/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-30T04:55:24Z","links":{"resolver":"https://pith.science/pith/KVMF7BATWCCAS355ZBCS4YEALT","bundle":"https://pith.science/pith/KVMF7BATWCCAS355ZBCS4YEALT/bundle.json","state":"https://pith.science/pith/KVMF7BATWCCAS355ZBCS4YEALT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVMF7BATWCCAS355ZBCS4YEALT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KVMF7BATWCCAS355ZBCS4YEALT","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":"601d51f5d3d73f5428bbd077bd145e459e1c4d0e7385f0639e8506eae6d9b6c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-11T14:35:27Z","title_canon_sha256":"30accb477b169cebb82021a6e2ffd471e200a7aac997259bb1a7492725f5bd5b"},"schema_version":"1.0","source":{"id":"1509.03535","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03535","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03535v3","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03535","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"KVMF7BATWCCA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KVMF7BATWCCAS355","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KVMF7BAT","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:667d8a63f9bef614fabd1cae3d9d7d6674ab4f2cabb0959e2458b31d2074fa1f","target":"graph","created_at":"2026-05-18T00:48:33Z","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":"We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue promising the shortest expected delay, which is a natural and near-optimal policy for systems with non-identical servers. This system can be modeled as an inhomogeneous random walk in the quadrant. By stretching the boundaries of the compensation approach we prove that the equilibrium distribution of this random walk can be expressed as a series of product-","authors_text":"Ivo J.B.F. Adan, Johan S.H. van Leeuwaarden, Jori Selen, Stella Kapodistria","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-11T14:35:27Z","title":"Steady-state analysis of shortest expected delay routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03535","kind":"arxiv","version":3},"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:1c20d9708ffcc63528d91f082613561f100ca3c02afc479f6a912a5fd8a437e6","target":"record","created_at":"2026-05-18T00:48:33Z","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":"601d51f5d3d73f5428bbd077bd145e459e1c4d0e7385f0639e8506eae6d9b6c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-11T14:35:27Z","title_canon_sha256":"30accb477b169cebb82021a6e2ffd471e200a7aac997259bb1a7492725f5bd5b"},"schema_version":"1.0","source":{"id":"1509.03535","kind":"arxiv","version":3}},"canonical_sha256":"55585f8413b084096fbdc8452e60805cdd963b2a472d99d8fe2c1f2060a1ec9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55585f8413b084096fbdc8452e60805cdd963b2a472d99d8fe2c1f2060a1ec9b","first_computed_at":"2026-05-18T00:48:33.138554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:33.138554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LUrGYvb/v8GxxCUKLThB9p73o/0TRFQzHj+tzNDukCOL9eeiNppNCdhZGvMK6Q8SmWn8YfMtwjRJilMr74GXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:33.139207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03535","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c20d9708ffcc63528d91f082613561f100ca3c02afc479f6a912a5fd8a437e6","sha256:667d8a63f9bef614fabd1cae3d9d7d6674ab4f2cabb0959e2458b31d2074fa1f"],"state_sha256":"de286b9e7f65643750e981771a1feaac6a1b92b982550e8da0a53181338c1760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NGAz4zLZd+egpFZpc+3DE5BAi4soeSomwAMtozOojtTgNR25+tg9xWwOk+ACEt9gH6n9uLMUcpDZeavC/PNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:55:24.333483Z","bundle_sha256":"79601e344893f000eef5d4b82dc2463316cea128a92da2416dce5221ed7bf195"}}