{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:UZ4OKDBR6WWAULX7K7TKC7CGRC","short_pith_number":"pith:UZ4OKDBR","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"},"canonical_sha256":"a678e50c31f5ac0a2eff57e6a17c4688bc544ef92514e2fec2120727d37bb0fb","source":{"kind":"arxiv","id":"math/0612476","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612476","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612476v3","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612476","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"UZ4OKDBR6WWA","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"UZ4OKDBR6WWAULX7","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"UZ4OKDBR","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:UZ4OKDBR6WWAULX7K7TKC7CGRC","target":"record","payload":{"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"},"canonical_sha256":"a678e50c31f5ac0a2eff57e6a17c4688bc544ef92514e2fec2120727d37bb0fb","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"},"source_kind":"arxiv","source_id":"math/0612476","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FlFNVn6bS/rr14845yhrx2VKJLrrtCV8W2eTKOKoxQfka0GQGX7/woK7DjI4BsOeUC/OBJsDI96BiUfSalmvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:33:43.578440Z"},"content_sha256":"216885b57a2e406b51deed06b1a5cc9179dabfdf7e7876723e4b03312a8ffc73","schema_version":"1.0","event_id":"sha256:216885b57a2e406b51deed06b1a5cc9179dabfdf7e7876723e4b03312a8ffc73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:UZ4OKDBR6WWAULX7K7TKC7CGRC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5T/0yDBurpZnODc2+uAYs9HU7a/oaFoEvbjGfc2qovTANXCmw5feQNdizthMM+FiyPMl72rGN1xfzBMp7FaPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:33:43.578801Z"},"content_sha256":"b22ddbda069cf65138c5a79161c5c9de0af869a725c7662ac6cdbc7d927596cb","schema_version":"1.0","event_id":"sha256:b22ddbda069cf65138c5a79161c5c9de0af869a725c7662ac6cdbc7d927596cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/bundle.json","state_url":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T17:33:43Z","links":{"resolver":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC","bundle":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/bundle.json","state":"https://pith.science/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZ4OKDBR6WWAULX7K7TKC7CGRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:UZ4OKDBR6WWAULX7K7TKC7CGRC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1b830a6c1e0c9e4faec8ce95e21e0690099bcf72ade486413d9aee565189c1ad","cross_cats_sorted":["math.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-12-16T19:30:37Z","title_canon_sha256":"980c46f6adcf347be5a4ca5c69604fa4026736e63933a8348b5a8f37c4da2af0"},"schema_version":"1.0","source":{"id":"math/0612476","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612476","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612476v3","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612476","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"UZ4OKDBR6WWA","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"UZ4OKDBR6WWAULX7","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"UZ4OKDBR","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:b22ddbda069cf65138c5a79161c5c9de0af869a725c7662ac6cdbc7d927596cb","target":"graph","created_at":"2026-05-18T03:29:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Richard G. Clegg","cross_cats":["math.DS","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-12-16T19:30:37Z","title":"A discrete-time Markov modulated queuing system with batched arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612476","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:216885b57a2e406b51deed06b1a5cc9179dabfdf7e7876723e4b03312a8ffc73","target":"record","created_at":"2026-05-18T03:29:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1b830a6c1e0c9e4faec8ce95e21e0690099bcf72ade486413d9aee565189c1ad","cross_cats_sorted":["math.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-12-16T19:30:37Z","title_canon_sha256":"980c46f6adcf347be5a4ca5c69604fa4026736e63933a8348b5a8f37c4da2af0"},"schema_version":"1.0","source":{"id":"math/0612476","kind":"arxiv","version":3}},"canonical_sha256":"a678e50c31f5ac0a2eff57e6a17c4688bc544ef92514e2fec2120727d37bb0fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a678e50c31f5ac0a2eff57e6a17c4688bc544ef92514e2fec2120727d37bb0fb","first_computed_at":"2026-05-18T03:29:39.254920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:39.254920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fz+mghfl8GSQCiYllyf4zKz8Z25w3ePyfyymDnC9BDQNC45ciPssdWUlQYWbM+F/Fcwh/oBwsCifMjfcPWNPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:39.255641Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0612476","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:216885b57a2e406b51deed06b1a5cc9179dabfdf7e7876723e4b03312a8ffc73","sha256:b22ddbda069cf65138c5a79161c5c9de0af869a725c7662ac6cdbc7d927596cb"],"state_sha256":"4df7f4497637ed6340860d45406c8a8371e32782950f5709810f793c30510d49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTJdhXSEmTAc5uQt5W+M4g8El67glav2j3geS2A0nvGg9cV2jjPCmLEag23kix5UNBZk/wfPjCkDbEuAU7XlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:33:43.582357Z","bundle_sha256":"e271b715f5591f73a6c17406a95843a3c2bd0616e154b748c9834c4af4b8d1c7"}}