{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HLUSRIK5K23PROP3JSFKQRQCFW","short_pith_number":"pith:HLUSRIK5","schema_version":"1.0","canonical_sha256":"3ae928a15d56b6f8b9fb4c8aa846022da807b7b44a7704c5f57a89e542b10b59","source":{"kind":"arxiv","id":"2401.09819","version":2},"attestation_state":"computed","paper":{"title":"PPNet: A Two-Stage Neural Network for End-to-end Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Bin Liang, Chongkun Xia, Qinglong Meng, Songping Mai, Xueqian Wang","submitted_at":"2024-01-18T09:20:27Z","abstract_excerpt":"The classical path planners, such as sampling-based path planners, can provide probabilistic completeness guarantees in the sense that the probability that the planner fails to return a solution if one exists, decays to zero as the number of samples approaches infinity. However, finding a near-optimal feasible solution in a given period is challenging in many applications such as the autonomous vehicle. To achieve an end-to-end near-optimal path planner, we first divide the path planning problem into two subproblems, which are path space segmentation and waypoints generation in the given path'"},"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":"2401.09819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-01-18T09:20:27Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"50f04e7521cb6732ef9b0778e4e979460c5db85d2e19f64c9ed55b5219b750c9","abstract_canon_sha256":"f323a12807132d0279fcee0bc5ae2b40959bc82d8eb539e078ff964bb1fa8444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:00.346850Z","signature_b64":"A5b7IEzQLKF8tA63ijLk6Tfxv5JTmzoQYUFduNXlc9OaADceRRDc+kSdJvZxcAia8IG+//EvBoV59ue/FhKkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae928a15d56b6f8b9fb4c8aa846022da807b7b44a7704c5f57a89e542b10b59","last_reissued_at":"2026-07-05T08:11:00.346289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:00.346289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PPNet: A Two-Stage Neural Network for End-to-end Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Bin Liang, Chongkun Xia, Qinglong Meng, Songping Mai, Xueqian Wang","submitted_at":"2024-01-18T09:20:27Z","abstract_excerpt":"The classical path planners, such as sampling-based path planners, can provide probabilistic completeness guarantees in the sense that the probability that the planner fails to return a solution if one exists, decays to zero as the number of samples approaches infinity. However, finding a near-optimal feasible solution in a given period is challenging in many applications such as the autonomous vehicle. To achieve an end-to-end near-optimal path planner, we first divide the path planning problem into two subproblems, which are path space segmentation and waypoints generation in the given path'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.09819/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":"2401.09819","created_at":"2026-07-05T08:11:00.346379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09819v2","created_at":"2026-07-05T08:11:00.346379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09819","created_at":"2026-07-05T08:11:00.346379+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLUSRIK5K23P","created_at":"2026-07-05T08:11:00.346379+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLUSRIK5K23PROP3","created_at":"2026-07-05T08:11:00.346379+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLUSRIK5","created_at":"2026-07-05T08:11:00.346379+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/HLUSRIK5K23PROP3JSFKQRQCFW","json":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW.json","graph_json":"https://pith.science/api/pith-number/HLUSRIK5K23PROP3JSFKQRQCFW/graph.json","events_json":"https://pith.science/api/pith-number/HLUSRIK5K23PROP3JSFKQRQCFW/events.json","paper":"https://pith.science/paper/HLUSRIK5"},"agent_actions":{"view_html":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW","download_json":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW.json","view_paper":"https://pith.science/paper/HLUSRIK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09819&json=true","fetch_graph":"https://pith.science/api/pith-number/HLUSRIK5K23PROP3JSFKQRQCFW/graph.json","fetch_events":"https://pith.science/api/pith-number/HLUSRIK5K23PROP3JSFKQRQCFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW/action/storage_attestation","attest_author":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW/action/author_attestation","sign_citation":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW/action/citation_signature","submit_replication":"https://pith.science/pith/HLUSRIK5K23PROP3JSFKQRQCFW/action/replication_record"}},"created_at":"2026-07-05T08:11:00.346379+00:00","updated_at":"2026-07-05T08:11:00.346379+00:00"}