{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JZLC5RNUQZ3GYTWP4XXIKQNJCR","short_pith_number":"pith:JZLC5RNU","canonical_record":{"source":{"id":"1811.01700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-05T14:12:14Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"f71744a1ca84265fc0a6fe8ba876e8e6c29e5bea01dbf57ec1b8befe0769279d","abstract_canon_sha256":"71945fe17a8b940da2eb24996da1c87a6c41043ad03dd7913a76561e019dba5b"},"schema_version":"1.0"},"canonical_sha256":"4e562ec5b486766c4ecfe5ee8541a914704be3cf8dbe0a87e4e68a40654bc118","source":{"kind":"arxiv","id":"1811.01700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01700","created_at":"2026-05-17T23:49:27Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01700v1","created_at":"2026-05-17T23:49:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01700","created_at":"2026-05-17T23:49:27Z"},{"alias_kind":"pith_short_12","alias_value":"JZLC5RNUQZ3G","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JZLC5RNUQZ3GYTWP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JZLC5RNU","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JZLC5RNUQZ3GYTWP4XXIKQNJCR","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-05T14:12:14Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"f71744a1ca84265fc0a6fe8ba876e8e6c29e5bea01dbf57ec1b8befe0769279d","abstract_canon_sha256":"71945fe17a8b940da2eb24996da1c87a6c41043ad03dd7913a76561e019dba5b"},"schema_version":"1.0"},"canonical_sha256":"4e562ec5b486766c4ecfe5ee8541a914704be3cf8dbe0a87e4e68a40654bc118","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:27.466603Z","signature_b64":"xtRRukt1RWU+2/NUsTR/gTz+cEpBJwpI1hp4y1owq+/uv7wWjyNflroC215gYhh2CDnwCw1VV0wcvEcfScCwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e562ec5b486766c4ecfe5ee8541a914704be3cf8dbe0a87e4e68a40654bc118","last_reissued_at":"2026-05-17T23:49:27.465966Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:27.465966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01700","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-17T23:49:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ymEqG4MDSOKUljpFCKJoKIMvFCW0Azo+SbDUBqy96x98MsTHO7Wdbq5elrlRt6mBJRBYBz9yigp3uwJED82EBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:04:23.340734Z"},"content_sha256":"72c0c7233aa8cf26d3383788495b93d6740249aaab7a671b4a76855b340e6888","schema_version":"1.0","event_id":"sha256:72c0c7233aa8cf26d3383788495b93d6740249aaab7a671b4a76855b340e6888"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JZLC5RNUQZ3GYTWP4XXIKQNJCR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Subgoal Graphs with Reinforcement Learning to Build a Rational Pathfinder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.AI","authors_text":"Cong Hu, Junjie Zeng, Long Qin, Quanjun Yin, Yue Hu","submitted_at":"2018-11-05T14:12:14Z","abstract_excerpt":"In this paper, we present a hierarchical path planning framework called SG-RL (subgoal graphs-reinforcement learning), to plan rational paths for agents maneuvering in continuous and uncertain environments. By \"rational\", we mean (1) efficient path planning to eliminate first-move lags; (2) collision-free and smooth for agents with kinematic constraints satisfied. SG-RL works in a two-level manner. At the first level, SG-RL uses a geometric path-planning method, i.e., Simple Subgoal Graphs (SSG), to efficiently find optimal abstract paths, also called subgoal sequences. At the second level, SG"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01700","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-17T23:49:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUY9k1t4LRPbuLjWvB1c1nfqAd8WR1GRlBh7GOmDtc1m8H/zfUsn1R36lemrYzCy8KJ8cDxUF/Ynr9R8uQ/PCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:04:23.341669Z"},"content_sha256":"67086e3c2a01698dcd7caff766d593c9b9c7e355e1b3195aab5db98c9e7bff71","schema_version":"1.0","event_id":"sha256:67086e3c2a01698dcd7caff766d593c9b9c7e355e1b3195aab5db98c9e7bff71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZLC5RNUQZ3GYTWP4XXIKQNJCR/bundle.json","state_url":"https://pith.science/pith/JZLC5RNUQZ3GYTWP4XXIKQNJCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZLC5RNUQZ3GYTWP4XXIKQNJCR/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-11T03:04:23Z","links":{"resolver":"https://pith.science/pith/JZLC5RNUQZ3GYTWP4XXIKQNJCR","bundle":"https://pith.science/pith/JZLC5RNUQZ3GYTWP4XXIKQNJCR/bundle.json","state":"https://pith.science/pith/JZLC5RNUQZ3GYTWP4XXIKQNJCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZLC5RNUQZ3GYTWP4XXIKQNJCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JZLC5RNUQZ3GYTWP4XXIKQNJCR","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":"71945fe17a8b940da2eb24996da1c87a6c41043ad03dd7913a76561e019dba5b","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-05T14:12:14Z","title_canon_sha256":"f71744a1ca84265fc0a6fe8ba876e8e6c29e5bea01dbf57ec1b8befe0769279d"},"schema_version":"1.0","source":{"id":"1811.01700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01700","created_at":"2026-05-17T23:49:27Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01700v1","created_at":"2026-05-17T23:49:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01700","created_at":"2026-05-17T23:49:27Z"},{"alias_kind":"pith_short_12","alias_value":"JZLC5RNUQZ3G","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JZLC5RNUQZ3GYTWP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JZLC5RNU","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:67086e3c2a01698dcd7caff766d593c9b9c7e355e1b3195aab5db98c9e7bff71","target":"graph","created_at":"2026-05-17T23:49:27Z","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 present a hierarchical path planning framework called SG-RL (subgoal graphs-reinforcement learning), to plan rational paths for agents maneuvering in continuous and uncertain environments. By \"rational\", we mean (1) efficient path planning to eliminate first-move lags; (2) collision-free and smooth for agents with kinematic constraints satisfied. SG-RL works in a two-level manner. At the first level, SG-RL uses a geometric path-planning method, i.e., Simple Subgoal Graphs (SSG), to efficiently find optimal abstract paths, also called subgoal sequences. At the second level, SG","authors_text":"Cong Hu, Junjie Zeng, Long Qin, Quanjun Yin, Yue Hu","cross_cats":["cs.LG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-05T14:12:14Z","title":"Combining Subgoal Graphs with Reinforcement Learning to Build a Rational Pathfinder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01700","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:72c0c7233aa8cf26d3383788495b93d6740249aaab7a671b4a76855b340e6888","target":"record","created_at":"2026-05-17T23:49:27Z","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":"71945fe17a8b940da2eb24996da1c87a6c41043ad03dd7913a76561e019dba5b","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-05T14:12:14Z","title_canon_sha256":"f71744a1ca84265fc0a6fe8ba876e8e6c29e5bea01dbf57ec1b8befe0769279d"},"schema_version":"1.0","source":{"id":"1811.01700","kind":"arxiv","version":1}},"canonical_sha256":"4e562ec5b486766c4ecfe5ee8541a914704be3cf8dbe0a87e4e68a40654bc118","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e562ec5b486766c4ecfe5ee8541a914704be3cf8dbe0a87e4e68a40654bc118","first_computed_at":"2026-05-17T23:49:27.465966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:27.465966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xtRRukt1RWU+2/NUsTR/gTz+cEpBJwpI1hp4y1owq+/uv7wWjyNflroC215gYhh2CDnwCw1VV0wcvEcfScCwAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:27.466603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72c0c7233aa8cf26d3383788495b93d6740249aaab7a671b4a76855b340e6888","sha256:67086e3c2a01698dcd7caff766d593c9b9c7e355e1b3195aab5db98c9e7bff71"],"state_sha256":"38273be24a3a00d3a64e3e0ff43673f98a06aca627bd144ef127e6d21fc2a70e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7JDzIDmriRhDVKK9WaBvcYeVIQDw52dEJMRjs7+Hx9nnhwrulaeJo8pQkhuRME9go9DHo0b+SLDmvsCExaDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:04:23.345553Z","bundle_sha256":"ddd4b16d5aaffc0dd5e91a5166d36d2348c19e0a2ac88fea11bdbde8fd553e48"}}