{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DVU4M4KPQF6GNG5JZY72C72DPM","short_pith_number":"pith:DVU4M4KP","schema_version":"1.0","canonical_sha256":"1d69c6714f817c669ba9ce3fa17f437b3b6a0c72a2e708a66fc790013d941565","source":{"kind":"arxiv","id":"2109.00713","version":1},"attestation_state":"computed","paper":{"title":"Markovian Transition Counting Processes: An Alternative to Markov Modulated Poisson Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"math.PR","authors_text":"Azam Asanjarani, Sophie Hautphenne, Yoni Nazarathy","submitted_at":"2021-09-02T05:07:33Z","abstract_excerpt":"Stochastic models for performance analysis, optimization and control of queues hinge on a multitude of alternatives for input point processes. In case of bursty traffic, one very popular model is the \\textit{Markov Modulated Poisson Process} (MMPP), however it is not the only option. Here, we introduce an alternative that we call \\textit{Markovian transition counting process} (MTCP). The latter is a point process counting the number of transitions of a finite continuous-time Markov chain.\n  For a given MTCP one can establish an MMPP with the same first and second moments of counts. In this pap"},"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":"2109.00713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-09-02T05:07:33Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"1956ec483c6763bd65e3fa46f47948e73d37edb9ac66320147e31a3c4cd5f391","abstract_canon_sha256":"9e459ae810588f761d6d88f6ca5314d9a2a8ac91b59cdf0f6fed5e01d597b0ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:57.985606Z","signature_b64":"dF73feY5z/w54tAFO4XYeec0+dmEK/Gtgfp88l21ZqToPirqugd/hyu8tRzT9RCoEwIBS837GTuxbai9Z/LeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d69c6714f817c669ba9ce3fa17f437b3b6a0c72a2e708a66fc790013d941565","last_reissued_at":"2026-07-05T03:10:57.985225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:57.985225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markovian Transition Counting Processes: An Alternative to Markov Modulated Poisson Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"math.PR","authors_text":"Azam Asanjarani, Sophie Hautphenne, Yoni Nazarathy","submitted_at":"2021-09-02T05:07:33Z","abstract_excerpt":"Stochastic models for performance analysis, optimization and control of queues hinge on a multitude of alternatives for input point processes. In case of bursty traffic, one very popular model is the \\textit{Markov Modulated Poisson Process} (MMPP), however it is not the only option. Here, we introduce an alternative that we call \\textit{Markovian transition counting process} (MTCP). The latter is a point process counting the number of transitions of a finite continuous-time Markov chain.\n  For a given MTCP one can establish an MMPP with the same first and second moments of counts. In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00713","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.00713/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.00713","created_at":"2026-07-05T03:10:57.985282+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.00713v1","created_at":"2026-07-05T03:10:57.985282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00713","created_at":"2026-07-05T03:10:57.985282+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVU4M4KPQF6G","created_at":"2026-07-05T03:10:57.985282+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVU4M4KPQF6GNG5J","created_at":"2026-07-05T03:10:57.985282+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVU4M4KP","created_at":"2026-07-05T03:10:57.985282+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/DVU4M4KPQF6GNG5JZY72C72DPM","json":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM.json","graph_json":"https://pith.science/api/pith-number/DVU4M4KPQF6GNG5JZY72C72DPM/graph.json","events_json":"https://pith.science/api/pith-number/DVU4M4KPQF6GNG5JZY72C72DPM/events.json","paper":"https://pith.science/paper/DVU4M4KP"},"agent_actions":{"view_html":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM","download_json":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM.json","view_paper":"https://pith.science/paper/DVU4M4KP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.00713&json=true","fetch_graph":"https://pith.science/api/pith-number/DVU4M4KPQF6GNG5JZY72C72DPM/graph.json","fetch_events":"https://pith.science/api/pith-number/DVU4M4KPQF6GNG5JZY72C72DPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM/action/storage_attestation","attest_author":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM/action/author_attestation","sign_citation":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM/action/citation_signature","submit_replication":"https://pith.science/pith/DVU4M4KPQF6GNG5JZY72C72DPM/action/replication_record"}},"created_at":"2026-07-05T03:10:57.985282+00:00","updated_at":"2026-07-05T03:10:57.985282+00:00"}