{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GXIWOADV7WJI4QVBYUEMWOTX3Y","short_pith_number":"pith:GXIWOADV","canonical_record":{"source":{"id":"1905.12968","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-30T11:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"781a73cd70eccf3f8a13a4eaaadd04c0e1832239817bbab88f63ce6603d4510d","abstract_canon_sha256":"597c6af5433e8453f10b118f41bc7479b6d62a5ab5eb9b18092e274d938dec06"},"schema_version":"1.0"},"canonical_sha256":"35d1670075fd928e42a1c508cb3a77de125b046831dc1cb495ace5c68e1cbc7c","source":{"kind":"arxiv","id":"1905.12968","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12968","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12968v2","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12968","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"GXIWOADV7WJI","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GXIWOADV7WJI4QVB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GXIWOADV","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GXIWOADV7WJI4QVBYUEMWOTX3Y","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12968","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-30T11:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"781a73cd70eccf3f8a13a4eaaadd04c0e1832239817bbab88f63ce6603d4510d","abstract_canon_sha256":"597c6af5433e8453f10b118f41bc7479b6d62a5ab5eb9b18092e274d938dec06"},"schema_version":"1.0"},"canonical_sha256":"35d1670075fd928e42a1c508cb3a77de125b046831dc1cb495ace5c68e1cbc7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.954559Z","signature_b64":"EetizdyblmmwB5Gt6CgsMQSB02W6FhavepWdymY/Yv+ddj7fMANLv/qL5g/QLUPWL3/K6AOLDLUObbyW542RCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35d1670075fd928e42a1c508cb3a77de125b046831dc1cb495ace5c68e1cbc7c","last_reissued_at":"2026-05-17T23:41:52.953933Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.953933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12968","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-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6NYGetGXiaqbFgAmYT1V2lK1w3EzYvnTuHHjFNlLypwvRCNUwtGMyaS83D+ulm3Ec7LFR+s70Atlh8kPjRrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:52:43.748499Z"},"content_sha256":"181151db398a16dced6c57ffff4f9959a56548a5f55a8735afbb4d1452d439b5","schema_version":"1.0","event_id":"sha256:181151db398a16dced6c57ffff4f9959a56548a5f55a8735afbb4d1452d439b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GXIWOADV7WJI4QVBYUEMWOTX3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gert de Cooman, Jasper De Bock, Natan T'Joens, Thomas Krak","submitted_at":"2019-05-30T11:24:50Z","abstract_excerpt":"We present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other types of model uncertainty. The class of inferences that we consider contains, as special cases, tight lower and upper bounds on expected hitting times, on hitting probabilities and on expectations of functions that are a sum or product of simpler ones. Our algorithm exploits the specific structure that is inherent in all these inferences: they admit a gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12968","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-17T23:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qti0nqRdX2uElSU8SuNuZQk6ykSgazff9OIoF4l0p/tF4PsiU/V//Yd5nEYw5+Bt0AVYkCg/qdA2IrZbTziDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:52:43.748847Z"},"content_sha256":"d9cb70f51d303bca1c84ef94e1a56ec3743d6f33b8a0274e623714888316d0c7","schema_version":"1.0","event_id":"sha256:d9cb70f51d303bca1c84ef94e1a56ec3743d6f33b8a0274e623714888316d0c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXIWOADV7WJI4QVBYUEMWOTX3Y/bundle.json","state_url":"https://pith.science/pith/GXIWOADV7WJI4QVBYUEMWOTX3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXIWOADV7WJI4QVBYUEMWOTX3Y/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-04T04:52:43Z","links":{"resolver":"https://pith.science/pith/GXIWOADV7WJI4QVBYUEMWOTX3Y","bundle":"https://pith.science/pith/GXIWOADV7WJI4QVBYUEMWOTX3Y/bundle.json","state":"https://pith.science/pith/GXIWOADV7WJI4QVBYUEMWOTX3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXIWOADV7WJI4QVBYUEMWOTX3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GXIWOADV7WJI4QVBYUEMWOTX3Y","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":"597c6af5433e8453f10b118f41bc7479b6d62a5ab5eb9b18092e274d938dec06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-30T11:24:50Z","title_canon_sha256":"781a73cd70eccf3f8a13a4eaaadd04c0e1832239817bbab88f63ce6603d4510d"},"schema_version":"1.0","source":{"id":"1905.12968","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12968","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12968v2","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12968","created_at":"2026-05-17T23:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"GXIWOADV7WJI","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GXIWOADV7WJI4QVB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GXIWOADV","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:d9cb70f51d303bca1c84ef94e1a56ec3743d6f33b8a0274e623714888316d0c7","target":"graph","created_at":"2026-05-17T23:41:52Z","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 present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other types of model uncertainty. The class of inferences that we consider contains, as special cases, tight lower and upper bounds on expected hitting times, on hitting probabilities and on expectations of functions that are a sum or product of simpler ones. Our algorithm exploits the specific structure that is inherent in all these inferences: they admit a gene","authors_text":"Gert de Cooman, Jasper De Bock, Natan T'Joens, Thomas Krak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-30T11:24:50Z","title":"A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12968","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:181151db398a16dced6c57ffff4f9959a56548a5f55a8735afbb4d1452d439b5","target":"record","created_at":"2026-05-17T23:41:52Z","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":"597c6af5433e8453f10b118f41bc7479b6d62a5ab5eb9b18092e274d938dec06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-30T11:24:50Z","title_canon_sha256":"781a73cd70eccf3f8a13a4eaaadd04c0e1832239817bbab88f63ce6603d4510d"},"schema_version":"1.0","source":{"id":"1905.12968","kind":"arxiv","version":2}},"canonical_sha256":"35d1670075fd928e42a1c508cb3a77de125b046831dc1cb495ace5c68e1cbc7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35d1670075fd928e42a1c508cb3a77de125b046831dc1cb495ace5c68e1cbc7c","first_computed_at":"2026-05-17T23:41:52.953933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:52.953933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EetizdyblmmwB5Gt6CgsMQSB02W6FhavepWdymY/Yv+ddj7fMANLv/qL5g/QLUPWL3/K6AOLDLUObbyW542RCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:52.954559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12968","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:181151db398a16dced6c57ffff4f9959a56548a5f55a8735afbb4d1452d439b5","sha256:d9cb70f51d303bca1c84ef94e1a56ec3743d6f33b8a0274e623714888316d0c7"],"state_sha256":"cdda883ce978eb90e9a09ebd3bccce7f6d16e13d464d1d0e11da7c517ba4dede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyZgocaPUR1TwALi/9aNMvj/0fcuhpZrxncejpqP+n02Is8MtvjIGLE8DQ7JYaaKG9VYXpcZM0b+Lx+ch7qaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:52:43.750741Z","bundle_sha256":"0e3d73e6991ecf82024429fa58ef59de89badb4114038e678f7db6511308ee0c"}}