{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:UZ4OKDBR6WWAULX7K7TKC7CGRC","short_pith_number":"pith:UZ4OKDBR","schema_version":"1.0","canonical_sha256":"a678e50c31f5ac0a2eff57e6a17c4688bc544ef92514e2fec2120727d37bb0fb","source":{"kind":"arxiv","id":"math/0612476","version":3},"attestation_state":"computed","paper":{"title":"A discrete-time Markov modulated queuing system with batched arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Richard G. Clegg","submitted_at":"2006-12-16T19:30:37Z","abstract_excerpt":"This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The server process is a single server deterministic queue. A closed form exact solution is given for the expected queue length and delay. A simple system of equations is given for the probability of the queue exceeding a given length."},"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":"math/0612476","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-12-16T19:30:37Z","cross_cats_sorted":["math.DS","math.ST","stat.TH"],"title_canon_sha256":"980c46f6adcf347be5a4ca5c69604fa4026736e63933a8348b5a8f37c4da2af0","abstract_canon_sha256":"1b830a6c1e0c9e4faec8ce95e21e0690099bcf72ade486413d9aee565189c1ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:39.255641Z","signature_b64":"Fz+mghfl8GSQCiYllyf4zKz8Z25w3ePyfyymDnC9BDQNC45ciPssdWUlQYWbM+F/Fcwh/oBwsCifMjfcPWNPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a678e50c31f5ac0a2eff57e6a17c4688bc544ef92514e2fec2120727d37bb0fb","last_reissued_at":"2026-05-18T03:29:39.254920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:39.254920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A discrete-time Markov modulated queuing system with batched arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Richard G. Clegg","submitted_at":"2006-12-16T19:30:37Z","abstract_excerpt":"This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The server process is a single server deterministic queue. A closed form exact solution is given for the expected queue length and delay. A simple system of equations is given for the probability of the queue exceeding a given length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612476","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":"math/0612476","created_at":"2026-05-18T03:29:39.255029+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0612476v3","created_at":"2026-05-18T03:29:39.255029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612476","created_at":"2026-05-18T03:29:39.255029+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZ4OKDBR6WWA","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZ4OKDBR6WWAULX7","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZ4OKDBR","created_at":"2026-05-18T12:25:54.717736+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/UZ4OKDBR6WWAULX7K7TKC7CGRC","json":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC.json","graph_json":"https://pith.science/api/pith-number/UZ4OKDBR6WWAULX7K7TKC7CGRC/graph.json","events_json":"https://pith.science/api/pith-number/UZ4OKDBR6WWAULX7K7TKC7CGRC/events.json","paper":"https://pith.science/paper/UZ4OKDBR"},"agent_actions":{"view_html":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC","download_json":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC.json","view_paper":"https://pith.science/paper/UZ4OKDBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0612476&json=true","fetch_graph":"https://pith.science/api/pith-number/UZ4OKDBR6WWAULX7K7TKC7CGRC/graph.json","fetch_events":"https://pith.science/api/pith-number/UZ4OKDBR6WWAULX7K7TKC7CGRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/action/storage_attestation","attest_author":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/action/author_attestation","sign_citation":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/action/citation_signature","submit_replication":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/action/replication_record"}},"created_at":"2026-05-18T03:29:39.255029+00:00","updated_at":"2026-05-18T03:29:39.255029+00:00"}