{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NPA266EZ2MSMLVF65HAHGR5VSB","short_pith_number":"pith:NPA266EZ","schema_version":"1.0","canonical_sha256":"6bc1af7899d324c5d4bee9c07347b5906f5733052933b19c919d9867a5388ad9","source":{"kind":"arxiv","id":"2405.03885","version":2},"attestation_state":"computed","paper":{"title":"Playing Games with your PET: Extending the Partial Exploration Tool to Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT","cs.SY"],"primary_cat":"eess.SY","authors_text":"Maximilian Weininger, Tobias Meggendorfer","submitted_at":"2024-05-06T22:07:26Z","abstract_excerpt":"We present version 2.0 of the Partial Exploration Tool (PET), a tool for verification of probabilistic systems. We extend the previous version by adding support for stochastic games, based on a recent unified framework for sound value iteration algorithms. Thereby, PET2 is the first tool implementing a sound and efficient approach for solving stochastic games with objectives of the type reachability/safety and mean payoff. We complement this approach by developing and implementing a partial-exploration based variant for all three objectives. Our experimental evaluation shows that PET2 offers t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.03885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-05-06T22:07:26Z","cross_cats_sorted":["cs.AI","cs.GT","cs.SY"],"title_canon_sha256":"bf11936e3c33c1ae6bba495b6cf1a4baf26dc14113283ca1b70fd14b8b51e480","abstract_canon_sha256":"7727bfcef3bb30c2da9bd62d45cb480f157f497c1006d3fba1761e6bced4a40a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:08.614723Z","signature_b64":"qh1YNdyaGqMoVpfTycsRBr3br4p23JBzGXhccCxdcenRmWY6zJtPxNdeyHewYtdKltFwIFT0JVPatNyAuNGwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bc1af7899d324c5d4bee9c07347b5906f5733052933b19c919d9867a5388ad9","last_reissued_at":"2026-07-05T08:18:08.614213Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:08.614213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Playing Games with your PET: Extending the Partial Exploration Tool to Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT","cs.SY"],"primary_cat":"eess.SY","authors_text":"Maximilian Weininger, Tobias Meggendorfer","submitted_at":"2024-05-06T22:07:26Z","abstract_excerpt":"We present version 2.0 of the Partial Exploration Tool (PET), a tool for verification of probabilistic systems. We extend the previous version by adding support for stochastic games, based on a recent unified framework for sound value iteration algorithms. Thereby, PET2 is the first tool implementing a sound and efficient approach for solving stochastic games with objectives of the type reachability/safety and mean payoff. We complement this approach by developing and implementing a partial-exploration based variant for all three objectives. Our experimental evaluation shows that PET2 offers t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03885","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/2405.03885/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.03885","created_at":"2026-07-05T08:18:08.614271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.03885v2","created_at":"2026-07-05T08:18:08.614271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03885","created_at":"2026-07-05T08:18:08.614271+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPA266EZ2MSM","created_at":"2026-07-05T08:18:08.614271+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPA266EZ2MSMLVF6","created_at":"2026-07-05T08:18:08.614271+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPA266EZ","created_at":"2026-07-05T08:18:08.614271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10185","citing_title":"Solving Robust Markov Decision Processes: Generic, Reliable, Efficient","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB","json":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB.json","graph_json":"https://pith.science/api/pith-number/NPA266EZ2MSMLVF65HAHGR5VSB/graph.json","events_json":"https://pith.science/api/pith-number/NPA266EZ2MSMLVF65HAHGR5VSB/events.json","paper":"https://pith.science/paper/NPA266EZ"},"agent_actions":{"view_html":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB","download_json":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB.json","view_paper":"https://pith.science/paper/NPA266EZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.03885&json=true","fetch_graph":"https://pith.science/api/pith-number/NPA266EZ2MSMLVF65HAHGR5VSB/graph.json","fetch_events":"https://pith.science/api/pith-number/NPA266EZ2MSMLVF65HAHGR5VSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB/action/storage_attestation","attest_author":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB/action/author_attestation","sign_citation":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB/action/citation_signature","submit_replication":"https://pith.science/pith/NPA266EZ2MSMLVF65HAHGR5VSB/action/replication_record"}},"created_at":"2026-07-05T08:18:08.614271+00:00","updated_at":"2026-07-05T08:18:08.614271+00:00"}