{"as_of":"2026-08-08T23:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ff8aa1cb4cd7bdb5eed0430a9f86847e58d03d47a08179de2a6d8f63d9e58ec","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T17:51:37.654940Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2603.19464/citation-record","integrity":"/paper/2603.19464/integrity","json":"/paper/2603.19464/citation-record.json","paper":"/paper/2603.19464"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.574055Z","title":"Solving the multi-objective path planning problem for mobile robot using an improved nsga-ii algorithm,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.574055Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:1bf7c221d9918d995cd136a53813d0804aee817a4af9fdfa99449306833762d5","observation_id":"f67fd3a7-66b4-4f71-bb18-bf869565994b","resolution":{"observed_at":"2026-08-02T17:51:37.574055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.577664Z","title":"Approximation algorithms for some vehicle routing problems,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.577664Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:52c7833a872aa6251773e7c7c4c29283eeec23aee1a12604ce8c42b2c1c98e95","observation_id":"c5101a21-b7e8-47d1-b678-7a049417ccbd","resolution":{"observed_at":"2026-08-02T17:51:37.577664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-02T17:51:37.580499Z","title":"Deepseekmath: Pushing the limits of mathematical reasoning in open language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.580499Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:1c1ce3172cf91497b1cf2d0012fbfdde880af050f9a7763b6e4d09a860a10abb","observation_id":"5fa3ee56-9385-4d45-a36b-4826b7559221","resolution":{"observed_at":"2026-08-02T17:51:37.580499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.583159Z","title":"Omni-MATH: A universal olympiad level mathematic benchmark for large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.583159Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:a4d39d5dd2bfb9be9640ada4a67dc33a2c778d01739cca1409576e444346f62a","observation_id":"6318e9e4-3f54-4b50-8c8c-e77d06e7b0d1","resolution":{"observed_at":"2026-08-02T17:51:37.583159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.585799Z","title":"OlympiadBench: A challenging benchmark for promoting AGI with olympiad-level bilingual multimodal scientific problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.585799Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:6b9dccdce45b82bf0733b0c7e3662286b4e202f1b87221d5484efd041212aa8b","observation_id":"43ae8c0e-4d6c-4689-a3e1-2e221fc79c9c","resolution":{"observed_at":"2026-08-02T17:51:37.585799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.588744Z","title":"Matharena: Evaluating LLMs on uncontaminated math competitions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.588744Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:732993dd9b1526bca83161cfe63bb79b089a48eb8337050aeff2e703f8e3d506","observation_id":"b3c18315-f82a-4cdb-af70-23deb3dcaf28","resolution":{"observed_at":"2026-08-02T17:51:37.588744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-02T17:51:37.591566Z","title":"Training verifiers to solve math word problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.591566Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:ec6ba466d2bad0260afae169e6ac55971f3158c049b5079ad95d1c4439157ed7","observation_id":"af06cdea-57ce-4376-b8aa-daf3d67ed0ce","resolution":{"observed_at":"2026-08-02T17:51:37.591566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.594212Z","title":"Measuring mathematical problem solving with the MATH dataset,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.594212Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:7bdd133a7ec3c0239356fca571a62062fc6836e3d87ad256a6b11aaf35d13f00","observation_id":"8931be80-85c3-4dd0-b458-2e505eb39421","resolution":{"observed_at":"2026-08-02T17:51:37.594212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.596653Z","title":"A log-approximation for coverage path planning with the energy constraint,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.596653Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:e078b53663b49dbbc3e01cf9a11b52cba58a529ce6280ba96bbdb561d4530e58","observation_id":"3b935bc3-3ec3-42f8-be9f-45ac6d885760","resolution":{"observed_at":"2026-08-02T17:51:37.596653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.599121Z","title":"An approximation algorithm for the pickup and delivery vehicle routing problem on trees,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.599121Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:c2fecb1155b506d289e192d9a7d2a8bdfe0916e6c4c4d4e6ffb0421dcebc3889","observation_id":"c90ea3b0-e20a-4e80-8d7d-6aa77aab6509","resolution":{"observed_at":"2026-08-02T17:51:37.599121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.601463Z","title":"Chain of thought prompting elicits reasoning in large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.601463Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:ccc944e73b3ab55b255ae082f24a319ef44e088f00ed5cb2ee2f5f76743814ba","observation_id":"cf4e74f3-9486-4579-9712-e92e30f718d2","resolution":{"observed_at":"2026-08-02T17:51:37.601463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.603889Z","title":"Can language models solve graph problems in natural language?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.603889Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:c2c392a5c418d193cf0e74a5520530f0ff51d2a60a39ed0bf17c3a2845e3117f","observation_id":"e50b31e7-3353-4dc9-ac36-15e2369d8e03","resolution":{"observed_at":"2026-08-02T17:51:37.603889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11477","last_updated":"2023-09-27T07:29:44Z","snapshot_observed_at":"2026-08-01T15:58:01.346044Z","submitted_at":"2023-04-22T20:34:03Z","title":"LLM+P: Empowering Large Language Models with Optimal Planning Proficiency","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11477","snapshot_observed_at":"2026-08-02T17:51:37.606256Z","title":"Llm+p: Empowering large language models with optimal planning proficiency,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.606256Z"},"links":{"cited_paper":"/paper/2304.11477","citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:f46a01216188bf009c48786710a163be33a59c3a70ac6a3bf0b4a2143f7c39dd","observation_id":"2d147dc5-03cb-48c2-9342-c4b137f1b262","resolution":{"observed_at":"2026-08-02T17:51:37.606256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.609114Z","title":"LLM-a*: Large language model enhanced incremental heuristic search on path planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.609114Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:8b34b0e3fa9441b1a7a3d5e5b20f69f2a99591df609a2d20c217b607214a5959","observation_id":"9bf6cb82-163e-48c5-b8ad-6c89f855861a","resolution":{"observed_at":"2026-08-02T17:51:37.609114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.611695Z","title":"Grapharena: Evaluating and exploring large language models on graph computation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.611695Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:f1ed9fe61c886e87e5e216bc0a2160b5a49c785975d2e7e15a9fac4d74315771","observation_id":"d473cbcf-fe15-4b13-a0cf-40cd2e7d6a71","resolution":{"observed_at":"2026-08-02T17:51:37.611695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.613940Z","title":"Travelplanner: a benchmark for real-world planning with language agents,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.613940Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:47bc2edd0e4ee5ab658521e597295f657b353fedba208c67e9f777d79853d9af","observation_id":"c290ed2e-dc36-453e-88ab-cbb9bb202513","resolution":{"observed_at":"2026-08-02T17:51:37.613940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.616253Z","title":"Personal travel solver: A preference-driven LLM-solver system for travel planning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.616253Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:38106b42c839258e920a81e647fcc4d945ba4ae2cc2817dbae0238d38a265134","observation_id":"52ada5c4-73bc-4068-848f-8fb896840466","resolution":{"observed_at":"2026-08-02T17:51:37.616253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.618563Z","title":"Let’s verify step by step,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.618563Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:1f2476cd47b234d23aea2cb5f4a86ea91514adcf460059ff316df52e9fba76cf","observation_id":"107f91f6-927f-4938-9e74-9f19365582f0","resolution":{"observed_at":"2026-08-02T17:51:37.618563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.620901Z","title":"ARB: Advanced reasoning benchmark for large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.620901Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:13e4105ceff22ccfae2b1793f7faa2d71e22a39899a12cb74730b0befc03cbe3","observation_id":"0e48372a-16bf-43db-b648-05213c061f2b","resolution":{"observed_at":"2026-08-02T17:51:37.620901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04872","last_updated":"2025-12-23T02:23:47Z","snapshot_observed_at":"2026-08-04T15:54:46.196160Z","submitted_at":"2024-11-07T17:07:35Z","title":"FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04872","snapshot_observed_at":"2026-08-02T17:51:37.623160Z","title":"Frontiermath: A benchmark for evaluating advanced mathematical reasoning in ai,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.623160Z"},"links":{"cited_paper":"/paper/2411.04872","citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:5a4048eda038029825d0454de6a9ac4c0f7fc6448102bb9d32da70ace998d9d7","observation_id":"2922276d-b6af-4b89-bb8e-79ac2994d2b0","resolution":{"observed_at":"2026-08-02T17:51:37.623160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.625792Z","title":"Gold-medalist performance in solving olympiad geometry with alphageometry2,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.625792Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:552dd946b6da5ea6e8472e6ceeaa4faca76acdf95620f74c35eaafa7dacc063b","observation_id":"06543c3d-d94b-4ccc-8d5b-4130831084b4","resolution":{"observed_at":"2026-08-02T17:51:37.625792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.628347Z","title":"Solving inequality proofs with large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.628347Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:6e0400b29abca0cbf707e12f136767a51774b99446176d1292ec58471657df93","observation_id":"7da2dfe2-9f43-410f-bb00-bc7b41f9554e","resolution":{"observed_at":"2026-08-02T17:51:37.628347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.630788Z","title":"The open proof corpus: A large-scale study of LLM-generated mathematical proofs,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.630788Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:a9e29072891882578dcc4b68168e4f016fae758e91e436d94233ae5639fa0034","observation_id":"8a8ee4b4-484f-4b9e-8dea-b4e030ad2a54","resolution":{"observed_at":"2026-08-02T17:51:37.630788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.633360Z","title":"Judging llm-as-a-judge with mt-bench and chatbot arena,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.633360Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:e1f75847bd4db76a7a225aa58bea62c4291953ed5c0dc76eed819111037c11a0","observation_id":"0cb8e05a-0623-4b13-b13f-9a3bed864446","resolution":{"observed_at":"2026-08-02T17:51:37.633360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.635691Z","title":"A survey on llm-as-a-judge,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.635691Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:d2c37f6853592743335ed3c4c5e160a7714c735e17076cd603cb7568f9e89d63","observation_id":"989e30cc-f4a0-429e-ab59-d90ee6c4b1fa","resolution":{"observed_at":"2026-08-02T17:51:37.635691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11111","last_updated":"2024-07-21T11:11:49Z","snapshot_observed_at":"2026-07-06T17:31:29.199601Z","submitted_at":"2024-02-16T22:24:13Z","title":"Language Models as Science Tutors","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11111","snapshot_observed_at":"2026-08-02T17:51:37.638006Z","title":"Language models as science tutors,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.638006Z"},"links":{"cited_paper":"/paper/2402.11111","citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:6d363a367259668b87adab02af249df6c4750480018d6c5236355b31f6b0bce5","observation_id":"82fc1b1e-6b08-42b5-863c-0c15106c43ce","resolution":{"observed_at":"2026-08-02T17:51:37.638006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.640594Z","title":"Autograding mathematical induc- tion proofs with natural language processing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.640594Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:4a9ec4a2b837bf5c984d348fe4114fd0c04dbd407cdcf7d8902fcec1a1ef0c38","observation_id":"c6ecebfa-f01b-40dd-b81d-7ded37d73f80","resolution":{"observed_at":"2026-08-02T17:51:37.640594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.642971Z","title":"Language models are few-shot graders,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.642971Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:66c622cac858c4b860733b187b49c9ad6f541af67e138915672ce5ceca550b1a","observation_id":"a7f2ef38-618c-4c01-b9ab-608f83feac79","resolution":{"observed_at":"2026-08-02T17:51:37.642971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.645179Z","title":"Approximation algorithms for distance constrained vehicle routing problems,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.645179Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:6889f84f6f758cd3e1af3e44d0d33390cd8d6d1f9a9027c4adbf32b0817f8855","observation_id":"6cec8363-00fb-4dc8-8549-104a58eff354","resolution":{"observed_at":"2026-08-02T17:51:37.645179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.647936Z","title":"A new approximation algorithm for the capacitated vehicle routing problem on a tree,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.647936Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:d8bc894fb5f90121e6f7f519aed3c954ca10ed76476b8ca977f17a040a098b29","observation_id":"26c3aba6-6cc5-4103-ae72-fcb0d02bac3f","resolution":{"observed_at":"2026-08-02T17:51:37.647936Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.650280Z","title":"Approximation algorithms for some routing problems,","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.650280Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:784d4ad32dd1bd622e1bd5751b83759a08622ff0ede485a62622822b759dc17f","observation_id":"25c04e1b-c571-4ae4-84ed-cfc77c32cfad","resolution":{"observed_at":"2026-08-02T17:51:37.650280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.652617Z","title":"Approximation algorithms for tours of height-varying view cones,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.652617Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:42a5e4fd5f6e23b6af456983683cf0a24afc45ddf38bd52363caa19ac84e5f7b","observation_id":"c420ef5a-10ab-4f1e-a186-c757e7af10a8","resolution":{"observed_at":"2026-08-02T17:51:37.652617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:51:37.654940Z","title":"Coverage path planning under the energy constraint,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T17:51:37.654940Z"},"links":{"citing_paper":"/paper/2603.19464"},"observation_digest":"sha256:ef4a7de55729a3160255f4022ef29c23a19786d2c60398e049ea81c5f30e772b","observation_id":"f1975f7f-39cb-4491-9dcf-53b048f68f94","resolution":{"observed_at":"2026-08-02T17:51:37.654940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.19464","last_updated":"2026-07-17T01:47:32Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-02T17:51:37.256993Z","submitted_at":"2026-03-19T20:55:46Z","title":"Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":33},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2603.19464."}