{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YRX3TRFHLERUQZEBLYPS2G3F6T","short_pith_number":"pith:YRX3TRFH","canonical_record":{"source":{"id":"1505.04996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-19T13:52:43Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"9b6c32a8c9999c7141a97aae548323d57a1c9b21d7f945004e43ad49987503bb","abstract_canon_sha256":"c63793902d8192ad478c1c4d34a5b14062c0a69c303bf7629cf38ebbe0c3a202"},"schema_version":"1.0"},"canonical_sha256":"c46fb9c4a759234864815e1f2d1b65f4caed5cacbd2133bb7bb0562e9b687b18","source":{"kind":"arxiv","id":"1505.04996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04996","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04996v2","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04996","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"YRX3TRFHLERU","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YRX3TRFHLERUQZEB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YRX3TRFH","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YRX3TRFHLERUQZEBLYPS2G3F6T","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-19T13:52:43Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"9b6c32a8c9999c7141a97aae548323d57a1c9b21d7f945004e43ad49987503bb","abstract_canon_sha256":"c63793902d8192ad478c1c4d34a5b14062c0a69c303bf7629cf38ebbe0c3a202"},"schema_version":"1.0"},"canonical_sha256":"c46fb9c4a759234864815e1f2d1b65f4caed5cacbd2133bb7bb0562e9b687b18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:38.735821Z","signature_b64":"6bNdd1CIRXZYgGdk3/1VESM9FR1WNwTZmCH5LvBb5RkhR6RtrAaFmZ3SJaL6kAmXzxDNKV5zkHqx0ZVDClM2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c46fb9c4a759234864815e1f2d1b65f4caed5cacbd2133bb7bb0562e9b687b18","last_reissued_at":"2026-05-18T01:19:38.735259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:38.735259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04996","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:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5F1p91RR8ortXjp4dKdmfMyE3MiwqXl3SebHYZt/qoMbWbFhbwQBKFSbczzubftiqy2dLMm6QvRWbhy7WIXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:55:19.605270Z"},"content_sha256":"a88578b039796280656e78f3645c129dafffdd2c418325a60680ef68d41cd652","schema_version":"1.0","event_id":"sha256:a88578b039796280656e78f3645c129dafffdd2c418325a60680ef68d41cd652"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YRX3TRFHLERUQZEBLYPS2G3F6T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Critically loaded k-limited polling systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Erik Winands, Marko Boon","submitted_at":"2015-05-19T13:52:43Z","abstract_excerpt":"We consider a two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in each queue. The major benefit of the $k$-limited service discipline is that it - besides bounding the cycle time - effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic regime, in which one of the queues becomes critically loaded with the other queue remaining stable. By using a singular-perturbation technique, we rigorously prove heavy-traffic limits for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04996","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:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMufvLIScsyUG8wB6sKBWup/LPfYFPdX5iyCrFmd1AdUpDFwTjNdUbfQc/aelrg1nydas2Sy1FHz+IxP5bN1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:55:19.605630Z"},"content_sha256":"1b4386a40232b9e087b6d8ce2021b4521007b5698bfee955af0dce57f26344ac","schema_version":"1.0","event_id":"sha256:1b4386a40232b9e087b6d8ce2021b4521007b5698bfee955af0dce57f26344ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/bundle.json","state_url":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/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-20T21:55:19Z","links":{"resolver":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T","bundle":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/bundle.json","state":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YRX3TRFHLERUQZEBLYPS2G3F6T","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":"c63793902d8192ad478c1c4d34a5b14062c0a69c303bf7629cf38ebbe0c3a202","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-19T13:52:43Z","title_canon_sha256":"9b6c32a8c9999c7141a97aae548323d57a1c9b21d7f945004e43ad49987503bb"},"schema_version":"1.0","source":{"id":"1505.04996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04996","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04996v2","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04996","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"YRX3TRFHLERU","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YRX3TRFHLERUQZEB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YRX3TRFH","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:1b4386a40232b9e087b6d8ce2021b4521007b5698bfee955af0dce57f26344ac","target":"graph","created_at":"2026-05-18T01:19:38Z","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 two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in each queue. The major benefit of the $k$-limited service discipline is that it - besides bounding the cycle time - effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic regime, in which one of the queues becomes critically loaded with the other queue remaining stable. By using a singular-perturbation technique, we rigorously prove heavy-traffic limits for th","authors_text":"Erik Winands, Marko Boon","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-19T13:52:43Z","title":"Critically loaded k-limited polling systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04996","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:a88578b039796280656e78f3645c129dafffdd2c418325a60680ef68d41cd652","target":"record","created_at":"2026-05-18T01:19:38Z","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":"c63793902d8192ad478c1c4d34a5b14062c0a69c303bf7629cf38ebbe0c3a202","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-19T13:52:43Z","title_canon_sha256":"9b6c32a8c9999c7141a97aae548323d57a1c9b21d7f945004e43ad49987503bb"},"schema_version":"1.0","source":{"id":"1505.04996","kind":"arxiv","version":2}},"canonical_sha256":"c46fb9c4a759234864815e1f2d1b65f4caed5cacbd2133bb7bb0562e9b687b18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c46fb9c4a759234864815e1f2d1b65f4caed5cacbd2133bb7bb0562e9b687b18","first_computed_at":"2026-05-18T01:19:38.735259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:38.735259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6bNdd1CIRXZYgGdk3/1VESM9FR1WNwTZmCH5LvBb5RkhR6RtrAaFmZ3SJaL6kAmXzxDNKV5zkHqx0ZVDClM2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:38.735821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a88578b039796280656e78f3645c129dafffdd2c418325a60680ef68d41cd652","sha256:1b4386a40232b9e087b6d8ce2021b4521007b5698bfee955af0dce57f26344ac"],"state_sha256":"9f5a6cb8d1be2dc4fb1241033ffa543edd6197b9c9ea151807cff9f68f9ff2db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahI6HR521WpK5LTZ13G3lBsRpO+53GK028zQ1X9EGc6kMsFR5pWCy8FxFl0YLYq9YEVZ3HuB2d0mwQu5fR6sDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:55:19.607639Z","bundle_sha256":"d6e9731b52e95dce0f84c7b9791c7fc753741206d92415c14905b7f4ba379806"}}