{"as_of":"2026-08-14T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f4a33632c02761495a6d3bcc112662efb19b788ddd7d4035b649d546cd9cd3b","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:22:28.574618Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2608.09277/citation-record","integrity":"/paper/2608.09277/integrity","json":"/paper/2608.09277/citation-record.json","paper":"/paper/2608.09277"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:28.298732Z","title":"Large language model-based agents for software engineering: A survey.ACM Transactions on Software Engineering and Methodology, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.298732Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:7c066b4a13c99bdf88d831bb3860cb26d731803b37737a8d434b18a025f90fe1","observation_id":"d64ea52c-512a-4363-bd0d-76dea1af2770","resolution":{"observed_at":"2026-08-11T20:22:28.298732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.00083","last_updated":"2025-09-30T03:34:50Z","snapshot_observed_at":"2026-07-06T22:05:57.485783Z","submitted_at":"2025-07-31T18:17:36Z","title":"A Survey on Code Generation with LLM-based Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.00083","snapshot_observed_at":"2026-08-11T20:22:28.303465Z","title":"A survey on code generation with llm-based agents.arXiv preprint arXiv:2508.00083, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.303465Z"},"links":{"cited_paper":"/paper/2508.00083","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:56d6a5f30fe9e930b283385c1d8daa2fea9810a9986c1b367a7d3bb7def2d3b1","observation_id":"8a9da94f-bd12-4c93-b5ba-3403cf5ea54b","resolution":{"observed_at":"2026-08-11T20:22:28.303465Z","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-11T20:22:28.308517Z","title":"A survey on large language models for code generation.ACM Transactions on Software Engineering and Methodology, 35 (2):1–72, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.308517Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:589d310d7eab2cb7636a6ef5cf40e18bd744c11c248d332a0f3aa9f91bba221e","observation_id":"0b0bd5cc-da8a-49ba-b27f-0dcc96f394a6","resolution":{"observed_at":"2026-08-11T20:22:28.308517Z","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-11T20:22:28.314670Z","title":"The lean 4 theorem prover and programming language","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.314670Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:ca9c3ed1233c7f0aa11df92cddc646209f2ae02288bf43f080753e53e6c7416d","observation_id":"de93cffb-e21e-4268-974b-43d140dd66b8","resolution":{"observed_at":"2026-08-11T20:22:28.314670Z","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-11T20:22:28.319415Z","title":"Growing mathlib: maintenance of a large scale mathematical library","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.319415Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:b46632288e3f86717b157fb55ac41b6f68403b3691e7522e8f53155ec72d150b","observation_id":"4569aa35-964f-421e-8657-591c5f8060f8","resolution":{"observed_at":"2026-08-11T20:22:28.319415Z","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-11T20:22:28.323616Z","title":"Cslib: The lean computer science library.arXiv preprint arXiv:2602.04846, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.323616Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:50ed0b023d541ae70a309e80824b230afe3b5be2e0926b014f6188b3c5d9b006","observation_id":"e5423e5d-5f49-46df-bc39-0b0c88742e39","resolution":{"observed_at":"2026-08-11T20:22:28.323616Z","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-11T20:22:28.328965Z","title":"Verina: Benchmarking verifiable code generation.arXiv preprint arXiv:2505.23135, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.328965Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:2d7343c1729b2f1a3f929fc1de8eafee292c322b1d15936cdba7081bc38b4056","observation_id":"1876f662-849e-49e5-9b8d-b62911b61c32","resolution":{"observed_at":"2026-08-11T20:22:28.328965Z","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-11T20:22:28.333263Z","title":"Proving the coding interview: A benchmark for formally verified code generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.333263Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:d4bfb48c8dc3ab559e6adee9c612c515db0cad5c526506087233fa58b72c6f74","observation_id":"9f6412b0-24b1-42ca-ad92-aa858c3313f9","resolution":{"observed_at":"2026-08-11T20:22:28.333263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.29088","last_updated":"2026-04-14T22:21:17Z","snapshot_observed_at":"2026-08-12T20:30:08.667076Z","submitted_at":"2026-03-31T00:06:44Z","title":"WybeCoder: Verified Imperative Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.29088","snapshot_observed_at":"2026-08-11T20:22:28.338085Z","title":"Holden, Gabriel Synnaeve, and Peter O’Hearn","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.338085Z"},"links":{"cited_paper":"/paper/2603.29088","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:c15d522ab9129eff4ab3bf30e224d40e4213a6c1b544452fba488cc2ea4c2c8f","observation_id":"1652f593-b625-45a0-9d38-aa920ce437ae","resolution":{"observed_at":"2026-08-11T20:22:28.338085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.19329","last_updated":"2026-08-10T08:34:04Z","snapshot_observed_at":"2026-08-13T23:38:09.444000Z","submitted_at":"2026-03-18T18:42:04Z","title":"Goedel-Code-Prover: Hierarchical Proof Search for Open State-of-the-Art Code Verification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.19329","snapshot_observed_at":"2026-08-11T20:22:28.348778Z","title":"Goedel-code-prover: Hierarchical proof search for open state-of-the-art code verification.arXiv preprint arXiv:2603.19329, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.348778Z"},"links":{"cited_paper":"/paper/2603.19329","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:33da1003fe5d52a694e1d88ba6f77fd5622d50e20dc05d6083f684cc9f4c34b0","observation_id":"1691d8fc-4cb8-40e0-9ea8-0e73340283d3","resolution":{"observed_at":"2026-08-11T20:22:28.348778Z","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-11T20:22:28.356335Z","title":"Autoverus: Automated proof generation for rust code.Proceedings of the ACM on Programming Languages, 9(OOPSLA2): 3454–3482, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.356335Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:4f7177273e036b82ce05a8ee17cf2bd2c6a1f2c21a4767d733a30ce23d14ae9b","observation_id":"e2760132-3570-4008-b5b4-3bd766e5a489","resolution":{"observed_at":"2026-08-11T20:22:28.356335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.18436","last_updated":"2026-04-15T16:44:49Z","snapshot_observed_at":"2026-08-11T19:04:57.128806Z","submitted_at":"2025-12-20T17:22:52Z","title":"VeruSAGE: A Study of Agent-Based Verification for Rust Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.18436","snapshot_observed_at":"2026-08-11T20:22:28.361239Z","title":"Verusage: A study of agent-based verification for rust systems.arXiv preprint arXiv:2512.18436, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.361239Z"},"links":{"cited_paper":"/paper/2512.18436","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:a75970475498c7e6670b2e8b6d87dfc237b4c11c145942e093e90fef6f53f185","observation_id":"3370a5cc-b72f-4e5f-9680-98cb6003083e","resolution":{"observed_at":"2026-08-11T20:22:28.361239Z","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-11T20:22:28.365743Z","title":"Exverus: Verus proof repair via counterexample reasoning.arXiv preprint arXiv:2603.25810, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.365743Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:bb448d56af199aa718227daa8160c66b3a900ae0212899da488215a3d4cedc81","observation_id":"56efd3d9-a2dc-48b8-81a3-734fa844bf66","resolution":{"observed_at":"2026-08-11T20:22:28.365743Z","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-11T20:22:28.372028Z","title":"Dijkstra.A Discipline of Programming","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.372028Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:16da9bcd23d6b130aa0bc4bad85eeec798c2a6062116161d4f5a6446fdcb86fc","observation_id":"863d5191-5e5d-4156-bf1a-1ae35947e443","resolution":{"observed_at":"2026-08-11T20:22:28.372028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.09464","last_updated":"2026-06-03T00:07:52Z","snapshot_observed_at":"2026-08-03T02:57:45.754840Z","submitted_at":"2026-02-10T06:58:26Z","title":"AlgoVeri: An Aligned Benchmark for Verified Code Generation on Classical Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.09464","snapshot_observed_at":"2026-08-11T20:22:28.377810Z","title":"Algoveri: An aligned benchmark for verified code generation on classical algorithms.arXiv preprint arXiv:2602.09464, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.377810Z"},"links":{"cited_paper":"/paper/2602.09464","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:9f588a9387d544cb55c93afca3287361a330aad10923f16a4d3b28906a8d2090","observation_id":"74c6f477-bbeb-4501-abc7-b5562accd79c","resolution":{"observed_at":"2026-08-11T20:22:28.377810Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.814801Z","title":"Dafny: An automatic program verifier for functional correctness","venue":null,"work_id":"cc888da9-1d97-41da-9c9f-58e0903e74a0","year":2010},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.382518Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:334d1a74908c2816e7cc3a25c89a11f5d1d3a8f2c8ef7f178a6a0b259dbc6547","observation_id":"a26aa349-3d87-41d1-9f24-7975406ce977","resolution":{"observed_at":"2026-08-11T20:22:29.822514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.791540Z","title":"Dependent types and multi-monadic effects in F ⋆","venue":null,"work_id":"8ad6f71d-3d4a-4b1e-ae04-13204b0e51c3","year":2016},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.389484Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:f1401ff3e0c4c1ecb2971cafb4edb90580d6d5e0d382366618fa8b9e38f5aafd","observation_id":"d91a3fc3-b416-472c-a8e6-b4e20179a220","resolution":{"observed_at":"2026-08-11T20:22:29.796507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:28.394590Z","title":"Verus: Verifying rust programs using linear ghost types.Proceedings of the ACM on Programming Languages, 7(OOPSLA1):286–315, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.394590Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:354de7db02789c46f8812c930634cf1be36bdf6f7ae9b3e7f20e6df2f3a5014f","observation_id":"74d4232f-9eee-47a5-8e29-af3dbc70cccb","resolution":{"observed_at":"2026-08-11T20:22:28.394590Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.767105Z","title":"Springer, 2004","venue":null,"work_id":"a4f10545-1bf0-4324-8721-06c682b38a27","year":2004},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.399749Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:331d25a08da3b68b8cb3c2a2ae3d42b268bcaab07391453ae9090bb396572ce9","observation_id":"8a9ee66e-92fe-440a-81fd-667e7b084751","resolution":{"observed_at":"2026-08-11T20:22:29.772180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.753718Z","title":"Paulson, and Markus Wenzel.Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 ofLecture Notes in Computer Science","venue":null,"work_id":"a445798d-4acd-4d25-8a64-d2853ff2d578","year":2002},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.406841Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:2f4fea1bef3b834af9bbfb21b6148f950afb12db9f48e7cadcf5923bbac193e9","observation_id":"9da88daa-00be-4748-9b84-ddccd7dd0b2b","resolution":{"observed_at":"2026-08-11T20:22:29.758677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.737544Z","title":"Clever: A curated benchmark for formally verified code generation","venue":null,"work_id":"fd5b3143-5a34-4263-9ed1-33a8a0447996","year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.412145Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:730472d1c1a2e8214bfb1ad687520d05c6e8bcd5afb1b16dab6e3163faf5034a","observation_id":"4acd2c2a-ac15-44a0-8f6a-c67fef409af1","resolution":{"observed_at":"2026-08-11T20:22:29.743450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01769","last_updated":"2024-12-02T18:11:30Z","snapshot_observed_at":"2026-08-12T07:42:20.815940Z","submitted_at":"2024-12-02T18:11:30Z","title":"Commit0: Library Generation from Scratch","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01769","snapshot_observed_at":"2026-08-11T20:22:28.417400Z","title":"Commit0: Library generation from scratch.arXiv preprint arXiv:2412.01769, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.417400Z"},"links":{"cited_paper":"/paper/2412.01769","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:b30e4d97d190b5cd70b454356608e1fb91fc78eeffd85e9f5f116a66413c7c8e","observation_id":"43cdd4e1-a553-4764-8a1a-4f72d4b57fbb","resolution":{"observed_at":"2026-08-11T20:22:28.417400Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.715313Z","title":"On the interplay between consistency, completeness, and correctness in requirements evolution.Information and Software technology, 45(14):993–1009, 2003","venue":null,"work_id":"0604823f-2948-46c3-ade0-e9f0718e5746","year":2003},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.421821Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:e54e4a8f2f391d3028a2866990db15ef73b9acce644ab5e4ed27a2bd9dde9423","observation_id":"5e5427b1-d5d0-4980-b4ca-d6c50e4389b4","resolution":{"observed_at":"2026-08-11T20:22:29.724023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.695739Z","title":"Empirical research on requirements quality: a systematic mapping study.Requirements Engineering, 27 (2):183–209, 2022","venue":null,"work_id":"7950d46a-7e1b-423c-adae-b8839eefe607","year":2022},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.426003Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:9d7cfddc8efced4c49698c1c41d158c134cf606f9b8f6362b9c969af0b933d4f","observation_id":"6e4fd83b-65f2-4b6d-b26b-0d563a622842","resolution":{"observed_at":"2026-08-11T20:22:29.701101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.19514","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:28.969355Z","title":"Learning to disprove: For- mal counterexample generation with large language models.arXiv preprint arXiv:2603.19514, 2026","venue":null,"work_id":"a543473b-a90c-49c9-a61d-2df80cb2c72c","year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.431274Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:513a0f68f36200652a4c4d5d6bcb793f3f5c50b7ed4d5c4791ee3aed499c0231","observation_id":"3bd59508-e842-43db-a2fa-ec66ef567b61","resolution":{"observed_at":"2026-08-11T20:22:28.976515Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.681260Z","title":"Lean LSP MCP: Tools for agentic interaction with the Lean theorem prover, 3","venue":null,"work_id":"371b37ae-1e52-43cf-9235-a9e1510411be","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.436192Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:acb642f6a7a5949f8a54001a65cee7e5070d9d1073bcb22799a5dbec33c83465","observation_id":"def2d0a3-8ea1-4aea-8ca1-98486ef981da","resolution":{"observed_at":"2026-08-11T20:22:29.685894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.653393Z","title":"Lean 4 Skills: Theorem proving skill and workflow pack for AI coding agents, October 2025","venue":null,"work_id":"7f802425-84e4-4585-a639-061fdcaddecd","year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.445790Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:93cd943dfe98f440fa111778424dfc88222532ba448491398efd25034b35813a","observation_id":"89e87bf6-0dc4-4dd8-9549-0730e5f1b140","resolution":{"observed_at":"2026-08-11T20:22:29.657584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.638134Z","title":null,"venue":null,"work_id":"6f6ab1c2-f9a6-4eec-ac7d-ae4b345d30e6","year":1997},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.450046Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:d3a327cbec260fec348ba8c0b31a86be0a7fc87a83720b5a0a0baf05bb3c7cf1","observation_id":"a5b044a9-fe06-4af1-ad70-f568812f36bb","resolution":{"observed_at":"2026-08-11T20:22:29.644417Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.16331","last_updated":"2026-07-03T09:17:03Z","snapshot_observed_at":"2026-08-07T04:15:41.914807Z","submitted_at":"2025-07-22T08:13:01Z","title":"Re:Form -- Reducing Human Annotations in Scalable Formal Software Verification with RL in LLMs: A Preliminary Study on Dafny","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.16331","snapshot_observed_at":"2026-08-11T20:22:28.454252Z","title":"Re:Form – reducing human priors in scalable formal software verification with RL in LLMs: A preliminary study on Dafny.arXiv preprint arXiv:2507.16331, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.454252Z"},"links":{"cited_paper":"/paper/2507.16331","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:8520972f602369a2cc4e310b0913db7b5d94f02dde3aad10494a150a1d2069dd","observation_id":"13b6ca6f-fa2e-4a1f-9bfb-d1d9a0edbed6","resolution":{"observed_at":"2026-08-11T20:22:28.454252Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.625202Z","title":"Rabe, Talia Ringer, and Yuriy Brun","venue":null,"work_id":"46e76ba7-ebcb-4e4d-ad79-d6fa799d295b","year":2023},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.459048Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:9803ce197b4009a5a3b553c1a2b3bee7d59c6e5f6d1ebb76753e87ed3dcb7d54","observation_id":"356692d9-8567-454e-98aa-7409741f255b","resolution":{"observed_at":"2026-08-11T20:22:29.629521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.610322Z","title":"An in-context learning agent for formal theorem-proving","venue":null,"work_id":"185cb14f-bd7f-41e8-859a-8721f6705915","year":2024},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.463872Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:7950599ef5b580f014560d18fbcaa63e21fdb4d1bff60be65aed1756c84ab6b8","observation_id":"d4021dba-38fd-4fab-8819-8426bb20d7bc","resolution":{"observed_at":"2026-08-11T20:22:29.614680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.17981","last_updated":"2026-07-24T00:53:17Z","snapshot_observed_at":"2026-08-06T16:15:03.966399Z","submitted_at":"2026-06-16T14:33:15Z","title":"Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs","version":2},"cited_work":{"arxiv_id":"2606.17981","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.17981","snapshot_observed_at":"2026-08-11T20:22:28.860663Z","title":"Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs","venue":"cs.SE","work_id":"836cffff-d710-47c7-aa43-c795f8a9f0cf","year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.468009Z"},"links":{"cited_paper":"/paper/2606.17981","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:bf0e6de80356375af86f2c5470fb1dca701b02c91daec158e159737a5b3a071f","observation_id":"1e56213c-afef-40af-b15b-38978d37f70a","resolution":{"observed_at":"2026-08-11T20:22:28.867863Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.596868Z","title":"Neuro-symbolic proof generation for scaling systems software verification","venue":null,"work_id":"af1f0a20-e8dc-4f7a-896a-b54bd055b607","year":2026},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.473103Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:4a56e26c23ad21c4854c4445cdf9dd9d49afccd9bb85b3109d9b72d44f302d23","observation_id":"d5e9c17f-8ae8-4bae-806f-66d1ada380a6","resolution":{"observed_at":"2026-08-11T20:22:29.600702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.582060Z","title":"Jiang, Jia Deng, Stella Biderman, and Sean Welleck","venue":null,"work_id":"b961bb23-a06d-4849-b8c9-1492b32e9b97","year":2024},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.481031Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:e6a45915eeda1df86f76d9b3d7504390dfe3ae3424f9d29866882663ed7552b7","observation_id":"839ff797-107b-4eaa-ae2c-4541e08566b5","resolution":{"observed_at":"2026-08-11T20:22:29.587111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14333","last_updated":"2024-05-23T09:03:42Z","snapshot_observed_at":"2026-08-13T00:00:48.229211Z","submitted_at":"2024-05-23T09:03:42Z","title":"DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14333","snapshot_observed_at":"2026-08-11T20:22:28.485328Z","title":"DeepSeek-Prover: Advancing theorem proving in LLMs through large-scale synthetic data.arXiv preprint arXiv:2405.14333, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.485328Z"},"links":{"cited_paper":"/paper/2405.14333","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:25f95bd9395f28f72532e35ef390a608ca4b599c5e23facb51b292d7dbfe5b05","observation_id":"448b34f7-19e3-49da-996e-cbf9d03ba1c4","resolution":{"observed_at":"2026-08-11T20:22:28.485328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21801","last_updated":"2025-07-18T08:20:23Z","snapshot_observed_at":"2026-08-02T11:46:58.603316Z","submitted_at":"2025-04-30T16:57:48Z","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21801","snapshot_observed_at":"2026-08-11T20:22:28.489952Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.489952Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:30c05e42cd37cd0eb5b49e5e776b07b9614b2414a666e39fc6ed42c9ad5604ac","observation_id":"3f4bc104-173a-436b-9299-9826afb2723a","resolution":{"observed_at":"2026-08-11T20:22:28.489952Z","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-11T20:22:28.494510Z","title":"Horváth, Goran Žuži´c, Erin Wieser, Anian Huang, Julian Schrittwieser, et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.494510Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:25f0aaf01318ac977c7938172c8f5e09021b445a2ecd2a9d7300d8cfa01faae3","observation_id":"2e207cd3-0cab-4799-a145-34b566f5b4f9","resolution":{"observed_at":"2026-08-11T20:22:28.494510Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.566367Z","title":null,"venue":null,"work_id":"39873f36-cb5e-4f54-9e55-a1de0dce14cf","year":1967},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.498585Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:c403a26ffb8d452d5157a64100b37ec74b483ba80fa0c2b5e10d558fda7d803f","observation_id":"89b18ca7-c59b-4b3a-983f-be68d6fefb23","resolution":{"observed_at":"2026-08-11T20:22:29.570569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:28.502757Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.502757Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:42c94854237af4ce70906c1c52b0558ec63b6422794746af84f754578f7e9fb1","observation_id":"edd0c166-ed38-4407-acaf-ab403074908e","resolution":{"observed_at":"2026-08-11T20:22:28.502757Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.536570Z","title":"Texts and Monographs in Computer Science","venue":null,"work_id":"571bfa39-36d9-4ee1-8e4e-671a7b0aff69","year":1981},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.507391Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:1f9507cb0f4233b1def39ab6848251e29e8efd044dbc4a0cd6e76e50f834638b","observation_id":"f44ed49f-cc3d-45d0-99c8-7829a04b4d35","resolution":{"observed_at":"2026-08-11T20:22:29.541870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.520249Z","title":"Program synthesis from polymor- phic refinement types","venue":null,"work_id":"36c62032-1b5e-45b2-8157-21725e25847d","year":2016},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.511577Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:c9e0d65e708b6403bf9b913c2c61c877c4cbc1a4d424b17b18e615a1d6c5b9b1","observation_id":"f9894dab-dd33-4f5c-b147-f61abf4bd087","resolution":{"observed_at":"2026-08-11T20:22:29.524740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.505299Z","title":"Self-planning code generation with large language models.ACM Transactions on Software Engineering and Methodology, 2024","venue":null,"work_id":"8203a3ce-ee7a-482d-9773-a09f5fece399","year":2024},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.516256Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:7e5e0920364cf90a96771a9a15b3cae9ecea6c07dd4302bb145a576acc36da62","observation_id":"782fb905-7b51-4b7c-b394-f630617688fb","resolution":{"observed_at":"2026-08-11T20:22:29.510453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.484753Z","title":"Plan-and-solve prompting: Improving zero-shot chain-of-thought reasoning by large language models","venue":null,"work_id":"357d910e-f523-4ec1-9be6-b7f4b7d11fa0","year":2023},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.520761Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:748afb1f9aadc7e786aa034b750ef1396d6a6454852ccab4b191798367407444","observation_id":"e47ca8c1-5b83-4dbd-820a-06bfd0b5faaa","resolution":{"observed_at":"2026-08-11T20:22:29.491735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:28.524417Z","title":"A benchmark for vericoding: Formally verified program synthesis.arXiv preprint arXiv:2509.22908, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.524417Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:01ab96dfeb5b97cc4327e918a0da18c404276a12b2a7704bbee3867df8730991","observation_id":"e4d57e42-eaaa-4354-8ac5-6142b6d60b80","resolution":{"observed_at":"2026-08-11T20:22:28.524417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08467","last_updated":"2024-06-12T17:53:31Z","snapshot_observed_at":"2026-08-12T23:44:17.226600Z","submitted_at":"2024-06-12T17:53:31Z","title":"DafnyBench: A Benchmark for Formal Software Verification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.08467","snapshot_observed_at":"2026-08-11T20:22:28.527645Z","title":"DafnyBench: A benchmark for formal software verification.arXiv preprint arXiv:2406.08467, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.527645Z"},"links":{"cited_paper":"/paper/2406.08467","citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:db50f2a6b7cbf8e4560bd690b620d3b9ced47f4f7e75690904b3a7b2fca4ead3","observation_id":"6e72f3b5-41eb-4095-be92-200b2a3c5eb2","resolution":{"observed_at":"2026-08-11T20:22:28.527645Z","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-11T20:22:28.531845Z","title":"Z3: An efficient smt solver","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.531845Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:04a428a7156fbc77d11a2df78da9f1e9f38e53c6a21dceaf29ac75939a28a9d8","observation_id":"e9ea9683-667b-4132-b9e6-3f04f8faf9b6","resolution":{"observed_at":"2026-08-11T20:22:28.531845Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.462897Z","title":"cvc5: A versatile and industrial-strength smt solver","venue":null,"work_id":"1bafb2e6-32e9-4a01-8735-00390867ccf9","year":2022},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.537916Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:64e9fd68971c0b5c860879be3aea3ceb5deb7aa6232e389af58888b686333151","observation_id":"8a4715ca-644a-4124-b28f-e1d98a8c980a","resolution":{"observed_at":"2026-08-11T20:22:29.467254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.449780Z","title":"- Exit: every sorry enumerated; instruction source located or confirmed absent","venue":null,"work_id":"ba5ec108-2230-4bdb-adc3-85454231922f","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.542742Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:17de8437bb762b26eb832d8dd309d63ccb1a0b9a3c237d6383e90e0d8ea8ee52","observation_id":"18811e00-1316-49e5-aca1-2bf047184300","resolution":{"observed_at":"2026-08-11T20:22:29.453917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.436734Z","title":"- Exit: plan file exists on disk; all required sections present; any locked-algorithm instruction is restated verbatim under `## Restated contract`","venue":null,"work_id":"f6956ba9-9163-41e8-8526-6c22532e3bc8","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.546482Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:380b4d6d8d2334a5dbc991b6b5d3e48b2dfc3db8d625d2b67a6a7a964cd4ea2f","observation_id":"3ac0c8c0-aaee-4997-a000-9942bdc7c741","resolution":{"observed_at":"2026-08-11T20:22:29.441339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.419569Z","title":"- Exit: verdict is PASS-PLAN","venue":null,"work_id":"ab542419-a50e-439f-aa7c-a1d27d06027b","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.550483Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:724116dc3caed8b741608bbfcc5c349694494d1e7317c5d80f40dbf6e42a9250","observation_id":"028df8e3-b7de-4f57-8ff1-19023589bf0e","resolution":{"observed_at":"2026-08-11T20:22:29.425917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.402583Z","title":"`decreasing_by sorry`may stay (or be omitted if Lean auto-derives)","venue":null,"work_id":"5daca23d-456e-4874-87eb-ad205c4049e9","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.555894Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:f84e9ea32bfb330a344db1695c42c6e632e7a8a38dce1708855071880b4d1a7b","observation_id":"7e9368d1-a285-47a4-b806-ebe61b528e12","resolution":{"observed_at":"2026-08-11T20:22:29.409340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.385983Z","title":"- Exit: no errors and no in-scope sorries","venue":null,"work_id":"f1524465-bad0-484f-a5ee-2193f27702f3","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.560540Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:c76c337cec18daceba7ab76ab243b08056567f64c710164c580e09aa383bcc5e","observation_id":"5ec7e4c5-f1d3-4988-9356-a93734ed06b3","resolution":{"observed_at":"2026-08-11T20:22:29.391100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.371114Z","title":"- Exit:`lean-verifier-mechanical`returns PASS-MECHANICAL and `lean-verifier-instruction`returns PASS-INSTRUCTION; act on each verdict's Action: line otherwise","venue":null,"work_id":"d2c94fe6-8a04-4e03-b659-f3bdb05b364f","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.566159Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:29af9cb75b1192d9b156d9b070f55818ceab98049f2423c69a2e5e77ea712959","observation_id":"3de03fb8-f177-4a63-9df2-60d517eb7c53","resolution":{"observed_at":"2026-08-11T20:22:29.375393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.358028Z","title":"Runs sorry scan, compile check, axiom check","venue":null,"work_id":"81452e6d-694d-4082-82f9-78a5636b2874","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.570237Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:3ed2ee87c167e0de598eab0971e8565ea069bbfa304ebdb4514fb3424a53911d","observation_id":"dc2a31aa-f3e2-4cf7-bbc5-1612b41a17ee","resolution":{"observed_at":"2026-08-11T20:22:29.362135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.343718Z","title":"Reads the @start code","venue":null,"work_id":"8554c0cc-60d6-471c-9753-6f26933af95c","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.574618Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:ada5744a1d5e23d86fd681a4a54582d6662f06880bed392258477eab253a5872","observation_id":"8b57c6a9-c26b-441e-a4e0-0bd4a9da288a","resolution":{"observed_at":"2026-08-11T20:22:29.348606Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:22:29.667089Z","title":null,"venue":null,"work_id":"5c0dc87d-f095-42a0-8891-543f1eab238d","year":null},"citing_paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-11T20:22:28.440831Z"},"links":{"citing_paper":"/paper/2608.09277"},"observation_digest":"sha256:60550abc08a4432ea3164184153ea1234e19c9536d8a1eb067cbfcdce3bea565","observation_id":"5dd138c2-4640-49ee-a46b-979bb79b8bd1","resolution":{"observed_at":"2026-08-11T20:22:29.671667Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.09277","last_updated":"2026-08-10T08:33:18Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-13T23:42:31.805006Z","submitted_at":"2026-08-10T08:33:18Z","title":"P$^{3}$: Joint Program-and-Proof Planning for Verified Code Generation"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":2,"verified_fuzzy":25},"total_outbound_references":56},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2608.09277."}