{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z2EITSDJUPKTMVLRBESU27K2LV","short_pith_number":"pith:Z2EITSDJ","schema_version":"1.0","canonical_sha256":"ce8889c869a3d536557109254d7d5a5d566fe6b043aee82f16cef749c763c993","source":{"kind":"arxiv","id":"1108.5943","version":2},"attestation_state":"computed","paper":{"title":"Proof System for Plan Verification under 0-Approximation Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Xishun Zhao, Yuping Shen","submitted_at":"2011-08-30T12:48:29Z","abstract_excerpt":"In this paper a proof system is developed for plan verification problems $\\{X\\}c\\{Y\\}$ and $\\{X\\}c\\{KW p\\}$ under 0-approximation semantics for ${\\mathcal A}_K$. Here, for a plan $c$, two sets $X,Y$ of fluent literals, and a literal $p$, $\\{X\\}c\\{Y\\}$ (resp. $\\{X\\}c\\{KW p\\}$) means that all literals of $Y$ become true (resp. $p$ becomes known) after executing $c$ in any initial state in which all literals in $X$ are true.Then, soundness and completeness are proved. The proof system allows verifying plans and generating plans as well."},"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":"1108.5943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T12:48:29Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"19b82c1b5322418e5d58aad07b118624a0de83d777123788e9155bde06274434","abstract_canon_sha256":"c4fe31c219b629e2a61bedf41561f3ccaf63d0900a6815df6298c477d68ba8a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:33.412981Z","signature_b64":"CV7HBQCSOpB7Ei/DasbO7MKLSVAAQYd6McpZvtTfcbM4CjMxcwUxO0cQ/ZezTAfeQKJF9JsLPKC4FfB8gKjiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce8889c869a3d536557109254d7d5a5d566fe6b043aee82f16cef749c763c993","last_reissued_at":"2026-05-18T04:12:33.412464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:33.412464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof System for Plan Verification under 0-Approximation Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Xishun Zhao, Yuping Shen","submitted_at":"2011-08-30T12:48:29Z","abstract_excerpt":"In this paper a proof system is developed for plan verification problems $\\{X\\}c\\{Y\\}$ and $\\{X\\}c\\{KW p\\}$ under 0-approximation semantics for ${\\mathcal A}_K$. Here, for a plan $c$, two sets $X,Y$ of fluent literals, and a literal $p$, $\\{X\\}c\\{Y\\}$ (resp. $\\{X\\}c\\{KW p\\}$) means that all literals of $Y$ become true (resp. $p$ becomes known) after executing $c$ in any initial state in which all literals in $X$ are true.Then, soundness and completeness are proved. The proof system allows verifying plans and generating plans as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5943","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":"1108.5943","created_at":"2026-05-18T04:12:33.412540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5943v2","created_at":"2026-05-18T04:12:33.412540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5943","created_at":"2026-05-18T04:12:33.412540+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2EITSDJUPKT","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2EITSDJUPKTMVLR","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2EITSDJ","created_at":"2026-05-18T12:26:47.523578+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/Z2EITSDJUPKTMVLRBESU27K2LV","json":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV.json","graph_json":"https://pith.science/api/pith-number/Z2EITSDJUPKTMVLRBESU27K2LV/graph.json","events_json":"https://pith.science/api/pith-number/Z2EITSDJUPKTMVLRBESU27K2LV/events.json","paper":"https://pith.science/paper/Z2EITSDJ"},"agent_actions":{"view_html":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV","download_json":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV.json","view_paper":"https://pith.science/paper/Z2EITSDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5943&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2EITSDJUPKTMVLRBESU27K2LV/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2EITSDJUPKTMVLRBESU27K2LV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV/action/storage_attestation","attest_author":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV/action/author_attestation","sign_citation":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV/action/citation_signature","submit_replication":"https://pith.science/pith/Z2EITSDJUPKTMVLRBESU27K2LV/action/replication_record"}},"created_at":"2026-05-18T04:12:33.412540+00:00","updated_at":"2026-05-18T04:12:33.412540+00:00"}