{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BYUXX7BPWXXYVYQTWEXVHKSPY2","short_pith_number":"pith:BYUXX7BP","canonical_record":{"source":{"id":"1007.5421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-30T11:55:05Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"a04c376379eb85cfc8a94e9beb68752e43d92658cadda652220308eebfbd6fa8","abstract_canon_sha256":"d87d686482d596dcc208be3fe84e3aa9345f99cc7fcd56487558ca91c53dc694"},"schema_version":"1.0"},"canonical_sha256":"0e297bfc2fb5ef8ae213b12f53aa4fc68afb852904793de1f9fbdb35223c9c9c","source":{"kind":"arxiv","id":"1007.5421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5421","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5421v1","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5421","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"BYUXX7BPWXXY","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BYUXX7BPWXXYVYQT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BYUXX7BP","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BYUXX7BPWXXYVYQTWEXVHKSPY2","target":"record","payload":{"canonical_record":{"source":{"id":"1007.5421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-30T11:55:05Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"a04c376379eb85cfc8a94e9beb68752e43d92658cadda652220308eebfbd6fa8","abstract_canon_sha256":"d87d686482d596dcc208be3fe84e3aa9345f99cc7fcd56487558ca91c53dc694"},"schema_version":"1.0"},"canonical_sha256":"0e297bfc2fb5ef8ae213b12f53aa4fc68afb852904793de1f9fbdb35223c9c9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:45.243033Z","signature_b64":"SIw+KJEbjdfCql9hariU4xM5P/Ld1Vpp0zWP79T25aTRB2U53BzgPFhm5/aUIlbiA9BhKUWhq9FlaVWL5wmSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e297bfc2fb5ef8ae213b12f53aa4fc68afb852904793de1f9fbdb35223c9c9c","last_reissued_at":"2026-05-18T04:42:45.242522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:45.242522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.5421","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-18T04:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SofDXB2Ot3M+sywDL/LniSDFn305ksXZ9MRFzxzX6LeWcmaFvBg7p16wHaQ2BSIgtKS4VQ2dndjoesLaq56cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:59:18.012442Z"},"content_sha256":"e2926ca375861da922f09f7cc110ca885cc09c48a3e1799fbc5321f950c4af48","schema_version":"1.0","event_id":"sha256:e2926ca375861da922f09f7cc110ca885cc09c48a3e1799fbc5321f950c4af48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BYUXX7BPWXXYVYQTWEXVHKSPY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inference with Constrained Hidden Markov Models in PRISM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Christian Theil Have, Henning Christiansen, Matthieu Petit, Ole Torp Lassen","submitted_at":"2010-07-30T11:55:05Z","abstract_excerpt":"A Hidden Markov Model (HMM) is a common statistical model which is widely used for analysis of biological sequence data and other sequential phenomena. In the present paper we show how HMMs can be extended with side-constraints and present constraint solving techniques for efficient inference. Defining HMMs with side-constraints in Constraint Logic Programming have advantages in terms of more compact expression and pruning opportunities during inference.\n  We present a PRISM-based framework for extending HMMs with side-constraints and show how well-known constraints such as cardinality and all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5421","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-18T04:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AYNt9DjL3ccYL/DMTWj0o6aaycPWgCG90g8+H2uRbzQYGde8fUSSgqxq8nOZH5nc09smFyPUjbb9yusAMq/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:59:18.012799Z"},"content_sha256":"696c3d3fd17f5a9b7376e4e3415d43cbcd175d1d0d7a78161b2676fe7b56ee29","schema_version":"1.0","event_id":"sha256:696c3d3fd17f5a9b7376e4e3415d43cbcd175d1d0d7a78161b2676fe7b56ee29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYUXX7BPWXXYVYQTWEXVHKSPY2/bundle.json","state_url":"https://pith.science/pith/BYUXX7BPWXXYVYQTWEXVHKSPY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYUXX7BPWXXYVYQTWEXVHKSPY2/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-09T17:59:18Z","links":{"resolver":"https://pith.science/pith/BYUXX7BPWXXYVYQTWEXVHKSPY2","bundle":"https://pith.science/pith/BYUXX7BPWXXYVYQTWEXVHKSPY2/bundle.json","state":"https://pith.science/pith/BYUXX7BPWXXYVYQTWEXVHKSPY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYUXX7BPWXXYVYQTWEXVHKSPY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BYUXX7BPWXXYVYQTWEXVHKSPY2","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":"d87d686482d596dcc208be3fe84e3aa9345f99cc7fcd56487558ca91c53dc694","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-30T11:55:05Z","title_canon_sha256":"a04c376379eb85cfc8a94e9beb68752e43d92658cadda652220308eebfbd6fa8"},"schema_version":"1.0","source":{"id":"1007.5421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5421","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5421v1","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5421","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"BYUXX7BPWXXY","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BYUXX7BPWXXYVYQT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BYUXX7BP","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:696c3d3fd17f5a9b7376e4e3415d43cbcd175d1d0d7a78161b2676fe7b56ee29","target":"graph","created_at":"2026-05-18T04:42:45Z","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":"A Hidden Markov Model (HMM) is a common statistical model which is widely used for analysis of biological sequence data and other sequential phenomena. In the present paper we show how HMMs can be extended with side-constraints and present constraint solving techniques for efficient inference. Defining HMMs with side-constraints in Constraint Logic Programming have advantages in terms of more compact expression and pruning opportunities during inference.\n  We present a PRISM-based framework for extending HMMs with side-constraints and show how well-known constraints such as cardinality and all","authors_text":"Christian Theil Have, Henning Christiansen, Matthieu Petit, Ole Torp Lassen","cross_cats":["cs.LO","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-30T11:55:05Z","title":"Inference with Constrained Hidden Markov Models in PRISM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5421","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:e2926ca375861da922f09f7cc110ca885cc09c48a3e1799fbc5321f950c4af48","target":"record","created_at":"2026-05-18T04:42:45Z","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":"d87d686482d596dcc208be3fe84e3aa9345f99cc7fcd56487558ca91c53dc694","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-30T11:55:05Z","title_canon_sha256":"a04c376379eb85cfc8a94e9beb68752e43d92658cadda652220308eebfbd6fa8"},"schema_version":"1.0","source":{"id":"1007.5421","kind":"arxiv","version":1}},"canonical_sha256":"0e297bfc2fb5ef8ae213b12f53aa4fc68afb852904793de1f9fbdb35223c9c9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e297bfc2fb5ef8ae213b12f53aa4fc68afb852904793de1f9fbdb35223c9c9c","first_computed_at":"2026-05-18T04:42:45.242522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:45.242522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SIw+KJEbjdfCql9hariU4xM5P/Ld1Vpp0zWP79T25aTRB2U53BzgPFhm5/aUIlbiA9BhKUWhq9FlaVWL5wmSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:45.243033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.5421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2926ca375861da922f09f7cc110ca885cc09c48a3e1799fbc5321f950c4af48","sha256:696c3d3fd17f5a9b7376e4e3415d43cbcd175d1d0d7a78161b2676fe7b56ee29"],"state_sha256":"8383133966c1a2bcb049e6481ba4924d1094436a1e4cf7d253cb74b54025e97e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/FLwtMO55r3E72GNqscuX/AyixzdYM94tRO8KznsrpTzf0LwnxyjwHVw5/Lx/WaO2gBY+aYbJ+kVEW7L4P7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:59:18.014813Z","bundle_sha256":"cd521441be6ff0fca3b579c115445cbc7d84a225d4a5b8074f0a54001f02b921"}}