{"as_of":"2026-08-18T03:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b536e36e26f5f8bf98a6fa4e2cabc84b0d81b6bbe67de4462abfaf2181189342","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-17T06:30:58.91139+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-15T16:59:23.490482Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T21:26:13.999304Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-08-11T20:02:27.460873Z","title":"and Welleck, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06176","last_updated":"2024-12-09T03:22:35Z","snapshot_observed_at":"2026-08-16T00:32:52.362957Z","submitted_at":"2024-12-09T03:22:35Z","title":"AlphaVerus: Bootstrapping Formally Verified Code Generation through Self-Improving Translation and Treefinement","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T20:02:27.460873Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2412.06176"},"observation_digest":"sha256:e53c2e21438978365f6917bf72bed560ae01c3f6d6dfc9644703e0af55e59673","observation_id":"6251974d-f5b8-4493-a3f7-8526db1f0273","resolution":{"observed_at":"2026-08-11T20:02:27.460873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-08-11T10:51:30.738010Z","title":"miniCodeProps: a minimal benchmark for proving code properties","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16075","last_updated":"2024-12-20T17:19:24Z","snapshot_observed_at":"2026-08-14T15:03:35.102170Z","submitted_at":"2024-12-20T17:19:24Z","title":"Formal Mathematical Reasoning: A New Frontier in AI","version":1},"reference_index":278,"source":"pdf_text","source_observed_at":"2026-08-11T10:51:30.738010Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2412.16075"},"observation_digest":"sha256:dfdf2b1dede417fb92b559151bb32638b314fa6980a480ce0950c0c9c3fca3dd","observation_id":"6aa3455c-8c23-4932-8db7-842b938377ed","resolution":{"observed_at":"2026-08-11T10:51:30.738010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-08-15T16:59:23.490482Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18587","last_updated":"2025-08-26T01:39:50Z","snapshot_observed_at":"2026-08-17T07:58:43.764455Z","submitted_at":"2025-08-26T01:39:50Z","title":"A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T16:59:23.490482Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2508.18587"},"observation_digest":"sha256:2213255676ec85db4c9c9bc0fdab0852203aea85b8b18236b3fbcea91d993fb4","observation_id":"b67947af-7c7d-49b7-ba22-1978f101dd98","resolution":{"observed_at":"2026-08-15T16:59:23.490482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":"2406.11915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-07-01T21:26:13.999304Z","title":"miniCodeProps: A minimal benchmark for proving code properties","venue":null,"work_id":"cb75711a-c611-4f1c-bdef-cbd99cef34e1","year":2024},"citing_paper":{"arxiv_id":"2511.21104","last_updated":"2026-05-14T05:18:06Z","snapshot_observed_at":"2026-08-13T01:41:55.964919Z","submitted_at":"2025-11-26T06:39:19Z","title":"BRIDGE: Building Representations In Domain Guided Program Synthesis","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-17T05:23:04.821980Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2511.21104"},"observation_digest":"sha256:19874f9f7181e1c863ab038c6be95b74fb87ad8e010dc46b9c8749a4be21611a","observation_id":"fc4c65f7-8470-48db-bca8-15ee52964351","resolution":{"observed_at":"2026-05-17T05:24:04.833673Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":"2406.11915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-07-01T21:26:13.999304Z","title":"miniCodeProps: A minimal benchmark for proving code properties","venue":null,"work_id":"cb75711a-c611-4f1c-bdef-cbd99cef34e1","year":2024},"citing_paper":{"arxiv_id":"2603.14628","last_updated":"2026-04-19T15:46:53Z","snapshot_observed_at":"2026-08-13T07:42:36.996374Z","submitted_at":"2026-03-15T21:55:59Z","title":"s2n-bignum-bench: A practical benchmark for evaluating low-level code reasoning of LLMs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T10:59:28.944919Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2603.14628"},"observation_digest":"sha256:115b5f5094b0e764fba4b5004d5d4b68be345dfd6fde1c39db1afe2fb1f181f5","observation_id":"e62bc26d-451a-425d-985f-f4006bdd3360","resolution":{"observed_at":"2026-05-15T10:59:57.109801Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":"2406.11915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-07-01T21:26:13.999304Z","title":"miniCodeProps: A minimal benchmark for proving code properties","venue":null,"work_id":"cb75711a-c611-4f1c-bdef-cbd99cef34e1","year":2024},"citing_paper":{"arxiv_id":"2605.08553","last_updated":"2026-05-08T23:25:05Z","snapshot_observed_at":"2026-08-13T04:52:24.109699Z","submitted_at":"2026-05-08T23:25:05Z","title":"VeriContest: A Competitive-Programming Benchmark for Verifiable Code Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-12T01:21:42.562823Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2605.08553"},"observation_digest":"sha256:3615e56ecf7ee1bea691cbdd16bfcac374db78b896a5176e717365054b3e8810","observation_id":"60878fd3-e9d3-43b2-998a-3e4baf5f5353","resolution":{"observed_at":"2026-05-12T08:01:32.542398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":"2406.11915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-07-01T21:26:13.999304Z","title":"miniCodeProps: A minimal benchmark for proving code properties","venue":null,"work_id":"cb75711a-c611-4f1c-bdef-cbd99cef34e1","year":2024},"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":29,"source":"pdf_text","source_observed_at":"2026-05-25T04:52:06.456555Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2605.23109"},"observation_digest":"sha256:9bc6a34bdf52a63f55a9fa47ab72432864418a2d3fabd26dacd8e6c4dbafe5f7","observation_id":"ebad445a-474c-41a4-bbae-d8bc2940496d","resolution":{"observed_at":"2026-05-25T04:55:23.761583Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":"2406.11915","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-07-01T21:26:13.999304Z","title":"miniCodeProps: A minimal benchmark for proving code properties","venue":null,"work_id":"cb75711a-c611-4f1c-bdef-cbd99cef34e1","year":2024},"citing_paper":{"arxiv_id":"2606.01008","last_updated":"2026-05-31T04:51:27Z","snapshot_observed_at":"2026-08-17T13:41:38.196203Z","submitted_at":"2026-05-31T04:51:27Z","title":"FVSpec: Real-World Property-Based Tests as Lean Challenges","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T17:05:13.012431Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2606.01008"},"observation_digest":"sha256:c6d727f6fec7a1dd929b36950e91a27b9443b7ba594a6ad761c0877cd94fda33","observation_id":"5c1d1f80-fcc4-4e42-9564-6ce51559029f","resolution":{"observed_at":"2026-07-01T21:26:14.000712Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11915","snapshot_observed_at":"2026-08-14T05:11:01.371264Z","title":"miniCodeProps: a minimal benchmark for proving code properties.arXiv preprint arXiv:2406.11915, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13522","last_updated":"2026-08-13T17:41:27Z","snapshot_observed_at":"2026-08-18T00:29:43.788970Z","submitted_at":"2026-08-13T17:41:27Z","title":"Vero: Can AI Agents Build Formally Verified Software Repositories?","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T05:11:01.371264Z"},"links":{"cited_paper":"/paper/2406.11915","citing_paper":"/paper/2608.13522"},"observation_digest":"sha256:84d6adad47d3f910449f18e4101c62a1496877ca18fb22fb33d3201e18d3b9d3","observation_id":"a99012e3-3620-4f0c-83d0-122167a4ede8","resolution":{"observed_at":"2026-08-14T05:11:01.371264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.11915/citation-record","integrity":"/paper/2406.11915/integrity","json":"/paper/2406.11915/citation-record.json","paper":"/paper/2406.11915"},"outbound":[],"paper":{"arxiv_id":"2406.11915","last_updated":"2024-10-10T16:13:19Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T13:42:29.028758Z","submitted_at":"2024-06-16T21:11:23Z","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2406.11915."}