{"as_of":"2026-08-20T04:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a180aabd5b900d5535fd009109aee010eeda4906fd9b5629c8470f381e0aadb9","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T16:08:39.755740Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"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/2607.04631/citation-record","integrity":"/paper/2607.04631/integrity","json":"/paper/2607.04631/citation-record.json","paper":"/paper/2607.04631"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Claude Opus 4.5 system card","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:bb4de0e6ced064d7d3cc33b3522b38cecedf4c634a14fe00fdf7d47a4fc970de","observation_id":"3fbe8b3e-18d4-41a3-b16d-580380d6df3e","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:878d8054eadbcee71fc41190b6a2f23a8d582a78d7b7fb1b2722284f6decee61","observation_id":"1ec75b59-3bca-4ac7-a1d5-8c7c7c6ba226","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Knowledge transfer from high-resource to low-resource programming languages for code llms.Proc","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:c6d801e9993d96a9577e63700e38bd29815e86efb885b2bec7a82ccce517282e","observation_id":"67683b9e-17be-445e-9f46-91230cd7fc87","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"MultiPL-E: A scalable and polyglot approach to benchmarking neural code generation.IEEE Trans","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:7039ca17421f47d00d24a1ea989bf6b70b40267c07757d5e9e47b22f2cea3bdb","observation_id":"4631bb9a-bfee-4b99-83ea-0ea56f906be4","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Automated proof generation for rust code via self-evolution, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:4ae0e487eab95431a5e2e201e4ddd28409754ad8d0cdb754f6fb7b37bed4916a","observation_id":"5323378d-e66d-4b0f-b936-22381a9b81bc","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Frama-C: A software analysis perspective","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:a2902f318e714faea6ea7419f9cc1d9ff5fc94764324a650fd716d8983156406","observation_id":"16e5f2e3-5729-4c13-9374-2f629e037347","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Z3: An efficient SMT solver","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:904a41c7cde7363dd169aec74358f065b5cf2fdf3591af0178fc4eaa46d3454c","observation_id":"808bcbf0-4e4b-4c9a-a613-2e1e29c4d83b","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Lorch, Yuan Yao, and Xiaoxing Ma","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:3408b19b5ee8a74e3cdca1acc774ca8c431506a15f1e1efe4c563ca1becf66d7","observation_id":"22d17f14-d937-447e-b317-20ee23a57c2f","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.06767","last_updated":"2023-12-01T14:28:06Z","snapshot_observed_at":"2026-08-07T04:02:54.504761Z","submitted_at":"2023-04-13T18:22:40Z","title":"RAFT: Reward rAnked FineTuning for Generative Foundation Model Alignment","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.06767","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Raft: Reward ranked finetuning for generative foundation model alignment.arXiv preprint arXiv:2304.06767, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2304.06767","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:b9fcf44be7c7d3e79ff5827887b9905d0af30752899a5cf9214e6e22b0d33d9d","observation_id":"304c169e-fe8a-4982-9628-f340655e9af6","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00212","last_updated":"2025-03-21T03:27:55Z","snapshot_observed_at":"2026-08-19T05:12:56.768935Z","submitted_at":"2025-01-31T23:01:48Z","title":"STP: Self-play LLM Theorem Provers with Iterative Conjecturing and Proving","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00212","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Stp: Self-play llm theorem provers with iterative conjecturing and proving.arXiv preprint arXiv:2502.00212, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2502.00212","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:779e21721af01bacfed2f9706a634bb8be1d30363013f618615d2051154770c5","observation_id":"bf4ba96c-5752-440e-abf8-617947cdda98","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.07759","last_updated":"2023-05-24T23:30:43Z","snapshot_observed_at":"2026-08-19T04:05:48.812216Z","submitted_at":"2023-05-12T20:56:48Z","title":"TinyStories: How Small Can Language Models Be and Still Speak Coherent English?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.07759","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Tinystories: How small can language models be and still speak coherent english?arXiv preprint arXiv:2305.07759, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2305.07759","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:cc6c825d7aa65c8b1fbc6902356938d64887917864788cb71072f8135005bd3e","observation_id":"ca34f4f5-af03-49df-b0af-43707dc8d903","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08998","last_updated":"2023-08-21T10:23:42Z","snapshot_observed_at":"2026-08-13T14:38:32.919809Z","submitted_at":"2023-08-17T14:12:48Z","title":"Reinforced Self-Training (ReST) for Language Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08998","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Reinforced self-training (rest) for language modeling.arXiv preprint arXiv:2308.08998, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2308.08998","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:37571316a5f59af5276d1c9a3120ac63c74e1dccf0b0a572f1aa8c1276e53fae","observation_id":"669d434c-1985-4100-83ac-312b99d85220","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Data quality for machine learning tasks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:9ed477948a85ab840f5caead82196715b49a7a8b6bf5dfbec3ea1ab141f925c1","observation_id":"0a415b5f-4994-418b-97bd-a4c2541982d6","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02305","last_updated":"2024-04-02T21:03:37Z","snapshot_observed_at":"2026-08-16T14:04:10.052009Z","submitted_at":"2024-04-02T21:03:37Z","title":"Collapse of Self-trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02305","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Collapse of self-trained language models.arXiv preprint arXiv:2404.02305, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2404.02305","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:a1cea355f3597d60517c81b7bda9945d820ca32c3d0e445df84017f242d0377b","observation_id":"21ba4c27-b3f5-4e6e-8160-f8a7518f864a","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"LoRA: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:2712ce6a4e73f5e30c78dc9f278eca250e86d96ba630244cd679063c5aa7e645","observation_id":"32a5ea74-a683-4f9e-8289-58c4ff75d087","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Qwen2.5-Coder technical report.arXiv preprint arXiv:2409.12186, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:57b1ac90e41d1d843423991e4bcdf9197b60881d698675939835f792d8d6becf","observation_id":"f4c1b721-dc52-4d05-a4ef-efd90a3a2c42","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Verus: A practical foundation for systems verification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:1cc59257ef8f26a3a0f16199f14a6a819507e454f157ce83e4b5c2f6a431c755","observation_id":"79e717b9-624f-424b-92ef-d204bfaee60b","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","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":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:d08ca1107b3f0e7ab4c5bd65a80bd0d0dfc29165cb7a78e70e125cda3fc6131f","observation_id":"4e9dc0eb-650c-4dd5-9026-b0e72cfc4ded","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Dafny: An automatic program verifier for functional correctness","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:f364891c2c812af6ccbb53e332959c9c5faae119cdc196d06ef25dd9a8f9384d","observation_id":"6ea8bb93-c6af-4ae3-b674-31e671612b2c","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Lenat and John Seely Brown","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:a1931b70ed286b454a667508bd7893fa7fb09403089a3b5166ce13bad6336037","observation_id":"77bf85a6-a489-40e5-834a-a04aaf83fad5","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05463","last_updated":"2023-09-11T14:01:45Z","snapshot_observed_at":"2026-08-02T22:47:03.212781Z","submitted_at":"2023-09-11T14:01:45Z","title":"Textbooks Are All You Need II: phi-1.5 technical report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05463","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Textbooks are all you need ii: phi-1.5 technical report.arXiv preprint arXiv:2309.05463, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2309.05463","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:a8d8a93f2e934869788b3c9b8e6d063b08c08f556edafe1fd75ee058bf0d4a32","observation_id":"dcb47945-43ec-4ee1-83dd-fa7e0ae112f6","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07640","last_updated":"2025-04-19T13:53:05Z","snapshot_observed_at":"2026-08-19T20:10:21.442760Z","submitted_at":"2025-02-11T15:27:35Z","title":"Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07640","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"Goedel-prover: A frontier model for open-source automated theorem proving.arXiv preprint arXiv:2502.07640, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2502.07640","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:810fcea634142592c1a5e9a0d0e58bf34b2f81987cb83279dfaf5537f70ea6c3","observation_id":"73b27a59-95bb-4b41-bcb0-289134ee65a2","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-16T13:43:38.124764Z","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-07-11T16:08:39.755740Z","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":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2406.08467","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:5adf5dc91e600bd2a2a2317f5aacefbe81e58afc8c78ddf2549646c89ce7b3aa","observation_id":"74e0edb1-6760-43bd-ba5d-f6debc46c01c","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Lopes, Iris Ma, and James Noble","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:0e3feb591a928e9e9161976a6b9fa453d7060cc8e70f9b9c24015b3e78acb3e7","observation_id":"5909aa06-a34b-4d9e-b681-bf9f38b85217","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"On the impact of formal verification on software development.Proceedings of the ACM on Programming Languages, 9(OOPSLA2):3642–3668, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:2f9892437198fad94c323a6104ddfe4ced83a2827dc55410fce26cdf9f1ff8be","observation_id":"15065a7c-8654-430d-96d0-b3bf3584cd64","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Building a c compiler with a team of parallel claudes","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:94bdd9c712bc56f0265b1504c6c739fe0ea7f1d56447a8afe57a543e5bb0fef3","observation_id":"cd7cfdc6-e65c-4516-a16a-08414c67f5d0","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Learning formal mathemat- ics from intrinsic motivation.Advances in Neural Information Processing Systems, 37:43032– 43057, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:7c5a103888167b98c91c08fc731b3f98dc8d87f9a9e0f33e814002d734e6701d","observation_id":"25817134-8dc2-466d-8d76-fdb75e58ba79","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"dafny-annotator: AI-assisted verification of Dafny programs, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:4934ca768e78c8fa6bb0af175292ba97b3bc6b8ad6191db4e4ec00188c16bcbf","observation_id":"16e846b8-2b55-4533-a5d4-2672207de6f0","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Taxonomic diversity estimation using rarefaction.Paleobiology, 1(4):333–342, 1975","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:4a0a9b94390b07687a11481d51e227d10a59d968ac1e741d9168d132ccf35923","observation_id":"2fd29c39-e244-4816-a6f5-e2cec02020c4","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Agentic much? adoption of coding agents on github.ACM Transactions on Software Engineering and Methodology, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:2c0c536cf18706b84f31231ecc530fed57a706acc65e03c1b66f51b5ef0df0f2","observation_id":"a4c1fa14-209c-476d-9446-e7d032f2a00d","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Ai models collapse when trained on recursively generated data.Nature, 631(8022):755– 759, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:b84edaa63b08e2376c0237666552d72aebe8ec6f6affa63cccf308f848eadb2f","observation_id":"b41ae697-f2b8-432a-8142-403b84a2c2b9","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Clover: Closed-loop verifiable code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:773a86d61ff6e05800486d61c5923345f04da06cf6bd83a4f9b8c2d8a22b1450","observation_id":"50ddbc5e-0d49-47bf-9088-1d5b6d16d509","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Solving olympiad geometry without human demonstrations.Nature, 625(7995):476–482, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:b2ccb9ef46a12c088a8f95768f6ad16b5fbed7a83fe513118a3e7c01905860e2","observation_id":"6184ba90-d5dc-4a01-b015-37898b0b0805","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16291","last_updated":"2023-10-19T16:27:03Z","snapshot_observed_at":"2026-08-13T16:55:46.498156Z","submitted_at":"2023-05-25T17:46:38Z","title":"Voyager: An Open-Ended Embodied Agent with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16291","snapshot_observed_at":"2026-07-11T16:08:39.755740Z","title":"V oyager: An open-ended embodied agent with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2305.16291","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:f7a1524b091dcd9c4b4f2b9d06654f347f2110dc3db72c41a0deec4de542b330","observation_id":"e114e8eb-1f4a-426f-b192-fe831a8ebe03","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14333","last_updated":"2024-05-23T09:03:42Z","snapshot_observed_at":"2026-08-16T13:50:18.721796Z","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-07-11T16:08:39.755740Z","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":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"cited_paper":"/paper/2405.14333","citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:bfbdf141c5a0e18f17555b89a402d9d5b35c9235b588696821d0814144336ca1","observation_id":"3af081ab-b442-4f0e-b231-9d4c90c2ef2f","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"something went wrong","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:5d02a35f02869e7642e463a5f5b240c0a4798e0331909094cf953f4c0e5334ac","observation_id":"0d519cbc-6996-4b9e-9f21-943c52337415","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"The repository is most likely unrelated to verified programming, so freely adapt or reinterpret its theme","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:08e0dbdfe649117451a0eb6e37e584edf6de182790ae5e82b1f0f0eb4fd4cee8","observation_id":"38064235-84b0-4131-9da7-2eef5b4a8c75","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Your program should NOT try to implement the entire idea, which is likely to be overly ambitious to write in one go","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:cca0e6b1560dff41c01f74a36f6dabdab69b18ab2df55cfcab5f0e331b72b77a","observation_id":"8892f65d-fc9c-4eac-b64c-53cc1ecfdc39","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"The repository is most likely unrelated to verified programming, so freely adapt or reinterpret its theme","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:c37ea9227153e09bb1f50a24c052a746d7cf8b2d7e07857a45db50b69d7da2eb","observation_id":"0a53c0d4-217e-43bc-a5ad-baf07e3402e8","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Your program should NOT try to implement the entire idea, which is likely to be overly ambitious to write in one go","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:d058cddcc2b66c6139cf871a7fe687170e1795367243e2c9489d3a49925d4bc5","observation_id":"f9f31c9d-8f5d-44f3-bb50-5af387aba78d","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"The repository is most likely unrelated to formal verification, so freely adapt or reinterpret its theme","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:3077b1c3457e234e6c7c19427aee80b415bc51d573becae5cc14f80e7af4b484","observation_id":"8cbd85cd-a73d-47e3-a9d2-e1924c2238e8","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","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-07-11T16:08:39.755740Z","title":"Hello, World!","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:39.755740Z"},"links":{"citing_paper":"/paper/2607.04631"},"observation_digest":"sha256:970a1b4f83b64e8afa03bcfc8232175e3c4b6a99fec8937a0b17cb0fb8f0a162","observation_id":"327fb0b1-f7ec-46b5-9917-d2f0dcc1fbfa","resolution":{"observed_at":"2026-07-11T16:08:39.755740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04631","last_updated":"2026-07-06T03:31:14Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T21:22:23.938933Z","submitted_at":"2026-07-06T03:31:14Z","title":"Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"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 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2607.04631."}