{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ENSXWRCPTSLDPMET4J2TGUZMNX","short_pith_number":"pith:ENSXWRCP","schema_version":"1.0","canonical_sha256":"23657b444f9c9637b093e27533532c6dd9a144acff2d7bdccf6734220b26df92","source":{"kind":"arxiv","id":"2510.02664","version":1},"attestation_state":"computed","paper":{"title":"HOMC: A MATLAB Package for Higher Order Markov Chains","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Jianhong Xu","submitted_at":"2025-10-03T01:46:22Z","abstract_excerpt":"We present a MATLAB package, which is the first of its kind, for Higher Order Markov Chains (HOMC). It can be used to easily compute all important quantities in our recent works relevant to higher order Markov chains, such as the $k$-step transition tensor, limiting probability distribution, ever-reaching probability tensor, and mean first passage time tensor. It can also be used to check whether a higher order chain is ergodic or regular, to construct the transition matrix of the associated reduced first order chain, and to determine whether a state is recurrent or transient. A key function i"},"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":"2510.02664","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.CO","submitted_at":"2025-10-03T01:46:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"98cd536d0aa737b8308a3fdd3a3945f607fadc6f6600338d261308c011ecb057","abstract_canon_sha256":"618944365a67f044e2cc283c523c3049041523bc7ed04b9a79cd91325260fcce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:25:29.497992Z","signature_b64":"7VHaspyH0krjo1JOmMSMwgPxBobIeKG05CAjOOepEk1MUhNjm/c2SOpwDT7hCsnFj1aFk/WTaEq3GyTRTRKjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23657b444f9c9637b093e27533532c6dd9a144acff2d7bdccf6734220b26df92","last_reissued_at":"2026-07-29T01:25:29.497032Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:25:29.497032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HOMC: A MATLAB Package for Higher Order Markov Chains","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Jianhong Xu","submitted_at":"2025-10-03T01:46:22Z","abstract_excerpt":"We present a MATLAB package, which is the first of its kind, for Higher Order Markov Chains (HOMC). It can be used to easily compute all important quantities in our recent works relevant to higher order Markov chains, such as the $k$-step transition tensor, limiting probability distribution, ever-reaching probability tensor, and mean first passage time tensor. It can also be used to check whether a higher order chain is ergodic or regular, to construct the transition matrix of the associated reduced first order chain, and to determine whether a state is recurrent or transient. A key function i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.02664","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.02664/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2510.02664","created_at":"2026-07-29T01:25:29.497493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.02664v1","created_at":"2026-07-29T01:25:29.497493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.02664","created_at":"2026-07-29T01:25:29.497493+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENSXWRCPTSLD","created_at":"2026-07-29T01:25:29.497493+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENSXWRCPTSLDPMET","created_at":"2026-07-29T01:25:29.497493+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENSXWRCP","created_at":"2026-07-29T01:25:29.497493+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.30482","citing_title":"An Alternative Framework for Irreducibility and Primitivity of Nonnegative Tensors","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2606.10058","citing_title":"Mean First Passage Times and Fundamental Tensors of Higher Order Markov Chains","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX","json":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX.json","graph_json":"https://pith.science/api/pith-number/ENSXWRCPTSLDPMET4J2TGUZMNX/graph.json","events_json":"https://pith.science/api/pith-number/ENSXWRCPTSLDPMET4J2TGUZMNX/events.json","paper":"https://pith.science/paper/ENSXWRCP"},"agent_actions":{"view_html":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX","download_json":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX.json","view_paper":"https://pith.science/paper/ENSXWRCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.02664&json=true","fetch_graph":"https://pith.science/api/pith-number/ENSXWRCPTSLDPMET4J2TGUZMNX/graph.json","fetch_events":"https://pith.science/api/pith-number/ENSXWRCPTSLDPMET4J2TGUZMNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX/action/storage_attestation","attest_author":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX/action/author_attestation","sign_citation":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX/action/citation_signature","submit_replication":"https://pith.science/pith/ENSXWRCPTSLDPMET4J2TGUZMNX/action/replication_record"}},"created_at":"2026-07-29T01:25:29.497493+00:00","updated_at":"2026-07-29T01:25:29.497493+00:00"}