{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GARZP2YKDENNOLF5DJO6K5TWES","short_pith_number":"pith:GARZP2YK","schema_version":"1.0","canonical_sha256":"302397eb0a191ad72cbd1a5de5767624affd457e925c90b535103ae090d8e0c9","source":{"kind":"arxiv","id":"1402.7248","version":3},"attestation_state":"computed","paper":{"title":"Perfect Simulation of $M/G/c$ Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Stephen B. Connor, Wilfrid S. Kendall","submitted_at":"2014-02-28T14:01:46Z","abstract_excerpt":"In this paper we describe a perfect simulation algorithm for the stable $M/G/c$ queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue. Journal of Applied Probability, 48A, 209--213) showed how to build a dominated CFTP algorithm for perfect simulation of the super-stable $M/G/c$ queue operating under First Come First Served discipline, with dominating process provided by the corresponding $M/G/1$ queue (using Wolff's sample path monotonicity, which applies when service durations are coupled in order of initiation of service), and exploiting the fact that "},"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":"1402.7248","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-28T14:01:46Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"a730bccf0924d3c9b11e9e1a70bbc9fe64d581468e1686fa809679888e3fa038","abstract_canon_sha256":"30c8f9a0ea4484a778cd315ab98df50ff9c012387cf6ffd1f1d0cbb22430ced9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:39.881638Z","signature_b64":"OmLOQvVpv9gzZVVScJfzeKo9xe7A2lMXLVKhQ47oNMglzOAv5SrSKrSWML+ATms2vBT9mvX6IxoTXc4DU0dKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"302397eb0a191ad72cbd1a5de5767624affd457e925c90b535103ae090d8e0c9","last_reissued_at":"2026-05-18T01:25:39.881005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:39.881005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Simulation of $M/G/c$ Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Stephen B. Connor, Wilfrid S. Kendall","submitted_at":"2014-02-28T14:01:46Z","abstract_excerpt":"In this paper we describe a perfect simulation algorithm for the stable $M/G/c$ queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue. Journal of Applied Probability, 48A, 209--213) showed how to build a dominated CFTP algorithm for perfect simulation of the super-stable $M/G/c$ queue operating under First Come First Served discipline, with dominating process provided by the corresponding $M/G/1$ queue (using Wolff's sample path monotonicity, which applies when service durations are coupled in order of initiation of service), and exploiting the fact that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7248","kind":"arxiv","version":3},"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":"1402.7248","created_at":"2026-05-18T01:25:39.881089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7248v3","created_at":"2026-05-18T01:25:39.881089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7248","created_at":"2026-05-18T01:25:39.881089+00:00"},{"alias_kind":"pith_short_12","alias_value":"GARZP2YKDENN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GARZP2YKDENNOLF5","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GARZP2YK","created_at":"2026-05-18T12:28:30.664211+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/GARZP2YKDENNOLF5DJO6K5TWES","json":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES.json","graph_json":"https://pith.science/api/pith-number/GARZP2YKDENNOLF5DJO6K5TWES/graph.json","events_json":"https://pith.science/api/pith-number/GARZP2YKDENNOLF5DJO6K5TWES/events.json","paper":"https://pith.science/paper/GARZP2YK"},"agent_actions":{"view_html":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES","download_json":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES.json","view_paper":"https://pith.science/paper/GARZP2YK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7248&json=true","fetch_graph":"https://pith.science/api/pith-number/GARZP2YKDENNOLF5DJO6K5TWES/graph.json","fetch_events":"https://pith.science/api/pith-number/GARZP2YKDENNOLF5DJO6K5TWES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES/action/storage_attestation","attest_author":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES/action/author_attestation","sign_citation":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES/action/citation_signature","submit_replication":"https://pith.science/pith/GARZP2YKDENNOLF5DJO6K5TWES/action/replication_record"}},"created_at":"2026-05-18T01:25:39.881089+00:00","updated_at":"2026-05-18T01:25:39.881089+00:00"}