{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4MUCLMK6EEZ7ZK7AR77SFG3Z3H","short_pith_number":"pith:4MUCLMK6","schema_version":"1.0","canonical_sha256":"e32825b15e2133fcabe08fff229b79d9cce6cf42e4e24efe5504fe89067835f8","source":{"kind":"arxiv","id":"1707.06756","version":1},"attestation_state":"computed","paper":{"title":"An Infinite Hidden Markov Model With Similarity-Biased Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Chaofan Huang, Clayton T. Morrison, Colin Reimer Dawson","submitted_at":"2017-07-21T04:39:10Z","abstract_excerpt":"We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between \"nearby\" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pair-wise similarities, thereby inducing correlations among the transition distributions. We present an augmented data representation of the model as a Markov Jump Process in which: (1) some jump attempts fail, and (2) the probability of success is proportional to the similarity bet"},"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":"1707.06756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-21T04:39:10Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"title_canon_sha256":"3c319d205f868b1a41d0ac0e4b56cfa904d8d58228546a8138969b323ae4aed9","abstract_canon_sha256":"7c707fb251b0bbdfe53b979fffa7e96abe0a34e7a64c811b5c0ddae01b22f77b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:51.750288Z","signature_b64":"O4CpX6TSD4P1krPjvC0F/UaqMDqui7cFvaKWs5zgZCTtkbXtJmZS99sF0kQuyls9GrZsoWXrZdnXRqlBTUFuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e32825b15e2133fcabe08fff229b79d9cce6cf42e4e24efe5504fe89067835f8","last_reissued_at":"2026-05-18T00:39:51.749665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:51.749665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Infinite Hidden Markov Model With Similarity-Biased Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Chaofan Huang, Clayton T. Morrison, Colin Reimer Dawson","submitted_at":"2017-07-21T04:39:10Z","abstract_excerpt":"We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between \"nearby\" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pair-wise similarities, thereby inducing correlations among the transition distributions. We present an augmented data representation of the model as a Markov Jump Process in which: (1) some jump attempts fail, and (2) the probability of success is proportional to the similarity bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06756","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.06756","created_at":"2026-05-18T00:39:51.749757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06756v1","created_at":"2026-05-18T00:39:51.749757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06756","created_at":"2026-05-18T00:39:51.749757+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MUCLMK6EEZ7","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MUCLMK6EEZ7ZK7A","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MUCLMK6","created_at":"2026-05-18T12:31:00.734936+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/4MUCLMK6EEZ7ZK7AR77SFG3Z3H","json":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H.json","graph_json":"https://pith.science/api/pith-number/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/graph.json","events_json":"https://pith.science/api/pith-number/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/events.json","paper":"https://pith.science/paper/4MUCLMK6"},"agent_actions":{"view_html":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H","download_json":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H.json","view_paper":"https://pith.science/paper/4MUCLMK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06756&json=true","fetch_graph":"https://pith.science/api/pith-number/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/graph.json","fetch_events":"https://pith.science/api/pith-number/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/action/storage_attestation","attest_author":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/action/author_attestation","sign_citation":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/action/citation_signature","submit_replication":"https://pith.science/pith/4MUCLMK6EEZ7ZK7AR77SFG3Z3H/action/replication_record"}},"created_at":"2026-05-18T00:39:51.749757+00:00","updated_at":"2026-05-18T00:39:51.749757+00:00"}