{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WJVKCZDPB6YV464XPNHIS22GAZ","short_pith_number":"pith:WJVKCZDP","canonical_record":{"source":{"id":"1808.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T14:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"e0e40038b8a3dd9a0eee2cdeaa61de3872ae1e58e1607a80fac74d272aa1708b","abstract_canon_sha256":"d4c8f1acf8c76dfd1dccdcbef5c9e02306decd060335d8f8d64022e417e6c763"},"schema_version":"1.0"},"canonical_sha256":"b26aa1646f0fb15e7b977b4e896b460649a724e993ed44aa4097b33428124e1e","source":{"kind":"arxiv","id":"1808.03950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03950","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03950v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03950","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"WJVKCZDPB6YV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WJVKCZDPB6YV464X","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WJVKCZDP","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WJVKCZDPB6YV464XPNHIS22GAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T14:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"e0e40038b8a3dd9a0eee2cdeaa61de3872ae1e58e1607a80fac74d272aa1708b","abstract_canon_sha256":"d4c8f1acf8c76dfd1dccdcbef5c9e02306decd060335d8f8d64022e417e6c763"},"schema_version":"1.0"},"canonical_sha256":"b26aa1646f0fb15e7b977b4e896b460649a724e993ed44aa4097b33428124e1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.265105Z","signature_b64":"qfqiNNM9Ui5Ks7GHNNqd+kEmAsPsgtd7eI9dC5mkhDqHg0B5sVhhH+ueJAfHrE5zFNB7rFu3oTFrCERoXi4aBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26aa1646f0fb15e7b977b4e896b460649a724e993ed44aa4097b33428124e1e","last_reissued_at":"2026-05-18T00:08:19.264517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.264517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03950","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-18T00:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzT/vIVrx1/ce0K6OWbOoSnfu91TWuYxLB6Tk/br7VHj0jhkcS66OnbN5a+tbDXcK1CYT0mkDpG2JNlc6rxpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:32:21.900835Z"},"content_sha256":"8501d7dba1e8c1b7c12091084cbd724b2a0aaef0a0b7eefeab83a9687716a7d3","schema_version":"1.0","event_id":"sha256:8501d7dba1e8c1b7c12091084cbd724b2a0aaef0a0b7eefeab83a9687716a7d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WJVKCZDPB6YV464XPNHIS22GAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear least square method for the computation of the mean first passage times of ergodic markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Yaming Chen","submitted_at":"2018-08-12T14:29:13Z","abstract_excerpt":"An efficient and accurate iterative scheme for the computation of the mean first passage times (MFPTs) of ergodic Markov chains has been presented. Firstly, the computation problem of MFPTs is transformed into a set of linear equations. It has been proven that each of these equations is compatible and their minimal norm solutions constitute MFPTs. A new presentation of the MFPTs is also derived. Using linear least square algorithms, some numerical examples compared with the finite algorithm of Hunter [LAA, 549(2018)100-122] and iterative algorithm of J.Xu [AMC, 250(2025)372-389] are given. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03950","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-18T00:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeI50E1vLEH4jL9DMXeTzwoRe0aVHckADJPGKuFRbGMd90umQ458UCm6RpOxvWJtpFEJbMscqhlDSAyYo6gTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:32:21.901517Z"},"content_sha256":"2119ea6da3c77672d93a6b85e6518a52504263b8c4880ac3bc955a6db97637f4","schema_version":"1.0","event_id":"sha256:2119ea6da3c77672d93a6b85e6518a52504263b8c4880ac3bc955a6db97637f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJVKCZDPB6YV464XPNHIS22GAZ/bundle.json","state_url":"https://pith.science/pith/WJVKCZDPB6YV464XPNHIS22GAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJVKCZDPB6YV464XPNHIS22GAZ/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-24T06:32:21Z","links":{"resolver":"https://pith.science/pith/WJVKCZDPB6YV464XPNHIS22GAZ","bundle":"https://pith.science/pith/WJVKCZDPB6YV464XPNHIS22GAZ/bundle.json","state":"https://pith.science/pith/WJVKCZDPB6YV464XPNHIS22GAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJVKCZDPB6YV464XPNHIS22GAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WJVKCZDPB6YV464XPNHIS22GAZ","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":"d4c8f1acf8c76dfd1dccdcbef5c9e02306decd060335d8f8d64022e417e6c763","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T14:29:13Z","title_canon_sha256":"e0e40038b8a3dd9a0eee2cdeaa61de3872ae1e58e1607a80fac74d272aa1708b"},"schema_version":"1.0","source":{"id":"1808.03950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03950","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03950v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03950","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"WJVKCZDPB6YV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WJVKCZDPB6YV464X","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WJVKCZDP","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:2119ea6da3c77672d93a6b85e6518a52504263b8c4880ac3bc955a6db97637f4","target":"graph","created_at":"2026-05-18T00:08:19Z","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":"An efficient and accurate iterative scheme for the computation of the mean first passage times (MFPTs) of ergodic Markov chains has been presented. Firstly, the computation problem of MFPTs is transformed into a set of linear equations. It has been proven that each of these equations is compatible and their minimal norm solutions constitute MFPTs. A new presentation of the MFPTs is also derived. Using linear least square algorithms, some numerical examples compared with the finite algorithm of Hunter [LAA, 549(2018)100-122] and iterative algorithm of J.Xu [AMC, 250(2025)372-389] are given. The","authors_text":"Yaming Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T14:29:13Z","title":"Linear least square method for the computation of the mean first passage times of ergodic markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03950","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:8501d7dba1e8c1b7c12091084cbd724b2a0aaef0a0b7eefeab83a9687716a7d3","target":"record","created_at":"2026-05-18T00:08:19Z","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":"d4c8f1acf8c76dfd1dccdcbef5c9e02306decd060335d8f8d64022e417e6c763","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-12T14:29:13Z","title_canon_sha256":"e0e40038b8a3dd9a0eee2cdeaa61de3872ae1e58e1607a80fac74d272aa1708b"},"schema_version":"1.0","source":{"id":"1808.03950","kind":"arxiv","version":1}},"canonical_sha256":"b26aa1646f0fb15e7b977b4e896b460649a724e993ed44aa4097b33428124e1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b26aa1646f0fb15e7b977b4e896b460649a724e993ed44aa4097b33428124e1e","first_computed_at":"2026-05-18T00:08:19.264517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.264517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qfqiNNM9Ui5Ks7GHNNqd+kEmAsPsgtd7eI9dC5mkhDqHg0B5sVhhH+ueJAfHrE5zFNB7rFu3oTFrCERoXi4aBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.265105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8501d7dba1e8c1b7c12091084cbd724b2a0aaef0a0b7eefeab83a9687716a7d3","sha256:2119ea6da3c77672d93a6b85e6518a52504263b8c4880ac3bc955a6db97637f4"],"state_sha256":"2e145513b05119abd9976df19d3e0441a4ddc874044ae882e6bb9b5c57ef1507"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggytELdIvco8gkgUlqOLZSFKrY/v/v0/HlcP59SyN/E/TW9S5WGhWcjfS/+7XBL5O+qJ9cmrM5+cB1y3Uq9BCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:32:21.905240Z","bundle_sha256":"6f7f9678c45010628040da046f6a8482fa44dfcb09b3b171aa6140e998427660"}}