{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2CDRCCRFGDKNB4UFU46PCVP5P7","short_pith_number":"pith:2CDRCCRF","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"},"canonical_sha256":"d087110a2530d4d0f285a73cf155fd7fc1d59134d405520072989a522111072b","source":{"kind":"arxiv","id":"1807.09962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09962","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09962v1","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09962","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"2CDRCCRFGDKN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CDRCCRFGDKNB4UF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CDRCCRF","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2CDRCCRFGDKNB4UFU46PCVP5P7","target":"record","payload":{"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"},"canonical_sha256":"d087110a2530d4d0f285a73cf155fd7fc1d59134d405520072989a522111072b","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"},"source_kind":"arxiv","source_id":"1807.09962","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-18T00:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yoiEeOYB/dBZfd+fOB85uHhiNtc3RZja2hWDUNnJgx/lotumspOv0UbC6wITBGjNJr+SiLoGqMLNVcqJMvwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:39.059529Z"},"content_sha256":"8387e6f8b8411d12500153c923df0cbb8f50295155d407e55f5577d647b0bdd3","schema_version":"1.0","event_id":"sha256:8387e6f8b8411d12500153c923df0cbb8f50295155d407e55f5577d647b0bdd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2CDRCCRFGDKNB4UFU46PCVP5P7","target":"graph","payload":{"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"},"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-18T00:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YuWa3EE6TWyPEPpYlkNExRoIX4D0BjjLMNgHtCpsxtbFHCKjnj9ywX5kzbSf+XyPOJdvHooyBZZ4OkGl5JHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:39.060170Z"},"content_sha256":"ea29750d4a66343a700b79fca110558cebc7efb93f826bee3df580092faaf933","schema_version":"1.0","event_id":"sha256:ea29750d4a66343a700b79fca110558cebc7efb93f826bee3df580092faaf933"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/bundle.json","state_url":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/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-07T16:15:39Z","links":{"resolver":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7","bundle":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/bundle.json","state":"https://pith.science/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CDRCCRFGDKNB4UFU46PCVP5P7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2CDRCCRFGDKNB4UFU46PCVP5P7","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":"e6de32a804abcab749391953a94add012ae3f6d8350d46dc9677a867b0b28021","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-26T05:35:18Z","title_canon_sha256":"097e9a9211e15a2c235192d3cfa2cca90e19488db9271f61406388933e13d32a"},"schema_version":"1.0","source":{"id":"1807.09962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09962","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09962v1","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09962","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"2CDRCCRFGDKN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CDRCCRFGDKNB4UF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CDRCCRF","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:ea29750d4a66343a700b79fca110558cebc7efb93f826bee3df580092faaf933","target":"graph","created_at":"2026-05-18T00:09:45Z","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":"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 ","authors_text":"Beomjoon Kim, Leslie Pack Kaelbling, Tomas Lozano-Perez, Zi Wang","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-26T05:35:18Z","title":"Learning to guide task and motion planning using score-space representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09962","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:8387e6f8b8411d12500153c923df0cbb8f50295155d407e55f5577d647b0bdd3","target":"record","created_at":"2026-05-18T00:09:45Z","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":"e6de32a804abcab749391953a94add012ae3f6d8350d46dc9677a867b0b28021","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-07-26T05:35:18Z","title_canon_sha256":"097e9a9211e15a2c235192d3cfa2cca90e19488db9271f61406388933e13d32a"},"schema_version":"1.0","source":{"id":"1807.09962","kind":"arxiv","version":1}},"canonical_sha256":"d087110a2530d4d0f285a73cf155fd7fc1d59134d405520072989a522111072b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d087110a2530d4d0f285a73cf155fd7fc1d59134d405520072989a522111072b","first_computed_at":"2026-05-18T00:09:45.931252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:45.931252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l71j4ERNZEUDfGTByn7/UjQlk3RB4YPITR/nUpEyWaDLiKN5GLhGAfwhvIWRYAEsFamW5m7jhtrZ/yESfk7QDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:45.931895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8387e6f8b8411d12500153c923df0cbb8f50295155d407e55f5577d647b0bdd3","sha256:ea29750d4a66343a700b79fca110558cebc7efb93f826bee3df580092faaf933"],"state_sha256":"3b8ccb7ca93952af48adb96bae57abc5b4f7d2844b1ff590fed2e87e76997431"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMchht3Iwk47FHpq+GVNJOt4XTm7Gh22uULJAii3ra0mxAUCtvYXCB+hqi24CgqO3DTcpm+4tDeH2d6jajQSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:15:39.063533Z","bundle_sha256":"3eb69b87a6eb81b2a293ed5583b6288a8a93f0f19ce9fb52b9562f735d61f2cf"}}