{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YRX3TRFHLERUQZEBLYPS2G3F6T","short_pith_number":"pith:YRX3TRFH","schema_version":"1.0","canonical_sha256":"c46fb9c4a759234864815e1f2d1b65f4caed5cacbd2133bb7bb0562e9b687b18","source":{"kind":"arxiv","id":"1505.04996","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.04996","created_at":"2026-05-18T01:19:38.735356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04996v2","created_at":"2026-05-18T01:19:38.735356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04996","created_at":"2026-05-18T01:19:38.735356+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRX3TRFHLERU","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRX3TRFHLERUQZEB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRX3TRFH","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T","json":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T.json","graph_json":"https://pith.science/api/pith-number/YRX3TRFHLERUQZEBLYPS2G3F6T/graph.json","events_json":"https://pith.science/api/pith-number/YRX3TRFHLERUQZEBLYPS2G3F6T/events.json","paper":"https://pith.science/paper/YRX3TRFH"},"agent_actions":{"view_html":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T","download_json":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T.json","view_paper":"https://pith.science/paper/YRX3TRFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04996&json=true","fetch_graph":"https://pith.science/api/pith-number/YRX3TRFHLERUQZEBLYPS2G3F6T/graph.json","fetch_events":"https://pith.science/api/pith-number/YRX3TRFHLERUQZEBLYPS2G3F6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/action/storage_attestation","attest_author":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/action/author_attestation","sign_citation":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/action/citation_signature","submit_replication":"https://pith.science/pith/YRX3TRFHLERUQZEBLYPS2G3F6T/action/replication_record"}},"created_at":"2026-05-18T01:19:38.735356+00:00","updated_at":"2026-05-18T01:19:38.735356+00:00"}