{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X4XMPEXQ3AXLECQYNPBNKJ3FU4","short_pith_number":"pith:X4XMPEXQ","schema_version":"1.0","canonical_sha256":"bf2ec792f0d82eb20a186bc2d52765a730096517207dc602e60701b727242634","source":{"kind":"arxiv","id":"1611.02608","version":1},"attestation_state":"computed","paper":{"title":"Heavy traffic analysis of roving server networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik Winands, Marko Boon, Rob van der Mei","submitted_at":"2016-11-08T17:03:19Z","abstract_excerpt":"This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves the system or is routed to another queue. This type of customer routing in queueing networks arises very naturally in many application areas (in production systems, computer- and communication networks, maintenance, etc.). In these networks, the single most important characteristic of the system performance is oftentimes the path time, i.e. the total time sp"},"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":"1611.02608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-08T17:03:19Z","cross_cats_sorted":[],"title_canon_sha256":"cc826d3ab905d62f7bbf8699d8fd66a7e13c0ee651b01808e993d1d7db2f8d8d","abstract_canon_sha256":"793eed7a4122ae9f6795de86fdfda0d8943ec0ae07f5bed750d7e0d6a79ee617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:51.502516Z","signature_b64":"q3UYhG/D2e/rEelBZYhMe7nawkrm/tfvZMTZIehrPRC8e5Xf40dCYWs4Z8KX9vZ+Vj1nwy6yPHrMfsbaVvIuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf2ec792f0d82eb20a186bc2d52765a730096517207dc602e60701b727242634","last_reissued_at":"2026-05-18T00:59:51.501787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:51.501787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heavy traffic analysis of roving server networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik Winands, Marko Boon, Rob van der Mei","submitted_at":"2016-11-08T17:03:19Z","abstract_excerpt":"This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves the system or is routed to another queue. This type of customer routing in queueing networks arises very naturally in many application areas (in production systems, computer- and communication networks, maintenance, etc.). In these networks, the single most important characteristic of the system performance is oftentimes the path time, i.e. the total time sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02608","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.02608","created_at":"2026-05-18T00:59:51.501883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02608v1","created_at":"2026-05-18T00:59:51.501883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02608","created_at":"2026-05-18T00:59:51.501883+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4XMPEXQ3AXL","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4XMPEXQ3AXLECQY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4XMPEXQ","created_at":"2026-05-18T12:30:51.357362+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/X4XMPEXQ3AXLECQYNPBNKJ3FU4","json":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4.json","graph_json":"https://pith.science/api/pith-number/X4XMPEXQ3AXLECQYNPBNKJ3FU4/graph.json","events_json":"https://pith.science/api/pith-number/X4XMPEXQ3AXLECQYNPBNKJ3FU4/events.json","paper":"https://pith.science/paper/X4XMPEXQ"},"agent_actions":{"view_html":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4","download_json":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4.json","view_paper":"https://pith.science/paper/X4XMPEXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02608&json=true","fetch_graph":"https://pith.science/api/pith-number/X4XMPEXQ3AXLECQYNPBNKJ3FU4/graph.json","fetch_events":"https://pith.science/api/pith-number/X4XMPEXQ3AXLECQYNPBNKJ3FU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4/action/storage_attestation","attest_author":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4/action/author_attestation","sign_citation":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4/action/citation_signature","submit_replication":"https://pith.science/pith/X4XMPEXQ3AXLECQYNPBNKJ3FU4/action/replication_record"}},"created_at":"2026-05-18T00:59:51.501883+00:00","updated_at":"2026-05-18T00:59:51.501883+00:00"}