{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:USSR6JW4ALHBL6CWYBQFPQE3MO","short_pith_number":"pith:USSR6JW4","canonical_record":{"source":{"id":"1902.05727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-02-15T09:12:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3a622d83bf8d54804fa16d4a1c5183c8b27750c0273dfd8dce40380bed7bf435","abstract_canon_sha256":"121069d924212ef4a71ed0784acd85f7bcd879119b92a2f84528c5c9ce1040cf"},"schema_version":"1.0"},"canonical_sha256":"a4a51f26dc02ce15f856c06057c09b63a018b7524e191847d7b3852efcd9dc5a","source":{"kind":"arxiv","id":"1902.05727","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05727","created_at":"2026-05-17T23:50:19Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05727v2","created_at":"2026-05-17T23:50:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05727","created_at":"2026-05-17T23:50:19Z"},{"alias_kind":"pith_short_12","alias_value":"USSR6JW4ALHB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USSR6JW4ALHBL6CW","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USSR6JW4","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:USSR6JW4ALHBL6CWYBQFPQE3MO","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-02-15T09:12:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3a622d83bf8d54804fa16d4a1c5183c8b27750c0273dfd8dce40380bed7bf435","abstract_canon_sha256":"121069d924212ef4a71ed0784acd85f7bcd879119b92a2f84528c5c9ce1040cf"},"schema_version":"1.0"},"canonical_sha256":"a4a51f26dc02ce15f856c06057c09b63a018b7524e191847d7b3852efcd9dc5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:19.299282Z","signature_b64":"szjH/f36LZYu2TN6DZuiN2p6uLSCqSTdnqsNobplWn2saqSojzOCvcc4RBKaOd1usxPweMDemwvZIVW0mkHJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4a51f26dc02ce15f856c06057c09b63a018b7524e191847d7b3852efcd9dc5a","last_reissued_at":"2026-05-17T23:50:19.298624Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:19.298624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05727","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-17T23:50:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EV9ubPszaXNiO4BctVgbStQboIYQuoRjmcdNeoStVVrYRmCibnIaV5ggN+d4kI2bNz7LGuya2IQ2VlmrahKgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:01:09.226131Z"},"content_sha256":"38b6778237f53ff8c4ae768853ca5615a5f9eae32ef934ba6ef09fef83778fa8","schema_version":"1.0","event_id":"sha256:38b6778237f53ff8c4ae768853ca5615a5f9eae32ef934ba6ef09fef83778fa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:USSR6JW4ALHBL6CWYBQFPQE3MO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shepherding Hordes of Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Milan Ceska, Nils Jansen, Sebastian Junges","submitted_at":"2019-02-15T09:12:34Z","abstract_excerpt":"This paper considers large families of Markov chains (MCs) that are defined over a set of parameters with finite discrete domains. Such families occur in software product lines, planning under partial observability, and sketching of probabilistic programs. Simple questions, like `does at least one family member satisfy a property?', are NP-hard. We tackle two problems: distinguish family members that satisfy a given quantitative property from those that do not, and determine a family member that satisfies the property optimally, i.e., with the highest probability or reward. We show that combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05727","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-17T23:50:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyhAEy6DVA4joSgPNRxuACp862fF4EW8l98JVpP1z+k6ZfdGYFNh44wBmREcnBfJdY9/esiE+OtLvIrfutjkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:01:09.226639Z"},"content_sha256":"cc07269d6cf50217d6d82e8b92bc8deade8ba6382bb902f498d901d07d06b7fc","schema_version":"1.0","event_id":"sha256:cc07269d6cf50217d6d82e8b92bc8deade8ba6382bb902f498d901d07d06b7fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/bundle.json","state_url":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/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-05-23T22:01:09Z","links":{"resolver":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO","bundle":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/bundle.json","state":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:USSR6JW4ALHBL6CWYBQFPQE3MO","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":"121069d924212ef4a71ed0784acd85f7bcd879119b92a2f84528c5c9ce1040cf","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-02-15T09:12:34Z","title_canon_sha256":"3a622d83bf8d54804fa16d4a1c5183c8b27750c0273dfd8dce40380bed7bf435"},"schema_version":"1.0","source":{"id":"1902.05727","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05727","created_at":"2026-05-17T23:50:19Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05727v2","created_at":"2026-05-17T23:50:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05727","created_at":"2026-05-17T23:50:19Z"},{"alias_kind":"pith_short_12","alias_value":"USSR6JW4ALHB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USSR6JW4ALHBL6CW","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USSR6JW4","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:cc07269d6cf50217d6d82e8b92bc8deade8ba6382bb902f498d901d07d06b7fc","target":"graph","created_at":"2026-05-17T23:50:19Z","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":"This paper considers large families of Markov chains (MCs) that are defined over a set of parameters with finite discrete domains. Such families occur in software product lines, planning under partial observability, and sketching of probabilistic programs. Simple questions, like `does at least one family member satisfy a property?', are NP-hard. We tackle two problems: distinguish family members that satisfy a given quantitative property from those that do not, and determine a family member that satisfies the property optimally, i.e., with the highest probability or reward. We show that combin","authors_text":"Joost-Pieter Katoen, Milan Ceska, Nils Jansen, Sebastian Junges","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-02-15T09:12:34Z","title":"Shepherding Hordes of Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05727","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:38b6778237f53ff8c4ae768853ca5615a5f9eae32ef934ba6ef09fef83778fa8","target":"record","created_at":"2026-05-17T23:50:19Z","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":"121069d924212ef4a71ed0784acd85f7bcd879119b92a2f84528c5c9ce1040cf","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-02-15T09:12:34Z","title_canon_sha256":"3a622d83bf8d54804fa16d4a1c5183c8b27750c0273dfd8dce40380bed7bf435"},"schema_version":"1.0","source":{"id":"1902.05727","kind":"arxiv","version":2}},"canonical_sha256":"a4a51f26dc02ce15f856c06057c09b63a018b7524e191847d7b3852efcd9dc5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4a51f26dc02ce15f856c06057c09b63a018b7524e191847d7b3852efcd9dc5a","first_computed_at":"2026-05-17T23:50:19.298624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:19.298624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"szjH/f36LZYu2TN6DZuiN2p6uLSCqSTdnqsNobplWn2saqSojzOCvcc4RBKaOd1usxPweMDemwvZIVW0mkHJCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:19.299282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05727","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38b6778237f53ff8c4ae768853ca5615a5f9eae32ef934ba6ef09fef83778fa8","sha256:cc07269d6cf50217d6d82e8b92bc8deade8ba6382bb902f498d901d07d06b7fc"],"state_sha256":"b3ea09274bec5d0766aa6fd744a8b58b069ea63d7d047877d8375036cb57db0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sLq2npy9ejURQrBJoA8wyxgeaP1onerMjCGqgvCQs2GBnfcaROfcX4MX2S1wTO/nqus3Tx3QJMU2/AXr18DDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:01:09.229571Z","bundle_sha256":"8b36a6981f4459ab6e5d77ffc07bb1404fb7a753efc38905039b730ce2520bb7"}}