{"as_of":"2026-08-09T18:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48be65be1ef1c3a27bb640abf3f497849e30bf416385935b0a64947b4d799691","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:43:17.341524Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":"2310.17807","doi":"10.48550/arxiv.2310.17807","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clover: Closed-loop verifiable code generation","venue":"arXiv (Cornell University)","work_id":"e9f3eadf-5ce1-4399-9149-c80c017a5982","year":2023},"citing_paper":{"arxiv_id":"2511.21104","last_updated":"2026-05-14T05:18:06Z","snapshot_observed_at":"2026-07-31T09:16:50.137667Z","submitted_at":"2025-11-26T06:39:19Z","title":"BRIDGE: Building Representations In Domain Guided Program Synthesis","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-17T05:23:04.821980Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2511.21104"},"observation_digest":"sha256:bb4d21178281f64bfae8dc9ccba2044f750e09e50e29a6efac3f9c322e920ff5","observation_id":"1132164b-713c-4fc9-8252-50b86a7c2289","resolution":{"observed_at":"2026-05-17T05:24:04.815466Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":"2310.17807","doi":"10.48550/arxiv.2310.17807","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clover: Closed-loop verifiable code generation","venue":"arXiv (Cornell University)","work_id":"e9f3eadf-5ce1-4399-9149-c80c017a5982","year":2023},"citing_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},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-10T08:19:03.469738Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2604.16584"},"observation_digest":"sha256:e52c49620068bf7fe6a7165f3e9a772b100b59afe28306dcc653c03db7a920a3","observation_id":"4f955474-f2b2-42b8-9ee4-3797d147a4d4","resolution":{"observed_at":"2026-05-10T08:22:36.754495Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":"2310.17807","doi":"10.48550/arxiv.2310.17807","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clover: Closed-loop verifiable code generation","venue":"arXiv (Cornell University)","work_id":"e9f3eadf-5ce1-4399-9149-c80c017a5982","year":2023},"citing_paper":{"arxiv_id":"2605.07935","last_updated":"2026-05-08T16:05:31Z","snapshot_observed_at":"2026-08-03T01:09:10.584822Z","submitted_at":"2026-05-08T16:05:31Z","title":"TraceFix: Repairing Agent Coordination Protocols with TLA+ Counterexamples","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-11T03:27:03.589336Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2605.07935"},"observation_digest":"sha256:c70b4238dea90b05b4fea20559788bcc8174ff30e4f9530545450e59de4fa3da","observation_id":"79a917d5-5bdb-4fdc-b63b-a92aa3c3ef4d","resolution":{"observed_at":"2026-05-11T03:30:55.990391Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":"2310.17807","doi":"10.48550/arxiv.2310.17807","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clover: Closed-loop verifiable code generation","venue":"arXiv (Cornell University)","work_id":"e9f3eadf-5ce1-4399-9149-c80c017a5982","year":2023},"citing_paper":{"arxiv_id":"2605.23109","last_updated":"2026-05-22T00:05:36Z","snapshot_observed_at":"2026-07-06T23:33:24.215365Z","submitted_at":"2026-05-22T00:05:36Z","title":"Inductive Deductive Synthesis: Enabling AI to Generate Formally Verified Systems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-25T04:52:06.456555Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2605.23109"},"observation_digest":"sha256:c760b58910837d4aeba0cfaff13070934ff250f845c8ca047a8404a9a99962a7","observation_id":"3a82e883-6e3f-436a-ae42-58efcdf62dd9","resolution":{"observed_at":"2026-05-25T04:55:23.795340Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":"2310.17807","doi":"10.48550/arxiv.2310.17807","metadata_source":"arxiv_reference","pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Clover: Closed-loop verifiable code generation","venue":"arXiv (Cornell University)","work_id":"e9f3eadf-5ce1-4399-9149-c80c017a5982","year":2023},"citing_paper":{"arxiv_id":"2605.30914","last_updated":"2026-05-29T06:59:28Z","snapshot_observed_at":"2026-08-04T08:48:12.582835Z","submitted_at":"2026-05-29T06:59:28Z","title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-28T23:52:36.891080Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2605.30914"},"observation_digest":"sha256:a5c1a38e0fa507f8bb5cf9c648be99819b894fe8436f37cdcee54fa58a9be051","observation_id":"e5250635-3a16-4636-bc09-e7cc4e8fdd57","resolution":{"observed_at":"2026-06-28T23:52:49.323824Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-02T07:40:13.413247Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14137","last_updated":"2026-07-17T14:29:07Z","snapshot_observed_at":"2026-08-02T07:40:06.654743Z","submitted_at":"2026-07-10T14:41:38Z","title":"Untrusted Authors, Trusted Answers: A Calculus of Fidelity-Graded Translations","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T07:40:13.413247Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2607.14137"},"observation_digest":"sha256:7e934cb5249fe1d20e8af9a6c72dcd2d24df601c25db7c095f780167cef6eba5","observation_id":"6489aab5-d3ff-42ed-9166-1d6787c63f1b","resolution":{"observed_at":"2026-08-02T07:40:13.413247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-07-30T22:39:33.957458Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23425","last_updated":"2026-07-26T02:49:56Z","snapshot_observed_at":"2026-08-06T23:37:51.377753Z","submitted_at":"2026-07-26T02:49:56Z","title":"TLA+-Bench: An Execution-Grounded Benchmark and Dataset for Natural-Language to TLA Specification Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-30T22:39:33.957458Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2607.23425"},"observation_digest":"sha256:4fba461a7b69b03cafb41fecd1d827f49a4720819fb4b2580ae50408807e5f24","observation_id":"8f1eccb1-b79d-4c30-83f7-f3e64ecd3c15","resolution":{"observed_at":"2026-07-30T22:39:33.957458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-06T00:43:17.341524Z","title":"Clover: Closed-Loop Verifiable Code Generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00965","last_updated":"2026-08-02T03:32:08Z","snapshot_observed_at":"2026-08-09T03:35:42.537416Z","submitted_at":"2026-08-02T03:32:08Z","title":"An AI Approach to Verified Production Cryptographic Libraries","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:43:17.341524Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2608.00965"},"observation_digest":"sha256:6238b36b59ce3c6f71c9875f4f14bc39abc1da62449d3c27a69543ade090fe53","observation_id":"26903e40-f5c8-412b-85ce-16ddc0e89847","resolution":{"observed_at":"2026-08-06T00:43:17.341524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17807","snapshot_observed_at":"2026-08-05T16:34:39.763558Z","title":"arXiv preprint arXiv:2310.17807 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03588","last_updated":"2026-08-04T12:42:11Z","snapshot_observed_at":"2026-08-07T23:12:08.583315Z","submitted_at":"2026-08-04T12:42:11Z","title":"GenOS: Compositional Certificates for Semantic Robustness in AI Code Generation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T16:34:39.763558Z"},"links":{"cited_paper":"/paper/2310.17807","citing_paper":"/paper/2608.03588"},"observation_digest":"sha256:8fa9f41af8431b17f7aafa43a82853e97aee781c5bc16bbead30276a160a3b48","observation_id":"d45874fb-11ae-4385-8ed2-7e3d2f6f7308","resolution":{"observed_at":"2026-08-05T16:34:39.763558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.17807/citation-record","integrity":"/paper/2310.17807/integrity","json":"/paper/2310.17807/citation-record.json","paper":"/paper/2310.17807"},"outbound":[],"paper":{"arxiv_id":"2310.17807","last_updated":"2024-11-16T21:57:49Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T16:39:16.652626Z","submitted_at":"2023-10-26T22:58:19Z","title":"Clover: Closed-Loop Verifiable Code Generation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2310.17807."}