{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EP5JGQ7VFO3MCJ4PDYOM6F5A4B","short_pith_number":"pith:EP5JGQ7V","schema_version":"1.0","canonical_sha256":"23fa9343f52bb6c1278f1e1ccf17a0e048d28d88dc8b8c1872988bef272c51f4","source":{"kind":"arxiv","id":"1308.6104","version":1},"attestation_state":"computed","paper":{"title":"Positive recurrence and transience of a two-station network with server states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Toshihisa Ozawa","submitted_at":"2013-08-28T09:24:12Z","abstract_excerpt":"We study positive recurrence and transience of a two-station network in which the behavior of the server in each station is governed by a Markov chain with a finite number of server states; this service process can represent various service disciplines such as a non-preemptive priority service and K-limited service. Assuming that exogenous customers arrive according to independent Markovian arrival processes (MAPs), we represent the behavior of the whole network as a continuous-time Markov chain and, by the uniformization technique, obtain the corresponding discrete-time Markov chain, which is"},"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":"1308.6104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-28T09:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"3083b83f7c713270bd26bcaf6b46f99609a1a2c5d740161d0c737339a79665e4","abstract_canon_sha256":"5a5e26a4406d9bfc94442eaab9505b3ce4f3dd16bfc1beb6c30c90c46d7e2af4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:49.061335Z","signature_b64":"ipVsfmKcKoKurTWBSBLUXx5Tl7A9e8zSYySIc/jRS7ieMpepkERONtZLeSoCHRRn+mynqSKFf5DgFhO2DDmEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23fa9343f52bb6c1278f1e1ccf17a0e048d28d88dc8b8c1872988bef272c51f4","last_reissued_at":"2026-05-18T03:14:49.060756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:49.060756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positive recurrence and transience of a two-station network with server states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Toshihisa Ozawa","submitted_at":"2013-08-28T09:24:12Z","abstract_excerpt":"We study positive recurrence and transience of a two-station network in which the behavior of the server in each station is governed by a Markov chain with a finite number of server states; this service process can represent various service disciplines such as a non-preemptive priority service and K-limited service. Assuming that exogenous customers arrive according to independent Markovian arrival processes (MAPs), we represent the behavior of the whole network as a continuous-time Markov chain and, by the uniformization technique, obtain the corresponding discrete-time Markov chain, which is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6104","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":"1308.6104","created_at":"2026-05-18T03:14:49.060864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6104v1","created_at":"2026-05-18T03:14:49.060864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6104","created_at":"2026-05-18T03:14:49.060864+00:00"},{"alias_kind":"pith_short_12","alias_value":"EP5JGQ7VFO3M","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EP5JGQ7VFO3MCJ4P","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EP5JGQ7V","created_at":"2026-05-18T12:27:43.054852+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/EP5JGQ7VFO3MCJ4PDYOM6F5A4B","json":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B.json","graph_json":"https://pith.science/api/pith-number/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/graph.json","events_json":"https://pith.science/api/pith-number/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/events.json","paper":"https://pith.science/paper/EP5JGQ7V"},"agent_actions":{"view_html":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B","download_json":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B.json","view_paper":"https://pith.science/paper/EP5JGQ7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6104&json=true","fetch_graph":"https://pith.science/api/pith-number/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/graph.json","fetch_events":"https://pith.science/api/pith-number/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/action/storage_attestation","attest_author":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/action/author_attestation","sign_citation":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/action/citation_signature","submit_replication":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/action/replication_record"}},"created_at":"2026-05-18T03:14:49.060864+00:00","updated_at":"2026-05-18T03:14:49.060864+00:00"}