{"as_of":"2026-08-19T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2c09792ab4a24a766e6d71a577b054dc687b47e0227f7d41848447d2d90e6827","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":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:28:32.000131Z","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-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-11T10:51:30.174620Z","title":"Laurel: Generating Dafny assertions using large language models","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":162,"source":"pdf_text","source_observed_at":"2026-08-11T10:51:30.174620Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2412.16075"},"observation_digest":"sha256:44a9d5476dfe7b211d3135dd96669fcdf7098b441fa09cae1cc1db3313a07e83","observation_id":"dd710776-8593-4146-ac86-9fba7655093f","resolution":{"observed_at":"2026-08-11T10:51:30.174620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-10T21:18:02.227845Z","title":"Laurel: Generating dafny assertions using large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.05252","last_updated":"2025-01-09T14:03:35Z","snapshot_observed_at":"2026-08-16T23:04:54.705625Z","submitted_at":"2025-01-09T14:03:35Z","title":"From Scientific Texts to Verifiable Code: Automating the Process with Transformers","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.227845Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:36e26b5991afab2f2ef22d6f935bab094393459e4d2fba41ded155e878ccb4ce","observation_id":"67bfc8cc-d15b-41ea-9e34-6c59dd6d9388","resolution":{"observed_at":"2026-08-10T21:18:02.227845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-10T21:11:51.300216Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.06283","last_updated":"2025-01-10T17:23:14Z","snapshot_observed_at":"2026-08-18T00:50:03.973095Z","submitted_at":"2025-01-10T17:23:14Z","title":"Dafny as Verification-Aware Intermediate Language for Code Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:11:51.300216Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2501.06283"},"observation_digest":"sha256:a405d8a4ffcdbdafb25cda822df5533397c9b07e2c419a62d5b78a579497383b","observation_id":"abe16ec6-a471-46a6-b540-37f47689c0d6","resolution":{"observed_at":"2026-08-10T21:11:51.300216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-16T05:28:32.000131Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.21061","last_updated":"2025-04-29T10:02:29Z","snapshot_observed_at":"2026-08-17T12:31:25.670222Z","submitted_at":"2025-04-29T10:02:29Z","title":"Seeking Specifications: The Case for Neuro-Symbolic Specification Synthesis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T05:28:32.000131Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2504.21061"},"observation_digest":"sha256:1e8d2027f83600ddf140e2157b0905fca69ebab5391edc651ddd70ee7a656bb6","observation_id":"299ca29c-efba-49b7-8bb2-fc078c31a5a7","resolution":{"observed_at":"2026-08-16T05:28:32.000131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-07T04:22:32.604934Z","title":"Laurel: Generating dafny assertions using large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10704","last_updated":"2025-06-12T13:55:01Z","snapshot_observed_at":"2026-08-18T01:00:13.964175Z","submitted_at":"2025-06-12T13:55:01Z","title":"Formalising Software Requirements using Large Language Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:32.604934Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2506.10704"},"observation_digest":"sha256:fa248e0bd347f2b7fd2221682902e7f44b74440305dc0ecbd100a209c6fe2404","observation_id":"7bf44895-3b0d-4250-975b-1e302e32237b","resolution":{"observed_at":"2026-08-07T04:22:32.604934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-07T01:07:25.544508Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11874","last_updated":"2025-06-13T15:26:58Z","snapshot_observed_at":"2026-08-16T01:05:44.626821Z","submitted_at":"2025-06-13T15:26:58Z","title":"A Short Survey on Formalising Software Requirements using Large Language Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T01:07:25.544508Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2506.11874"},"observation_digest":"sha256:f961a7fe2bce393f545b24364c56aa7d0c7db79fecaf155e6f2487e1bd70dbda","observation_id":"6220d133-8bee-4e03-95e8-d913d98b8621","resolution":{"observed_at":"2026-08-07T01:07:25.544508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-15T19:58:00.671158Z","title":"Continualvls: Continual learning for vision-language segmentation in its,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14096","last_updated":"2025-09-05T22:03:39Z","snapshot_observed_at":"2026-08-17T00:24:39.245252Z","submitted_at":"2025-06-17T01:20:50Z","title":"Image Segmentation with Large Language Models: A Survey with Perspectives for Intelligent Transportation Systems","version":2},"reference_index":122,"source":"pdf_text","source_observed_at":"2026-08-15T19:58:00.671158Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2506.14096"},"observation_digest":"sha256:e5c2d0ea6a206fe72366afd0e42c91ba4286c544ac73316c133a4afa869d9e5d","observation_id":"0e629ca1-44ac-4c13-bd21-c663e50ffc53","resolution":{"observed_at":"2026-08-15T19:58:00.671158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-15T19:52:51.771399Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14627","last_updated":"2025-06-23T15:52:25Z","snapshot_observed_at":"2026-08-19T18:36:29.888915Z","submitted_at":"2025-06-17T15:23:56Z","title":"Working Document -- Formalising Software Requirements with Large Language Models","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T19:52:51.771399Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2506.14627"},"observation_digest":"sha256:ac73af9a73da33a7770f5f70296eb44eab9a89deac2142301d2d3958a5c3d17b","observation_id":"86b06909-ac8a-47f9-b79e-ead1ad000b38","resolution":{"observed_at":"2026-08-15T19:52:51.771399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-08-06T16:13:51.470873Z","title":"Mugnier, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14330","last_updated":"2025-08-28T13:50:56Z","snapshot_observed_at":"2026-08-18T00:59:19.906372Z","submitted_at":"2025-07-18T19:15:50Z","title":"Leveraging LLMs for Formal Software Requirements -- Challenges and Prospects","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:13:51.470873Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2507.14330"},"observation_digest":"sha256:fac4b35e08ea0d9c38dad7fece1a94f50054a8962aa17a3c9b5010f56fc8ae34","observation_id":"0119fc7d-7455-473b-ae87-1574d5fc2fee","resolution":{"observed_at":"2026-08-06T16:13:51.470873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":"2405.16792","doi":"10.48550/arxiv.2405.16792.url:","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Laurel: Unblocking automated verification with large language models.PACMPL (OOPSLA)","venue":null,"work_id":"6ded38e0-5b81-4c46-a4c3-eb0caf24e7ab","year":2025},"citing_paper":{"arxiv_id":"2512.18436","last_updated":"2026-04-15T16:44:49Z","snapshot_observed_at":"2026-08-15T02:29:04.432033Z","submitted_at":"2025-12-20T17:22:52Z","title":"VeruSAGE: A Study of Agent-Based Verification for Rust Systems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-16T21:04:11.290943Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2512.18436"},"observation_digest":"sha256:209b3ae04766e8f5c6ffa537b91c4133cc135d1c8482d671a8091ad211c6e7ca","observation_id":"0f17cad0-0862-4371-8702-bc753be5fe55","resolution":{"observed_at":"2026-05-16T21:08:33.080928Z","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":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":"2405.16792","doi":"10.48550/arxiv.2405.16792.url:","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Laurel: Unblocking automated verification with large language models.PACMPL (OOPSLA)","venue":null,"work_id":"6ded38e0-5b81-4c46-a4c3-eb0caf24e7ab","year":2025},"citing_paper":{"arxiv_id":"2604.05080","last_updated":"2026-04-06T18:32:09Z","snapshot_observed_at":"2026-08-15T16:19:19.483808Z","submitted_at":"2026-04-06T18:32:09Z","title":"Nidus: Externalized Reasoning for AI-Assisted Engineering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T19:21:53.699234Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2604.05080"},"observation_digest":"sha256:c430052410f0dbed71f002871aefb55af1dfe40a1e7787a72b64fe6aa7c21c9d","observation_id":"7fb02ff6-d962-42b7-8a69-3d6d9f25b00c","resolution":{"observed_at":"2026-05-10T23:05:48.380841Z","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":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":"2405.16792","doi":"10.48550/arxiv.2405.16792.url:","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Laurel: Unblocking automated verification with large language models.PACMPL (OOPSLA)","venue":null,"work_id":"6ded38e0-5b81-4c46-a4c3-eb0caf24e7ab","year":2025},"citing_paper":{"arxiv_id":"2604.05820","last_updated":"2026-07-14T09:49:12Z","snapshot_observed_at":"2026-08-16T09:22:51.694456Z","submitted_at":"2026-04-07T12:53:42Z","title":"SpecRL: Reinforcement Learning with Test-Based Completeness Rewards for Formal Specification Synthesis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T19:06:10.718673Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2604.05820"},"observation_digest":"sha256:1aa0e933822576011a695a4b15613f1e5a2e61415baaa93059ea4ea1c9bace54","observation_id":"e3dc109e-7fb1-45e8-bcbe-1a6f578e07ba","resolution":{"observed_at":"2026-05-10T23:30:50.832075Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":"2405.16792","doi":"10.48550/arxiv.2405.16792.url:","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Laurel: Unblocking automated verification with large language models.PACMPL (OOPSLA)","venue":null,"work_id":"6ded38e0-5b81-4c46-a4c3-eb0caf24e7ab","year":2025},"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":34,"source":"pdf_text","source_observed_at":"2026-05-25T04:52:06.456555Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2605.23109"},"observation_digest":"sha256:1720aa6b5f7f7a91ed8459c5f5fcb42c86ee89daf3625b8ee95c889545fd2be9","observation_id":"9fa2d7ba-7925-45aa-8b62-ad4977e0bd89","resolution":{"observed_at":"2026-05-25T04:55:23.697124Z","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":"2405.16792","last_updated":"2025-03-03T22:24:37Z","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models","version":2},"cited_work":{"arxiv_id":"2405.16792","doi":"10.48550/arxiv.2405.16792.url:","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16792","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Laurel: Unblocking automated verification with large language models.PACMPL (OOPSLA)","venue":null,"work_id":"6ded38e0-5b81-4c46-a4c3-eb0caf24e7ab","year":2025},"citing_paper":{"arxiv_id":"2605.30914","last_updated":"2026-05-29T06:59:28Z","snapshot_observed_at":"2026-08-14T18:21:58.376831Z","submitted_at":"2026-05-29T06:59:28Z","title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-06-28T23:52:36.891080Z"},"links":{"cited_paper":"/paper/2405.16792","citing_paper":"/paper/2605.30914"},"observation_digest":"sha256:dc349350f74f8dfa241db9e34128d635f864637b8a02b0eabb406011a13f177a","observation_id":"00dc80d6-74c5-474d-9376-151ad0bedf7e","resolution":{"observed_at":"2026-06-28T23:52:48.490447Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2405.16792/citation-record","integrity":"/paper/2405.16792/integrity","json":"/paper/2405.16792/citation-record.json","paper":"/paper/2405.16792"},"outbound":[],"paper":{"arxiv_id":"2405.16792","last_updated":"2025-03-03T22:24:37Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-18T10:50:02.967480Z","submitted_at":"2024-05-27T03:26:01Z","title":"Laurel: Unblocking Automated Verification with Large Language Models"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2405.16792."}