{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:27BGKVYW6K5PE63OSLUXLTLEMX","short_pith_number":"pith:27BGKVYW","canonical_record":{"source":{"id":"1001.4499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-25T17:53:43Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"c98b54288fe2198b6fccdf89ba7ce0ab35eb0c4a50d79d2482ac5afc3075fea2","abstract_canon_sha256":"a54366b26ed055045ec305121a679f947bb0866e64b3e5786850cde10332964c"},"schema_version":"1.0"},"canonical_sha256":"d7c2655716f2baf27b6e92e975cd6465e2edb60133d6cdcf8ef8ba867117567b","source":{"kind":"arxiv","id":"1001.4499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4499","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4499v1","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4499","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"27BGKVYW6K5P","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"27BGKVYW6K5PE63O","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"27BGKVYW","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:27BGKVYW6K5PE63OSLUXLTLEMX","target":"record","payload":{"canonical_record":{"source":{"id":"1001.4499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-25T17:53:43Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"c98b54288fe2198b6fccdf89ba7ce0ab35eb0c4a50d79d2482ac5afc3075fea2","abstract_canon_sha256":"a54366b26ed055045ec305121a679f947bb0866e64b3e5786850cde10332964c"},"schema_version":"1.0"},"canonical_sha256":"d7c2655716f2baf27b6e92e975cd6465e2edb60133d6cdcf8ef8ba867117567b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:50.113409Z","signature_b64":"WDGHcNMkSb7kMwr7oczyqWsBPbWQ5SUb7UEuQLVxWwNFJmKwzuoXT1/AWUn5bbV68NL9pktPrfkUfZADi7yQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7c2655716f2baf27b6e92e975cd6465e2edb60133d6cdcf8ef8ba867117567b","last_reissued_at":"2026-05-18T03:16:50.112692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:50.112692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.4499","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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUMZGdnKqTQjDQ4xfGulZlE5MbdTyILver+UwgC/+bOR3QgLVNagM39AjG+7RsasbvqQKdIwLXau6ZYr/oseBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:54:14.609424Z"},"content_sha256":"80c250c4d228423114d5ebbefbe870ab2720b3b0497311104298916bcc174376","schema_version":"1.0","event_id":"sha256:80c250c4d228423114d5ebbefbe870ab2720b3b0497311104298916bcc174376"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:27BGKVYW6K5PE63OSLUXLTLEMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Bro\\v{n}a Brejov\\'a, Michal N\\'an\\'asi, Tom\\'a\\v{s} Vina\\v{r}","submitted_at":"2010-01-25T17:53:43Z","abstract_excerpt":"Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations of the Viterbi decoding have been demonstrated, and new algorithms have been developed to address them \\citep{Kall2005,Brejova2007,Gross2007,Brown2010}.\n  In this paper, we propose a new efficient highest expected reward decoding algorithm (HERD) that allows for uncertainty in boundaries of individual sequence features. We demonstrate usefulness of our approach on jumping HMMs for recombination detection in viral genomes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4499","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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CD/T04d+t2mA9esl/YzEsA5Mh5zZa1pHyxVFr8nvZYa5vkFLxgBL84YfGlAg5Ycz1QXN6pXHNYVFW8BHivj5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:54:14.609767Z"},"content_sha256":"ec67373c5fa7c6f538529b3050bd0f866ed69abac47f958e79e654c34104cd07","schema_version":"1.0","event_id":"sha256:ec67373c5fa7c6f538529b3050bd0f866ed69abac47f958e79e654c34104cd07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27BGKVYW6K5PE63OSLUXLTLEMX/bundle.json","state_url":"https://pith.science/pith/27BGKVYW6K5PE63OSLUXLTLEMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27BGKVYW6K5PE63OSLUXLTLEMX/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-29T21:54:14Z","links":{"resolver":"https://pith.science/pith/27BGKVYW6K5PE63OSLUXLTLEMX","bundle":"https://pith.science/pith/27BGKVYW6K5PE63OSLUXLTLEMX/bundle.json","state":"https://pith.science/pith/27BGKVYW6K5PE63OSLUXLTLEMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27BGKVYW6K5PE63OSLUXLTLEMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:27BGKVYW6K5PE63OSLUXLTLEMX","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":"a54366b26ed055045ec305121a679f947bb0866e64b3e5786850cde10332964c","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-25T17:53:43Z","title_canon_sha256":"c98b54288fe2198b6fccdf89ba7ce0ab35eb0c4a50d79d2482ac5afc3075fea2"},"schema_version":"1.0","source":{"id":"1001.4499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4499","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4499v1","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4499","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"27BGKVYW6K5P","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"27BGKVYW6K5PE63O","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"27BGKVYW","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:ec67373c5fa7c6f538529b3050bd0f866ed69abac47f958e79e654c34104cd07","target":"graph","created_at":"2026-05-18T03:16:50Z","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":"Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations of the Viterbi decoding have been demonstrated, and new algorithms have been developed to address them \\citep{Kall2005,Brejova2007,Gross2007,Brown2010}.\n  In this paper, we propose a new efficient highest expected reward decoding algorithm (HERD) that allows for uncertainty in boundaries of individual sequence features. We demonstrate usefulness of our approach on jumping HMMs for recombination detection in viral genomes.","authors_text":"Bro\\v{n}a Brejov\\'a, Michal N\\'an\\'asi, Tom\\'a\\v{s} Vina\\v{r}","cross_cats":["q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-25T17:53:43Z","title":"The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4499","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:80c250c4d228423114d5ebbefbe870ab2720b3b0497311104298916bcc174376","target":"record","created_at":"2026-05-18T03:16:50Z","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":"a54366b26ed055045ec305121a679f947bb0866e64b3e5786850cde10332964c","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-25T17:53:43Z","title_canon_sha256":"c98b54288fe2198b6fccdf89ba7ce0ab35eb0c4a50d79d2482ac5afc3075fea2"},"schema_version":"1.0","source":{"id":"1001.4499","kind":"arxiv","version":1}},"canonical_sha256":"d7c2655716f2baf27b6e92e975cd6465e2edb60133d6cdcf8ef8ba867117567b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7c2655716f2baf27b6e92e975cd6465e2edb60133d6cdcf8ef8ba867117567b","first_computed_at":"2026-05-18T03:16:50.112692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:50.112692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WDGHcNMkSb7kMwr7oczyqWsBPbWQ5SUb7UEuQLVxWwNFJmKwzuoXT1/AWUn5bbV68NL9pktPrfkUfZADi7yQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:50.113409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.4499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80c250c4d228423114d5ebbefbe870ab2720b3b0497311104298916bcc174376","sha256:ec67373c5fa7c6f538529b3050bd0f866ed69abac47f958e79e654c34104cd07"],"state_sha256":"fada93478d344ce23ed5dae06d4f2e9955207109bfae62484678b5592334818e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAY+cuyH6mnc2T9yO6vxRcQJFjRB/KSLtFQjPZxWzhApPEblCz7zW6P9a7wCz3XLP2/QhacHt7uXVubcsfBeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:54:14.611639Z","bundle_sha256":"96c6d740f5b24a8f4fb9a313647d062583604c720a75a1f00587fba7edb850cd"}}