{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XM4EY257J5YPCFWDKHJWPGZZ6U","short_pith_number":"pith:XM4EY257","canonical_record":{"source":{"id":"1202.3707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"6e01107ae5ec3a5c06964836da00bb47c4feead5c01561452206949a02a08f76","abstract_canon_sha256":"1872db46a6420187f1f1ddc4b85d1796fd235882ebdb01951b128d4f5e515c34"},"schema_version":"1.0"},"canonical_sha256":"bb384c6bbf4f70f116c351d3679b39f50eeccb6e58a41aadd5431b29b8f4ab32","source":{"kind":"arxiv","id":"1202.3707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3707","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3707v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3707","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"XM4EY257J5YP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XM4EY257J5YPCFWD","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XM4EY257","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XM4EY257J5YPCFWDKHJWPGZZ6U","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"6e01107ae5ec3a5c06964836da00bb47c4feead5c01561452206949a02a08f76","abstract_canon_sha256":"1872db46a6420187f1f1ddc4b85d1796fd235882ebdb01951b128d4f5e515c34"},"schema_version":"1.0"},"canonical_sha256":"bb384c6bbf4f70f116c351d3679b39f50eeccb6e58a41aadd5431b29b8f4ab32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.462834Z","signature_b64":"9hYeSJDS1uXTDGstZmi080PPG4Ro+2FXvU6JzEYPRAa0M5QTM9cWstt+N8DmIn51o+uSgg3xRyyt7zYSMMVUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb384c6bbf4f70f116c351d3679b39f50eeccb6e58a41aadd5431b29b8f4ab32","last_reissued_at":"2026-05-18T04:02:03.462360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.462360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3707","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:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpLG5xa4ZQmKoUqtIUP06dMIHzWQOtyzlePOe7qjktbhVQonOxyqK/J6hljbrByw3a/H1DQuHDTmodINwWiLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:55:31.720031Z"},"content_sha256":"ee4632e11369d79f023c3a4bd85ffaefa972be4aa5140e4ccb5d2b2eb7b90273","schema_version":"1.0","event_id":"sha256:ee4632e11369d79f023c3a4bd85ffaefa972be4aa5140e4ccb5d2b2eb7b90273"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XM4EY257J5YPCFWDKHJWPGZZ6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A temporally abstracted Viterbi algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Shaunak Chatterjee, Stuart Russell","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demonstrated this possibility using state abstraction to speed up the Viterbi algorithm. In this paper, we show how to apply temporal abstraction to the Viterbi problem. Our algorithm uses bounds derived from analysis of coarse timescales to prune large parts of the state trellis at finer timescales. We demonstrate improvements of several orders of magnitude over the standard Viterbi algorithm, as well as significant spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3707","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:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERAXvK/sQL5a9WCcuH0c7+sh4M4VDLOv+LjmgQRf4bnsi/ahTz/Hezr+0qi18QFDuY7DhOVsYocSeM12OQxDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:55:31.720392Z"},"content_sha256":"46ef84f8e065aa773c5b794895e7544eb2082be665cde92002c68a0d3004bb94","schema_version":"1.0","event_id":"sha256:46ef84f8e065aa773c5b794895e7544eb2082be665cde92002c68a0d3004bb94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XM4EY257J5YPCFWDKHJWPGZZ6U/bundle.json","state_url":"https://pith.science/pith/XM4EY257J5YPCFWDKHJWPGZZ6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XM4EY257J5YPCFWDKHJWPGZZ6U/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-22T09:55:31Z","links":{"resolver":"https://pith.science/pith/XM4EY257J5YPCFWDKHJWPGZZ6U","bundle":"https://pith.science/pith/XM4EY257J5YPCFWDKHJWPGZZ6U/bundle.json","state":"https://pith.science/pith/XM4EY257J5YPCFWDKHJWPGZZ6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XM4EY257J5YPCFWDKHJWPGZZ6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XM4EY257J5YPCFWDKHJWPGZZ6U","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":"1872db46a6420187f1f1ddc4b85d1796fd235882ebdb01951b128d4f5e515c34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"6e01107ae5ec3a5c06964836da00bb47c4feead5c01561452206949a02a08f76"},"schema_version":"1.0","source":{"id":"1202.3707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3707","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3707v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3707","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"XM4EY257J5YP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XM4EY257J5YPCFWD","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XM4EY257","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:46ef84f8e065aa773c5b794895e7544eb2082be665cde92002c68a0d3004bb94","target":"graph","created_at":"2026-05-18T04:02:03Z","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":"Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demonstrated this possibility using state abstraction to speed up the Viterbi algorithm. In this paper, we show how to apply temporal abstraction to the Viterbi problem. Our algorithm uses bounds derived from analysis of coarse timescales to prune large parts of the state trellis at finer timescales. We demonstrate improvements of several orders of magnitude over the standard Viterbi algorithm, as well as significant spe","authors_text":"Shaunak Chatterjee, Stuart Russell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title":"A temporally abstracted Viterbi algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3707","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:ee4632e11369d79f023c3a4bd85ffaefa972be4aa5140e4ccb5d2b2eb7b90273","target":"record","created_at":"2026-05-18T04:02:03Z","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":"1872db46a6420187f1f1ddc4b85d1796fd235882ebdb01951b128d4f5e515c34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"6e01107ae5ec3a5c06964836da00bb47c4feead5c01561452206949a02a08f76"},"schema_version":"1.0","source":{"id":"1202.3707","kind":"arxiv","version":1}},"canonical_sha256":"bb384c6bbf4f70f116c351d3679b39f50eeccb6e58a41aadd5431b29b8f4ab32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb384c6bbf4f70f116c351d3679b39f50eeccb6e58a41aadd5431b29b8f4ab32","first_computed_at":"2026-05-18T04:02:03.462360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.462360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9hYeSJDS1uXTDGstZmi080PPG4Ro+2FXvU6JzEYPRAa0M5QTM9cWstt+N8DmIn51o+uSgg3xRyyt7zYSMMVUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.462834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee4632e11369d79f023c3a4bd85ffaefa972be4aa5140e4ccb5d2b2eb7b90273","sha256:46ef84f8e065aa773c5b794895e7544eb2082be665cde92002c68a0d3004bb94"],"state_sha256":"a01573a15f323d35ac970c07cf1c902256d9b3223c23fe9e9463dc10baac8722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meC3SAWhyVzdO37FhSWpr0u/QY2LGKaKAs+tQS0O4EGp9dMc8VAfrnLmdTZS6BjFFArJfMQtd/9iA7yLfHn7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:55:31.722301Z","bundle_sha256":"4c55dccfa4b9ebab5467086f0b6e21ba2cbe90f3854d8a12b11442de0be266db"}}