{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LQAFIN4YPNY3YFU3W65I63UDAK","short_pith_number":"pith:LQAFIN4Y","canonical_record":{"source":{"id":"2605.19819","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T13:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"c4c6800f858e03f1ef385fcc57164ff3aac4f939ab34fe69a579831b017cccd9","abstract_canon_sha256":"058b5dc0fca05beda02f2a8bdbc140ad09f4d1f14a50504d491e05f54946d1f6"},"schema_version":"1.0"},"canonical_sha256":"5c005437987b71bc169bb7ba8f6e8302b901adeff0a2edebea83f30f17e743fd","source":{"kind":"arxiv","id":"2605.19819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19819","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19819v1","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19819","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"LQAFIN4YPNY3","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"LQAFIN4YPNY3YFU3","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"LQAFIN4Y","created_at":"2026-05-20T01:06:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LQAFIN4YPNY3YFU3W65I63UDAK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19819","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T13:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"c4c6800f858e03f1ef385fcc57164ff3aac4f939ab34fe69a579831b017cccd9","abstract_canon_sha256":"058b5dc0fca05beda02f2a8bdbc140ad09f4d1f14a50504d491e05f54946d1f6"},"schema_version":"1.0"},"canonical_sha256":"5c005437987b71bc169bb7ba8f6e8302b901adeff0a2edebea83f30f17e743fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:16.168539Z","signature_b64":"012vbkbTHB5hpGBCpHTNXsJWmcT3hs4cT90bDyMJUU4DZl4KrgYM16QuLcActiQXAwLLHvu1uVtBuLcWesrhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c005437987b71bc169bb7ba8f6e8302b901adeff0a2edebea83f30f17e743fd","last_reissued_at":"2026-05-20T01:06:16.167930Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:16.167930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19819","source_version":1,"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-20T01:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wr79PoP6d7rNqlKDrHMhqDqKqpxWob3g0eXwBtsSUFzIuACFglrGBl9D601QjWbHKtkq0GVJyW8ibxDZDjDqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:24:34.374400Z"},"content_sha256":"498f2d6100bd108fed822c0ecc424322515780a9884f537d3d677af2f2ab9eac","schema_version":"1.0","event_id":"sha256:498f2d6100bd108fed822c0ecc424322515780a9884f537d3d677af2f2ab9eac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LQAFIN4YPNY3YFU3W65I63UDAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Satisfiability for Knowing How over Linear Plans is NP-complete","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Carlos Areces, Pablo Barcel\\'o, Pablo F. Castro, Raul Fervari, St\\'ephane Demri, Valentin Cassano","submitted_at":"2026-05-19T13:13:23Z","abstract_excerpt":"We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability of knowing-how formulas is NP-complete, improving previously known complexity bounds. The proof proceeds via a translation into modal logic S5, an instrumental tool for addressing a variety of problems in knowledge representation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19819/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T01:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4fbtoG/HEW8knvtbQNH9b4KsEmKxfzk41XxKxEmlXPmaDLBCIJrtESMs8QawqOrBdeE2Ux+bDlKvCpXL8jwoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:24:34.375084Z"},"content_sha256":"0543a749378403c0788aafb32883942ec02358fad41423e14c2ed691fa193d14","schema_version":"1.0","event_id":"sha256:0543a749378403c0788aafb32883942ec02358fad41423e14c2ed691fa193d14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQAFIN4YPNY3YFU3W65I63UDAK/bundle.json","state_url":"https://pith.science/pith/LQAFIN4YPNY3YFU3W65I63UDAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQAFIN4YPNY3YFU3W65I63UDAK/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-23T05:24:34Z","links":{"resolver":"https://pith.science/pith/LQAFIN4YPNY3YFU3W65I63UDAK","bundle":"https://pith.science/pith/LQAFIN4YPNY3YFU3W65I63UDAK/bundle.json","state":"https://pith.science/pith/LQAFIN4YPNY3YFU3W65I63UDAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQAFIN4YPNY3YFU3W65I63UDAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LQAFIN4YPNY3YFU3W65I63UDAK","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":"058b5dc0fca05beda02f2a8bdbc140ad09f4d1f14a50504d491e05f54946d1f6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T13:13:23Z","title_canon_sha256":"c4c6800f858e03f1ef385fcc57164ff3aac4f939ab34fe69a579831b017cccd9"},"schema_version":"1.0","source":{"id":"2605.19819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19819","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19819v1","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19819","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"LQAFIN4YPNY3","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"LQAFIN4YPNY3YFU3","created_at":"2026-05-20T01:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"LQAFIN4Y","created_at":"2026-05-20T01:06:16Z"}],"graph_snapshots":[{"event_id":"sha256:0543a749378403c0788aafb32883942ec02358fad41423e14c2ed691fa193d14","target":"graph","created_at":"2026-05-20T01:06:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.19819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability of knowing-how formulas is NP-complete, improving previously known complexity bounds. The proof proceeds via a translation into modal logic S5, an instrumental tool for addressing a variety of problems in knowledge representation.","authors_text":"Carlos Areces, Pablo Barcel\\'o, Pablo F. Castro, Raul Fervari, St\\'ephane Demri, Valentin Cassano","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T13:13:23Z","title":"Satisfiability for Knowing How over Linear Plans is NP-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19819","kind":"arxiv","version":1},"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:498f2d6100bd108fed822c0ecc424322515780a9884f537d3d677af2f2ab9eac","target":"record","created_at":"2026-05-20T01:06:16Z","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":"058b5dc0fca05beda02f2a8bdbc140ad09f4d1f14a50504d491e05f54946d1f6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T13:13:23Z","title_canon_sha256":"c4c6800f858e03f1ef385fcc57164ff3aac4f939ab34fe69a579831b017cccd9"},"schema_version":"1.0","source":{"id":"2605.19819","kind":"arxiv","version":1}},"canonical_sha256":"5c005437987b71bc169bb7ba8f6e8302b901adeff0a2edebea83f30f17e743fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c005437987b71bc169bb7ba8f6e8302b901adeff0a2edebea83f30f17e743fd","first_computed_at":"2026-05-20T01:06:16.167930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:06:16.167930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"012vbkbTHB5hpGBCpHTNXsJWmcT3hs4cT90bDyMJUU4DZl4KrgYM16QuLcActiQXAwLLHvu1uVtBuLcWesrhBg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:06:16.168539Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:498f2d6100bd108fed822c0ecc424322515780a9884f537d3d677af2f2ab9eac","sha256:0543a749378403c0788aafb32883942ec02358fad41423e14c2ed691fa193d14"],"state_sha256":"44b782b2011fd56883099b86fd9fc2bfc7826a2b995f68941e50adb8d6eddc78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOM5uJlMk+DLQzesske8WdgAJOs/Dt70ad0nw6xiLBTJPAT3UVTgccR7FowfEojSxkhsTw8R4aL6KfozULnfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T05:24:34.378409Z","bundle_sha256":"4c5a05a498576caf4ea567bccf9eacb629859323eaaea39c1dc60060952a2581"}}