{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:H3KASPPA366ERS7A3U2C4OUPR7","short_pith_number":"pith:H3KASPPA","canonical_record":{"source":{"id":"1106.5257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"eb7d4bca08194b1a48f8692cac01baade9449c5c32255543c83644f037a7ad78","abstract_canon_sha256":"60d0bdd12828901a074ab41a20ebceae8b56e0e5d425cf5f82c28b4ae251af1c"},"schema_version":"1.0"},"canonical_sha256":"3ed4093de0dfbc48cbe0dd342e3a8f8fc5cb8a16cec86bdc4f1585e2bb2592f5","source":{"kind":"arxiv","id":"1106.5257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5257","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5257v1","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5257","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"H3KASPPA366E","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H3KASPPA366ERS7A","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H3KASPPA","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:H3KASPPA366ERS7A3U2C4OUPR7","target":"record","payload":{"canonical_record":{"source":{"id":"1106.5257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"eb7d4bca08194b1a48f8692cac01baade9449c5c32255543c83644f037a7ad78","abstract_canon_sha256":"60d0bdd12828901a074ab41a20ebceae8b56e0e5d425cf5f82c28b4ae251af1c"},"schema_version":"1.0"},"canonical_sha256":"3ed4093de0dfbc48cbe0dd342e3a8f8fc5cb8a16cec86bdc4f1585e2bb2592f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:14.004087Z","signature_b64":"gwcw7RmVKqrJyh2vQqpXHZcZo02LG8GXiTJIyIeNeB8fhSFQkAkh0oPY+ojACnID/6VVVMgM445j6VomvbtqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ed4093de0dfbc48cbe0dd342e3a8f8fc5cb8a16cec86bdc4f1585e2bb2592f5","last_reissued_at":"2026-05-18T04:19:14.003483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:14.003483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.5257","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-18T04:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXlf8CCWQ/MGLKKB+9ZJ+zfoX2430dvaxKSsnunhArt+nQQLJb1l2g9nM0r4Z0RUYUZO6qLqZceomqOpOzMNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:06:55.442737Z"},"content_sha256":"4fc57e1135e5840dfd23dffd33f23dfe03febe4aa6bd9ad8b767b51ac6635973","schema_version":"1.0","event_id":"sha256:4fc57e1135e5840dfd23dffd33f23dfe03febe4aa6bd9ad8b767b51ac6635973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:H3KASPPA366ERS7A3U2C4OUPR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Answer Set Planning Under Action Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. Polleres, G. Pfeifer, N. Leone, T. Eiter, W. Faber","submitted_at":"2011-06-26T21:02:44Z","abstract_excerpt":"Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language Kc, which extends the declarative planning language K by action costs. Kc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5257","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"},"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-18T04:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VDJA3R4NurQ8AsixdoTx35zrzL8Tnx2goKh9BAP7pQA3uFNOm/UGuc4Sh55FzN//JbcDTtTIGsy4VMja+IoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:06:55.443107Z"},"content_sha256":"302f5f1c3858bfd570d075ea56fe7e9d8cc99ac12d05802712096d3139285703","schema_version":"1.0","event_id":"sha256:302f5f1c3858bfd570d075ea56fe7e9d8cc99ac12d05802712096d3139285703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3KASPPA366ERS7A3U2C4OUPR7/bundle.json","state_url":"https://pith.science/pith/H3KASPPA366ERS7A3U2C4OUPR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3KASPPA366ERS7A3U2C4OUPR7/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-06-04T20:06:55Z","links":{"resolver":"https://pith.science/pith/H3KASPPA366ERS7A3U2C4OUPR7","bundle":"https://pith.science/pith/H3KASPPA366ERS7A3U2C4OUPR7/bundle.json","state":"https://pith.science/pith/H3KASPPA366ERS7A3U2C4OUPR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3KASPPA366ERS7A3U2C4OUPR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:H3KASPPA366ERS7A3U2C4OUPR7","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":"60d0bdd12828901a074ab41a20ebceae8b56e0e5d425cf5f82c28b4ae251af1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:02:44Z","title_canon_sha256":"eb7d4bca08194b1a48f8692cac01baade9449c5c32255543c83644f037a7ad78"},"schema_version":"1.0","source":{"id":"1106.5257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5257","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5257v1","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5257","created_at":"2026-05-18T04:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"H3KASPPA366E","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H3KASPPA366ERS7A","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H3KASPPA","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:302f5f1c3858bfd570d075ea56fe7e9d8cc99ac12d05802712096d3139285703","target":"graph","created_at":"2026-05-18T04:19:14Z","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":"Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language Kc, which extends the declarative planning language K by action costs. Kc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems ","authors_text":"A. Polleres, G. Pfeifer, N. Leone, T. Eiter, W. Faber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:02:44Z","title":"Answer Set Planning Under Action Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5257","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:4fc57e1135e5840dfd23dffd33f23dfe03febe4aa6bd9ad8b767b51ac6635973","target":"record","created_at":"2026-05-18T04:19:14Z","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":"60d0bdd12828901a074ab41a20ebceae8b56e0e5d425cf5f82c28b4ae251af1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:02:44Z","title_canon_sha256":"eb7d4bca08194b1a48f8692cac01baade9449c5c32255543c83644f037a7ad78"},"schema_version":"1.0","source":{"id":"1106.5257","kind":"arxiv","version":1}},"canonical_sha256":"3ed4093de0dfbc48cbe0dd342e3a8f8fc5cb8a16cec86bdc4f1585e2bb2592f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ed4093de0dfbc48cbe0dd342e3a8f8fc5cb8a16cec86bdc4f1585e2bb2592f5","first_computed_at":"2026-05-18T04:19:14.003483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:14.003483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gwcw7RmVKqrJyh2vQqpXHZcZo02LG8GXiTJIyIeNeB8fhSFQkAkh0oPY+ojACnID/6VVVMgM445j6VomvbtqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:14.004087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fc57e1135e5840dfd23dffd33f23dfe03febe4aa6bd9ad8b767b51ac6635973","sha256:302f5f1c3858bfd570d075ea56fe7e9d8cc99ac12d05802712096d3139285703"],"state_sha256":"5cb212301beb5e85ad9ab7e00355d2928681a489440f5464e1039a36b8bac825"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FijcTkVKYiTJaewuSqV0Bxe3eVeNW2/7dF76fVbnhw3LlrvADOzWaYsl/v767I5G5RecOUv+qMbUfSHkmtPyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:06:55.445384Z","bundle_sha256":"29673a17d33ca114205190590661811b19469dff01a8fb69986d7032d0b9bb4e"}}