{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SVGNDI4SABMRIF7UUZ7L6HY3LH","short_pith_number":"pith:SVGNDI4S","canonical_record":{"source":{"id":"0909.0737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2009-09-03T19:29:56Z","cross_cats_sorted":["cs.LG","q-bio.GN"],"title_canon_sha256":"177d6d004ef0dd65cc66020941fba107b6009c7290dded12eb9d565c79cc4e98","abstract_canon_sha256":"a4c061f7138961279ca9b04cbd75c98d02ca91befdcb888104d0688c142a576d"},"schema_version":"1.0"},"canonical_sha256":"954cd1a39200591417f4a67ebf1f1b59e4d8c9934dd4ead4ad683a711d929e89","source":{"kind":"arxiv","id":"0909.0737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0737","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0737v2","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0737","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"pith_short_12","alias_value":"SVGNDI4SABMR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SVGNDI4SABMRIF7U","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SVGNDI4S","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SVGNDI4SABMRIF7UUZ7L6HY3LH","target":"record","payload":{"canonical_record":{"source":{"id":"0909.0737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2009-09-03T19:29:56Z","cross_cats_sorted":["cs.LG","q-bio.GN"],"title_canon_sha256":"177d6d004ef0dd65cc66020941fba107b6009c7290dded12eb9d565c79cc4e98","abstract_canon_sha256":"a4c061f7138961279ca9b04cbd75c98d02ca91befdcb888104d0688c142a576d"},"schema_version":"1.0"},"canonical_sha256":"954cd1a39200591417f4a67ebf1f1b59e4d8c9934dd4ead4ad683a711d929e89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:05.499344Z","signature_b64":"ajZNxXol/GYGCxtyH4H5iqMAjWHVArzt3CMu15D43exrfpO58KuXwxXyDnN63zAUIfkFDbk33lLB9wZ3u8VpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"954cd1a39200591417f4a67ebf1f1b59e4d8c9934dd4ead4ad683a711d929e89","last_reissued_at":"2026-05-18T03:43:05.498687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:05.498687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.0737","source_version":2,"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:43:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llIJvQgprKtGorWGiRvcxg8OAjMX5Y0jCa06+2PCDciZ2fNRP3k7mp2IDsYhipX2CITPIUTlNg/dqu9FpixQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:22:30.822227Z"},"content_sha256":"f3cbb34c6391f2638b2eaa4502e480b4c33946f74595ec5b24a50f4d95816e22","schema_version":"1.0","event_id":"sha256:f3cbb34c6391f2638b2eaa4502e480b4c33946f74595ec5b24a50f4d95816e22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SVGNDI4SABMRIF7UUZ7L6HY3LH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient algorithms for training the parameters of hidden Markov models using stochastic expectation maximization EM training and Viterbi training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-bio.GN"],"primary_cat":"q-bio.QM","authors_text":"Irmtraud M. Meyer, Tin Yin Lam","submitted_at":"2009-09-03T19:29:56Z","abstract_excerpt":"Background: Hidden Markov models are widely employed by numerous bioinformatics programs used today. Applications range widely from comparative gene prediction to time-series analyses of micro-array data. The parameters of the underlying models need to be adjusted for specific data sets, for example the genome of a particular species, in order to maximize the prediction accuracy. Computationally efficient algorithms for parameter training are thus key to maximizing the usability of a wide range of bioinformatics applications.\n  Results: We introduce two computationally efficient training algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0737","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"},"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:43:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxLPhLVwIulVJ0+js1uTY39qGIUpwhPobkmseinMptA8XkrdMIjwkIQ+d3tAElTfrNyQVgoEYm4VULD9Xz9+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:22:30.823126Z"},"content_sha256":"483f051aed4ea63d28a0247e1c020e77357985bac9d264bb6a36e37ee5ea3fe9","schema_version":"1.0","event_id":"sha256:483f051aed4ea63d28a0247e1c020e77357985bac9d264bb6a36e37ee5ea3fe9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVGNDI4SABMRIF7UUZ7L6HY3LH/bundle.json","state_url":"https://pith.science/pith/SVGNDI4SABMRIF7UUZ7L6HY3LH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVGNDI4SABMRIF7UUZ7L6HY3LH/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-09T12:22:30Z","links":{"resolver":"https://pith.science/pith/SVGNDI4SABMRIF7UUZ7L6HY3LH","bundle":"https://pith.science/pith/SVGNDI4SABMRIF7UUZ7L6HY3LH/bundle.json","state":"https://pith.science/pith/SVGNDI4SABMRIF7UUZ7L6HY3LH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVGNDI4SABMRIF7UUZ7L6HY3LH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SVGNDI4SABMRIF7UUZ7L6HY3LH","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":"a4c061f7138961279ca9b04cbd75c98d02ca91befdcb888104d0688c142a576d","cross_cats_sorted":["cs.LG","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2009-09-03T19:29:56Z","title_canon_sha256":"177d6d004ef0dd65cc66020941fba107b6009c7290dded12eb9d565c79cc4e98"},"schema_version":"1.0","source":{"id":"0909.0737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0737","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0737v2","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0737","created_at":"2026-05-18T03:43:05Z"},{"alias_kind":"pith_short_12","alias_value":"SVGNDI4SABMR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SVGNDI4SABMRIF7U","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SVGNDI4S","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:483f051aed4ea63d28a0247e1c020e77357985bac9d264bb6a36e37ee5ea3fe9","target":"graph","created_at":"2026-05-18T03:43:05Z","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":"Background: Hidden Markov models are widely employed by numerous bioinformatics programs used today. Applications range widely from comparative gene prediction to time-series analyses of micro-array data. The parameters of the underlying models need to be adjusted for specific data sets, for example the genome of a particular species, in order to maximize the prediction accuracy. Computationally efficient algorithms for parameter training are thus key to maximizing the usability of a wide range of bioinformatics applications.\n  Results: We introduce two computationally efficient training algor","authors_text":"Irmtraud M. Meyer, Tin Yin Lam","cross_cats":["cs.LG","q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2009-09-03T19:29:56Z","title":"Efficient algorithms for training the parameters of hidden Markov models using stochastic expectation maximization EM training and Viterbi training"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0737","kind":"arxiv","version":2},"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:f3cbb34c6391f2638b2eaa4502e480b4c33946f74595ec5b24a50f4d95816e22","target":"record","created_at":"2026-05-18T03:43:05Z","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":"a4c061f7138961279ca9b04cbd75c98d02ca91befdcb888104d0688c142a576d","cross_cats_sorted":["cs.LG","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2009-09-03T19:29:56Z","title_canon_sha256":"177d6d004ef0dd65cc66020941fba107b6009c7290dded12eb9d565c79cc4e98"},"schema_version":"1.0","source":{"id":"0909.0737","kind":"arxiv","version":2}},"canonical_sha256":"954cd1a39200591417f4a67ebf1f1b59e4d8c9934dd4ead4ad683a711d929e89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"954cd1a39200591417f4a67ebf1f1b59e4d8c9934dd4ead4ad683a711d929e89","first_computed_at":"2026-05-18T03:43:05.498687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:05.498687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ajZNxXol/GYGCxtyH4H5iqMAjWHVArzt3CMu15D43exrfpO58KuXwxXyDnN63zAUIfkFDbk33lLB9wZ3u8VpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:05.499344Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.0737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3cbb34c6391f2638b2eaa4502e480b4c33946f74595ec5b24a50f4d95816e22","sha256:483f051aed4ea63d28a0247e1c020e77357985bac9d264bb6a36e37ee5ea3fe9"],"state_sha256":"e33ec16c0bbe3723eb9a1ccb8ec648d26b8e83a2c5303c841e2d9cc169c89cf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msSgle9LTtHKlxoZMZLJg2rmIzUGZdjgh1phdaHpClYV+68tGytqROMR/26L9OnquCFmYf3OntjrgLOv+W5rBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:22:30.826496Z","bundle_sha256":"d77f3f5baa8221164211c850844ad6d584f7ffa00e5c50e590f31dca6be8636b"}}