{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RJ6K3PDUTVU5XWD3HRFSI6QLJW","short_pith_number":"pith:RJ6K3PDU","schema_version":"1.0","canonical_sha256":"8a7cadbc749d69dbd87b3c4b247a0b4d93b473f1a387efb37efd6a21b3cae597","source":{"kind":"arxiv","id":"1304.0060","version":2},"attestation_state":"computed","paper":{"title":"Reachability Probabilities of Quantum Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Nengkun Yu, Shenggang Ying, Yuan Feng","submitted_at":"2013-03-30T02:16:01Z","abstract_excerpt":"This paper studies three kinds of long-term behaviours, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for computing the reachability, repeated reachability and persistence probabilities of a qMC are presented, and their complexities are analysed."},"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":"1304.0060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-30T02:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"d6f8133394eae3ff16fd8c33c7e5d5312cb31e4b43325fd49716cd34cafe1619","abstract_canon_sha256":"7603185352303eacc6d43882b9a2901a02f12eb677b8f9ad670eec9782e1680a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:33.346900Z","signature_b64":"ZS8vjt87QQMsRRjhdbikaxi+4+qKJ4lIA6/ybwczo2mFIhGoYkpcD26hfnt/nZ+NwdJPYxorKMmCKNn1FJI5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a7cadbc749d69dbd87b3c4b247a0b4d93b473f1a387efb37efd6a21b3cae597","last_reissued_at":"2026-05-18T03:21:33.346398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:33.346398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability Probabilities of Quantum Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Nengkun Yu, Shenggang Ying, Yuan Feng","submitted_at":"2013-03-30T02:16:01Z","abstract_excerpt":"This paper studies three kinds of long-term behaviours, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for computing the reachability, repeated reachability and persistence probabilities of a qMC are presented, and their complexities are analysed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0060","kind":"arxiv","version":2},"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":"1304.0060","created_at":"2026-05-18T03:21:33.346474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0060v2","created_at":"2026-05-18T03:21:33.346474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0060","created_at":"2026-05-18T03:21:33.346474+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJ6K3PDUTVU5","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJ6K3PDUTVU5XWD3","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJ6K3PDU","created_at":"2026-05-18T12:27:57.521954+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/RJ6K3PDUTVU5XWD3HRFSI6QLJW","json":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW.json","graph_json":"https://pith.science/api/pith-number/RJ6K3PDUTVU5XWD3HRFSI6QLJW/graph.json","events_json":"https://pith.science/api/pith-number/RJ6K3PDUTVU5XWD3HRFSI6QLJW/events.json","paper":"https://pith.science/paper/RJ6K3PDU"},"agent_actions":{"view_html":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW","download_json":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW.json","view_paper":"https://pith.science/paper/RJ6K3PDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0060&json=true","fetch_graph":"https://pith.science/api/pith-number/RJ6K3PDUTVU5XWD3HRFSI6QLJW/graph.json","fetch_events":"https://pith.science/api/pith-number/RJ6K3PDUTVU5XWD3HRFSI6QLJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW/action/storage_attestation","attest_author":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW/action/author_attestation","sign_citation":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW/action/citation_signature","submit_replication":"https://pith.science/pith/RJ6K3PDUTVU5XWD3HRFSI6QLJW/action/replication_record"}},"created_at":"2026-05-18T03:21:33.346474+00:00","updated_at":"2026-05-18T03:21:33.346474+00:00"}