{"as_of":"2026-08-20T05:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00e02d6b8578f39d838726b87491befe3aed539178ffb54678cb019f8efc3024","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T04:02:22.170884Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2605.23772/citation-record","integrity":"/paper/2605.23772/integrity","json":"/paper/2605.23772/citation-record.json","paper":"/paper/2605.23772"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.01346","last_updated":"2025-10-10T20:12:14Z","snapshot_observed_at":"2026-08-17T15:33:47.953572Z","submitted_at":"2025-10-01T18:21:13Z","title":"Aristotle: IMO-level Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2510.01346","doi":"10.48550/arxiv.2510.01346","metadata_source":"pith","pith_arxiv_id":"2510.01346","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Aristotle: IMO-level Automated Theorem Proving","venue":"cs.AI","work_id":"6c61af2f-a34a-4647-9111-6ba5a60f6bc2","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2510.01346","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:0ac015642db9c4d20cfe7562de263ce300164a76ba21477d7aa7a9f96a51b925","observation_id":"680c4842-4a4d-40a8-9746-461575126524","resolution":{"observed_at":"2026-05-25T04:05:20.622338Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Claude-agent-sdk-python","venue":null,"work_id":"547b61db-ec7a-4c3e-8990-051b943d4d6c","year":null},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:69aab59547cc75f197bb94e1f47e4eb2fc27134355b1cc852b73a678f48823f2","observation_id":"cb6f70c6-4939-4d46-9c23-f7d28c0ed57a","resolution":{"observed_at":"2026-05-25T16:47:05.674372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-20615-8_17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mizar: State-of-the-art and beyond","venue":"Lecture notes in computer science","work_id":"eda6ce0e-c3ed-41db-b64c-4ab95c999d86","year":2015},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:83dcf2244e5ee48d13f5196359807473f84c0695d09605d224c646655e3b00af","observation_id":"5151f7d5-1785-4cd5-9e22-7a2c22835b2e","resolution":{"observed_at":"2026-05-25T04:05:19.967917Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-06-01T22:58:10.973998+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-01T22:58:10.973998+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.18587","last_updated":"2025-08-26T01:39:50Z","snapshot_observed_at":"2026-08-19T15:01:27.818736Z","submitted_at":"2025-08-26T01:39:50Z","title":"A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants","version":1},"cited_work":{"arxiv_id":"2508.18587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.18587","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A case study on the effectiveness of llms in verification with proof assistants","venue":null,"work_id":"76d1a7ca-2ca9-4d98-bbde-3458a587f977","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2508.18587","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:fc80a7b62ac57246218bf1f66c05b9a7a56782a0cf87e2ba86f9076c8da96b99","observation_id":"b26b3ab6-4ec8-46e0-aeb2-e5ab4bc450d9","resolution":{"observed_at":"2026-05-25T04:05:20.634391Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itp.2023.9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Brown, and Josef Urban","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"84c69d2b-078a-4696-bed7-8791b28455d0","year":2023},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:68db807b5e9fbd9913e7c4c19bc8b7626be0d3ad29bd4fbed3a8201e283794c9","observation_id":"c93be20f-1d7f-461a-9620-0350bec7b6a6","resolution":{"observed_at":"2026-05-25T04:05:19.972243Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-06-01T22:58:11.415547+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-01T22:58:11.415547+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":"2107.03374","doi":"10.48550/arxiv.2107.03374","metadata_source":"pith","pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating Large Language Models Trained on Code","venue":"cs.LG","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","year":2021},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:84a12434751159f91932eb97e333b0c7b1f6cdce1d9f1707d70e65b7c4eeeaba","observation_id":"451a513e-ba32-4ff7-96e9-01a9312b288d","resolution":{"observed_at":"2026-05-25T04:05:20.616690Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-01T08:08:23.404839+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T08:08:23.404839+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:3d0bdac6fdcf86fe27ec901369d1e6686e81d628062b5961e961d1257e149c4b","observation_id":"c29c1302-bcd5-432f-a858-f49314b7c0b1","resolution":{"observed_at":"2026-05-25T04:05:20.640235Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"LeanHammer","venue":null,"work_id":"f9acebf6-8aa8-403b-887c-4c0633df8e83","year":null},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:a83c453133ce75fd21f61e56aead7314926138c46b21a836a4076d8df01e153d","observation_id":"77b75311-1f28-4433-9b76-1454f6a1c37c","resolution":{"observed_at":"2026-05-25T16:47:05.687513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Lean-lsp-mcp","venue":null,"work_id":"86515434-0dcd-497a-87c7-677796a29e24","year":null},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:bd39b518526bbce857badfcfffa3bcf55ebb9350f368ae461c6084a572be3480","observation_id":"3416f2fb-0349-4574-95df-80348a866a93","resolution":{"observed_at":"2026-05-25T16:47:05.691517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.16584","last_updated":"2026-04-17T14:56:45Z","snapshot_observed_at":"2026-07-06T23:03:52.631613Z","submitted_at":"2026-04-17T14:56:45Z","title":"Certified Program Synthesis with a Multi-Modal Verifier","version":1},"cited_work":{"arxiv_id":"2604.16584","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.16584","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Certified Program Synthesis with a Multi-Modal Verifier","venue":"cs.SE","work_id":"67786472-8b36-4d19-a9af-053173553688","year":2026},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2604.16584","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:111899f0b4c318eaeabbc1f6985f2c0015b223d3d71feda7cf835498436a8033","observation_id":"058edf85-0d21-4740-a0ab-80877f596c54","resolution":{"observed_at":"2026-05-25T04:05:20.628611Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Lean4-skills","venue":null,"work_id":"6ad6f1c1-c538-46d3-b907-2d2b0dcb1721","year":null},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:e1c5f0e525bba77d74fef190248285071dca31d04097364069fbd802c2beee38","observation_id":"13328de2-66c4-4f3a-b9f7-c0e0f2f2bf6e","resolution":{"observed_at":"2026-05-25T16:47:05.670305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Hol light: A tutorial introduction","venue":null,"work_id":"3b297357-040a-41ea-ad30-ded86914db08","year":1996},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:a931a67a9a6cb70a88e661deaf6a4d0f7826145c08baa29e561523d9ffae545b","observation_id":"e1f6be72-a853-4af9-96cc-890fcfba642f","resolution":{"observed_at":"2026-05-25T16:47:05.656653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.15855","doi":"10.48550/arxiv.2507.15855","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Winning gold at imo 2025 with a model-agnostic verification- and-refinement pipeline","venue":"arXiv (Cornell University)","work_id":"32562c8f-ed95-45bc-b280-a6a82b5fba12","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:7da836ef7dadedf7724349ae2af6b90e98e2b67bde18b7cfcab650ef6626817c","observation_id":"2f744206-edd0-409b-bd08-598b9488b418","resolution":{"observed_at":"2026-05-25T04:05:20.657679Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41586-025-09833-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https://aclanthology.org/2025","venue":"Nature","work_id":"7185d70a-ddd1-45ed-bbec-e728c41ebf52","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:cb618a152eb769e1ee570128a295a64b52c1f2d827d2f9aefc26a1c455b6a2f0","observation_id":"42ddc457-9e09-4e36-98cf-a37b82c641dd","resolution":{"observed_at":"2026-05-25T04:05:19.951992Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-03T17:38:21.778911+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T17:38:21.778911+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.17150","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T08:47:49.689142Z","title":"Intent formalization: A grand challenge for reliable coding in the age of ai agents","venue":null,"work_id":"9816fddd-7db4-444f-82d8-0668656b446d","year":2026},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:f9a797cb1083021758296fdf6477c9a8435b9b3135c19e22cce8a74630c72232","observation_id":"d502bbdb-e90a-4d8d-ba99-bc7e31133a1a","resolution":{"observed_at":"2026-05-25T04:05:20.663237Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.19329","last_updated":"2026-08-10T08:34:04Z","snapshot_observed_at":"2026-08-18T01:03:12.754571Z","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":"2603.19329","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.19329","snapshot_observed_at":"2026-08-11T03:20:54.894970Z","title":"Goedel-code-prover: Hierarchical proof search for open state-of-the-art code verification","venue":null,"work_id":"14ce7cf2-71d1-44c1-871c-74c74fd4276c","year":2026},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2603.19329","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:58bd6052f10ea463c7985297e1453697e30e116efb7d69361eb7b5ee06561780","observation_id":"8d780983-4c45-4a23-989f-9d83b4da1650","resolution":{"observed_at":"2026-08-11T03:20:54.894970Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3105.357567","doi":"10.1145/3573105.3575671","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Aesop: White-Box Best-First Proof Search for Lean","venue":null,"work_id":"8850afd0-bed1-490c-80d3-7372bb2036a0","year":2023},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:463eca56499de0e74335618da0413f153795be1dc0ae6cb7fda9d3bdfc254707","observation_id":"e7cb7b4f-9800-42e6-abe9-3b09d780046b","resolution":{"observed_at":"2026-05-25T04:05:19.958438Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-07-13T16:49:38.194877+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T16:49:38.194877+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14408","last_updated":"2024-06-21T02:51:41Z","snapshot_observed_at":"2026-08-16T13:41:03.849027Z","submitted_at":"2024-06-20T15:31:05Z","title":"FVEL: Interactive Formal Verification Environment with Large Language Models via Theorem Proving","version":2},"cited_work":{"arxiv_id":"2406.14408","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14408","snapshot_observed_at":"2026-07-03T20:38:55.778131Z","title":"Fvel: Interactive formal verification environment with large language models via theorem proving","venue":null,"work_id":"dd62d493-2053-40ff-ba03-fdbf4ead667f","year":2024},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2406.14408","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:0676ff34fafc6648c82000f4cf4c015d8804fa835ba45598cce1bb6b658fec55","observation_id":"d94be3fb-3c0c-4361-ac07-a808b0d10d58","resolution":{"observed_at":"2026-05-25T04:05:20.651879Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03613","last_updated":"2025-08-05T16:28:22Z","snapshot_observed_at":"2026-08-11T11:12:15.356883Z","submitted_at":"2025-08-05T16:28:22Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction","version":1},"cited_work":{"arxiv_id":"2508.03613","doi":"10.48550/arxiv.2508.03613","metadata_source":"pith","pith_arxiv_id":"2508.03613","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction","venue":"cs.LG","work_id":"cfdb69bb-3c0b-41d3-bd34-3167a6931bb2","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2508.03613","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:37e21f53387acb64c7c88a119ac9becb9449e0578d5264db8797c8f47d0a81d8","observation_id":"29e888ba-4bfa-4452-a059-168a4f37da00","resolution":{"observed_at":"2026-05-25T04:05:20.676654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:11.143969+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:11.143969+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.14027","doi":"10.48550/arxiv.2601.14027","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Numina-Lean-Agent: An Open and General Agentic Reasoning System for Formal Mathematics","venue":"arXiv (Cornell University)","work_id":"34238340-e9f4-4013-858e-3d9d2c91ae53","year":2026},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:eb9f1434f244a96a272a4bcc54293a2593dcd5b50e590b5b0ebbdfeaf5b1b47d","observation_id":"d25b5637-4006-4ae2-a171-7959a8ca1fd8","resolution":{"observed_at":"2026-05-25T04:05:20.683311Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-79876-5_37","metadata_source":"crossref","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-22T14:57:51.162680Z","title":"The lean 4 theorem prover and programming language","venue":"Lecture Notes in Computer Science","work_id":"580a7df0-08ad-410d-89d6-34fd91a3e676","year":2021},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:8cc70ef8abac8c7179aebdf2b831efd39d7decd0b73831465b535cc7511b02ad","observation_id":"49f86fd9-18a4-455e-9390-5be0e6dd3c70","resolution":{"observed_at":"2026-05-25T04:05:19.963545Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:17.007758+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:17.007758+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","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":"690bd439-c763-4a21-84ac-e008c320411f","year":2002},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:535693d21612d6803f837ed44d143d163be513eb397ebccdd7f1c75079d41880","observation_id":"b9143b1f-0476-4df9-aab8-63efc7c4dbf2","resolution":{"observed_at":"2026-05-25T16:47:05.659222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"PhD thesis, Chalmers University of Technology and Göteborg University","venue":null,"work_id":"ef74852f-7c33-4f93-832f-22cc08ba0eb3","year":2007},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:7087bfa2bb77f087d620061f4ac233732de0a089e73d569a8891de3a4ab34bb6","observation_id":"9fcbcfe1-838c-417e-932e-984237a67c9a","resolution":{"observed_at":"2026-05-25T16:47:05.662690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2504.06239","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Canonical for Automated Theorem Proving in Lean","venue":null,"work_id":"33123bba-2f83-42a7-8cfe-5f88158f28d5","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:71ff236a796cce876bd6aab7bc4477032997820730fec75e18bd4e22174c1504","observation_id":"2460f533-1912-4f35-9c47-b6e44382e0d6","resolution":{"observed_at":"2026-05-25T04:05:20.724243Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Lean-lsp-mcp","venue":null,"work_id":"9e4547d6-3b8d-4132-90bc-1532a524b501","year":2026},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:65ee5e80ee4849241c3ee1e1f0c1254a01d1acadec554869f23ac34d5c0f73e9","observation_id":"c6fde471-dfb8-4246-9902-4ba4d5822407","resolution":{"observed_at":"2026-05-25T16:47:05.678360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Numina-lean-agent","venue":null,"work_id":"910a552e-ac13-43f8-bcc4-32725ba90710","year":null},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:a917ca23abc58eafffbcaef427f9578b4f581eb218b747d51c423c612f9b685f","observation_id":"c6ad9a74-21e6-41c0-93e8-f94d02ab6af2","resolution":{"observed_at":"2026-05-25T16:47:05.682235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2504.21801","doi":"10.48550/arxiv.2504.21801","metadata_source":"pith","pith_arxiv_id":"2504.21801","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","venue":"cs.CL","work_id":"3579ad7c-ab73-41db-801b-bf86628c5c02","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:09255f63168703b5f7cb9a7d05d87ebf9fcab08f27f077fb31e74a4764df5232","observation_id":"d7200234-a8fc-4d4a-bd94-81b12fd08f97","resolution":{"observed_at":"2026-05-25T04:05:20.691403Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:13.361719+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:13.361719+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"The rocq prover.Project website, 2026.https://rocq-prover.org","venue":null,"work_id":"118ec49d-e300-48a1-a53e-1ec47f6ebc6b","year":2026},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:f075ed3d583e43281e1f0db6d87be939f3b3aeab37dbea4073909d876467f788","observation_id":"0c8affe7-c7b2-4299-b9c9-76b2c85d1614","resolution":{"observed_at":"2026-05-25T16:47:05.651681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-71067-7_6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A brief overview of HOL4","venue":"Lecture notes in computer science","work_id":"2f19d6bc-ec89-4665-b2f2-7cf7f846c397","year":2008},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:a89ee1b94c1185724f1855a6fccf13fa3eaf00b07c81a67e85795aa18f4bb775","observation_id":"595fe84e-9a02-46a7-b692-d485a6a31735","resolution":{"observed_at":"2026-05-25T04:05:19.947409Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-06-01T22:58:13.224867+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-01T22:58:13.224867+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04353","last_updated":"2024-08-08T04:15:31Z","snapshot_observed_at":"2026-08-17T15:19:46.827734Z","submitted_at":"2023-10-06T16:21:22Z","title":"An In-Context Learning Agent for Formal Theorem-Proving","version":5},"cited_work":{"arxiv_id":"2310.04353","doi":"10.48550/arxiv.2310.04353","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.04353","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An in-context learning agent for formal theorem-proving","venue":"arXiv (Cornell University)","work_id":"354e6ad2-0712-4d89-a847-78a47bc6c434","year":2024},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2310.04353","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:984e49a51d668e9e4fe59b5d935be481f5190bf57451c5d4dc95c826f3c0e6e4","observation_id":"0cca331a-e2b7-47f6-a26c-7324082cf456","resolution":{"observed_at":"2026-05-25T04:05:20.718664Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.13938","doi":"10.48550/arxiv.2505.13938","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CLEVER: A Curated Benchmark for Formally Verified Code Generation","venue":"ArXiv.org","work_id":"cdf41e8b-ef2a-400b-922f-b8e65da9e5d7","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:0d28e7d80f6868d349b77bc61f6451bef292c08706417eeae881551ebee93645","observation_id":"941b1014-6eac-407e-b8df-fbb5983f202e","resolution":{"observed_at":"2026-05-25T04:05:20.645907Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Lean FRO","venue":null,"work_id":"edaa609d-7ffe-4308-a9bf-11359b4c66e3","year":2024},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:960024bb8bf7f04fcba565f3b5766f6081cc67cc8429b62b2f1631a57c04b9cb","observation_id":"d986f0b6-14ca-4715-89a1-389b4ab44dc9","resolution":{"observed_at":"2026-05-25T16:47:05.655223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.04763","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minif2f in rocq: Automatic translation between proof assistants – a case study","venue":null,"work_id":"498fd135-28cc-48fa-9735-17b300af14eb","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:31b3b4ded076d55110416692fefb6361ab8aa57c526ff7dd2dd865d604edf5e5","observation_id":"47e37856-6078-4fc7-ab63-acb437bbe098","resolution":{"observed_at":"2026-05-25T04:05:20.712919Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11354","last_updated":"2025-04-15T16:23:44Z","snapshot_observed_at":"2026-08-15T23:16:36.618851Z","submitted_at":"2025-04-15T16:23:44Z","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2504.11354","doi":"10.18653/v1/2025.acl-long.1565","metadata_source":"pith","pith_arxiv_id":"2504.11354","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","venue":"cs.AI","work_id":"0ff53eb8-7b88-4c00-8ba0-5f90f9a97f90","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2504.11354","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:78fa25728276716f28f47c32eabe16837e5283d5b7b459d8f891848bf68da714","observation_id":"c5e8be51-d435-4be1-b335-10afe56ed427","resolution":{"observed_at":"2026-05-25T04:05:20.699555Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-07-12T16:19:43.22822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T16:19:43.22822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.18885","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A minimalist proof language for neural theorem proving over isabelle/hol","venue":null,"work_id":"6b4af2d5-5f3c-42ca-8165-4281c8e437b4","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:161d19b6cb55db3ac1ba344a6a77ba4a2b2ec8bc47c74a0699ffd137b1e0e55e","observation_id":"4e6ae7cb-3c68-4bfc-be57-dd01ddfe283d","resolution":{"observed_at":"2026-05-25T04:05:20.706661Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.23135","doi":"10.48550/arxiv.2505.23135","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"VERINA: Bench- marking Verifiable Code Generation","venue":"ArXiv.org","work_id":"a11948de-0db3-4ba9-9a9c-ad2a8f304154","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:9176718eb783c5ed03c66870e5bed71809cd74a3ca7f54ad5fea8806d6690006","observation_id":"f96309eb-d7d5-4eed-9db3-214c8b2e3321","resolution":{"observed_at":"2026-05-25T04:05:20.729497Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"This is guaranteed to exist for odd-degree polynomials (even-length coefficient list) with non-zero leading coefficient – exactly the docstring’s preconditions","venue":null,"work_id":"7093f67e-4a78-4178-9d67-a0f1d48423eb","year":null},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:ccb62ea9b0795536c31b1248c9c9807140cde71eb2d1090add61f7a7819dd54d","observation_id":"1c3eaa49-ad81-4cdb-ab02-b94ac03e30c5","resolution":{"observed_at":"2026-05-25T16:47:05.666744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06-05T21:23:00.469572Z","title":"Each step halves the interval containing the root","venue":null,"work_id":"f874ccd6-c1e5-4a45-82ac-ed27527f6f7d","year":null},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:51deda6bff725807d5650a5ee394f3c384fdb0aad75a174093445f09468b1140","observation_id":"a9021c9c-929c-49dc-8136-9fb521682417","resolution":{"observed_at":"2026-05-25T16:47:05.695456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-19T04:04:55.677659Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":24,"verified_fuzzy":13},"total_outbound_references":38},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2605.23772."}