{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AWJV6QSBSX4ZRMYY63YVGZWMKK","short_pith_number":"pith:AWJV6QSB","schema_version":"1.0","canonical_sha256":"05935f424195f998b318f6f15366cc52bb2579fe64dcd0805e21f91a0699a855","source":{"kind":"arxiv","id":"1903.00070","version":4},"attestation_state":"computed","paper":{"title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Binghong Chen, Bo Dai, Guo Ye, Han Liu, Le Song, Qinjie Lin","submitted_at":"2019-02-28T20:53:13Z","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"},"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":"1903.00070","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T20:53:13Z","cross_cats_sorted":["cs.RO","stat.ML"],"title_canon_sha256":"f970d6683b6b88bcd4dac89c95f99ace03fad8c4f11948cd6623e1a78f501a6b","abstract_canon_sha256":"15879337300b555c67cdd03051eeca73f2d3f3e079daada0ac323109c257cae4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:00.045553Z","signature_b64":"1BYlkGvhacqtLP9eQA2lNVVUjOPZUzDWcCPVEFqR7Ax/YohtZb1VDh3sxjPcxzAOOzjM0UNSn8SAG8qXDvepAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05935f424195f998b318f6f15366cc52bb2579fe64dcd0805e21f91a0699a855","last_reissued_at":"2026-07-05T00:43:00.045079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:00.045079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Binghong Chen, Bo Dai, Guo Ye, Han Liu, Le Song, Qinjie Lin","submitted_at":"2019-02-28T20:53:13Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00070","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.00070/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1903.00070","created_at":"2026-07-05T00:43:00.045132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00070v4","created_at":"2026-07-05T00:43:00.045132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00070","created_at":"2026-07-05T00:43:00.045132+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWJV6QSBSX4Z","created_at":"2026-07-05T00:43:00.045132+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWJV6QSBSX4ZRMYY","created_at":"2026-07-05T00:43:00.045132+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWJV6QSB","created_at":"2026-07-05T00:43:00.045132+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20884","citing_title":"Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK","json":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK.json","graph_json":"https://pith.science/api/pith-number/AWJV6QSBSX4ZRMYY63YVGZWMKK/graph.json","events_json":"https://pith.science/api/pith-number/AWJV6QSBSX4ZRMYY63YVGZWMKK/events.json","paper":"https://pith.science/paper/AWJV6QSB"},"agent_actions":{"view_html":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK","download_json":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK.json","view_paper":"https://pith.science/paper/AWJV6QSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00070&json=true","fetch_graph":"https://pith.science/api/pith-number/AWJV6QSBSX4ZRMYY63YVGZWMKK/graph.json","fetch_events":"https://pith.science/api/pith-number/AWJV6QSBSX4ZRMYY63YVGZWMKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/action/storage_attestation","attest_author":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/action/author_attestation","sign_citation":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/action/citation_signature","submit_replication":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/action/replication_record"}},"created_at":"2026-07-05T00:43:00.045132+00:00","updated_at":"2026-07-05T00:43:00.045132+00:00"}