{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EOEWTYXCIWOLLL5XEPVGI46SXS","short_pith_number":"pith:EOEWTYXC","schema_version":"1.0","canonical_sha256":"238969e2e2459cb5afb723ea6473d2bcb4c4ee334606014ecdf2e77acb6b07c5","source":{"kind":"arxiv","id":"2105.00312","version":1},"attestation_state":"computed","paper":{"title":"Waypoint Planning Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Alexandru-Iosif Toma, Daniel Lenton, Hao-Ya Hsueh, Hussein Ali Jaafar, Ronald Clark, Sajad Saeedi, Stephen James","submitted_at":"2021-05-01T18:02:01Z","abstract_excerpt":"With the recent advances in machine learning, path planning algorithms are also evolving; however, the learned path planning algorithms often have difficulty competing with success rates of classic algorithms. We propose waypoint planning networks (WPN), a hybrid algorithm based on LSTMs with a local kernel - a classic algorithm such as A*, and a global kernel using a learned algorithm. WPN produces a more computationally efficient and robust solution. We compare WPN against A*, as well as related works including motion planning networks (MPNet) and value iteration networks (VIN). In this pape"},"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":"2105.00312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-05-01T18:02:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c76cad697d1b9c41be9e316af98fe3744af27baf4ff8a8e00138788b0ed5f359","abstract_canon_sha256":"07436228c8577b3ccf5de30564ebb45d8fd7913453c54c3ddea4366edbd8c11e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:36.545960Z","signature_b64":"mfnoWc9APuAyEbObPQTxPevv5j/rkLBdZuMO9BfvhbmSB+XU0pxv6iIA6+rpbwaqp2YP9NHJG9P61AnCmFQ/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"238969e2e2459cb5afb723ea6473d2bcb4c4ee334606014ecdf2e77acb6b07c5","last_reissued_at":"2026-07-05T02:36:36.545496Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:36.545496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Waypoint Planning Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Alexandru-Iosif Toma, Daniel Lenton, Hao-Ya Hsueh, Hussein Ali Jaafar, Ronald Clark, Sajad Saeedi, Stephen James","submitted_at":"2021-05-01T18:02:01Z","abstract_excerpt":"With the recent advances in machine learning, path planning algorithms are also evolving; however, the learned path planning algorithms often have difficulty competing with success rates of classic algorithms. We propose waypoint planning networks (WPN), a hybrid algorithm based on LSTMs with a local kernel - a classic algorithm such as A*, and a global kernel using a learned algorithm. WPN produces a more computationally efficient and robust solution. We compare WPN against A*, as well as related works including motion planning networks (MPNet) and value iteration networks (VIN). In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.00312","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.00312/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":"2105.00312","created_at":"2026-07-05T02:36:36.545561+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.00312v1","created_at":"2026-07-05T02:36:36.545561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.00312","created_at":"2026-07-05T02:36:36.545561+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOEWTYXCIWOL","created_at":"2026-07-05T02:36:36.545561+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOEWTYXCIWOLLL5X","created_at":"2026-07-05T02:36:36.545561+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOEWTYXC","created_at":"2026-07-05T02:36:36.545561+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS","json":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS.json","graph_json":"https://pith.science/api/pith-number/EOEWTYXCIWOLLL5XEPVGI46SXS/graph.json","events_json":"https://pith.science/api/pith-number/EOEWTYXCIWOLLL5XEPVGI46SXS/events.json","paper":"https://pith.science/paper/EOEWTYXC"},"agent_actions":{"view_html":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS","download_json":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS.json","view_paper":"https://pith.science/paper/EOEWTYXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.00312&json=true","fetch_graph":"https://pith.science/api/pith-number/EOEWTYXCIWOLLL5XEPVGI46SXS/graph.json","fetch_events":"https://pith.science/api/pith-number/EOEWTYXCIWOLLL5XEPVGI46SXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS/action/storage_attestation","attest_author":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS/action/author_attestation","sign_citation":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS/action/citation_signature","submit_replication":"https://pith.science/pith/EOEWTYXCIWOLLL5XEPVGI46SXS/action/replication_record"}},"created_at":"2026-07-05T02:36:36.545561+00:00","updated_at":"2026-07-05T02:36:36.545561+00:00"}