{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:USSR6JW4ALHBL6CWYBQFPQE3MO","short_pith_number":"pith:USSR6JW4","schema_version":"1.0","canonical_sha256":"a4a51f26dc02ce15f856c06057c09b63a018b7524e191847d7b3852efcd9dc5a","source":{"kind":"arxiv","id":"1902.05727","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.05727","created_at":"2026-05-17T23:50:19.298736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05727v2","created_at":"2026-05-17T23:50:19.298736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05727","created_at":"2026-05-17T23:50:19.298736+00:00"},{"alias_kind":"pith_short_12","alias_value":"USSR6JW4ALHB","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"USSR6JW4ALHBL6CW","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"USSR6JW4","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO","json":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO.json","graph_json":"https://pith.science/api/pith-number/USSR6JW4ALHBL6CWYBQFPQE3MO/graph.json","events_json":"https://pith.science/api/pith-number/USSR6JW4ALHBL6CWYBQFPQE3MO/events.json","paper":"https://pith.science/paper/USSR6JW4"},"agent_actions":{"view_html":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO","download_json":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO.json","view_paper":"https://pith.science/paper/USSR6JW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05727&json=true","fetch_graph":"https://pith.science/api/pith-number/USSR6JW4ALHBL6CWYBQFPQE3MO/graph.json","fetch_events":"https://pith.science/api/pith-number/USSR6JW4ALHBL6CWYBQFPQE3MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/action/storage_attestation","attest_author":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/action/author_attestation","sign_citation":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/action/citation_signature","submit_replication":"https://pith.science/pith/USSR6JW4ALHBL6CWYBQFPQE3MO/action/replication_record"}},"created_at":"2026-05-17T23:50:19.298736+00:00","updated_at":"2026-05-17T23:50:19.298736+00:00"}