{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A2IGILVBQ4MSODF46SP2OXU56J","short_pith_number":"pith:A2IGILVB","schema_version":"1.0","canonical_sha256":"0690642ea18719270cbcf49fa75e9df27e7528ba27669399d4de115bb530dc79","source":{"kind":"arxiv","id":"1804.07031","version":1},"attestation_state":"computed","paper":{"title":"Algorithms and Conditional Lower Bounds for Planning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Alexander Svozil, Krishnendu Chatterjee, Monika Henzinger, Wolfgang Dvo\\v{r}\\'ak","submitted_at":"2018-04-19T08:12:50Z","abstract_excerpt":"We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set, and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present "},"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":"1804.07031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-19T08:12:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"013400f727c7fe65ec891cb95cdf6e5fbd7616c238f9d7f2f891dca612a0e582","abstract_canon_sha256":"253509f545ea7e4d58cc724f51bd523b68d113c1ccacf516991eab146c769fc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:04.517068Z","signature_b64":"I2Nm5LbxcssiLTEnQgZzHJvQX1tRiZMDAJSI24CUvzyeZJHPxgIIg82V3ByjzbJolPdow1AjjRTdCo+34GpaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0690642ea18719270cbcf49fa75e9df27e7528ba27669399d4de115bb530dc79","last_reissued_at":"2026-05-18T00:18:04.516329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:04.516329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms and Conditional Lower Bounds for Planning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Alexander Svozil, Krishnendu Chatterjee, Monika Henzinger, Wolfgang Dvo\\v{r}\\'ak","submitted_at":"2018-04-19T08:12:50Z","abstract_excerpt":"We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set, and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07031","kind":"arxiv","version":1},"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":"1804.07031","created_at":"2026-05-18T00:18:04.516458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07031v1","created_at":"2026-05-18T00:18:04.516458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07031","created_at":"2026-05-18T00:18:04.516458+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2IGILVBQ4MS","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2IGILVBQ4MSODF4","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2IGILVB","created_at":"2026-05-18T12:32:13.499390+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/A2IGILVBQ4MSODF46SP2OXU56J","json":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J.json","graph_json":"https://pith.science/api/pith-number/A2IGILVBQ4MSODF46SP2OXU56J/graph.json","events_json":"https://pith.science/api/pith-number/A2IGILVBQ4MSODF46SP2OXU56J/events.json","paper":"https://pith.science/paper/A2IGILVB"},"agent_actions":{"view_html":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J","download_json":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J.json","view_paper":"https://pith.science/paper/A2IGILVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07031&json=true","fetch_graph":"https://pith.science/api/pith-number/A2IGILVBQ4MSODF46SP2OXU56J/graph.json","fetch_events":"https://pith.science/api/pith-number/A2IGILVBQ4MSODF46SP2OXU56J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J/action/storage_attestation","attest_author":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J/action/author_attestation","sign_citation":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J/action/citation_signature","submit_replication":"https://pith.science/pith/A2IGILVBQ4MSODF46SP2OXU56J/action/replication_record"}},"created_at":"2026-05-18T00:18:04.516458+00:00","updated_at":"2026-05-18T00:18:04.516458+00:00"}