{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TTEBLF2TRC3WRNE56OFJXHJQHG","short_pith_number":"pith:TTEBLF2T","canonical_record":{"source":{"id":"1408.0149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-01T12:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"61b47850481f87361aa8ad815d266a74c7a2c50d305de195e756793de9e66a6e","abstract_canon_sha256":"09526dba61bc14e6149e67bf963fe78bb907c285de46cdd6a5e1ab95131add7e"},"schema_version":"1.0"},"canonical_sha256":"9cc815975388b768b49df38a9b9d30398416bca577ef0b8fe7cbe9e586f2ac95","source":{"kind":"arxiv","id":"1408.0149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0149","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0149v1","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0149","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"pith_short_12","alias_value":"TTEBLF2TRC3W","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TTEBLF2TRC3WRNE5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TTEBLF2T","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TTEBLF2TRC3WRNE56OFJXHJQHG","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-01T12:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"61b47850481f87361aa8ad815d266a74c7a2c50d305de195e756793de9e66a6e","abstract_canon_sha256":"09526dba61bc14e6149e67bf963fe78bb907c285de46cdd6a5e1ab95131add7e"},"schema_version":"1.0"},"canonical_sha256":"9cc815975388b768b49df38a9b9d30398416bca577ef0b8fe7cbe9e586f2ac95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:34.765651Z","signature_b64":"Q4t/iDpnF4TF519cwNVBLhV5vQ/85n/CSfKPxd2ViS9ZbYYISig60TQ9IK6zlBwGnc7kE9UPuDQHIOQencSmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc815975388b768b49df38a9b9d30398416bca577ef0b8fe7cbe9e586f2ac95","last_reissued_at":"2026-05-17T23:53:34.764995Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:34.764995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0149","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-17T23:53:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKzLWgsDLd+Mscrw/3tCMrWCAxAop4R+HGWamJDbi76MBcW+/Q/wtlKy7t4T/PT4cFYR1dJJtFv1wo/8x/pxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:23:47.465371Z"},"content_sha256":"995cd3cce790a0bc1f49844b488b0b4cb2cf76ee73281fded4d29d5a7fb926e7","schema_version":"1.0","event_id":"sha256:995cd3cce790a0bc1f49844b488b0b4cb2cf76ee73281fded4d29d5a7fb926e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TTEBLF2TRC3WRNE56OFJXHJQHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heavy-traffic analysis of k-limited polling systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik Winands, Marko Boon","submitted_at":"2014-08-01T12:19:04Z","abstract_excerpt":"In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exact heavy-traffic limits for the joint queue-length distribution using a singular-perturbation technique. It turns out that the number of customers in the stable queue has the same distribution as th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0149","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-17T23:53:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BIb+Rr1PyG3myMMisiODIgqam1OvjmQy9IM56PcJvUYKQAM4BKcqcIRKpQ8TySnrZwKM/r3oqpL35xIVm6qADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:23:47.466114Z"},"content_sha256":"10448cde1f10486dd077272661180b088106e57f737bb7aa9a60efb42db1eacf","schema_version":"1.0","event_id":"sha256:10448cde1f10486dd077272661180b088106e57f737bb7aa9a60efb42db1eacf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTEBLF2TRC3WRNE56OFJXHJQHG/bundle.json","state_url":"https://pith.science/pith/TTEBLF2TRC3WRNE56OFJXHJQHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTEBLF2TRC3WRNE56OFJXHJQHG/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-30T07:23:47Z","links":{"resolver":"https://pith.science/pith/TTEBLF2TRC3WRNE56OFJXHJQHG","bundle":"https://pith.science/pith/TTEBLF2TRC3WRNE56OFJXHJQHG/bundle.json","state":"https://pith.science/pith/TTEBLF2TRC3WRNE56OFJXHJQHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTEBLF2TRC3WRNE56OFJXHJQHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TTEBLF2TRC3WRNE56OFJXHJQHG","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":"09526dba61bc14e6149e67bf963fe78bb907c285de46cdd6a5e1ab95131add7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-01T12:19:04Z","title_canon_sha256":"61b47850481f87361aa8ad815d266a74c7a2c50d305de195e756793de9e66a6e"},"schema_version":"1.0","source":{"id":"1408.0149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0149","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0149v1","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0149","created_at":"2026-05-17T23:53:34Z"},{"alias_kind":"pith_short_12","alias_value":"TTEBLF2TRC3W","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TTEBLF2TRC3WRNE5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TTEBLF2T","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:10448cde1f10486dd077272661180b088106e57f737bb7aa9a60efb42db1eacf","target":"graph","created_at":"2026-05-17T23:53:34Z","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":"In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exact heavy-traffic limits for the joint queue-length distribution using a singular-perturbation technique. It turns out that the number of customers in the stable queue has the same distribution as th","authors_text":"Erik Winands, Marko Boon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-01T12:19:04Z","title":"Heavy-traffic analysis of k-limited polling systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0149","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:995cd3cce790a0bc1f49844b488b0b4cb2cf76ee73281fded4d29d5a7fb926e7","target":"record","created_at":"2026-05-17T23:53:34Z","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":"09526dba61bc14e6149e67bf963fe78bb907c285de46cdd6a5e1ab95131add7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-01T12:19:04Z","title_canon_sha256":"61b47850481f87361aa8ad815d266a74c7a2c50d305de195e756793de9e66a6e"},"schema_version":"1.0","source":{"id":"1408.0149","kind":"arxiv","version":1}},"canonical_sha256":"9cc815975388b768b49df38a9b9d30398416bca577ef0b8fe7cbe9e586f2ac95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cc815975388b768b49df38a9b9d30398416bca577ef0b8fe7cbe9e586f2ac95","first_computed_at":"2026-05-17T23:53:34.764995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:34.764995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q4t/iDpnF4TF519cwNVBLhV5vQ/85n/CSfKPxd2ViS9ZbYYISig60TQ9IK6zlBwGnc7kE9UPuDQHIOQencSmBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:34.765651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:995cd3cce790a0bc1f49844b488b0b4cb2cf76ee73281fded4d29d5a7fb926e7","sha256:10448cde1f10486dd077272661180b088106e57f737bb7aa9a60efb42db1eacf"],"state_sha256":"7f10df8d4584288b6385207a253c571541311bf3dbff57443758c1b02f8e855d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sl7DycsxTzFK2OehxrKHFzoA+hDGSb429y+qUSbxpq3HwHoX0+ckqKUB/wFBrSSFTwuVv29cYklr4LUa3DIjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:23:47.469980Z","bundle_sha256":"13dc17ce355cc9808df916185bf7f42e40eb93877f594919b7a58f435b244106"}}