{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XB7B5ZSVLLRKE3KFU4K5HMIID3","short_pith_number":"pith:XB7B5ZSV","schema_version":"1.0","canonical_sha256":"b87e1ee6555ae2a26d45a715d3b1081ecc4c2788b05e2d908e962f42b5c3cebc","source":{"kind":"arxiv","id":"2606.07920","version":1},"attestation_state":"computed","paper":{"title":"Combining Reinforcement Learning with Arc-search Interior-Point Method for Path Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Isaac E. Weintraub, Qiang Le, Yaguang Yang","submitted_at":"2026-06-06T00:56:16Z","abstract_excerpt":"Path planning in environments containing obstacles has numerous practical applications. The problem is challenging because it is inherently nonlinear and nonconvex. Consequently, a variety of techniques have been developed to address this problem, among which machine learning and optimal control (or optimization) have emerged as two prominent approaches. In general, machine learning methods do not require a high-fidelity model, and a trained agent can often generate a feasible path in real time. However, the resulting path is not necessarily optimal with respect to performance objectives such "},"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":"2606.07920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-06T00:56:16Z","cross_cats_sorted":[],"title_canon_sha256":"3810ca7d4144ab483103b6cbe359dc42ae29ce1f0bc5fe93d828bc2eba097e8c","abstract_canon_sha256":"9d8da823110ec9032a863a9f5c80a2bf0e9ac10d0ae55c1140c393cef2aa80c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:55.435075Z","signature_b64":"/ISDl/ix1KI1N+Q4sK9jQrWoNRnHQy+j6zLls6ZjJRtxrUZco7dt0mR6ZZtTbkMQprU/3UeuwYyVoT07/75YCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b87e1ee6555ae2a26d45a715d3b1081ecc4c2788b05e2d908e962f42b5c3cebc","last_reissued_at":"2026-06-09T01:04:55.434686Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:55.434686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Reinforcement Learning with Arc-search Interior-Point Method for Path Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Isaac E. Weintraub, Qiang Le, Yaguang Yang","submitted_at":"2026-06-06T00:56:16Z","abstract_excerpt":"Path planning in environments containing obstacles has numerous practical applications. The problem is challenging because it is inherently nonlinear and nonconvex. Consequently, a variety of techniques have been developed to address this problem, among which machine learning and optimal control (or optimization) have emerged as two prominent approaches. In general, machine learning methods do not require a high-fidelity model, and a trained agent can often generate a feasible path in real time. However, the resulting path is not necessarily optimal with respect to performance objectives such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07920","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/2606.07920/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":"2606.07920","created_at":"2026-06-09T01:04:55.434752+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07920v1","created_at":"2026-06-09T01:04:55.434752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07920","created_at":"2026-06-09T01:04:55.434752+00:00"},{"alias_kind":"pith_short_12","alias_value":"XB7B5ZSVLLRK","created_at":"2026-06-09T01:04:55.434752+00:00"},{"alias_kind":"pith_short_16","alias_value":"XB7B5ZSVLLRKE3KF","created_at":"2026-06-09T01:04:55.434752+00:00"},{"alias_kind":"pith_short_8","alias_value":"XB7B5ZSV","created_at":"2026-06-09T01:04:55.434752+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/XB7B5ZSVLLRKE3KFU4K5HMIID3","json":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3.json","graph_json":"https://pith.science/api/pith-number/XB7B5ZSVLLRKE3KFU4K5HMIID3/graph.json","events_json":"https://pith.science/api/pith-number/XB7B5ZSVLLRKE3KFU4K5HMIID3/events.json","paper":"https://pith.science/paper/XB7B5ZSV"},"agent_actions":{"view_html":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3","download_json":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3.json","view_paper":"https://pith.science/paper/XB7B5ZSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07920&json=true","fetch_graph":"https://pith.science/api/pith-number/XB7B5ZSVLLRKE3KFU4K5HMIID3/graph.json","fetch_events":"https://pith.science/api/pith-number/XB7B5ZSVLLRKE3KFU4K5HMIID3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3/action/storage_attestation","attest_author":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3/action/author_attestation","sign_citation":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3/action/citation_signature","submit_replication":"https://pith.science/pith/XB7B5ZSVLLRKE3KFU4K5HMIID3/action/replication_record"}},"created_at":"2026-06-09T01:04:55.434752+00:00","updated_at":"2026-06-09T01:04:55.434752+00:00"}