{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:67YTF4QV2ZP2NTQDFHUKYTHEGD","short_pith_number":"pith:67YTF4QV","schema_version":"1.0","canonical_sha256":"f7f132f215d65fa6ce0329e8ac4ce430e248fe28bd4acfcfa53a120583b26e05","source":{"kind":"arxiv","id":"1506.06268","version":4},"attestation_state":"computed","paper":{"title":"Bayesian Nonparametric Modeling of Higher Order Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Abhra Sarkar, David B. Dunson","submitted_at":"2015-06-20T16:54:16Z","abstract_excerpt":"We consider the problem of flexible modeling of higher order Markov chains when an upper bound on the order of the chain is known but the true order and nature of the serial dependence are unknown. We propose Bayesian nonparametric methodology based on conditional tensor factorizations, which can characterize any transition probability with a specified maximal order. The methodology selects the important lags and captures higher order interactions among the lags, while also facilitating calculation of Bayes factors for a variety of hypotheses of interest. We design efficient Markov chain Monte"},"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":"1506.06268","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-06-20T16:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"2602ab784a08e1362018ed5a8456cd262e2cfb0e4efbbb5300906292e79dcc02","abstract_canon_sha256":"59d69bc69fd3b958fa19425b2eba66c4407319daabd28f35fe5d5b738242f461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:45.666331Z","signature_b64":"Ov41chWRv9yg3aRU6qBxnmAPF+P6jox2prQdu/8p5lhoNqxmLoTjdBb57/cuQ4+Myl0SyWq8gM0D0XSl9/hcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f132f215d65fa6ce0329e8ac4ce430e248fe28bd4acfcfa53a120583b26e05","last_reissued_at":"2026-05-18T01:29:45.665848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:45.665848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Nonparametric Modeling of Higher Order Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Abhra Sarkar, David B. Dunson","submitted_at":"2015-06-20T16:54:16Z","abstract_excerpt":"We consider the problem of flexible modeling of higher order Markov chains when an upper bound on the order of the chain is known but the true order and nature of the serial dependence are unknown. We propose Bayesian nonparametric methodology based on conditional tensor factorizations, which can characterize any transition probability with a specified maximal order. The methodology selects the important lags and captures higher order interactions among the lags, while also facilitating calculation of Bayes factors for a variety of hypotheses of interest. We design efficient Markov chain Monte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06268","kind":"arxiv","version":4},"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":"1506.06268","created_at":"2026-05-18T01:29:45.665929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06268v4","created_at":"2026-05-18T01:29:45.665929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06268","created_at":"2026-05-18T01:29:45.665929+00:00"},{"alias_kind":"pith_short_12","alias_value":"67YTF4QV2ZP2","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"67YTF4QV2ZP2NTQD","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"67YTF4QV","created_at":"2026-05-18T12:29:07.941421+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/67YTF4QV2ZP2NTQDFHUKYTHEGD","json":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD.json","graph_json":"https://pith.science/api/pith-number/67YTF4QV2ZP2NTQDFHUKYTHEGD/graph.json","events_json":"https://pith.science/api/pith-number/67YTF4QV2ZP2NTQDFHUKYTHEGD/events.json","paper":"https://pith.science/paper/67YTF4QV"},"agent_actions":{"view_html":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD","download_json":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD.json","view_paper":"https://pith.science/paper/67YTF4QV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06268&json=true","fetch_graph":"https://pith.science/api/pith-number/67YTF4QV2ZP2NTQDFHUKYTHEGD/graph.json","fetch_events":"https://pith.science/api/pith-number/67YTF4QV2ZP2NTQDFHUKYTHEGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD/action/storage_attestation","attest_author":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD/action/author_attestation","sign_citation":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD/action/citation_signature","submit_replication":"https://pith.science/pith/67YTF4QV2ZP2NTQDFHUKYTHEGD/action/replication_record"}},"created_at":"2026-05-18T01:29:45.665929+00:00","updated_at":"2026-05-18T01:29:45.665929+00:00"}