{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3GAQEB3OYQWZ64RK6FHDBIYM5N","short_pith_number":"pith:3GAQEB3O","canonical_record":{"source":{"id":"1804.08984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-24T12:26:37Z","cross_cats_sorted":["cs.AI","math.PR"],"title_canon_sha256":"ccf21d14dca63090be7a78f65fd796ad81a45735288e930fc437fcfbe2565c77","abstract_canon_sha256":"05a0971bc6861cec651d540380c1b9a2a20c07ff8552b5197913f683a4613873"},"schema_version":"1.0"},"canonical_sha256":"d98102076ec42d9f722af14e30a30ceb7e36244ecc783a86682189e56490ef4b","source":{"kind":"arxiv","id":"1804.08984","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08984","created_at":"2026-05-18T00:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08984v3","created_at":"2026-05-18T00:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08984","created_at":"2026-05-18T00:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"3GAQEB3OYQWZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GAQEB3OYQWZ64RK","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GAQEB3O","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3GAQEB3OYQWZ64RK6FHDBIYM5N","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-24T12:26:37Z","cross_cats_sorted":["cs.AI","math.PR"],"title_canon_sha256":"ccf21d14dca63090be7a78f65fd796ad81a45735288e930fc437fcfbe2565c77","abstract_canon_sha256":"05a0971bc6861cec651d540380c1b9a2a20c07ff8552b5197913f683a4613873"},"schema_version":"1.0"},"canonical_sha256":"d98102076ec42d9f722af14e30a30ceb7e36244ecc783a86682189e56490ef4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:37.796970Z","signature_b64":"TOVvaQ5iPhbSvtgJIVCQdTzo6Xh3dyea63kHf2PRn3GTg/rqMQzzPYRT+la8bbrRbB/L7+MlfGzUQOOdepnPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98102076ec42d9f722af14e30a30ceb7e36244ecc783a86682189e56490ef4b","last_reissued_at":"2026-05-18T00:10:37.796307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:37.796307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08984","source_version":3,"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:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWKfgs7bsaMzdl9XjKU/Wb+mPQgMsKOpf2UJUQNRLjg7CnA1XCXDJ5G2wRIO/gER6Gr+Ulmsklh9f+p0zHzfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:01:56.799746Z"},"content_sha256":"dc8bdc481e3c3729034d11b8416cc8d90c05650f22e7bdcb32709ddf8a29d5c9","schema_version":"1.0","event_id":"sha256:dc8bdc481e3c3729034d11b8416cc8d90c05650f22e7bdcb32709ddf8a29d5c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3GAQEB3OYQWZ64RK6FHDBIYM5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Approaches for Stochastic Shortest Path on Succinct MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.PR"],"primary_cat":"cs.PL","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Nastaran Okati","submitted_at":"2018-04-24T12:26:37Z","abstract_excerpt":"We consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update the variables. First, we show that several examples from the AI literature can be modeled as succinct MDPs. Then we present computational approaches for upper and lower bounds for the SSP problem: (a)~for computing upper bounds, our method is polynomial-time in the implicit description of the MDP; (b)~for lower bounds, we present a polynomial-time (in the size of the implicit description) reduction to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08984","kind":"arxiv","version":3},"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:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDe9vv1G5M2koHXUBrtCCiXu2KmCrz9aevnGr10ztzfVDd0gvhAYFRQVWysIuJ/+hnMZ6m805OBC0Xou2AskDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:01:56.800399Z"},"content_sha256":"3024251c862c2652d1f81012c7215cf756058056d087e73a53a233d778e42b6b","schema_version":"1.0","event_id":"sha256:3024251c862c2652d1f81012c7215cf756058056d087e73a53a233d778e42b6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GAQEB3OYQWZ64RK6FHDBIYM5N/bundle.json","state_url":"https://pith.science/pith/3GAQEB3OYQWZ64RK6FHDBIYM5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GAQEB3OYQWZ64RK6FHDBIYM5N/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-26T00:01:56Z","links":{"resolver":"https://pith.science/pith/3GAQEB3OYQWZ64RK6FHDBIYM5N","bundle":"https://pith.science/pith/3GAQEB3OYQWZ64RK6FHDBIYM5N/bundle.json","state":"https://pith.science/pith/3GAQEB3OYQWZ64RK6FHDBIYM5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GAQEB3OYQWZ64RK6FHDBIYM5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3GAQEB3OYQWZ64RK6FHDBIYM5N","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":"05a0971bc6861cec651d540380c1b9a2a20c07ff8552b5197913f683a4613873","cross_cats_sorted":["cs.AI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-24T12:26:37Z","title_canon_sha256":"ccf21d14dca63090be7a78f65fd796ad81a45735288e930fc437fcfbe2565c77"},"schema_version":"1.0","source":{"id":"1804.08984","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08984","created_at":"2026-05-18T00:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08984v3","created_at":"2026-05-18T00:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08984","created_at":"2026-05-18T00:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"3GAQEB3OYQWZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GAQEB3OYQWZ64RK","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GAQEB3O","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:3024251c862c2652d1f81012c7215cf756058056d087e73a53a233d778e42b6b","target":"graph","created_at":"2026-05-18T00:10:37Z","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 consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update the variables. First, we show that several examples from the AI literature can be modeled as succinct MDPs. Then we present computational approaches for upper and lower bounds for the SSP problem: (a)~for computing upper bounds, our method is polynomial-time in the implicit description of the MDP; (b)~for lower bounds, we present a polynomial-time (in the size of the implicit description) reduction to","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Nastaran Okati","cross_cats":["cs.AI","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-24T12:26:37Z","title":"Computational Approaches for Stochastic Shortest Path on Succinct MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08984","kind":"arxiv","version":3},"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:dc8bdc481e3c3729034d11b8416cc8d90c05650f22e7bdcb32709ddf8a29d5c9","target":"record","created_at":"2026-05-18T00:10:37Z","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":"05a0971bc6861cec651d540380c1b9a2a20c07ff8552b5197913f683a4613873","cross_cats_sorted":["cs.AI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-24T12:26:37Z","title_canon_sha256":"ccf21d14dca63090be7a78f65fd796ad81a45735288e930fc437fcfbe2565c77"},"schema_version":"1.0","source":{"id":"1804.08984","kind":"arxiv","version":3}},"canonical_sha256":"d98102076ec42d9f722af14e30a30ceb7e36244ecc783a86682189e56490ef4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d98102076ec42d9f722af14e30a30ceb7e36244ecc783a86682189e56490ef4b","first_computed_at":"2026-05-18T00:10:37.796307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:37.796307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TOVvaQ5iPhbSvtgJIVCQdTzo6Xh3dyea63kHf2PRn3GTg/rqMQzzPYRT+la8bbrRbB/L7+MlfGzUQOOdepnPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:37.796970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08984","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc8bdc481e3c3729034d11b8416cc8d90c05650f22e7bdcb32709ddf8a29d5c9","sha256:3024251c862c2652d1f81012c7215cf756058056d087e73a53a233d778e42b6b"],"state_sha256":"d58d88ad855b10bcf7e9e2f0c6aa94deb7208cfcedd17559d9a2294fa6c80e7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xnqt5k5JgFApltogB4cuCZJb3fqfOPIJa69HlMdqPtecPQQdqtjuW/s5jolCmj5I9j1dVCi9I5Uykn5t9+cQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:01:56.803743Z","bundle_sha256":"9d6141e56877ef2183824515cc57d9c8508c98af7b43e56b0c865c08ba5d1b96"}}