{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MZTAV2YPZU4C3BWLSWMD5IM625","short_pith_number":"pith:MZTAV2YP","canonical_record":{"source":{"id":"2401.06574","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-12T13:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"f202ab269bccbd9051e522da0403310db4ebe1833cd8a1a06827cc989aa0c91f","abstract_canon_sha256":"890657564ee06c145296919b682c46ea75173796a9d98ea0f5dab677189ff89e"},"schema_version":"1.0"},"canonical_sha256":"66660aeb0fcd382d86cb95983ea19ed74f5fb640dd7fbcb0887bb40de0fceac6","source":{"kind":"arxiv","id":"2401.06574","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.06574","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"arxiv_version","alias_value":"2401.06574v2","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06574","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"pith_short_12","alias_value":"MZTAV2YPZU4C","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"pith_short_16","alias_value":"MZTAV2YPZU4C3BWL","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"pith_short_8","alias_value":"MZTAV2YP","created_at":"2026-07-05T07:38:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MZTAV2YPZU4C3BWLSWMD5IM625","target":"record","payload":{"canonical_record":{"source":{"id":"2401.06574","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-12T13:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"f202ab269bccbd9051e522da0403310db4ebe1833cd8a1a06827cc989aa0c91f","abstract_canon_sha256":"890657564ee06c145296919b682c46ea75173796a9d98ea0f5dab677189ff89e"},"schema_version":"1.0"},"canonical_sha256":"66660aeb0fcd382d86cb95983ea19ed74f5fb640dd7fbcb0887bb40de0fceac6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:34.004988Z","signature_b64":"uHvlsgh1yqjF756TmLbSFNw3m2OCKE68uhDV9fEKkNDQzXHJD/YBxW4CkXIVOHCuWppuopshNzbF8f9tlJZtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66660aeb0fcd382d86cb95983ea19ed74f5fb640dd7fbcb0887bb40de0fceac6","last_reissued_at":"2026-07-05T07:38:34.004578Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:34.004578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.06574","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-07-05T07:38:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJX8fY+xnLEcjFbpQvqF4pUw4DJ0S/zotbX9ILsH7NIeyil2GgIBfEsTAow0V1PoyofzwLnQIb3r89x/oOlBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T04:00:21.604350Z"},"content_sha256":"560f846b052483b122e06d22a18b8a7eb9a77ad024cfc7019b6387e1c79c7929","schema_version":"1.0","event_id":"sha256:560f846b052483b122e06d22a18b8a7eb9a77ad024cfc7019b6387e1c79c7929"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MZTAV2YPZU4C3BWLSWMD5IM625","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CTMCs with Imprecisely Timed Observations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Marielle Stoelinga, Matthias Volk, Nils Jansen, Sebastian Junges, Thom Badings","submitted_at":"2024-01-12T13:49:51Z","abstract_excerpt":"Labeled continuous-time Markov chains (CTMCs) describe processes subject to random timing and partial observability. In applications such as runtime monitoring, we must incorporate past observations. The timing of these observations matters but may be uncertain. Thus, we consider a setting in which we are given a sequence of imprecisely timed labels called the evidence. The problem is to compute reachability probabilities, which we condition on this evidence. Our key contribution is a method that solves this problem by unfolding the CTMC states over all possible timings for the evidence. We fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06574","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.06574/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:38:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xN3yphn7AzDybysPHs2DNGhOpdkGRKjkg/NZsSMiPbZA4QLZwKwGD9oRZuaXM5hkQKDgF7JtCH3rs7XtzLAJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T04:00:21.604727Z"},"content_sha256":"9614e640fbbac5595bde6798fbe871f378b04bf7ceb9129f6d7377fc19afeb05","schema_version":"1.0","event_id":"sha256:9614e640fbbac5595bde6798fbe871f378b04bf7ceb9129f6d7377fc19afeb05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZTAV2YPZU4C3BWLSWMD5IM625/bundle.json","state_url":"https://pith.science/pith/MZTAV2YPZU4C3BWLSWMD5IM625/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZTAV2YPZU4C3BWLSWMD5IM625/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-07-13T04:00:21Z","links":{"resolver":"https://pith.science/pith/MZTAV2YPZU4C3BWLSWMD5IM625","bundle":"https://pith.science/pith/MZTAV2YPZU4C3BWLSWMD5IM625/bundle.json","state":"https://pith.science/pith/MZTAV2YPZU4C3BWLSWMD5IM625/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZTAV2YPZU4C3BWLSWMD5IM625/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MZTAV2YPZU4C3BWLSWMD5IM625","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":"890657564ee06c145296919b682c46ea75173796a9d98ea0f5dab677189ff89e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-12T13:49:51Z","title_canon_sha256":"f202ab269bccbd9051e522da0403310db4ebe1833cd8a1a06827cc989aa0c91f"},"schema_version":"1.0","source":{"id":"2401.06574","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.06574","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"arxiv_version","alias_value":"2401.06574v2","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06574","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"pith_short_12","alias_value":"MZTAV2YPZU4C","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"pith_short_16","alias_value":"MZTAV2YPZU4C3BWL","created_at":"2026-07-05T07:38:34Z"},{"alias_kind":"pith_short_8","alias_value":"MZTAV2YP","created_at":"2026-07-05T07:38:34Z"}],"graph_snapshots":[{"event_id":"sha256:9614e640fbbac5595bde6798fbe871f378b04bf7ceb9129f6d7377fc19afeb05","target":"graph","created_at":"2026-07-05T07:38:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.06574/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Labeled continuous-time Markov chains (CTMCs) describe processes subject to random timing and partial observability. In applications such as runtime monitoring, we must incorporate past observations. The timing of these observations matters but may be uncertain. Thus, we consider a setting in which we are given a sequence of imprecisely timed labels called the evidence. The problem is to compute reachability probabilities, which we condition on this evidence. Our key contribution is a method that solves this problem by unfolding the CTMC states over all possible timings for the evidence. We fo","authors_text":"Marielle Stoelinga, Matthias Volk, Nils Jansen, Sebastian Junges, Thom Badings","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-12T13:49:51Z","title":"CTMCs with Imprecisely Timed Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06574","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:560f846b052483b122e06d22a18b8a7eb9a77ad024cfc7019b6387e1c79c7929","target":"record","created_at":"2026-07-05T07:38:34Z","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":"890657564ee06c145296919b682c46ea75173796a9d98ea0f5dab677189ff89e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-12T13:49:51Z","title_canon_sha256":"f202ab269bccbd9051e522da0403310db4ebe1833cd8a1a06827cc989aa0c91f"},"schema_version":"1.0","source":{"id":"2401.06574","kind":"arxiv","version":2}},"canonical_sha256":"66660aeb0fcd382d86cb95983ea19ed74f5fb640dd7fbcb0887bb40de0fceac6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66660aeb0fcd382d86cb95983ea19ed74f5fb640dd7fbcb0887bb40de0fceac6","first_computed_at":"2026-07-05T07:38:34.004578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:34.004578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uHvlsgh1yqjF756TmLbSFNw3m2OCKE68uhDV9fEKkNDQzXHJD/YBxW4CkXIVOHCuWppuopshNzbF8f9tlJZtAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:34.004988Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.06574","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:560f846b052483b122e06d22a18b8a7eb9a77ad024cfc7019b6387e1c79c7929","sha256:9614e640fbbac5595bde6798fbe871f378b04bf7ceb9129f6d7377fc19afeb05"],"state_sha256":"399b025c56abab8dd08aad28d765ebe76c596c7a8455a4f34618183992f06cde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VajQ5cDfiPn3nqTA/RiUmhp/q8Eq7Civ0p5pj0egiM0vsWs/MEpKFJLIP3W2YkVB5UOJyKZaJuQRzVj7bMc7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T04:00:21.607228Z","bundle_sha256":"3a32ddd05b83c255bcb1b544645c4ea3dee99764f66c03f2b41f0f915b25ccbb"}}