{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E3BEXN6HJ7PJ7L4RKRBPDBDREF","short_pith_number":"pith:E3BEXN6H","canonical_record":{"source":{"id":"1702.06791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-22T13:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"f66b05db4151d4cca91b89b48b39b3f8e2662bef47517ee7600801c186f78189","abstract_canon_sha256":"eb77daf27ebe20dcee8c0ee078b3b87d2f7ad2202c7814bb40ac8c128989a16e"},"schema_version":"1.0"},"canonical_sha256":"26c24bb7c74fde9faf915442f184712170cf4d3f69c935a19d42ec62722fc59d","source":{"kind":"arxiv","id":"1702.06791","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06791","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06791v2","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06791","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"E3BEXN6HJ7PJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3BEXN6HJ7PJ7L4R","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3BEXN6H","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E3BEXN6HJ7PJ7L4RKRBPDBDREF","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-22T13:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"f66b05db4151d4cca91b89b48b39b3f8e2662bef47517ee7600801c186f78189","abstract_canon_sha256":"eb77daf27ebe20dcee8c0ee078b3b87d2f7ad2202c7814bb40ac8c128989a16e"},"schema_version":"1.0"},"canonical_sha256":"26c24bb7c74fde9faf915442f184712170cf4d3f69c935a19d42ec62722fc59d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:57.287447Z","signature_b64":"wxHLK4KmVSnStBbDFFGbA53axaKT0eczx0jwknKIUop58nYjhU9f8XqjH+2FFGQ3X9aMHjDqhs/geT1pjGNICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26c24bb7c74fde9faf915442f184712170cf4d3f69c935a19d42ec62722fc59d","last_reissued_at":"2026-05-18T00:44:57.286935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:57.286935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06791","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-18T00:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLx3COB/X3L2NR5rDQXwIgoil15DByGTxuMgQu8h3pkNcugvn1DknD1bSxmINY8juSWlKUi3M5ErJ9jBq1QdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:18:03.739533Z"},"content_sha256":"0f5b4fdd0519ad72c6f8b81f5aeca6a43409832b1a1a7862d763bb8bdad3742b","schema_version":"1.0","event_id":"sha256:0f5b4fdd0519ad72c6f8b81f5aeca6a43409832b1a1a7862d763bb8bdad3742b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E3BEXN6HJ7PJ7L4RKRBPDBDREF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computation of Updated Lower Expectations for Imprecise Continuous-Time Hidden Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Arno Siebes, Jasper De Bock, Thomas Krak","submitted_at":"2017-02-22T13:31:07Z","abstract_excerpt":"We consider the problem of performing inference with imprecise continuous-time hidden Markov chains, that is, imprecise continuous-time Markov chains that are augmented with random output variables whose distribution depends on the hidden state of the chain. The prefix `imprecise' refers to the fact that we do not consider a classical continuous-time Markov chain, but replace it with a robust extension that allows us to represent various types of model uncertainty, using the theory of imprecise probabilities. The inference problem amounts to computing lower expectations of functions on the sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06791","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-18T00:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E81EWogcV6j9IYs99wkse5pQo8LTHdYS26mP9RD6CWyc//GR76CMV6x7ek+Sc1WahW9VSJiux5tpy0hqypboAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:18:03.739887Z"},"content_sha256":"7e1e1e13f73d131c30cdbb4fe70f44a38882300c206db6054bc06e2281658f51","schema_version":"1.0","event_id":"sha256:7e1e1e13f73d131c30cdbb4fe70f44a38882300c206db6054bc06e2281658f51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3BEXN6HJ7PJ7L4RKRBPDBDREF/bundle.json","state_url":"https://pith.science/pith/E3BEXN6HJ7PJ7L4RKRBPDBDREF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3BEXN6HJ7PJ7L4RKRBPDBDREF/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-04T06:18:03Z","links":{"resolver":"https://pith.science/pith/E3BEXN6HJ7PJ7L4RKRBPDBDREF","bundle":"https://pith.science/pith/E3BEXN6HJ7PJ7L4RKRBPDBDREF/bundle.json","state":"https://pith.science/pith/E3BEXN6HJ7PJ7L4RKRBPDBDREF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3BEXN6HJ7PJ7L4RKRBPDBDREF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E3BEXN6HJ7PJ7L4RKRBPDBDREF","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":"eb77daf27ebe20dcee8c0ee078b3b87d2f7ad2202c7814bb40ac8c128989a16e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-22T13:31:07Z","title_canon_sha256":"f66b05db4151d4cca91b89b48b39b3f8e2662bef47517ee7600801c186f78189"},"schema_version":"1.0","source":{"id":"1702.06791","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06791","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06791v2","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06791","created_at":"2026-05-18T00:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"E3BEXN6HJ7PJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3BEXN6HJ7PJ7L4R","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3BEXN6H","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:7e1e1e13f73d131c30cdbb4fe70f44a38882300c206db6054bc06e2281658f51","target":"graph","created_at":"2026-05-18T00:44:57Z","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 the problem of performing inference with imprecise continuous-time hidden Markov chains, that is, imprecise continuous-time Markov chains that are augmented with random output variables whose distribution depends on the hidden state of the chain. The prefix `imprecise' refers to the fact that we do not consider a classical continuous-time Markov chain, but replace it with a robust extension that allows us to represent various types of model uncertainty, using the theory of imprecise probabilities. The inference problem amounts to computing lower expectations of functions on the sta","authors_text":"Arno Siebes, Jasper De Bock, Thomas Krak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-22T13:31:07Z","title":"Efficient Computation of Updated Lower Expectations for Imprecise Continuous-Time Hidden Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06791","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:0f5b4fdd0519ad72c6f8b81f5aeca6a43409832b1a1a7862d763bb8bdad3742b","target":"record","created_at":"2026-05-18T00:44:57Z","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":"eb77daf27ebe20dcee8c0ee078b3b87d2f7ad2202c7814bb40ac8c128989a16e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-22T13:31:07Z","title_canon_sha256":"f66b05db4151d4cca91b89b48b39b3f8e2662bef47517ee7600801c186f78189"},"schema_version":"1.0","source":{"id":"1702.06791","kind":"arxiv","version":2}},"canonical_sha256":"26c24bb7c74fde9faf915442f184712170cf4d3f69c935a19d42ec62722fc59d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26c24bb7c74fde9faf915442f184712170cf4d3f69c935a19d42ec62722fc59d","first_computed_at":"2026-05-18T00:44:57.286935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:57.286935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wxHLK4KmVSnStBbDFFGbA53axaKT0eczx0jwknKIUop58nYjhU9f8XqjH+2FFGQ3X9aMHjDqhs/geT1pjGNICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:57.287447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06791","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f5b4fdd0519ad72c6f8b81f5aeca6a43409832b1a1a7862d763bb8bdad3742b","sha256:7e1e1e13f73d131c30cdbb4fe70f44a38882300c206db6054bc06e2281658f51"],"state_sha256":"349521aa88a828fd9c82236eed0bbeb9a4627730a78443913bf64f4a58db5592"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfWN6iohw9x1JrKuJ2evH+NtovFSj/P//zV5eYHwwl1juzEOEExtXBU8iEtz7PZrKObmeIKT2QVbY/if/fgiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:18:03.742130Z","bundle_sha256":"e87a9e499610b99faeacd5418993cc8f468d840a2f5087857c0f899a2dc39134"}}