{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AWJV6QSBSX4ZRMYY63YVGZWMKK","short_pith_number":"pith:AWJV6QSB","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"},"canonical_sha256":"05935f424195f998b318f6f15366cc52bb2579fe64dcd0805e21f91a0699a855","source":{"kind":"arxiv","id":"1903.00070","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AWJV6QSBSX4ZRMYY63YVGZWMKK","target":"record","payload":{"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"},"canonical_sha256":"05935f424195f998b318f6f15366cc52bb2579fe64dcd0805e21f91a0699a855","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"},"source_kind":"arxiv","source_id":"1903.00070","source_version":4,"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-07-05T00:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkPZZ9iLo7oXXQc71mzYulYJYmgusCo4qQ9VV1v4ycE0+DfSqUqb7I66agcdLSETRHZwR9gKSG1MqlYQBFdIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:14:05.193851Z"},"content_sha256":"f30fcc255070f46f7323fda13cd1f77e24e58417b4fcf9502cb799d8cbf016e1","schema_version":"1.0","event_id":"sha256:f30fcc255070f46f7323fda13cd1f77e24e58417b4fcf9502cb799d8cbf016e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AWJV6QSBSX4ZRMYY63YVGZWMKK","target":"graph","payload":{"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"},"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-07-05T00:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XF2kccuK+Z69E/vHO0gF/uHdEn2zHbQ8aVQTLrBgxwD+puc7UhWkIe6G9+6VIvQbiY0pJq3bFzp8jCdNeR3oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:14:05.194515Z"},"content_sha256":"49723df9fef8a782d8e3416d8d43b1f14eea2fb31a09632128b768766bdb8d63","schema_version":"1.0","event_id":"sha256:49723df9fef8a782d8e3416d8d43b1f14eea2fb31a09632128b768766bdb8d63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/bundle.json","state_url":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/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-08-13T10:14:05Z","links":{"resolver":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK","bundle":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/bundle.json","state":"https://pith.science/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWJV6QSBSX4ZRMYY63YVGZWMKK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaoTgPbWHGjnThlxTqlpIW/zjxwlIsntmYrxJqy5z9tNFniANPO0hd4aH2hdudhc8ckxdXUuOI17Gt/S+dRDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:14:05.198568Z","bundle_sha256":"419b2c6668a7673979a017d91e16dcdf95fa5c97f5d79e82e0e0e7dce519aa0f"}}