{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PJPGRTBXKNK2ZRJIH4QOB3T5OL","short_pith_number":"pith:PJPGRTBX","canonical_record":{"source":{"id":"1310.3609","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-14T09:50:49Z","cross_cats_sorted":["cs.DC","cs.LG","cs.LO"],"title_canon_sha256":"6318210d25498740610854fd314dfd9987f52caf25defb4e90889994386def60","abstract_canon_sha256":"4d318f1fa71e3af3ef9e9a760f0e7dc1219acd591416ce02c294b5e685f96375"},"schema_version":"1.0"},"canonical_sha256":"7a5e68cc375355acc5283f20e0ee7d72fa514bab4b416e853c11671676e68e82","source":{"kind":"arxiv","id":"1310.3609","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3609","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3609v4","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3609","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"PJPGRTBXKNK2","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PJPGRTBXKNK2ZRJI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PJPGRTBX","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PJPGRTBXKNK2ZRJIH4QOB3T5OL","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3609","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-14T09:50:49Z","cross_cats_sorted":["cs.DC","cs.LG","cs.LO"],"title_canon_sha256":"6318210d25498740610854fd314dfd9987f52caf25defb4e90889994386def60","abstract_canon_sha256":"4d318f1fa71e3af3ef9e9a760f0e7dc1219acd591416ce02c294b5e685f96375"},"schema_version":"1.0"},"canonical_sha256":"7a5e68cc375355acc5283f20e0ee7d72fa514bab4b416e853c11671676e68e82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:39.588196Z","signature_b64":"u7eaD7SZLaHssLDUXvX5f5vUv6HnrMcWsUyJtRZ6jRrbYIeHjYwEeLsfmtj4ylV+suBItulZSoSdpE6mWDYYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a5e68cc375355acc5283f20e0ee7d72fa514bab4b416e853c11671676e68e82","last_reissued_at":"2026-05-18T02:42:39.587704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:39.587704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3609","source_version":4,"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-18T02:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Q1BIeh1uwR4nNCEt0Yk6FVeWD/xkgw4nYrJDwtFULUZ2+CqBPgAOb4AYwGQS8L/vHOptJVtDJKWFkthGcyOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:32:23.903421Z"},"content_sha256":"0ce247b55e60923a1809d69038930fbd87b0518e2c86c0ae657bbfd0abd22c44","schema_version":"1.0","event_id":"sha256:0ce247b55e60923a1809d69038930fbd87b0518e2c86c0ae657bbfd0abd22c44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PJPGRTBXKNK2ZRJIH4QOB3T5OL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Verification of Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.LO"],"primary_cat":"cs.DS","authors_text":"Axel Legay, Louis-Marie Traonouez, Sean Sedwards","submitted_at":"2013-10-14T09:50:49Z","abstract_excerpt":"Markov decision processes (MDP) are useful to model concurrent process optimisation problems, but verifying them with numerical methods is often intractable. Existing approximative approaches do not scale well and are limited to memoryless schedulers. Here we present the basis of scalable verification for MDPSs, using an O(1) memory representation of history-dependent schedulers. We thus facilitate scalable learning techniques and the use of massively parallel verification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3609","kind":"arxiv","version":4},"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-18T02:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hINcJB47xgBr3AnpDxSkHAZqDd/MRAnIWDqLyk3ofqF9zZI5dkb3HX0KKjoSY4Ox9S/Eceb1vWKVhce0gDY/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T20:32:23.903769Z"},"content_sha256":"9999abc05dc3f01cd6fc178227d3a72b85ec3a262c0cd0b0d3a8ef32e89859f2","schema_version":"1.0","event_id":"sha256:9999abc05dc3f01cd6fc178227d3a72b85ec3a262c0cd0b0d3a8ef32e89859f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJPGRTBXKNK2ZRJIH4QOB3T5OL/bundle.json","state_url":"https://pith.science/pith/PJPGRTBXKNK2ZRJIH4QOB3T5OL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJPGRTBXKNK2ZRJIH4QOB3T5OL/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-28T20:32:23Z","links":{"resolver":"https://pith.science/pith/PJPGRTBXKNK2ZRJIH4QOB3T5OL","bundle":"https://pith.science/pith/PJPGRTBXKNK2ZRJIH4QOB3T5OL/bundle.json","state":"https://pith.science/pith/PJPGRTBXKNK2ZRJIH4QOB3T5OL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJPGRTBXKNK2ZRJIH4QOB3T5OL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PJPGRTBXKNK2ZRJIH4QOB3T5OL","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":"4d318f1fa71e3af3ef9e9a760f0e7dc1219acd591416ce02c294b5e685f96375","cross_cats_sorted":["cs.DC","cs.LG","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-14T09:50:49Z","title_canon_sha256":"6318210d25498740610854fd314dfd9987f52caf25defb4e90889994386def60"},"schema_version":"1.0","source":{"id":"1310.3609","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3609","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3609v4","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3609","created_at":"2026-05-18T02:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"PJPGRTBXKNK2","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PJPGRTBXKNK2ZRJI","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PJPGRTBX","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:9999abc05dc3f01cd6fc178227d3a72b85ec3a262c0cd0b0d3a8ef32e89859f2","target":"graph","created_at":"2026-05-18T02:42:39Z","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":"Markov decision processes (MDP) are useful to model concurrent process optimisation problems, but verifying them with numerical methods is often intractable. Existing approximative approaches do not scale well and are limited to memoryless schedulers. Here we present the basis of scalable verification for MDPSs, using an O(1) memory representation of history-dependent schedulers. We thus facilitate scalable learning techniques and the use of massively parallel verification.","authors_text":"Axel Legay, Louis-Marie Traonouez, Sean Sedwards","cross_cats":["cs.DC","cs.LG","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-14T09:50:49Z","title":"Scalable Verification of Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3609","kind":"arxiv","version":4},"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:0ce247b55e60923a1809d69038930fbd87b0518e2c86c0ae657bbfd0abd22c44","target":"record","created_at":"2026-05-18T02:42:39Z","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":"4d318f1fa71e3af3ef9e9a760f0e7dc1219acd591416ce02c294b5e685f96375","cross_cats_sorted":["cs.DC","cs.LG","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-14T09:50:49Z","title_canon_sha256":"6318210d25498740610854fd314dfd9987f52caf25defb4e90889994386def60"},"schema_version":"1.0","source":{"id":"1310.3609","kind":"arxiv","version":4}},"canonical_sha256":"7a5e68cc375355acc5283f20e0ee7d72fa514bab4b416e853c11671676e68e82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a5e68cc375355acc5283f20e0ee7d72fa514bab4b416e853c11671676e68e82","first_computed_at":"2026-05-18T02:42:39.587704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:39.587704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u7eaD7SZLaHssLDUXvX5f5vUv6HnrMcWsUyJtRZ6jRrbYIeHjYwEeLsfmtj4ylV+suBItulZSoSdpE6mWDYYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:39.588196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3609","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ce247b55e60923a1809d69038930fbd87b0518e2c86c0ae657bbfd0abd22c44","sha256:9999abc05dc3f01cd6fc178227d3a72b85ec3a262c0cd0b0d3a8ef32e89859f2"],"state_sha256":"7479f7e52f17d997756a00c69af63945a6b2961b4666755bf95882dffe185654"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRSK1q7C+4tvNVfLaCnY/hWquCx/suEXggKxtANiJZAhp4a8Y/Boz+jtm8UqXs5fPR1x0qXiADs7GG+aqqL+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T20:32:23.905719Z","bundle_sha256":"3b03233790baca94050268904ce78384aa5ef5191e50fe2b74b056b7d418f8e9"}}