{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EP5JGQ7VFO3MCJ4PDYOM6F5A4B","short_pith_number":"pith:EP5JGQ7V","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"},"canonical_sha256":"23fa9343f52bb6c1278f1e1ccf17a0e048d28d88dc8b8c1872988bef272c51f4","source":{"kind":"arxiv","id":"1308.6104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6104","created_at":"2026-05-18T03:14:49Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6104v1","created_at":"2026-05-18T03:14:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6104","created_at":"2026-05-18T03:14:49Z"},{"alias_kind":"pith_short_12","alias_value":"EP5JGQ7VFO3M","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EP5JGQ7VFO3MCJ4P","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EP5JGQ7V","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EP5JGQ7VFO3MCJ4PDYOM6F5A4B","target":"record","payload":{"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"},"canonical_sha256":"23fa9343f52bb6c1278f1e1ccf17a0e048d28d88dc8b8c1872988bef272c51f4","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"},"source_kind":"arxiv","source_id":"1308.6104","source_version":1,"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:14:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqxD++i9jxac/TUgS3L/7T0sFc7zBPevEV2TIy9M5EBXD65b6nt0NmdkytjkHifKWV28BncyZl8UXCa7Vw7iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:56:52.269889Z"},"content_sha256":"ccaaa6c45419911189eb3e4154454c2b80638b3afca2d2cc9f9121137ae8e388","schema_version":"1.0","event_id":"sha256:ccaaa6c45419911189eb3e4154454c2b80638b3afca2d2cc9f9121137ae8e388"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EP5JGQ7VFO3MCJ4PDYOM6F5A4B","target":"graph","payload":{"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"},"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:14:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2Z4KiV7nqhfxa9Pw6SPAYoEBu0sGT6lrQ1i5SjTZ4HOePgwXTg0cYWhrQyuIfIvhBViU5cLBoVcjrvkZVWlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:56:52.270231Z"},"content_sha256":"3f056ef64c65aa9aecf5a6b79660655d04a233ecbfb608273c2f3fe3f96e5f7d","schema_version":"1.0","event_id":"sha256:3f056ef64c65aa9aecf5a6b79660655d04a233ecbfb608273c2f3fe3f96e5f7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/bundle.json","state_url":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/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-06-24T16:56:52Z","links":{"resolver":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B","bundle":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/bundle.json","state":"https://pith.science/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EP5JGQ7VFO3MCJ4PDYOM6F5A4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EP5JGQ7VFO3MCJ4PDYOM6F5A4B","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":"5a5e26a4406d9bfc94442eaab9505b3ce4f3dd16bfc1beb6c30c90c46d7e2af4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-28T09:24:12Z","title_canon_sha256":"3083b83f7c713270bd26bcaf6b46f99609a1a2c5d740161d0c737339a79665e4"},"schema_version":"1.0","source":{"id":"1308.6104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6104","created_at":"2026-05-18T03:14:49Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6104v1","created_at":"2026-05-18T03:14:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6104","created_at":"2026-05-18T03:14:49Z"},{"alias_kind":"pith_short_12","alias_value":"EP5JGQ7VFO3M","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EP5JGQ7VFO3MCJ4P","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EP5JGQ7V","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:3f056ef64c65aa9aecf5a6b79660655d04a233ecbfb608273c2f3fe3f96e5f7d","target":"graph","created_at":"2026-05-18T03:14:49Z","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":"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","authors_text":"Toshihisa Ozawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-28T09:24:12Z","title":"Positive recurrence and transience of a two-station network with server states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6104","kind":"arxiv","version":1},"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:ccaaa6c45419911189eb3e4154454c2b80638b3afca2d2cc9f9121137ae8e388","target":"record","created_at":"2026-05-18T03:14:49Z","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":"5a5e26a4406d9bfc94442eaab9505b3ce4f3dd16bfc1beb6c30c90c46d7e2af4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-28T09:24:12Z","title_canon_sha256":"3083b83f7c713270bd26bcaf6b46f99609a1a2c5d740161d0c737339a79665e4"},"schema_version":"1.0","source":{"id":"1308.6104","kind":"arxiv","version":1}},"canonical_sha256":"23fa9343f52bb6c1278f1e1ccf17a0e048d28d88dc8b8c1872988bef272c51f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23fa9343f52bb6c1278f1e1ccf17a0e048d28d88dc8b8c1872988bef272c51f4","first_computed_at":"2026-05-18T03:14:49.060756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:49.060756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ipVsfmKcKoKurTWBSBLUXx5Tl7A9e8zSYySIc/jRS7ieMpepkERONtZLeSoCHRRn+mynqSKFf5DgFhO2DDmEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:49.061335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccaaa6c45419911189eb3e4154454c2b80638b3afca2d2cc9f9121137ae8e388","sha256:3f056ef64c65aa9aecf5a6b79660655d04a233ecbfb608273c2f3fe3f96e5f7d"],"state_sha256":"e9ddf1b93e5a6487ae10ec2869a2121bd139be1408c272fb6c0dd240657641fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyiZZpnEUXqU6QsjdmXTYd5g3KvZNjcMdzqo/iMF53DaFzhbgwFDM2mR5JoxQwsrI8y4zid1SFUuM9jjM7g3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:56:52.272666Z","bundle_sha256":"eb940856ca8209926b22611fbdc08d52c945da8c761713dede9877d1144244f2"}}