{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZFDL2ZWCCGBDFWRDTWS7CHWGZ2","short_pith_number":"pith:ZFDL2ZWC","canonical_record":{"source":{"id":"1401.5861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:49:53Z","cross_cats_sorted":[],"title_canon_sha256":"c3a526306572710febc0610ac852a0c5453fd1e0489f587885ab8f82fb878e81","abstract_canon_sha256":"8e92f1de8c59cd1b7e0ee195eb5a1964bed4ceb31a1393aacf079556d94e3738"},"schema_version":"1.0"},"canonical_sha256":"c946bd66c2118232da239da5f11ec6ce94359f9f865fb938fa0b0b19614a8d08","source":{"kind":"arxiv","id":"1401.5861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5861","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5861v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5861","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZFDL2ZWCCGBD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFDL2ZWCCGBDFWRD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFDL2ZWC","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZFDL2ZWCCGBDFWRDTWS7CHWGZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:49:53Z","cross_cats_sorted":[],"title_canon_sha256":"c3a526306572710febc0610ac852a0c5453fd1e0489f587885ab8f82fb878e81","abstract_canon_sha256":"8e92f1de8c59cd1b7e0ee195eb5a1964bed4ceb31a1393aacf079556d94e3738"},"schema_version":"1.0"},"canonical_sha256":"c946bd66c2118232da239da5f11ec6ce94359f9f865fb938fa0b0b19614a8d08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.606897Z","signature_b64":"DumzjKxOlZDyH49B2poK07a+YODgwmGfD1+Dnc8BegVW0lOOgIn54u8VZM9lKNImjiRia5idnc/ryTlQveo/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c946bd66c2118232da239da5f11ec6ce94359f9f865fb938fa0b0b19614a8d08","last_reissued_at":"2026-05-18T03:01:23.606220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.606220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5861","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-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGNrqO+NBgxLNAozv+jbzY/hpbGEBRkGR5bY0Nd212z7lLM5pC2Gipw834O5YtrPrl/Q88wEJ6EAhD18gWl7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:22.816599Z"},"content_sha256":"39ff28ce9c5e302261955d9433e139639ce994d483a51111160d066f98f5d676","schema_version":"1.0","event_id":"sha256:39ff28ce9c5e302261955d9433e139639ce994d483a51111160d066f98f5d676"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZFDL2ZWCCGBDFWRDTWS7CHWGZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Speedup Learning for Optimal Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Carmel Domshlak, Erez Karpas, Shaul Markovitch","submitted_at":"2014-01-23T02:49:53Z","abstract_excerpt":"Domain-independent planning is one of the foundational areas in the field of Artificial Intelligence. A description of a planning task consists of an initial world state, a goal, and a set of actions for modifying the world state. The objective is to find a sequence of actions, that is, a plan, that transforms the initial world state into a goal state. In optimal planning, we are interested in finding not just a plan, but one of the cheapest plans. A prominent approach to optimal planning these days is heuristic\nstate-space search, guided by admissible heuristic functions. Numerous admissible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5861","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-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGeEVG7ULizARDruCf+g8BFQgEyNLhz3OLlDSKTTEoszrtzmXQq9Tzilz2gQClCMb0rKC4rRqog+5YnHEnijAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:22.816944Z"},"content_sha256":"40aa61372089cc06e347570b99c9121328a7281a715e24ba89f73846aa4e9ada","schema_version":"1.0","event_id":"sha256:40aa61372089cc06e347570b99c9121328a7281a715e24ba89f73846aa4e9ada"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFDL2ZWCCGBDFWRDTWS7CHWGZ2/bundle.json","state_url":"https://pith.science/pith/ZFDL2ZWCCGBDFWRDTWS7CHWGZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFDL2ZWCCGBDFWRDTWS7CHWGZ2/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-30T06:09:22Z","links":{"resolver":"https://pith.science/pith/ZFDL2ZWCCGBDFWRDTWS7CHWGZ2","bundle":"https://pith.science/pith/ZFDL2ZWCCGBDFWRDTWS7CHWGZ2/bundle.json","state":"https://pith.science/pith/ZFDL2ZWCCGBDFWRDTWS7CHWGZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFDL2ZWCCGBDFWRDTWS7CHWGZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZFDL2ZWCCGBDFWRDTWS7CHWGZ2","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":"8e92f1de8c59cd1b7e0ee195eb5a1964bed4ceb31a1393aacf079556d94e3738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:49:53Z","title_canon_sha256":"c3a526306572710febc0610ac852a0c5453fd1e0489f587885ab8f82fb878e81"},"schema_version":"1.0","source":{"id":"1401.5861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5861","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5861v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5861","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZFDL2ZWCCGBD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFDL2ZWCCGBDFWRD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFDL2ZWC","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:40aa61372089cc06e347570b99c9121328a7281a715e24ba89f73846aa4e9ada","target":"graph","created_at":"2026-05-18T03:01:23Z","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":"Domain-independent planning is one of the foundational areas in the field of Artificial Intelligence. A description of a planning task consists of an initial world state, a goal, and a set of actions for modifying the world state. The objective is to find a sequence of actions, that is, a plan, that transforms the initial world state into a goal state. In optimal planning, we are interested in finding not just a plan, but one of the cheapest plans. A prominent approach to optimal planning these days is heuristic\nstate-space search, guided by admissible heuristic functions. Numerous admissible ","authors_text":"Carmel Domshlak, Erez Karpas, Shaul Markovitch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:49:53Z","title":"Online Speedup Learning for Optimal Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5861","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:39ff28ce9c5e302261955d9433e139639ce994d483a51111160d066f98f5d676","target":"record","created_at":"2026-05-18T03:01:23Z","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":"8e92f1de8c59cd1b7e0ee195eb5a1964bed4ceb31a1393aacf079556d94e3738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:49:53Z","title_canon_sha256":"c3a526306572710febc0610ac852a0c5453fd1e0489f587885ab8f82fb878e81"},"schema_version":"1.0","source":{"id":"1401.5861","kind":"arxiv","version":1}},"canonical_sha256":"c946bd66c2118232da239da5f11ec6ce94359f9f865fb938fa0b0b19614a8d08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c946bd66c2118232da239da5f11ec6ce94359f9f865fb938fa0b0b19614a8d08","first_computed_at":"2026-05-18T03:01:23.606220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:23.606220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DumzjKxOlZDyH49B2poK07a+YODgwmGfD1+Dnc8BegVW0lOOgIn54u8VZM9lKNImjiRia5idnc/ryTlQveo/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:23.606897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39ff28ce9c5e302261955d9433e139639ce994d483a51111160d066f98f5d676","sha256:40aa61372089cc06e347570b99c9121328a7281a715e24ba89f73846aa4e9ada"],"state_sha256":"7484ba515e8cec6edf482ceca58381317267503bfef78d788446582109d2e2fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BoXU5KtZ4uNwyAiapj66coiWQAvp2kcf9rPGTfqhTPXwJ26pTMYm/j95MeMN60hogzwVWK0Yql38q/PzkvmBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:09:22.818889Z","bundle_sha256":"f9dbcee279adf6fc722d8019d0d3d8a6806b9f156b7e32ec2acba47f45ab20df"}}