{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LO3E3EU2L7WWNU72JS5DPZCPWS","short_pith_number":"pith:LO3E3EU2","schema_version":"1.0","canonical_sha256":"5bb64d929a5fed66d3fa4cba37e44fb48828e7d24ebf2a2214f24b62155bdac7","source":{"kind":"arxiv","id":"2603.19464","version":2},"attestation_state":"computed","paper":{"title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Md. Tasin Tazwar, Minghan Wei, Zhengbang Yang, Zhuangdi Zhu","submitted_at":"2026-03-19T20:55:46Z","abstract_excerpt":"Robotic path planning problems are often NP-hard, and practical solutions typically rely on approximation algorithms with provable performance guarantees for general cases. While designing such algorithms is challenging, formally proving their approximation optimality is even more demanding, which requires domain-specific geometric insights and multi-step mathematical reasoning over complex operational constraints. Recent Large Language Models (LLMs) have demonstrated strong performance on mathematical reasoning benchmarks, yet their ability to assist with research-level optimality proofs in r"},"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":"2603.19464","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-03-19T20:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"b1c5cd1eecdb5ad9d005792ceec95a0277214eec05f5c0428ffde3841c886b1f","abstract_canon_sha256":"772c442f5a574321a53834e8f267c2b2d36185d06a77bcea82d146ae21cf31b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T00:15:09.511333Z","signature_b64":"GYcuxaO7CNjF8+0P4//nYUy3gDJJhZTJAvbKA4bMI+spesp+rrTqTT4SHceKl0xnsvCWXQ8QaZnDkBbgZKxgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bb64d929a5fed66d3fa4cba37e44fb48828e7d24ebf2a2214f24b62155bdac7","last_reissued_at":"2026-06-30T00:15:09.510842Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T00:15:09.510842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Md. Tasin Tazwar, Minghan Wei, Zhengbang Yang, Zhuangdi Zhu","submitted_at":"2026-03-19T20:55:46Z","abstract_excerpt":"Robotic path planning problems are often NP-hard, and practical solutions typically rely on approximation algorithms with provable performance guarantees for general cases. While designing such algorithms is challenging, formally proving their approximation optimality is even more demanding, which requires domain-specific geometric insights and multi-step mathematical reasoning over complex operational constraints. Recent Large Language Models (LLMs) have demonstrated strong performance on mathematical reasoning benchmarks, yet their ability to assist with research-level optimality proofs in r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.19464","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/2603.19464/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":"2603.19464","created_at":"2026-06-30T00:15:09.510905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.19464v2","created_at":"2026-06-30T00:15:09.510905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19464","created_at":"2026-06-30T00:15:09.510905+00:00"},{"alias_kind":"pith_short_12","alias_value":"LO3E3EU2L7WW","created_at":"2026-06-30T00:15:09.510905+00:00"},{"alias_kind":"pith_short_16","alias_value":"LO3E3EU2L7WWNU72","created_at":"2026-06-30T00:15:09.510905+00:00"},{"alias_kind":"pith_short_8","alias_value":"LO3E3EU2","created_at":"2026-06-30T00:15:09.510905+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/LO3E3EU2L7WWNU72JS5DPZCPWS","json":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS.json","graph_json":"https://pith.science/api/pith-number/LO3E3EU2L7WWNU72JS5DPZCPWS/graph.json","events_json":"https://pith.science/api/pith-number/LO3E3EU2L7WWNU72JS5DPZCPWS/events.json","paper":"https://pith.science/paper/LO3E3EU2"},"agent_actions":{"view_html":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS","download_json":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS.json","view_paper":"https://pith.science/paper/LO3E3EU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.19464&json=true","fetch_graph":"https://pith.science/api/pith-number/LO3E3EU2L7WWNU72JS5DPZCPWS/graph.json","fetch_events":"https://pith.science/api/pith-number/LO3E3EU2L7WWNU72JS5DPZCPWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS/action/storage_attestation","attest_author":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS/action/author_attestation","sign_citation":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS/action/citation_signature","submit_replication":"https://pith.science/pith/LO3E3EU2L7WWNU72JS5DPZCPWS/action/replication_record"}},"created_at":"2026-06-30T00:15:09.510905+00:00","updated_at":"2026-06-30T00:15:09.510905+00:00"}