{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4DOWPYK62PVMAEAIR4VH7ZC3QN","short_pith_number":"pith:4DOWPYK6","canonical_record":{"source":{"id":"1401.3885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:14:42Z","cross_cats_sorted":[],"title_canon_sha256":"f5b597f2b4b4ade39b95d37c2b70a1895d7ae8f1e87969f53c8c190ee65e1906","abstract_canon_sha256":"79eac89c87011e852fc6869a86ba0899f9e2da153709bc8d123b8d0961729beb"},"schema_version":"1.0"},"canonical_sha256":"e0dd67e15ed3eac010088f2a7fe45b8340ac57ea4aec50dc8da8d8a286e103e4","source":{"kind":"arxiv","id":"1401.3885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3885","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3885v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3885","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"4DOWPYK62PVM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DOWPYK62PVMAEAI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DOWPYK6","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4DOWPYK62PVMAEAIR4VH7ZC3QN","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:14:42Z","cross_cats_sorted":[],"title_canon_sha256":"f5b597f2b4b4ade39b95d37c2b70a1895d7ae8f1e87969f53c8c190ee65e1906","abstract_canon_sha256":"79eac89c87011e852fc6869a86ba0899f9e2da153709bc8d123b8d0961729beb"},"schema_version":"1.0"},"canonical_sha256":"e0dd67e15ed3eac010088f2a7fe45b8340ac57ea4aec50dc8da8d8a286e103e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.256526Z","signature_b64":"xySry1NvxvotQyLJZMy+FWAVqDxI39YYAzirHdn+yRbx0uqw1cZ+djE3u+BUsHQSi2w7P1QFYaokHQM0I1cCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0dd67e15ed3eac010088f2a7fe45b8340ac57ea4aec50dc8da8d8a286e103e4","last_reissued_at":"2026-05-18T03:02:06.255882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.255882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3885","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpxEnsFTPKTeWnPmBsV/EjbPVKWX9EMrShOdTlSG1LRTgu3c/vyRp+UHVmE0EKTBtsDL279UIVrvBYsCSdwSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:23:18.003110Z"},"content_sha256":"9f35e7a58be40af67ce46eb2b5b69858c2beac10d7e821da2c2918af37b5c8c9","schema_version":"1.0","event_id":"sha256:9f35e7a58be40af67ce46eb2b5b69858c2beac10d7e821da2c2918af37b5c8c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4DOWPYK62PVMAEAIR4VH7ZC3QN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling up Heuristic Planning with Relational Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daniel Borrajo, Raquel Fuentetaja, Sergio Jimenez, Tomas De la Rosa","submitted_at":"2014-01-16T05:14:42Z","abstract_excerpt":"Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are worth the expense. However, when  evaluation functions are misguiding or when planning problems are large enough, lots of node evaluations must be computed, which severely limits the scalability of heuristic planners. In this paper, we present a novel solution for reducing node evaluations in heuristic planning based on machine learning. Particularly, we define the task of learning search control for heuristic planning as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3885","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7n/kY8/yaBepOseBM8Hh4fGXEuzEpMSoxAzBDX4Y2va0NFMWP1KzPzG1jcbYaeWskZ4Syrc4BWtG+sr5OpXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T04:23:18.003712Z"},"content_sha256":"32e0a6e6b5af7ef81e67105b0cd47fdc7431a4c0ceb4ddcb75f8162f7f110994","schema_version":"1.0","event_id":"sha256:32e0a6e6b5af7ef81e67105b0cd47fdc7431a4c0ceb4ddcb75f8162f7f110994"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DOWPYK62PVMAEAIR4VH7ZC3QN/bundle.json","state_url":"https://pith.science/pith/4DOWPYK62PVMAEAIR4VH7ZC3QN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DOWPYK62PVMAEAIR4VH7ZC3QN/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-07-02T04:23:18Z","links":{"resolver":"https://pith.science/pith/4DOWPYK62PVMAEAIR4VH7ZC3QN","bundle":"https://pith.science/pith/4DOWPYK62PVMAEAIR4VH7ZC3QN/bundle.json","state":"https://pith.science/pith/4DOWPYK62PVMAEAIR4VH7ZC3QN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DOWPYK62PVMAEAIR4VH7ZC3QN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4DOWPYK62PVMAEAIR4VH7ZC3QN","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":"79eac89c87011e852fc6869a86ba0899f9e2da153709bc8d123b8d0961729beb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:14:42Z","title_canon_sha256":"f5b597f2b4b4ade39b95d37c2b70a1895d7ae8f1e87969f53c8c190ee65e1906"},"schema_version":"1.0","source":{"id":"1401.3885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3885","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3885v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3885","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"4DOWPYK62PVM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DOWPYK62PVMAEAI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DOWPYK6","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:32e0a6e6b5af7ef81e67105b0cd47fdc7431a4c0ceb4ddcb75f8162f7f110994","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are worth the expense. However, when  evaluation functions are misguiding or when planning problems are large enough, lots of node evaluations must be computed, which severely limits the scalability of heuristic planners. In this paper, we present a novel solution for reducing node evaluations in heuristic planning based on machine learning. Particularly, we define the task of learning search control for heuristic planning as","authors_text":"Daniel Borrajo, Raquel Fuentetaja, Sergio Jimenez, Tomas De la Rosa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:14:42Z","title":"Scaling up Heuristic Planning with Relational Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3885","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:9f35e7a58be40af67ce46eb2b5b69858c2beac10d7e821da2c2918af37b5c8c9","target":"record","created_at":"2026-05-18T03:02:06Z","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":"79eac89c87011e852fc6869a86ba0899f9e2da153709bc8d123b8d0961729beb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:14:42Z","title_canon_sha256":"f5b597f2b4b4ade39b95d37c2b70a1895d7ae8f1e87969f53c8c190ee65e1906"},"schema_version":"1.0","source":{"id":"1401.3885","kind":"arxiv","version":1}},"canonical_sha256":"e0dd67e15ed3eac010088f2a7fe45b8340ac57ea4aec50dc8da8d8a286e103e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0dd67e15ed3eac010088f2a7fe45b8340ac57ea4aec50dc8da8d8a286e103e4","first_computed_at":"2026-05-18T03:02:06.255882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.255882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xySry1NvxvotQyLJZMy+FWAVqDxI39YYAzirHdn+yRbx0uqw1cZ+djE3u+BUsHQSi2w7P1QFYaokHQM0I1cCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.256526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f35e7a58be40af67ce46eb2b5b69858c2beac10d7e821da2c2918af37b5c8c9","sha256:32e0a6e6b5af7ef81e67105b0cd47fdc7431a4c0ceb4ddcb75f8162f7f110994"],"state_sha256":"104424922c52e70042a6812d2ca1582c62f5dd6fe624f27d6207b04a9f8fb0e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJGuTJF010MTfflvhwH1CPE4WLTscIExsH3QsAZ0r04xuSfXm/kMHmlKkjtwhUHVjBow0TaUDrCEm3tTQ+h1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T04:23:18.006676Z","bundle_sha256":"9f15a14db5f3cb82274c633707555251ff732f4be7f3d808d8c9f84c871ea4e1"}}