{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FSP7FDTGS7UPUYEOTJ22X74EC4","short_pith_number":"pith:FSP7FDTG","canonical_record":{"source":{"id":"1905.04403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-10T23:36:05Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"c1a85464399c70665d72cbba3c99a9b7a2329894980f9025c55fd9816210aacb","abstract_canon_sha256":"1fe9d40703ae42921698a8fc6420dd21637bb812d97d26470ba5f3f44b62a32d"},"schema_version":"1.0"},"canonical_sha256":"2c9ff28e6697e8fa608e9a75abff8417086e83f3d313d0bb23c3fdf7471aafbf","source":{"kind":"arxiv","id":"1905.04403","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04403","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04403v3","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04403","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"FSP7FDTGS7UP","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_16","alias_value":"FSP7FDTGS7UPUYEO","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_8","alias_value":"FSP7FDTG","created_at":"2026-06-04T20:14:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FSP7FDTGS7UPUYEOTJ22X74EC4","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-10T23:36:05Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"c1a85464399c70665d72cbba3c99a9b7a2329894980f9025c55fd9816210aacb","abstract_canon_sha256":"1fe9d40703ae42921698a8fc6420dd21637bb812d97d26470ba5f3f44b62a32d"},"schema_version":"1.0"},"canonical_sha256":"2c9ff28e6697e8fa608e9a75abff8417086e83f3d313d0bb23c3fdf7471aafbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:14:30.001338Z","signature_b64":"GfXxm49gA8zWXSAzzA0HXscngWeIEEvX3MBkR/sMIh7VDxdNOCrOwvO82Ma2o2O0Mhm8cQSjKAeA2TN/Kln9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c9ff28e6697e8fa608e9a75abff8417086e83f3d313d0bb23c3fdf7471aafbf","last_reissued_at":"2026-06-04T20:14:30.000720Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:14:30.000720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04403","source_version":3,"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-06-04T20:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LOgIKRaipSjHMNA2ycGsgE/5A8s0t0SFPv254F9MMM0xiUQYVvxjzsdHixIOwA7SgKr2t0peJEgXLnJZxrjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:19:10.101953Z"},"content_sha256":"16a63c397f1c0f5f447658f607c84006bdfcd11cc037b18a5eb0a01ce989c663","schema_version":"1.0","event_id":"sha256:16a63c397f1c0f5f447658f607c84006bdfcd11cc037b18a5eb0a01ce989c663"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FSP7FDTGS7UPUYEOTJ22X74EC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"eess.SY","authors_text":"Jan K\\v{r}et\\'insk\\'y, Maximilian Weininger, Pranav Ashok","submitted_at":"2019-05-10T23:36:05Z","abstract_excerpt":"Statistical model checking (SMC) is a technique for analysis of probabilistic systems that may be (partially) unknown. We present an SMC algorithm for (unbounded) reachability yielding probably approximately correct (PAC) guarantees on the results. We consider both the setting (i) with no knowledge of the transition function (with the only quantity required a bound on the minimum transition probability) and (ii) with knowledge of the topology of the underlying graph. On the one hand, it is the first algorithm for stochastic games. On the other hand, it is the first practical algorithm even for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04403","kind":"arxiv","version":3},"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/1905.04403/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-06-04T20:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdspvQI+xsOg4bYG7cjEuid+FVb8AwBKtMttVvwZxfDVpGxW5PACFOBA9LS8i0yN7Buogaleyq7VOW7dT+CHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:19:10.102347Z"},"content_sha256":"a8302402f601fbdc4ae7fc5ec5b68d4d0f56c63bdf82a8120e86ab50361a08f8","schema_version":"1.0","event_id":"sha256:a8302402f601fbdc4ae7fc5ec5b68d4d0f56c63bdf82a8120e86ab50361a08f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSP7FDTGS7UPUYEOTJ22X74EC4/bundle.json","state_url":"https://pith.science/pith/FSP7FDTGS7UPUYEOTJ22X74EC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSP7FDTGS7UPUYEOTJ22X74EC4/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-05T10:19:10Z","links":{"resolver":"https://pith.science/pith/FSP7FDTGS7UPUYEOTJ22X74EC4","bundle":"https://pith.science/pith/FSP7FDTGS7UPUYEOTJ22X74EC4/bundle.json","state":"https://pith.science/pith/FSP7FDTGS7UPUYEOTJ22X74EC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSP7FDTGS7UPUYEOTJ22X74EC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FSP7FDTGS7UPUYEOTJ22X74EC4","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":"1fe9d40703ae42921698a8fc6420dd21637bb812d97d26470ba5f3f44b62a32d","cross_cats_sorted":["cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-10T23:36:05Z","title_canon_sha256":"c1a85464399c70665d72cbba3c99a9b7a2329894980f9025c55fd9816210aacb"},"schema_version":"1.0","source":{"id":"1905.04403","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04403","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04403v3","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04403","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"FSP7FDTGS7UP","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_16","alias_value":"FSP7FDTGS7UPUYEO","created_at":"2026-06-04T20:14:30Z"},{"alias_kind":"pith_short_8","alias_value":"FSP7FDTG","created_at":"2026-06-04T20:14:30Z"}],"graph_snapshots":[{"event_id":"sha256:a8302402f601fbdc4ae7fc5ec5b68d4d0f56c63bdf82a8120e86ab50361a08f8","target":"graph","created_at":"2026-06-04T20:14:30Z","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/1905.04403/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Statistical model checking (SMC) is a technique for analysis of probabilistic systems that may be (partially) unknown. We present an SMC algorithm for (unbounded) reachability yielding probably approximately correct (PAC) guarantees on the results. We consider both the setting (i) with no knowledge of the transition function (with the only quantity required a bound on the minimum transition probability) and (ii) with knowledge of the topology of the underlying graph. On the one hand, it is the first algorithm for stochastic games. On the other hand, it is the first practical algorithm even for","authors_text":"Jan K\\v{r}et\\'insk\\'y, Maximilian Weininger, Pranav Ashok","cross_cats":["cs.LG","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-10T23:36:05Z","title":"PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04403","kind":"arxiv","version":3},"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:16a63c397f1c0f5f447658f607c84006bdfcd11cc037b18a5eb0a01ce989c663","target":"record","created_at":"2026-06-04T20:14:30Z","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":"1fe9d40703ae42921698a8fc6420dd21637bb812d97d26470ba5f3f44b62a32d","cross_cats_sorted":["cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-05-10T23:36:05Z","title_canon_sha256":"c1a85464399c70665d72cbba3c99a9b7a2329894980f9025c55fd9816210aacb"},"schema_version":"1.0","source":{"id":"1905.04403","kind":"arxiv","version":3}},"canonical_sha256":"2c9ff28e6697e8fa608e9a75abff8417086e83f3d313d0bb23c3fdf7471aafbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c9ff28e6697e8fa608e9a75abff8417086e83f3d313d0bb23c3fdf7471aafbf","first_computed_at":"2026-06-04T20:14:30.000720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:14:30.000720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GfXxm49gA8zWXSAzzA0HXscngWeIEEvX3MBkR/sMIh7VDxdNOCrOwvO82Ma2o2O0Mhm8cQSjKAeA2TN/Kln9Bw==","signature_status":"signed_v1","signed_at":"2026-06-04T20:14:30.001338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04403","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16a63c397f1c0f5f447658f607c84006bdfcd11cc037b18a5eb0a01ce989c663","sha256:a8302402f601fbdc4ae7fc5ec5b68d4d0f56c63bdf82a8120e86ab50361a08f8"],"state_sha256":"fb81ea53076ded43246016aecaa7d33d154d3ea2e8755e4025c4ac696e2cb094"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NH43HNYqqTLIsTkcRc18s2w4dFUKnoE5/OyZj223FU7t1dYiBCebtHiALDEJ1putN3476QEQ1INmKLt0EOQHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:19:10.104324Z","bundle_sha256":"726bbd269c5ba2b95723b6d7b2dd57a9012c320d77a0cb4b5645aa3dc2b03ce8"}}