{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4KFZYZCGD5DOXKTX3ZGU5HVOCJ","short_pith_number":"pith:4KFZYZCG","schema_version":"1.0","canonical_sha256":"e28b9c64461f46ebaa77de4d4e9eae1248e9581748598aba41bb21d44af393a8","source":{"kind":"arxiv","id":"1608.01302","version":1},"attestation_state":"computed","paper":{"title":"Learning to Rank for Synthesizing Planning Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Caelan Reed Garrett, Leslie Pack Kaelbling, Tomas Lozano-Perez","submitted_at":"2016-08-03T19:50:39Z","abstract_excerpt":"We investigate learning heuristics for domain-specific planning. Prior work framed learning a heuristic as an ordinary regression problem. However, in a greedy best-first search, the ordering of states induced by a heuristic is more indicative of the resulting planner's performance than mean squared error. Thus, we instead frame learning a heuristic as a learning to rank problem which we solve using a RankSVM formulation. Additionally, we introduce new methods for computing features that capture temporal interactions in an approximate plan. Our experiments on recent International Planning Comp"},"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":"1608.01302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-03T19:50:39Z","cross_cats_sorted":[],"title_canon_sha256":"a92d95c725d6ec0e5c7c94a21af8f12a0baaa8e54a567f21ac783771a8e317cd","abstract_canon_sha256":"b5a44fee8ec9da2a4a4fcec51efbcfbf66c0577400bd6edd9c79e861ea6829d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.938706Z","signature_b64":"z/0S5I5gMzv8bMSVAmMpSmeatfUGenreydHWtpIJnb6QWoJID7OpfuFROw0/dCdf4UaxeqPnEFkewDC9OScQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28b9c64461f46ebaa77de4d4e9eae1248e9581748598aba41bb21d44af393a8","last_reissued_at":"2026-05-18T01:09:55.938090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.938090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Rank for Synthesizing Planning Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Caelan Reed Garrett, Leslie Pack Kaelbling, Tomas Lozano-Perez","submitted_at":"2016-08-03T19:50:39Z","abstract_excerpt":"We investigate learning heuristics for domain-specific planning. Prior work framed learning a heuristic as an ordinary regression problem. However, in a greedy best-first search, the ordering of states induced by a heuristic is more indicative of the resulting planner's performance than mean squared error. Thus, we instead frame learning a heuristic as a learning to rank problem which we solve using a RankSVM formulation. Additionally, we introduce new methods for computing features that capture temporal interactions in an approximate plan. Our experiments on recent International Planning Comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01302","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.01302","created_at":"2026-05-18T01:09:55.938206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01302v1","created_at":"2026-05-18T01:09:55.938206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01302","created_at":"2026-05-18T01:09:55.938206+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KFZYZCGD5DO","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KFZYZCGD5DOXKTX","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KFZYZCG","created_at":"2026-05-18T12:29:58.707656+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/4KFZYZCGD5DOXKTX3ZGU5HVOCJ","json":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ.json","graph_json":"https://pith.science/api/pith-number/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/graph.json","events_json":"https://pith.science/api/pith-number/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/events.json","paper":"https://pith.science/paper/4KFZYZCG"},"agent_actions":{"view_html":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ","download_json":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ.json","view_paper":"https://pith.science/paper/4KFZYZCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01302&json=true","fetch_graph":"https://pith.science/api/pith-number/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/action/storage_attestation","attest_author":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/action/author_attestation","sign_citation":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/action/citation_signature","submit_replication":"https://pith.science/pith/4KFZYZCGD5DOXKTX3ZGU5HVOCJ/action/replication_record"}},"created_at":"2026-05-18T01:09:55.938206+00:00","updated_at":"2026-05-18T01:09:55.938206+00:00"}