{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SW533SDZPP5Q5Z24SL7BMNCL5I","short_pith_number":"pith:SW533SDZ","canonical_record":{"source":{"id":"1710.07903","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-22T07:40:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"041792b5eab17d815703afeb6d7d973aa8dcad21a7d2b26da53b437bb051992f","abstract_canon_sha256":"4723b02b73793250d59d57a52e2de5d4148420387e9198a74e71eae5a81b0be2"},"schema_version":"1.0"},"canonical_sha256":"95bbbdc8797bfb0ee75c92fe16344bea3babca35244914439f6d560d95322dca","source":{"kind":"arxiv","id":"1710.07903","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07903","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07903v4","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07903","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"SW533SDZPP5Q","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SW533SDZPP5Q5Z24","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SW533SDZ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SW533SDZPP5Q5Z24SL7BMNCL5I","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07903","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-22T07:40:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"041792b5eab17d815703afeb6d7d973aa8dcad21a7d2b26da53b437bb051992f","abstract_canon_sha256":"4723b02b73793250d59d57a52e2de5d4148420387e9198a74e71eae5a81b0be2"},"schema_version":"1.0"},"canonical_sha256":"95bbbdc8797bfb0ee75c92fe16344bea3babca35244914439f6d560d95322dca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.357517Z","signature_b64":"OGCui0tPWedMJVsd6c2Lhfg1ozsK2viwynt30CZeTNdSIIvCMQFot5Xk+FfRvjqSAB0LZHCZnXRIQHEkNj6uBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95bbbdc8797bfb0ee75c92fe16344bea3babca35244914439f6d560d95322dca","last_reissued_at":"2026-05-18T00:22:39.357159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.357159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07903","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-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wr9uiJYrPlA4ZjwL67syl7Nfe3wQx0A71oL8iSNUmqPRW1Ku1+MiBKzJDoR07vN9wnfxVAawgjDVskgsk6oFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:41:56.307734Z"},"content_sha256":"0767ac6aa52617a35bda0e2c1489fe20d9651e8619ff8f4ed5da4af87ecab06e","schema_version":"1.0","event_id":"sha256:0767ac6aa52617a35bda0e2c1489fe20d9651e8619ff8f4ed5da4af87ecab06e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SW533SDZPP5Q5Z24SL7BMNCL5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Guillermo A. Perez, Stephane Le Roux","submitted_at":"2017-10-22T07:40:11Z","abstract_excerpt":"We study the never-worse relation (NWR) for Markov decision processes with an infinite-horizon reachability objective. A state q is never worse than a state p if the maximal probability of reaching the target set of states from p is at most the same value from q, regard- less of the probabilities labelling the transitions. Extremal-probability states, end components, and essential states are all special cases of the equivalence relation induced by the NWR. Using the NWR, states in the same equivalence class can be collapsed. Then, actions leading to sub- optimal states can be removed. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07903","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-18T00:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtMzw2uBcsWv6uQ5JKjT1auGXH7esPq3qvC1inRs6/XqmxVDJUUxb2ac7u4UvIZ39xNKtkEBX4mJGBwAFUS3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:41:56.308447Z"},"content_sha256":"a2cdedb7529466557f929cd8abc84c88e0c226c4c5ddc19da03482c8bfcf13cc","schema_version":"1.0","event_id":"sha256:a2cdedb7529466557f929cd8abc84c88e0c226c4c5ddc19da03482c8bfcf13cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SW533SDZPP5Q5Z24SL7BMNCL5I/bundle.json","state_url":"https://pith.science/pith/SW533SDZPP5Q5Z24SL7BMNCL5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SW533SDZPP5Q5Z24SL7BMNCL5I/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-31T08:41:56Z","links":{"resolver":"https://pith.science/pith/SW533SDZPP5Q5Z24SL7BMNCL5I","bundle":"https://pith.science/pith/SW533SDZPP5Q5Z24SL7BMNCL5I/bundle.json","state":"https://pith.science/pith/SW533SDZPP5Q5Z24SL7BMNCL5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SW533SDZPP5Q5Z24SL7BMNCL5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SW533SDZPP5Q5Z24SL7BMNCL5I","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":"4723b02b73793250d59d57a52e2de5d4148420387e9198a74e71eae5a81b0be2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-22T07:40:11Z","title_canon_sha256":"041792b5eab17d815703afeb6d7d973aa8dcad21a7d2b26da53b437bb051992f"},"schema_version":"1.0","source":{"id":"1710.07903","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07903","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07903v4","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07903","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"SW533SDZPP5Q","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SW533SDZPP5Q5Z24","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SW533SDZ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:a2cdedb7529466557f929cd8abc84c88e0c226c4c5ddc19da03482c8bfcf13cc","target":"graph","created_at":"2026-05-18T00:22: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":"We study the never-worse relation (NWR) for Markov decision processes with an infinite-horizon reachability objective. A state q is never worse than a state p if the maximal probability of reaching the target set of states from p is at most the same value from q, regard- less of the probabilities labelling the transitions. Extremal-probability states, end components, and essential states are all special cases of the equivalence relation induced by the NWR. Using the NWR, states in the same equivalence class can be collapsed. Then, actions leading to sub- optimal states can be removed. We show ","authors_text":"Guillermo A. Perez, Stephane Le Roux","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-22T07:40:11Z","title":"The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07903","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:0767ac6aa52617a35bda0e2c1489fe20d9651e8619ff8f4ed5da4af87ecab06e","target":"record","created_at":"2026-05-18T00:22: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":"4723b02b73793250d59d57a52e2de5d4148420387e9198a74e71eae5a81b0be2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-22T07:40:11Z","title_canon_sha256":"041792b5eab17d815703afeb6d7d973aa8dcad21a7d2b26da53b437bb051992f"},"schema_version":"1.0","source":{"id":"1710.07903","kind":"arxiv","version":4}},"canonical_sha256":"95bbbdc8797bfb0ee75c92fe16344bea3babca35244914439f6d560d95322dca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95bbbdc8797bfb0ee75c92fe16344bea3babca35244914439f6d560d95322dca","first_computed_at":"2026-05-18T00:22:39.357159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.357159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OGCui0tPWedMJVsd6c2Lhfg1ozsK2viwynt30CZeTNdSIIvCMQFot5Xk+FfRvjqSAB0LZHCZnXRIQHEkNj6uBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.357517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07903","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0767ac6aa52617a35bda0e2c1489fe20d9651e8619ff8f4ed5da4af87ecab06e","sha256:a2cdedb7529466557f929cd8abc84c88e0c226c4c5ddc19da03482c8bfcf13cc"],"state_sha256":"b84bf7d03b62693b554ba2b81f647b802f3dd53d9037062063800b3ef00a8935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVvE6Y2sQNsyO4FYmF6wNnwIaqSnInRGJpF5MVmatzN9+4GKmqiA/NIY7BHITz917SB9aNuG0k9nmGcFqcUkDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:41:56.312182Z","bundle_sha256":"b487d521016333abcf81679504851bbbe0e3f06e7737872c61f719d7f7f77351"}}