{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UMNQKDVAOOTWH2TN7WD727TGSE","short_pith_number":"pith:UMNQKDVA","canonical_record":{"source":{"id":"1607.04229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-14T17:58:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"96baf23b190963a9db60b0ef370e6690bcd4055233d3da128a67a083797d2acb","abstract_canon_sha256":"06520618776b8d14c8c8b584779e1b1c97483ef3334c8001576f1c28aeb1e22d"},"schema_version":"1.0"},"canonical_sha256":"a31b050ea073a763ea6dfd87fd7e669127199a579c2db19c51efbc107a77cf7e","source":{"kind":"arxiv","id":"1607.04229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04229","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04229v2","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04229","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"UMNQKDVAOOTW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMNQKDVAOOTWH2TN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMNQKDVA","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UMNQKDVAOOTWH2TN7WD727TGSE","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-14T17:58:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"96baf23b190963a9db60b0ef370e6690bcd4055233d3da128a67a083797d2acb","abstract_canon_sha256":"06520618776b8d14c8c8b584779e1b1c97483ef3334c8001576f1c28aeb1e22d"},"schema_version":"1.0"},"canonical_sha256":"a31b050ea073a763ea6dfd87fd7e669127199a579c2db19c51efbc107a77cf7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.154474Z","signature_b64":"zoIl4jccvWyS8kaRV5+r1l7Cb5fRasm/Dh6MmfdZI78H8F6QOWozPXpCWHJqF9EhgHriGdwRo5xtY8sdqJO1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31b050ea073a763ea6dfd87fd7e669127199a579c2db19c51efbc107a77cf7e","last_reissued_at":"2026-05-18T01:00:19.153788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.153788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04229","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-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYyZ/iR7dvefxFh47jWH9s4MNEv11+lUQTnPYTMK48mxrsydQI97Ass+5/KWoXmKWOzGyH+NiX23wLTbqvV8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:54:27.327244Z"},"content_sha256":"6f311c65747df5df7b7b0bc6db9e823a6141863d64f0f8aac761af13a1e8ec81","schema_version":"1.0","event_id":"sha256:6f311c65747df5df7b7b0bc6db9e823a6141863d64f0f8aac761af13a1e8ec81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UMNQKDVAOOTWH2TN7WD727TGSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arturs Backurs, Christos Tzamos","submitted_at":"2016-07-14T17:58:09Z","abstract_excerpt":"The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time $O(Tn^2)$ given a sequence of $T$ observations from a HMM with $n$ states. Despite significant interest in the problem and prolonged effort by different communities, no known algorithm achieves more than a polylogarithmic speedup.\n  In this paper, we explain this difficulty by providing matching conditional lower bounds. We show that the Viterbi algorithm runtime is optimal up to subpolynomial factors even when the number of distinct ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04229","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-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCr4mOILskgMgMie/uURUtMz07ioMoFpRAloNITiZdqAg4Ckfdu/dtLXV47M0q8V50GYy7x21rGZWuEGocxmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:54:27.327697Z"},"content_sha256":"cf80504caefec1e9433ecca457b0c63d9f067e065b8da509adbb28aff457cb83","schema_version":"1.0","event_id":"sha256:cf80504caefec1e9433ecca457b0c63d9f067e065b8da509adbb28aff457cb83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMNQKDVAOOTWH2TN7WD727TGSE/bundle.json","state_url":"https://pith.science/pith/UMNQKDVAOOTWH2TN7WD727TGSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMNQKDVAOOTWH2TN7WD727TGSE/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-05-30T16:54:27Z","links":{"resolver":"https://pith.science/pith/UMNQKDVAOOTWH2TN7WD727TGSE","bundle":"https://pith.science/pith/UMNQKDVAOOTWH2TN7WD727TGSE/bundle.json","state":"https://pith.science/pith/UMNQKDVAOOTWH2TN7WD727TGSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMNQKDVAOOTWH2TN7WD727TGSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UMNQKDVAOOTWH2TN7WD727TGSE","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":"06520618776b8d14c8c8b584779e1b1c97483ef3334c8001576f1c28aeb1e22d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-14T17:58:09Z","title_canon_sha256":"96baf23b190963a9db60b0ef370e6690bcd4055233d3da128a67a083797d2acb"},"schema_version":"1.0","source":{"id":"1607.04229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04229","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04229v2","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04229","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"UMNQKDVAOOTW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMNQKDVAOOTWH2TN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMNQKDVA","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:cf80504caefec1e9433ecca457b0c63d9f067e065b8da509adbb28aff457cb83","target":"graph","created_at":"2026-05-18T01:00:19Z","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":"The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time $O(Tn^2)$ given a sequence of $T$ observations from a HMM with $n$ states. Despite significant interest in the problem and prolonged effort by different communities, no known algorithm achieves more than a polylogarithmic speedup.\n  In this paper, we explain this difficulty by providing matching conditional lower bounds. We show that the Viterbi algorithm runtime is optimal up to subpolynomial factors even when the number of distinct ob","authors_text":"Arturs Backurs, Christos Tzamos","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-14T17:58:09Z","title":"Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04229","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:6f311c65747df5df7b7b0bc6db9e823a6141863d64f0f8aac761af13a1e8ec81","target":"record","created_at":"2026-05-18T01:00:19Z","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":"06520618776b8d14c8c8b584779e1b1c97483ef3334c8001576f1c28aeb1e22d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-14T17:58:09Z","title_canon_sha256":"96baf23b190963a9db60b0ef370e6690bcd4055233d3da128a67a083797d2acb"},"schema_version":"1.0","source":{"id":"1607.04229","kind":"arxiv","version":2}},"canonical_sha256":"a31b050ea073a763ea6dfd87fd7e669127199a579c2db19c51efbc107a77cf7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a31b050ea073a763ea6dfd87fd7e669127199a579c2db19c51efbc107a77cf7e","first_computed_at":"2026-05-18T01:00:19.153788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:19.153788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zoIl4jccvWyS8kaRV5+r1l7Cb5fRasm/Dh6MmfdZI78H8F6QOWozPXpCWHJqF9EhgHriGdwRo5xtY8sdqJO1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:19.154474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f311c65747df5df7b7b0bc6db9e823a6141863d64f0f8aac761af13a1e8ec81","sha256:cf80504caefec1e9433ecca457b0c63d9f067e065b8da509adbb28aff457cb83"],"state_sha256":"19cc66d8b20a935d93e550ef960b5eae33e5103758280cda42dd3476b68f2d35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tn+d0/2DUqJvUPJ7t5TCn+ykOreZvOwsZleA8PGMqKF/bI4rf7FcEvqu8gLF3OOtuxO4d87vAuLxjIWsJl3DDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:54:27.330294Z","bundle_sha256":"3645af0e389b5bb0bd5502eb23d5e18168b0f5cce03b66eba7e5501eb4bf1ba1"}}