{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AWJV6QSBSX4ZRMYY63YVGZWMKK","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":"15879337300b555c67cdd03051eeca73f2d3f3e079daada0ac323109c257cae4","cross_cats_sorted":["cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T20:53:13Z","title_canon_sha256":"f970d6683b6b88bcd4dac89c95f99ace03fad8c4f11948cd6623e1a78f501a6b"},"schema_version":"1.0","source":{"id":"1903.00070","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00070","created_at":"2026-07-05T00:43:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00070v4","created_at":"2026-07-05T00:43:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00070","created_at":"2026-07-05T00:43:00Z"},{"alias_kind":"pith_short_12","alias_value":"AWJV6QSBSX4Z","created_at":"2026-07-05T00:43:00Z"},{"alias_kind":"pith_short_16","alias_value":"AWJV6QSBSX4ZRMYY","created_at":"2026-07-05T00:43:00Z"},{"alias_kind":"pith_short_8","alias_value":"AWJV6QSB","created_at":"2026-07-05T00:43:00Z"}],"graph_snapshots":[{"event_id":"sha256:49723df9fef8a782d8e3416d8d43b1f14eea2fb31a09632128b768766bdb8d63","target":"graph","created_at":"2026-07-05T00:43:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.00070/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a meta path planning algorithm named \\emph{Neural Exploration-Exploitation Trees~(NEXT)} for learning from prior experience for solving new path planning problems in high dimensional continuous state and action spaces. Compared to more classical sampling-based methods like RRT, our approach achieves much better sample efficiency in high-dimensions and can benefit from prior experience of planning in similar environments. More specifically, NEXT exploits a novel neural architecture which can learn promising search directions from problem structures. The learned prior is then integrat","authors_text":"Binghong Chen, Bo Dai, Guo Ye, Han Liu, Le Song, Qinjie Lin","cross_cats":["cs.RO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T20:53:13Z","title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00070","kind":"arxiv","version":4},"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:f30fcc255070f46f7323fda13cd1f77e24e58417b4fcf9502cb799d8cbf016e1","target":"record","created_at":"2026-07-05T00:43:00Z","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":"15879337300b555c67cdd03051eeca73f2d3f3e079daada0ac323109c257cae4","cross_cats_sorted":["cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T20:53:13Z","title_canon_sha256":"f970d6683b6b88bcd4dac89c95f99ace03fad8c4f11948cd6623e1a78f501a6b"},"schema_version":"1.0","source":{"id":"1903.00070","kind":"arxiv","version":4}},"canonical_sha256":"05935f424195f998b318f6f15366cc52bb2579fe64dcd0805e21f91a0699a855","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05935f424195f998b318f6f15366cc52bb2579fe64dcd0805e21f91a0699a855","first_computed_at":"2026-07-05T00:43:00.045079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:43:00.045079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1BYlkGvhacqtLP9eQA2lNVVUjOPZUzDWcCPVEFqR7Ax/YohtZb1VDh3sxjPcxzAOOzjM0UNSn8SAG8qXDvepAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:43:00.045553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00070","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f30fcc255070f46f7323fda13cd1f77e24e58417b4fcf9502cb799d8cbf016e1","sha256:49723df9fef8a782d8e3416d8d43b1f14eea2fb31a09632128b768766bdb8d63"],"state_sha256":"0a82c1cc45d5ed8a0eafc17dd01dc6d0dd74a000d2eac7845a0e4535f485c8fc"}