{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GLOPMOP53R3I3FLVDS55U2WWQK","short_pith_number":"pith:GLOPMOP5","canonical_record":{"source":{"id":"1206.4679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-18T15:37:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b9c3ad800cf232a2ffd5b2e3f8f86efa722ed0ae7de56dc4cad8f5e8796362d6","abstract_canon_sha256":"692bdbcd440f64cfed3f9859272c1b10fe0fe095a8ebe1b5ac591fef0a5767f1"},"schema_version":"1.0"},"canonical_sha256":"32dcf639fddc768d95751cbbda6ad6829bc3a0612c92c950b979abb3506dc51b","source":{"kind":"arxiv","id":"1206.4679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4679","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4679v1","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4679","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"GLOPMOP53R3I","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GLOPMOP53R3I3FLV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GLOPMOP5","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GLOPMOP53R3I3FLVDS55U2WWQK","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-18T15:37:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b9c3ad800cf232a2ffd5b2e3f8f86efa722ed0ae7de56dc4cad8f5e8796362d6","abstract_canon_sha256":"692bdbcd440f64cfed3f9859272c1b10fe0fe095a8ebe1b5ac591fef0a5767f1"},"schema_version":"1.0"},"canonical_sha256":"32dcf639fddc768d95751cbbda6ad6829bc3a0612c92c950b979abb3506dc51b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:04.025521Z","signature_b64":"HPkcG7t780FVx/1aR5lI3d6oPk33gxdjeCUvTPHj8nD1TppFZhSz4B4193Lj3nNm+ZUwqaazw4PNUbLP38noAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32dcf639fddc768d95751cbbda6ad6829bc3a0612c92c950b979abb3506dc51b","last_reissued_at":"2026-05-18T03:53:04.024760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:04.024760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4679","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-18T03:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjUm6EEYYdSd/6iUSMI+ukyZ5/cVqnlGh38qRtA3HfXUXfiWsbY+UgZl9rz7N6YwuV25/rRHq7Zs6yE1F63KDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:42:42.176915Z"},"content_sha256":"a248d2d449da38c70629ea2f4e36e28eb288603cda002d02123450d6234d48b8","schema_version":"1.0","event_id":"sha256:a248d2d449da38c70629ea2f4e36e28eb288603cda002d02123450d6234d48b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GLOPMOP53R3I3FLVDS55U2WWQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factorized Asymptotic Bayesian Hidden Markov Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kohei Hayashi (Nara Institute of Science, Ryohei Fujimaki (NEC Laboratories America), Technology)","submitted_at":"2012-06-18T15:37:59Z","abstract_excerpt":"This paper addresses the issue of model selection for hidden Markov models (HMMs). We generalize factorized asymptotic Bayesian inference (FAB), which has been recently developed for model selection on independent hidden variables (i.e., mixture models), for time-dependent hidden variables. As with FAB in mixture models, FAB for HMMs is derived as an iterative lower bound maximization algorithm of a factorized information criterion (FIC). It inherits, from FAB for mixture models, several desirable properties for learning HMMs, such as asymptotic consistency of FIC with marginal log-likelihood,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4679","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-18T03:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3KvGcZTwmtMpZ5K8tjo2lXwlRI7GO5Rwrbkz5sWElfUCZoDnmeMY6Sx9YagGcjRUyRY+Xm3sGlwRZ5kohSQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:42:42.177710Z"},"content_sha256":"f4ae5584adac587971931397a174cbafadd9998bcd8b6f6d9061eea98d965022","schema_version":"1.0","event_id":"sha256:f4ae5584adac587971931397a174cbafadd9998bcd8b6f6d9061eea98d965022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLOPMOP53R3I3FLVDS55U2WWQK/bundle.json","state_url":"https://pith.science/pith/GLOPMOP53R3I3FLVDS55U2WWQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLOPMOP53R3I3FLVDS55U2WWQK/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-11T19:42:42Z","links":{"resolver":"https://pith.science/pith/GLOPMOP53R3I3FLVDS55U2WWQK","bundle":"https://pith.science/pith/GLOPMOP53R3I3FLVDS55U2WWQK/bundle.json","state":"https://pith.science/pith/GLOPMOP53R3I3FLVDS55U2WWQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLOPMOP53R3I3FLVDS55U2WWQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GLOPMOP53R3I3FLVDS55U2WWQK","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":"692bdbcd440f64cfed3f9859272c1b10fe0fe095a8ebe1b5ac591fef0a5767f1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-18T15:37:59Z","title_canon_sha256":"b9c3ad800cf232a2ffd5b2e3f8f86efa722ed0ae7de56dc4cad8f5e8796362d6"},"schema_version":"1.0","source":{"id":"1206.4679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4679","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4679v1","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4679","created_at":"2026-05-18T03:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"GLOPMOP53R3I","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GLOPMOP53R3I3FLV","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GLOPMOP5","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:f4ae5584adac587971931397a174cbafadd9998bcd8b6f6d9061eea98d965022","target":"graph","created_at":"2026-05-18T03:53:04Z","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":"This paper addresses the issue of model selection for hidden Markov models (HMMs). We generalize factorized asymptotic Bayesian inference (FAB), which has been recently developed for model selection on independent hidden variables (i.e., mixture models), for time-dependent hidden variables. As with FAB in mixture models, FAB for HMMs is derived as an iterative lower bound maximization algorithm of a factorized information criterion (FIC). It inherits, from FAB for mixture models, several desirable properties for learning HMMs, such as asymptotic consistency of FIC with marginal log-likelihood,","authors_text":"Kohei Hayashi (Nara Institute of Science, Ryohei Fujimaki (NEC Laboratories America), Technology)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-18T15:37:59Z","title":"Factorized Asymptotic Bayesian Hidden Markov Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4679","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:a248d2d449da38c70629ea2f4e36e28eb288603cda002d02123450d6234d48b8","target":"record","created_at":"2026-05-18T03:53:04Z","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":"692bdbcd440f64cfed3f9859272c1b10fe0fe095a8ebe1b5ac591fef0a5767f1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-18T15:37:59Z","title_canon_sha256":"b9c3ad800cf232a2ffd5b2e3f8f86efa722ed0ae7de56dc4cad8f5e8796362d6"},"schema_version":"1.0","source":{"id":"1206.4679","kind":"arxiv","version":1}},"canonical_sha256":"32dcf639fddc768d95751cbbda6ad6829bc3a0612c92c950b979abb3506dc51b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32dcf639fddc768d95751cbbda6ad6829bc3a0612c92c950b979abb3506dc51b","first_computed_at":"2026-05-18T03:53:04.024760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:04.024760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPkcG7t780FVx/1aR5lI3d6oPk33gxdjeCUvTPHj8nD1TppFZhSz4B4193Lj3nNm+ZUwqaazw4PNUbLP38noAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:04.025521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a248d2d449da38c70629ea2f4e36e28eb288603cda002d02123450d6234d48b8","sha256:f4ae5584adac587971931397a174cbafadd9998bcd8b6f6d9061eea98d965022"],"state_sha256":"79a7cb50cea6e526ffd866a590fce81be16e1fb071ecc66714f8a93c078c47f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ar4sgcTPq9jHK8ZAHslSFZzqV+X//QceGwC8BB2runh43twBA4EXJme5lvtTFZ/rST1ej+LIRj27aYhdZXbOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:42:42.181674Z","bundle_sha256":"ae223ee97c09c3ca5576828e461557647f30f0d24c4569ebc36c7a2efaa12fe5"}}