{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JAN4YRXZH3HHV2YE3A6TPSYQYK","short_pith_number":"pith:JAN4YRXZ","canonical_record":{"source":{"id":"1608.03070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-10T07:56:36Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"5595a56738a344049fc234aa558e6a7f762fd33d995b7633d5f1539842d37aa0","abstract_canon_sha256":"ef1152c0fdc75d7f18a0bfd253edc79653be60e3e1266f83087b923c61a98f22"},"schema_version":"1.0"},"canonical_sha256":"481bcc46f93ece7aeb04d83d37cb10c2acc2dd8b6d2a3d06bb450410c5f3471e","source":{"kind":"arxiv","id":"1608.03070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03070","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03070v1","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03070","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"JAN4YRXZH3HH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"JAN4YRXZH3HHV2YE","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"JAN4YRXZ","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JAN4YRXZH3HHV2YE3A6TPSYQYK","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-10T07:56:36Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"5595a56738a344049fc234aa558e6a7f762fd33d995b7633d5f1539842d37aa0","abstract_canon_sha256":"ef1152c0fdc75d7f18a0bfd253edc79653be60e3e1266f83087b923c61a98f22"},"schema_version":"1.0"},"canonical_sha256":"481bcc46f93ece7aeb04d83d37cb10c2acc2dd8b6d2a3d06bb450410c5f3471e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:30.326611Z","signature_b64":"sIVItQy3tP7DW0NOA4thtkWJXX6SHy3iISm9y4igHncpsnSS/YfZzKiN7syaPaTrs9JJmXwNfTQMAQbitg1CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"481bcc46f93ece7aeb04d83d37cb10c2acc2dd8b6d2a3d06bb450410c5f3471e","last_reissued_at":"2026-05-18T01:09:30.326251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:30.326251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03070","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-18T01:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbKVwH5ejgOk79PTUO5+uWGF8MiaQ1WaTFJkKQlOmkORwAiXHm05+PMh0KeMAeKHjY/L60D7WvJ/yquG2vrWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:08:43.979262Z"},"content_sha256":"be65a68ade10f8e1918c8a3e71c97012a1a86f86b5ccc31adad81899641df550","schema_version":"1.0","event_id":"sha256:be65a68ade10f8e1918c8a3e71c97012a1a86f86b5ccc31adad81899641df550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JAN4YRXZH3HHV2YE3A6TPSYQYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal routing in two-queue polling systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"A.A.J Lefeber, I.J.B.F. Adan, N. Lee, V.G. Kulkarni","submitted_at":"2016-08-10T07:56:36Z","abstract_excerpt":"We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a Poisson process. We study the control problem of how arrivals should be routed to the two queues in order to minimize expected waiting costs and characterize individually and socially optimal routing policies under three scenari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03070","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-18T01:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5aylg+L/y4Of6KBtAaOk2DQY9CPlDEPdkDYtwr3BEkXYUyQqLf4VEpCfUixHeRCNf1rG2Av8w4u31DJ7aJbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:08:43.980092Z"},"content_sha256":"2e8f8cd916846078e5b9fb3fece3380f4900d9d51bbc50ff7e9d8ee2ca0ce9f4","schema_version":"1.0","event_id":"sha256:2e8f8cd916846078e5b9fb3fece3380f4900d9d51bbc50ff7e9d8ee2ca0ce9f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAN4YRXZH3HHV2YE3A6TPSYQYK/bundle.json","state_url":"https://pith.science/pith/JAN4YRXZH3HHV2YE3A6TPSYQYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAN4YRXZH3HHV2YE3A6TPSYQYK/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-12T01:08:43Z","links":{"resolver":"https://pith.science/pith/JAN4YRXZH3HHV2YE3A6TPSYQYK","bundle":"https://pith.science/pith/JAN4YRXZH3HHV2YE3A6TPSYQYK/bundle.json","state":"https://pith.science/pith/JAN4YRXZH3HHV2YE3A6TPSYQYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAN4YRXZH3HHV2YE3A6TPSYQYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JAN4YRXZH3HHV2YE3A6TPSYQYK","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":"ef1152c0fdc75d7f18a0bfd253edc79653be60e3e1266f83087b923c61a98f22","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-10T07:56:36Z","title_canon_sha256":"5595a56738a344049fc234aa558e6a7f762fd33d995b7633d5f1539842d37aa0"},"schema_version":"1.0","source":{"id":"1608.03070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03070","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03070v1","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03070","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"JAN4YRXZH3HH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"JAN4YRXZH3HHV2YE","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"JAN4YRXZ","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:2e8f8cd916846078e5b9fb3fece3380f4900d9d51bbc50ff7e9d8ee2ca0ce9f4","target":"graph","created_at":"2026-05-18T01:09:30Z","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 polling system with two queues, exhaustive service, no switch-over times and exponential service times. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a Poisson process. We study the control problem of how arrivals should be routed to the two queues in order to minimize expected waiting costs and characterize individually and socially optimal routing policies under three scenari","authors_text":"A.A.J Lefeber, I.J.B.F. Adan, N. Lee, V.G. Kulkarni","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-10T07:56:36Z","title":"Optimal routing in two-queue polling systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03070","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:be65a68ade10f8e1918c8a3e71c97012a1a86f86b5ccc31adad81899641df550","target":"record","created_at":"2026-05-18T01:09:30Z","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":"ef1152c0fdc75d7f18a0bfd253edc79653be60e3e1266f83087b923c61a98f22","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-10T07:56:36Z","title_canon_sha256":"5595a56738a344049fc234aa558e6a7f762fd33d995b7633d5f1539842d37aa0"},"schema_version":"1.0","source":{"id":"1608.03070","kind":"arxiv","version":1}},"canonical_sha256":"481bcc46f93ece7aeb04d83d37cb10c2acc2dd8b6d2a3d06bb450410c5f3471e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"481bcc46f93ece7aeb04d83d37cb10c2acc2dd8b6d2a3d06bb450410c5f3471e","first_computed_at":"2026-05-18T01:09:30.326251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:30.326251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sIVItQy3tP7DW0NOA4thtkWJXX6SHy3iISm9y4igHncpsnSS/YfZzKiN7syaPaTrs9JJmXwNfTQMAQbitg1CCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:30.326611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be65a68ade10f8e1918c8a3e71c97012a1a86f86b5ccc31adad81899641df550","sha256:2e8f8cd916846078e5b9fb3fece3380f4900d9d51bbc50ff7e9d8ee2ca0ce9f4"],"state_sha256":"328364cc59c84826fc9da520a97dcfd05cba5c8af32f0c65c7315053209c0930"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jQ69mWiRb8NyIr+5rmUfoeMZ96ArNyE1nZUckrgSjGltS4vD+oF+e2R1CV22qzDQOl/f/2KXavpr5fBszm3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:08:43.986416Z","bundle_sha256":"699cde1dcc04c2c367ed86bbd4018f3c5973b0b45e6419bde846a00cd7e342b2"}}