{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PQV6U5XAJUUBFCY6BA3V3TCVN7","short_pith_number":"pith:PQV6U5XA","canonical_record":{"source":{"id":"1504.05739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-22T11:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"0f7de220268fff558c3eacf7a9c55d566c3f50e5ef8b11eecc9c241a99961051","abstract_canon_sha256":"4531f6a5e55ca93281562d15275274cc4ae348c8eed5e5ddf0352ed2e68fb2fa"},"schema_version":"1.0"},"canonical_sha256":"7c2bea76e04d28128b1e08375dcc556fd7ae84cde1ceb9ccd2e236321183ead6","source":{"kind":"arxiv","id":"1504.05739","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05739","created_at":"2026-05-18T01:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05739v2","created_at":"2026-05-18T01:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05739","created_at":"2026-05-18T01:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"PQV6U5XAJUUB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PQV6U5XAJUUBFCY6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PQV6U5XA","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PQV6U5XAJUUBFCY6BA3V3TCVN7","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-22T11:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"0f7de220268fff558c3eacf7a9c55d566c3f50e5ef8b11eecc9c241a99961051","abstract_canon_sha256":"4531f6a5e55ca93281562d15275274cc4ae348c8eed5e5ddf0352ed2e68fb2fa"},"schema_version":"1.0"},"canonical_sha256":"7c2bea76e04d28128b1e08375dcc556fd7ae84cde1ceb9ccd2e236321183ead6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:40.837530Z","signature_b64":"lvcVZgjI9EioQC815wr/j/YHm8RTkqAY8LUBDF00F0yjBhlvDz1bPZVsPZ8APc3+OoZXqKGlGhNnDfAqjxtRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c2bea76e04d28128b1e08375dcc556fd7ae84cde1ceb9ccd2e236321183ead6","last_reissued_at":"2026-05-18T01:19:40.836930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:40.836930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05739","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:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5cGafSregncyr8d9mK580T71ZHP1vVX8nWp3VJwZmdenrX1nAS9CyOOW0rq4mJYWdEoC5KICfLTMVEgXCoCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:24:36.713868Z"},"content_sha256":"55bd58995dc88c418068144ad2c965661e1e7344d09cb78f220853291f4062f5","schema_version":"1.0","event_id":"sha256:55bd58995dc88c418068144ad2c965661e1e7344d09cb78f220853291f4062f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PQV6U5XAJUUBFCY6BA3V3TCVN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Statistical Model Checking for Unbounded Temporal Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jan K\\v{r}et\\'insk\\'y, Przemys{\\l}aw Daca, Tatjana Petrov, Thomas A. Henzinger","submitted_at":"2015-04-22T11:29:58Z","abstract_excerpt":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, such as reachability and full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence and size of the state space. In comparison "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05739","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:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qMQTfi8HxV0WscsU1tHUy08pBN0j4rz2tax0YMWNCtDHMHIXk1weqM2Ipdzl4gKzCJBVVhC8RDu5qDQY3FfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:24:36.714215Z"},"content_sha256":"05af2c86bdc5abc66a733a882961beaf77d8b6de963cc4d50955ed02c84d9533","schema_version":"1.0","event_id":"sha256:05af2c86bdc5abc66a733a882961beaf77d8b6de963cc4d50955ed02c84d9533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQV6U5XAJUUBFCY6BA3V3TCVN7/bundle.json","state_url":"https://pith.science/pith/PQV6U5XAJUUBFCY6BA3V3TCVN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQV6U5XAJUUBFCY6BA3V3TCVN7/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-03T00:24:36Z","links":{"resolver":"https://pith.science/pith/PQV6U5XAJUUBFCY6BA3V3TCVN7","bundle":"https://pith.science/pith/PQV6U5XAJUUBFCY6BA3V3TCVN7/bundle.json","state":"https://pith.science/pith/PQV6U5XAJUUBFCY6BA3V3TCVN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQV6U5XAJUUBFCY6BA3V3TCVN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PQV6U5XAJUUBFCY6BA3V3TCVN7","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":"4531f6a5e55ca93281562d15275274cc4ae348c8eed5e5ddf0352ed2e68fb2fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-22T11:29:58Z","title_canon_sha256":"0f7de220268fff558c3eacf7a9c55d566c3f50e5ef8b11eecc9c241a99961051"},"schema_version":"1.0","source":{"id":"1504.05739","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05739","created_at":"2026-05-18T01:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05739v2","created_at":"2026-05-18T01:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05739","created_at":"2026-05-18T01:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"PQV6U5XAJUUB","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PQV6U5XAJUUBFCY6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PQV6U5XA","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:05af2c86bdc5abc66a733a882961beaf77d8b6de963cc4d50955ed02c84d9533","target":"graph","created_at":"2026-05-18T01:19:40Z","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 a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, such as reachability and full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence and size of the state space. In comparison ","authors_text":"Jan K\\v{r}et\\'insk\\'y, Przemys{\\l}aw Daca, Tatjana Petrov, Thomas A. Henzinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-22T11:29:58Z","title":"Faster Statistical Model Checking for Unbounded Temporal Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05739","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:55bd58995dc88c418068144ad2c965661e1e7344d09cb78f220853291f4062f5","target":"record","created_at":"2026-05-18T01:19:40Z","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":"4531f6a5e55ca93281562d15275274cc4ae348c8eed5e5ddf0352ed2e68fb2fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-22T11:29:58Z","title_canon_sha256":"0f7de220268fff558c3eacf7a9c55d566c3f50e5ef8b11eecc9c241a99961051"},"schema_version":"1.0","source":{"id":"1504.05739","kind":"arxiv","version":2}},"canonical_sha256":"7c2bea76e04d28128b1e08375dcc556fd7ae84cde1ceb9ccd2e236321183ead6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c2bea76e04d28128b1e08375dcc556fd7ae84cde1ceb9ccd2e236321183ead6","first_computed_at":"2026-05-18T01:19:40.836930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:40.836930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lvcVZgjI9EioQC815wr/j/YHm8RTkqAY8LUBDF00F0yjBhlvDz1bPZVsPZ8APc3+OoZXqKGlGhNnDfAqjxtRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:40.837530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05739","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55bd58995dc88c418068144ad2c965661e1e7344d09cb78f220853291f4062f5","sha256:05af2c86bdc5abc66a733a882961beaf77d8b6de963cc4d50955ed02c84d9533"],"state_sha256":"5bf8ee1005c072761bb2a087019ef1fc48bd46c712d9cd335a86fab52e300f8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OuPgNyw1bWU6Jn4DEKkkZWoZLej2kpLf3AKEibZ7m3GghO9sahoa6r0ZBhz1JLOH64rCvPzPe+6BGIxdb+UWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:24:36.716141Z","bundle_sha256":"ff9b92e764ddbeb7258170976b753848b645fac730e26857a8eaf2dd8dbd86b2"}}