{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KZEIK3E4IK4PK6EVIQI4MW4FLP","short_pith_number":"pith:KZEIK3E4","canonical_record":{"source":{"id":"1901.02972","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-09T23:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"ebd542f5aa0ba70888fd9fd651a6c641701eb00a18562ac63145c03d081bb214","abstract_canon_sha256":"e9e74ccc667aed7fb8fa61ce665c0920a66b96cf7a293fd063d7889052ea561d"},"schema_version":"1.0"},"canonical_sha256":"5648856c9c42b8f578954411c65b855bfb56caaedc71657ec0efd1e216f2122b","source":{"kind":"arxiv","id":"1901.02972","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02972","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02972v3","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02972","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"KZEIK3E4IK4P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KZEIK3E4IK4PK6EV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KZEIK3E4","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KZEIK3E4IK4PK6EVIQI4MW4FLP","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02972","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-09T23:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"ebd542f5aa0ba70888fd9fd651a6c641701eb00a18562ac63145c03d081bb214","abstract_canon_sha256":"e9e74ccc667aed7fb8fa61ce665c0920a66b96cf7a293fd063d7889052ea561d"},"schema_version":"1.0"},"canonical_sha256":"5648856c9c42b8f578954411c65b855bfb56caaedc71657ec0efd1e216f2122b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:02.333748Z","signature_b64":"nclZSmq1r2IcfBPwnmheBuUD17uIwWneJu4PnN6H4J9vmtr7m46BRmK3r9lNrHZBSFmfsMCZLbZa6+WaeFAxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5648856c9c42b8f578954411c65b855bfb56caaedc71657ec0efd1e216f2122b","last_reissued_at":"2026-05-17T23:50:02.333290Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:02.333290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02972","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-17T23:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vtULNE2rpbewnz2ytgV4TsnE1eOr1u334wdl+rWC6FpE7KOlmUNo4e8b17ekm2R+FMUym6nLOZcYP5rp8tooAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:26:43.975459Z"},"content_sha256":"fa2bdd0ab5506f3b890cfc71b80cd626e26872168f0474ac08502b00054ec685","schema_version":"1.0","event_id":"sha256:fa2bdd0ab5506f3b890cfc71b80cd626e26872168f0474ac08502b00054ec685"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KZEIK3E4IK4PK6EVIQI4MW4FLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A sequential update algorithm for computing the stationary distribution vector in upper block-Hessenberg Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Hiroyuki Masuyama","submitted_at":"2019-01-09T23:38:32Z","abstract_excerpt":"This paper proposes a new algorithm for computing the stationary distribution vector in continuous-time upper block-Hessenberg Markov chains. To this end, we consider the last-block-column-linearly-augmented (LBCL-augmented) truncation of the (infinitesimal) generator of the upper block-Hessenberg Markov chain. The LBCL-augmented truncation is a linearly-augmented truncation such that the augmentation distribution has its probability mass only on the last block column. We first derive an upper bound for the total variation distance between the respective stationary distribution vectors of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02972","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-17T23:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gM0vDdCRWDwnMlt3f+GVhdunZEANVrOBqM5v/xvlEIlcYde9t1X793cnvAGyenYIIuFShv8TP9ZVIYjDZjO1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:26:43.975808Z"},"content_sha256":"1159776de1608e499cb99e613fd1bdddddc304a6d77446adcb39d66cc85b0751","schema_version":"1.0","event_id":"sha256:1159776de1608e499cb99e613fd1bdddddc304a6d77446adcb39d66cc85b0751"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZEIK3E4IK4PK6EVIQI4MW4FLP/bundle.json","state_url":"https://pith.science/pith/KZEIK3E4IK4PK6EVIQI4MW4FLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZEIK3E4IK4PK6EVIQI4MW4FLP/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-09T10:26:43Z","links":{"resolver":"https://pith.science/pith/KZEIK3E4IK4PK6EVIQI4MW4FLP","bundle":"https://pith.science/pith/KZEIK3E4IK4PK6EVIQI4MW4FLP/bundle.json","state":"https://pith.science/pith/KZEIK3E4IK4PK6EVIQI4MW4FLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZEIK3E4IK4PK6EVIQI4MW4FLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KZEIK3E4IK4PK6EVIQI4MW4FLP","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":"e9e74ccc667aed7fb8fa61ce665c0920a66b96cf7a293fd063d7889052ea561d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-09T23:38:32Z","title_canon_sha256":"ebd542f5aa0ba70888fd9fd651a6c641701eb00a18562ac63145c03d081bb214"},"schema_version":"1.0","source":{"id":"1901.02972","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02972","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02972v3","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02972","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"KZEIK3E4IK4P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KZEIK3E4IK4PK6EV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KZEIK3E4","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:1159776de1608e499cb99e613fd1bdddddc304a6d77446adcb39d66cc85b0751","target":"graph","created_at":"2026-05-17T23:50:02Z","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 proposes a new algorithm for computing the stationary distribution vector in continuous-time upper block-Hessenberg Markov chains. To this end, we consider the last-block-column-linearly-augmented (LBCL-augmented) truncation of the (infinitesimal) generator of the upper block-Hessenberg Markov chain. The LBCL-augmented truncation is a linearly-augmented truncation such that the augmentation distribution has its probability mass only on the last block column. We first derive an upper bound for the total variation distance between the respective stationary distribution vectors of the ","authors_text":"Hiroyuki Masuyama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-09T23:38:32Z","title":"A sequential update algorithm for computing the stationary distribution vector in upper block-Hessenberg Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02972","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:fa2bdd0ab5506f3b890cfc71b80cd626e26872168f0474ac08502b00054ec685","target":"record","created_at":"2026-05-17T23:50:02Z","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":"e9e74ccc667aed7fb8fa61ce665c0920a66b96cf7a293fd063d7889052ea561d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-01-09T23:38:32Z","title_canon_sha256":"ebd542f5aa0ba70888fd9fd651a6c641701eb00a18562ac63145c03d081bb214"},"schema_version":"1.0","source":{"id":"1901.02972","kind":"arxiv","version":3}},"canonical_sha256":"5648856c9c42b8f578954411c65b855bfb56caaedc71657ec0efd1e216f2122b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5648856c9c42b8f578954411c65b855bfb56caaedc71657ec0efd1e216f2122b","first_computed_at":"2026-05-17T23:50:02.333290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:02.333290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nclZSmq1r2IcfBPwnmheBuUD17uIwWneJu4PnN6H4J9vmtr7m46BRmK3r9lNrHZBSFmfsMCZLbZa6+WaeFAxBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:02.333748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02972","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa2bdd0ab5506f3b890cfc71b80cd626e26872168f0474ac08502b00054ec685","sha256:1159776de1608e499cb99e613fd1bdddddc304a6d77446adcb39d66cc85b0751"],"state_sha256":"2ee2c727f36f2c0a2efb9c134b28748029eb6e6bcc59da3d05147faa8e0a3d2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYtQK15wRE8NmctzQthAQjybcaP9k8zYhXh9NNlqCthG0ZSMoM4e+whtAoIhvnqreo4dMWzXolxIp8WM4VA1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:26:43.977843Z","bundle_sha256":"f54d5a55b1172a63f43d38185a4ef87115ac9cbae6419983949323da2c769918"}}