{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CXJPQ53O77RVIMH54J5VG2SPUN","short_pith_number":"pith:CXJPQ53O","canonical_record":{"source":{"id":"1907.04799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-10T15:36:03Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"06f6416365c0936e38b929c31f64c265ece45d6b3e4c33ddf36f6ab17f627fae","abstract_canon_sha256":"8b18a7d85010ae17f554f30b1d616c2a7e63abfd5145a1292a3236c7d24b4628"},"schema_version":"1.0"},"canonical_sha256":"15d2f8776effe35430fde27b536a4fa35a4fa4890a0b99d21207afb31bd5ab28","source":{"kind":"arxiv","id":"1907.04799","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04799","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04799v2","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04799","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"CXJPQ53O77RV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CXJPQ53O77RVIMH5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CXJPQ53O","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CXJPQ53O77RVIMH54J5VG2SPUN","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-10T15:36:03Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"06f6416365c0936e38b929c31f64c265ece45d6b3e4c33ddf36f6ab17f627fae","abstract_canon_sha256":"8b18a7d85010ae17f554f30b1d616c2a7e63abfd5145a1292a3236c7d24b4628"},"schema_version":"1.0"},"canonical_sha256":"15d2f8776effe35430fde27b536a4fa35a4fa4890a0b99d21207afb31bd5ab28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:48.530852Z","signature_b64":"5AvkcmfbJJfI0x2XZ9XnqzZ9MPb41Ah9I+2/hr9qH84zF3s9RzeQBD+Har8cSyeKDI+bB0Srny2JlwRHR/cpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d2f8776effe35430fde27b536a4fa35a4fa4890a0b99d21207afb31bd5ab28","last_reissued_at":"2026-05-17T23:40:48.530079Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:48.530079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04799","source_version":2,"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-17T23:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+a7LZ/wVfDp/PDAwlsBHu2iTVNobZrJ2NjbUvzdl+sLrc4pT/BV5zpCn70qTORnZV3H3Bxqh4JubwxwcnDfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:10:44.521401Z"},"content_sha256":"d3623e168ae110d31e301fd674ddd1a249c1c5b4796a6622f38b8d3e847b3b81","schema_version":"1.0","event_id":"sha256:d3623e168ae110d31e301fd674ddd1a249c1c5b4796a6622f38b8d3e847b3b81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CXJPQ53O77RVIMH54J5VG2SPUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RL-RRT: Kinodynamic Motion Planning via Learning Reachability Estimators from RL Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Aleksandra Faust, Hao-Tien Lewis Chiang, Jasmine Hsu, Lydia Tapia, Marek Fiser","submitted_at":"2019-07-10T15:36:03Z","abstract_excerpt":"This paper addresses two challenges facing sampling-based kinodynamic motion planning: a way to identify good candidate states for local transitions and the subsequent computationally intractable steering between these candidate states. Through the combination of sampling-based planning, a Rapidly Exploring Randomized Tree (RRT) and an efficient kinodynamic motion planner through machine learning, we propose an efficient solution to long-range planning for kinodynamic motion planning. First, we use deep reinforcement learning to learn an obstacle-avoiding policy that maps a robot's sensor obse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04799","kind":"arxiv","version":2},"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-17T23:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FW3AVC6GV+fsgPGUnLrOv0p7Z0yv3d/8VW5AqOSkix5F+NGIxpPVBl4GWkmZGGI/XO1aSiQA++z9sk36HXekAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:10:44.522102Z"},"content_sha256":"3acbc4c66947ed446e5fe4ce0064990b7678a292e8304eb011aac7dd8fc7715c","schema_version":"1.0","event_id":"sha256:3acbc4c66947ed446e5fe4ce0064990b7678a292e8304eb011aac7dd8fc7715c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/bundle.json","state_url":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXJPQ53O77RVIMH54J5VG2SPUN/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-05-25T16:10:44Z","links":{"resolver":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN","bundle":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/bundle.json","state":"https://pith.science/pith/CXJPQ53O77RVIMH54J5VG2SPUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXJPQ53O77RVIMH54J5VG2SPUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CXJPQ53O77RVIMH54J5VG2SPUN","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":"8b18a7d85010ae17f554f30b1d616c2a7e63abfd5145a1292a3236c7d24b4628","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-10T15:36:03Z","title_canon_sha256":"06f6416365c0936e38b929c31f64c265ece45d6b3e4c33ddf36f6ab17f627fae"},"schema_version":"1.0","source":{"id":"1907.04799","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04799","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04799v2","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04799","created_at":"2026-05-17T23:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"CXJPQ53O77RV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CXJPQ53O77RVIMH5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CXJPQ53O","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:3acbc4c66947ed446e5fe4ce0064990b7678a292e8304eb011aac7dd8fc7715c","target":"graph","created_at":"2026-05-17T23:40:48Z","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":"This paper addresses two challenges facing sampling-based kinodynamic motion planning: a way to identify good candidate states for local transitions and the subsequent computationally intractable steering between these candidate states. Through the combination of sampling-based planning, a Rapidly Exploring Randomized Tree (RRT) and an efficient kinodynamic motion planner through machine learning, we propose an efficient solution to long-range planning for kinodynamic motion planning. First, we use deep reinforcement learning to learn an obstacle-avoiding policy that maps a robot's sensor obse","authors_text":"Aleksandra Faust, Hao-Tien Lewis Chiang, Jasmine Hsu, Lydia Tapia, Marek Fiser","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-10T15:36:03Z","title":"RL-RRT: Kinodynamic Motion Planning via Learning Reachability Estimators from RL Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04799","kind":"arxiv","version":2},"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:d3623e168ae110d31e301fd674ddd1a249c1c5b4796a6622f38b8d3e847b3b81","target":"record","created_at":"2026-05-17T23:40:48Z","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":"8b18a7d85010ae17f554f30b1d616c2a7e63abfd5145a1292a3236c7d24b4628","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-10T15:36:03Z","title_canon_sha256":"06f6416365c0936e38b929c31f64c265ece45d6b3e4c33ddf36f6ab17f627fae"},"schema_version":"1.0","source":{"id":"1907.04799","kind":"arxiv","version":2}},"canonical_sha256":"15d2f8776effe35430fde27b536a4fa35a4fa4890a0b99d21207afb31bd5ab28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15d2f8776effe35430fde27b536a4fa35a4fa4890a0b99d21207afb31bd5ab28","first_computed_at":"2026-05-17T23:40:48.530079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:48.530079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5AvkcmfbJJfI0x2XZ9XnqzZ9MPb41Ah9I+2/hr9qH84zF3s9RzeQBD+Har8cSyeKDI+bB0Srny2JlwRHR/cpBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:48.530852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04799","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3623e168ae110d31e301fd674ddd1a249c1c5b4796a6622f38b8d3e847b3b81","sha256:3acbc4c66947ed446e5fe4ce0064990b7678a292e8304eb011aac7dd8fc7715c"],"state_sha256":"2ca31b7fc5b7de70caff6f549440bf0aeb2feeafc58add60bee5e87bbb69fc6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OkEW5+y5Bzdt3m2RDDFPdXkMJDltVUT88WPvJSNhd1QKWkVlpw0HaH65qaln5h7P6W9IhVSLQsQWJ6Kg6C6gAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:10:44.526059Z","bundle_sha256":"6a7e2e29a2de36a3359af8033dda4f849f199a18da786035d3180d6674ccba1d"}}