{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:56HHC7JJ52M5ALWNSXHZASUBEY","short_pith_number":"pith:56HHC7JJ","canonical_record":{"source":{"id":"1210.0508","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-01T19:13:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d323d167358b2bef9968a268af62258b45e420fec4513f5b1f2f416ef1cd4d2","abstract_canon_sha256":"bbe65c61deb854e65a4ec2a54571d3026906dea6d4f39686448f9d34fd0a1147"},"schema_version":"1.0"},"canonical_sha256":"ef8e717d29ee99d02ecd95cf904a81260f9e5f522ff83c734b23a72648d226d5","source":{"kind":"arxiv","id":"1210.0508","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0508","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0508v5","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0508","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"56HHC7JJ52M5","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"56HHC7JJ52M5ALWN","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"56HHC7JJ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:56HHC7JJ52M5ALWNSXHZASUBEY","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0508","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-01T19:13:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d323d167358b2bef9968a268af62258b45e420fec4513f5b1f2f416ef1cd4d2","abstract_canon_sha256":"bbe65c61deb854e65a4ec2a54571d3026906dea6d4f39686448f9d34fd0a1147"},"schema_version":"1.0"},"canonical_sha256":"ef8e717d29ee99d02ecd95cf904a81260f9e5f522ff83c734b23a72648d226d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:29.537422Z","signature_b64":"pblTONkXRNG6fasVTbS0cs2uZL43eWDqLVFa9AXmIEun8Vw1d9QHI5tUI2TxW0CgskUWU8d6ISb/9YnsW0XtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef8e717d29ee99d02ecd95cf904a81260f9e5f522ff83c734b23a72648d226d5","last_reissued_at":"2026-05-18T00:52:29.536857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:29.536857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0508","source_version":5,"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-18T00:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RRRea/FqtLpq21jf0UKrLYraRh8wKaKmTFkw6+FWFap0MXmwoZG/2KwteRDEhn0e4tHIGffjQuLe6sbLSn0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:39:07.409857Z"},"content_sha256":"a9ffe2c4d6f0544699d69474fc42873745baa5715ad32219deb246d105ccc31e","schema_version":"1.0","event_id":"sha256:a9ffe2c4d6f0544699d69474fc42873745baa5715ad32219deb246d105ccc31e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:56HHC7JJ52M5ALWNSXHZASUBEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inference algorithms for pattern-based CRFs on sequence data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Rustem Takhanov, Vladimir Kolmogorov","submitted_at":"2012-10-01T19:13:59Z","abstract_excerpt":"We consider Conditional Random Fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) $x_1...x_n$ is the sum of terms over intervals $[i,j]$ where each term is non-zero only if the substring $x_i...x_j$ equals a prespecified pattern $\\alpha$. Such CRFs can be naturally applied to many sequence tagging problems.\n  We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively $O(n L)$, $O(n L \\ell"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0508","kind":"arxiv","version":5},"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-18T00:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iyWFD9qGgqAhKz62s2WeKpmzdSSyBhnTRNcEkDgKjLAmuGkWoYBfQO53rusW7/f0jIou+vYwpieD70EY7vehBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:39:07.410207Z"},"content_sha256":"1fbaaebc205d4ac7be9fff7e2130fafd054a7affd89d5dd493f1c1f3f5aa0197","schema_version":"1.0","event_id":"sha256:1fbaaebc205d4ac7be9fff7e2130fafd054a7affd89d5dd493f1c1f3f5aa0197"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56HHC7JJ52M5ALWNSXHZASUBEY/bundle.json","state_url":"https://pith.science/pith/56HHC7JJ52M5ALWNSXHZASUBEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56HHC7JJ52M5ALWNSXHZASUBEY/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-28T12:39:07Z","links":{"resolver":"https://pith.science/pith/56HHC7JJ52M5ALWNSXHZASUBEY","bundle":"https://pith.science/pith/56HHC7JJ52M5ALWNSXHZASUBEY/bundle.json","state":"https://pith.science/pith/56HHC7JJ52M5ALWNSXHZASUBEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56HHC7JJ52M5ALWNSXHZASUBEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:56HHC7JJ52M5ALWNSXHZASUBEY","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":"bbe65c61deb854e65a4ec2a54571d3026906dea6d4f39686448f9d34fd0a1147","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-01T19:13:59Z","title_canon_sha256":"4d323d167358b2bef9968a268af62258b45e420fec4513f5b1f2f416ef1cd4d2"},"schema_version":"1.0","source":{"id":"1210.0508","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0508","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0508v5","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0508","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"56HHC7JJ52M5","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"56HHC7JJ52M5ALWN","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"56HHC7JJ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:1fbaaebc205d4ac7be9fff7e2130fafd054a7affd89d5dd493f1c1f3f5aa0197","target":"graph","created_at":"2026-05-18T00:52:29Z","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":"We consider Conditional Random Fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) $x_1...x_n$ is the sum of terms over intervals $[i,j]$ where each term is non-zero only if the substring $x_i...x_j$ equals a prespecified pattern $\\alpha$. Such CRFs can be naturally applied to many sequence tagging problems.\n  We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively $O(n L)$, $O(n L \\ell","authors_text":"Rustem Takhanov, Vladimir Kolmogorov","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-01T19:13:59Z","title":"Inference algorithms for pattern-based CRFs on sequence data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0508","kind":"arxiv","version":5},"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:a9ffe2c4d6f0544699d69474fc42873745baa5715ad32219deb246d105ccc31e","target":"record","created_at":"2026-05-18T00:52:29Z","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":"bbe65c61deb854e65a4ec2a54571d3026906dea6d4f39686448f9d34fd0a1147","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-01T19:13:59Z","title_canon_sha256":"4d323d167358b2bef9968a268af62258b45e420fec4513f5b1f2f416ef1cd4d2"},"schema_version":"1.0","source":{"id":"1210.0508","kind":"arxiv","version":5}},"canonical_sha256":"ef8e717d29ee99d02ecd95cf904a81260f9e5f522ff83c734b23a72648d226d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef8e717d29ee99d02ecd95cf904a81260f9e5f522ff83c734b23a72648d226d5","first_computed_at":"2026-05-18T00:52:29.536857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:29.536857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pblTONkXRNG6fasVTbS0cs2uZL43eWDqLVFa9AXmIEun8Vw1d9QHI5tUI2TxW0CgskUWU8d6ISb/9YnsW0XtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:29.537422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0508","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9ffe2c4d6f0544699d69474fc42873745baa5715ad32219deb246d105ccc31e","sha256:1fbaaebc205d4ac7be9fff7e2130fafd054a7affd89d5dd493f1c1f3f5aa0197"],"state_sha256":"9f6a9964930f3034da93877b3844167aa1870fb025b65829e1ded7c351c80a8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uzs2ZNieILII3Idsr88OcVN7gFIbPpsZhSqwdXZi75J9rnyrspvMATmIqYMpsxcR8dUuUfd1AMRImNzeLGPXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:39:07.412152Z","bundle_sha256":"6bb56d611d9274162a0daa27709209999e1ef466f7fdcdb1ac06c758c11769ac"}}