{"as_of":"2026-08-19T20:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99942b9af21683393acd30bee744bf1873cf46746ca9afcee8eccce43b63a481","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:18:02.261401Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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/2501.05252/citation-record","integrity":"/paper/2501.05252/integrity","json":"/paper/2501.05252/citation-record.json","paper":"/paper/2501.05252"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.824994Z","title":"Formal proof–getting started,","venue":null,"work_id":"bf9f6c82-835a-4ed5-8076-cb75e13d23bb","year":2008},"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":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.162592Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:bdda542844027134268ae0eb589adf81ff00f645263a5211625b1a5355e6a01b","observation_id":"a0fd4ce1-f6d3-4824-bcdd-1900228ea42a","resolution":{"observed_at":"2026-08-10T21:18:02.829448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.813290Z","title":"The complexity of verification,","venue":null,"work_id":"2e83f973-320b-4550-997b-49961595a1e9","year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.169617Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:13635dc24b4af4b77ad8cefedb4909de7d62d78f7ba99b564e0f395464d9e4f1","observation_id":"42f490c2-f24a-4a5a-bf59-f79890d02189","resolution":{"observed_at":"2026-08-10T21:18:02.817524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.801110Z","title":"Opinions on Proof Assistants,","venue":null,"work_id":"ff6268d3-db6c-4094-934d-fb7d08335216","year":null},"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":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.174084Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:40c023285f00a1d36d7f78a71de8c2eff175155b86811ad9a4d27f511b86d462","observation_id":"04a55519-18ea-4b8b-9591-c715d7c5cd7d","resolution":{"observed_at":"2026-08-10T21:18:02.805379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.787476Z","title":"Proof assistants: History, ideas and futur e,","venue":null,"work_id":"fca6bb87-bad2-4383-8e5a-811b9eace57c","year":2009},"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":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.178406Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:c44b04bad4d18dcaf41728f61a1c2750451da8eb890434fad6bd1fdae3227041","observation_id":"efcf2fda-56d0-4caa-9991-5af2e50d217c","resolution":{"observed_at":"2026-08-10T21:18:02.792126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.773869Z","title":"Avoiding verification brittlene ss in Dafny,","venue":null,"work_id":"581fa457-d6e0-4d62-bdf5-2241226f3cd3","year":2023},"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":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.183211Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:93ce9fd2abf5bc3c81982a5a83ff6f91f35dc84bdd84ff40038912a60a5eada8","observation_id":"2120555f-172a-4947-97ef-20991e144437","resolution":{"observed_at":"2026-08-10T21:18:02.779095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.759244Z","title":"Proof assistants for na tural language semantics,","venue":null,"work_id":"287e5944-ca9b-4139-8778-ac508ea7993e","year":null},"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":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.190860Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:ace8aacc86f088b92314604d99053ac04ea82da8b50fd0ab4aa69d52d020c24a","observation_id":"8168c324-6239-4973-bd1b-5751b51d9f9e","resolution":{"observed_at":"2026-08-10T21:18:02.763983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.744731Z","title":"Attention is all you need,","venue":null,"work_id":"4c7ee5d3-630e-41f0-9619-9240c6633486","year":null},"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":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.198857Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:5a0c8c418d95eed981a7b216ef021b6b947927f9bc9e37ed65945c3654223132","observation_id":"77ed1305-652b-4191-bcfc-344a9748d5f6","resolution":{"observed_at":"2026-08-10T21:18:02.748847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16733","last_updated":"2024-04-23T08:12:46Z","snapshot_observed_at":"2026-08-19T09:38:39.597133Z","submitted_at":"2023-11-28T12:29:33Z","title":"LLMs for Science: Usage for Code Generation and Data Analysis","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16733","snapshot_observed_at":"2026-08-10T21:18:02.204068Z","title":"Llms for science: Usage for code generation and data analysis,","venue":null,"work_id":null,"year":2023},"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":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.204068Z"},"links":{"cited_paper":"/paper/2311.16733","citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:11e481b346d348af6198f32e7ca3905213775a61df087eb1925855352fec9a78","observation_id":"f765f474-f3b0-4eaf-b347-69428c2fc477","resolution":{"observed_at":"2026-08-10T21:18:02.204068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-10T21:18:02.209246Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"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":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.209246Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:2d6b3515f608d27c44ed1ecfeb129721afe480e1447a7816ba9b2c218e2bbee3","observation_id":"b3cbcdf1-6e1e-40e3-a23e-b34f2a9aa7d3","resolution":{"observed_at":"2026-08-10T21:18:02.209246Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.729940Z","title":"Microsoft copilot,","venue":null,"work_id":"20f6395b-0565-4d7b-8c7d-784a3aca0b1b","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":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.213448Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:43c085a4e11efb7e89e13cedf19a0b308670680432ab8df391823dd0ad2dcf21","observation_id":"52c2430c-0877-40bd-8e0e-751219e3fa29","resolution":{"observed_at":"2026-08-10T21:18:02.735280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.712965Z","title":"Clover: Closed-loop verifiable code generation,","venue":null,"work_id":"977081e3-fb21-4c54-b2cc-f9af9f8171e1","year":null},"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":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.217780Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:9f0eac47bc724d9b7282cb290123822e2ea48f2a5b60dbb19f20fdb7e598f2e6","observation_id":"c7c2ec24-e63d-4396-9b47-1af5628b2d51","resolution":{"observed_at":"2026-08-10T21:18:02.717348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.697449Z","title":"Towards AI-assisted synthesis of verified Dafny methods,","venue":null,"work_id":"a727db4b-4d43-4dff-af79-b31cfd029d19","year":null},"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":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.221750Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:26607c196367418a314cd36bceb36b39b0d8cae20f4f12c6fe4f2926f5c0dcf1","observation_id":"5c820369-05d9-4b70-acb2-b59d8284ce93","resolution":{"observed_at":"2026-08-10T21:18:02.703043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.540028Z","title":"Llms for relational reasoning: How far are we?","venue":null,"work_id":"ff31b7b6-1179-4cf8-b455-0606c080e40f","year":null},"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":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.233732Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:f8853793f90f7c217eb907b1ced46401f4165fdc69e3e825d7a49c001979de64","observation_id":"c722e3b4-d7be-4f6e-9e32-fc995f4b9385","resolution":{"observed_at":"2026-08-10T21:18:02.686030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.510924Z","title":"Draft, sketch, and prove: Guiding formal theorem provers with informal proofs,","venue":null,"work_id":"0e6c1eb2-4b9e-492b-bfc2-9e6db19cce5c","year":null},"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":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.239349Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:2f5273d11d66c771354c49de2dd39a2f73723d2f429c162121d5f8c879f7fe81","observation_id":"e24a6fa6-9b79-4be1-8893-d8080321063b","resolution":{"observed_at":"2026-08-10T21:18:02.516617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.493374Z","title":"Graph Theory,","venue":null,"work_id":"9b12b55a-bd2f-4616-99d4-9cd5836778fc","year":2019},"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":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.243877Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:0c5c964cdf427366f2bf5f8aa3694662ad94d670b9205ab6cb4e8674633539d1","observation_id":"cb69007f-f070-4c1e-be2d-c6dba8ca5a29","resolution":{"observed_at":"2026-08-10T21:18:02.498924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2017.41212","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.375061Z","title":"Accessible Software V erification with D afny ,","venue":null,"work_id":"f0f241dc-cd12-44d3-9347-146e7d0b7e00","year":2017},"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":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.248916Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:6e95eef94e09e08a2bd25b44d5a6d1bce517d361500d9e1a2102c472ee93731b","observation_id":"f545968d-1ddd-4845-a605-27eeb2a22e21","resolution":{"observed_at":"2026-08-10T21:18:02.389429Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.471713Z","title":"How we built cedar with automated reasoning a nd differen- tial testing,","venue":null,"work_id":"1f601cad-1ac7-4165-bc18-7ec19f6f25ba","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":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.253262Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:1ba710af937fbeca893bebc36765697267d27fc2684f7207c21711df1d8cb03b","observation_id":"c8c5fa79-4a2c-407f-9585-3f704a789415","resolution":{"observed_at":"2026-08-10T21:18:02.476622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.459569Z","title":"Dafny Reference Manual,","venue":null,"work_id":"2ed67e18-878a-422e-8df7-5e34c7544f8f","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":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.257148Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:d696db50330d44ff48a04ff0b8c21cec723e206832412b607cfb3bf8c4c4b246","observation_id":"a009d750-06bf-4a66-9489-add35bad3b3b","resolution":{"observed_at":"2026-08-10T21:18:02.462987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:02.446325Z","title":"Prometheus system demonstration video","venue":null,"work_id":"469c5748-8c1f-4044-b8c5-5787168b74be","year":null},"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":20,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:02.261401Z"},"links":{"citing_paper":"/paper/2501.05252"},"observation_digest":"sha256:47c932e7a10453a1bb021943281d31b0573ab9735baedbabde5616410363fe42","observation_id":"4edf9553-dad7-464d-8b79-6290868acfda","resolution":{"observed_at":"2026-08-10T21:18:02.450458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.05252","last_updated":"2025-01-09T14:03:35Z","latest_version":1,"primary_category":"cs.SE","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"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2501.05252."}