{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2CDRCCRFGDKNB4UFU46PCVP5P7","short_pith_number":"pith:2CDRCCRF","schema_version":"1.0","canonical_sha256":"d087110a2530d4d0f285a73cf155fd7fc1d59134d405520072989a522111072b","source":{"kind":"arxiv","id":"1807.09962","version":1},"attestation_state":"computed","paper":{"title":"Learning to guide task and motion planning using score-space representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Beomjoon Kim, Leslie Pack Kaelbling, Tomas Lozano-Perez, Zi Wang","submitted_at":"2018-07-26T05:35:18Z","abstract_excerpt":"In this paper, we propose a learning algorithm that speeds up the search in task and motion planning problems. Our algorithm proposes solutions to three different challenges that arise in learning to improve planning efficiency: what to predict, how to represent a planning problem instance, and how to transfer knowledge from one problem instance to another. We propose a method that predicts constraints on the search space based on a generic representation of a planning problem instance, called score-space, where we represent a problem instance in terms of the performance of a set of solutions "},"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":"1807.09962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-26T05:35:18Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"097e9a9211e15a2c235192d3cfa2cca90e19488db9271f61406388933e13d32a","abstract_canon_sha256":"e6de32a804abcab749391953a94add012ae3f6d8350d46dc9677a867b0b28021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:45.931895Z","signature_b64":"l71j4ERNZEUDfGTByn7/UjQlk3RB4YPITR/nUpEyWaDLiKN5GLhGAfwhvIWRYAEsFamW5m7jhtrZ/yESfk7QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d087110a2530d4d0f285a73cf155fd7fc1d59134d405520072989a522111072b","last_reissued_at":"2026-05-18T00:09:45.931252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:45.931252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to guide task and motion planning using score-space representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Beomjoon Kim, Leslie Pack Kaelbling, Tomas Lozano-Perez, Zi Wang","submitted_at":"2018-07-26T05:35:18Z","abstract_excerpt":"In this paper, we propose a learning algorithm that speeds up the search in task and motion planning problems. Our algorithm proposes solutions to three different challenges that arise in learning to improve planning efficiency: what to predict, how to represent a planning problem instance, and how to transfer knowledge from one problem instance to another. We propose a method that predicts constraints on the search space based on a generic representation of a planning problem instance, called score-space, where we represent a problem instance in terms of the performance of a set of solutions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09962","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":"1807.09962","created_at":"2026-05-18T00:09:45.931350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09962v1","created_at":"2026-05-18T00:09:45.931350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09962","created_at":"2026-05-18T00:09:45.931350+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CDRCCRFGDKN","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CDRCCRFGDKNB4UF","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CDRCCRF","created_at":"2026-05-18T12:31:59.375834+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/2CDRCCRFGDKNB4UFU46PCVP5P7","json":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7.json","graph_json":"https://pith.science/api/pith-number/2CDRCCRFGDKNB4UFU46PCVP5P7/graph.json","events_json":"https://pith.science/api/pith-number/2CDRCCRFGDKNB4UFU46PCVP5P7/events.json","paper":"https://pith.science/paper/2CDRCCRF"},"agent_actions":{"view_html":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7","download_json":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7.json","view_paper":"https://pith.science/paper/2CDRCCRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09962&json=true","fetch_graph":"https://pith.science/api/pith-number/2CDRCCRFGDKNB4UFU46PCVP5P7/graph.json","fetch_events":"https://pith.science/api/pith-number/2CDRCCRFGDKNB4UFU46PCVP5P7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/action/storage_attestation","attest_author":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/action/author_attestation","sign_citation":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/action/citation_signature","submit_replication":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/action/replication_record"}},"created_at":"2026-05-18T00:09:45.931350+00:00","updated_at":"2026-05-18T00:09:45.931350+00:00"}