{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JCOTZSKOE4RABIEWNNUDUK5JZ4","short_pith_number":"pith:JCOTZSKO","schema_version":"1.0","canonical_sha256":"489d3cc94e272200a0966b683a2ba9cf02957c2ac3bd2a1be1220fbf629d9810","source":{"kind":"arxiv","id":"1011.2034","version":1},"attestation_state":"computed","paper":{"title":"Many-server diffusion limits for $G/Ph/n+GI$ queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"J. G. Dai, Shuangchi He, Tolga Tezcan","submitted_at":"2010-11-09T10:47:31Z","abstract_excerpt":"This paper studies many-server limits for multi-server queues that have a phase-type service time distribution and allow for customer abandonment. The first set of limit theorems is for critically loaded $G/Ph/n+GI$ queues, where the patience times are independent and identically distributed following a general distribution. The next limit theorem is for overloaded $G/ Ph/n+M$ queues, where the patience time distribution is restricted to be exponential. We prove that a pair of diffusion-scaled total-customer-count and server-allocation processes, properly centered, converges in distribution to"},"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":"1011.2034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-09T10:47:31Z","cross_cats_sorted":[],"title_canon_sha256":"f9b936d20e52020e89464158c7a31621c3343a00f09c00746553cf347e361763","abstract_canon_sha256":"1c1419e6328f697606d0b23c8429c8dd7ef5fbc95223edeb84d53524be1aaf4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:42.739106Z","signature_b64":"Xie+1pMLI12+oGnIqM76gVFt6774S1cez19DJAgmFBBz997LhJhUR3E5Mq7mslFS4lJ67tMMxuXI6UbUSy4uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"489d3cc94e272200a0966b683a2ba9cf02957c2ac3bd2a1be1220fbf629d9810","last_reissued_at":"2026-05-18T04:36:42.738530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:42.738530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many-server diffusion limits for $G/Ph/n+GI$ queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"J. G. Dai, Shuangchi He, Tolga Tezcan","submitted_at":"2010-11-09T10:47:31Z","abstract_excerpt":"This paper studies many-server limits for multi-server queues that have a phase-type service time distribution and allow for customer abandonment. The first set of limit theorems is for critically loaded $G/Ph/n+GI$ queues, where the patience times are independent and identically distributed following a general distribution. The next limit theorem is for overloaded $G/ Ph/n+M$ queues, where the patience time distribution is restricted to be exponential. We prove that a pair of diffusion-scaled total-customer-count and server-allocation processes, properly centered, converges in distribution to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2034","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":"1011.2034","created_at":"2026-05-18T04:36:42.738618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2034v1","created_at":"2026-05-18T04:36:42.738618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2034","created_at":"2026-05-18T04:36:42.738618+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCOTZSKOE4RA","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCOTZSKOE4RABIEW","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCOTZSKO","created_at":"2026-05-18T12:26:09.077623+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/JCOTZSKOE4RABIEWNNUDUK5JZ4","json":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4.json","graph_json":"https://pith.science/api/pith-number/JCOTZSKOE4RABIEWNNUDUK5JZ4/graph.json","events_json":"https://pith.science/api/pith-number/JCOTZSKOE4RABIEWNNUDUK5JZ4/events.json","paper":"https://pith.science/paper/JCOTZSKO"},"agent_actions":{"view_html":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4","download_json":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4.json","view_paper":"https://pith.science/paper/JCOTZSKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2034&json=true","fetch_graph":"https://pith.science/api/pith-number/JCOTZSKOE4RABIEWNNUDUK5JZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/JCOTZSKOE4RABIEWNNUDUK5JZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4/action/storage_attestation","attest_author":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4/action/author_attestation","sign_citation":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4/action/citation_signature","submit_replication":"https://pith.science/pith/JCOTZSKOE4RABIEWNNUDUK5JZ4/action/replication_record"}},"created_at":"2026-05-18T04:36:42.738618+00:00","updated_at":"2026-05-18T04:36:42.738618+00:00"}