{"as_of":"2026-08-07T09:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19e83ba60104d218c85f2c64b779ccec38e08c1642794950c5f0f4e9680808be","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T05:52:05.192897Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T04:34:01.041527Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.20642","snapshot_observed_at":"2026-08-01T04:34:01.041527Z","title":"Fang, and Junwei Lu","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22511","last_updated":"2026-08-04T17:10:35Z","snapshot_observed_at":"2026-08-07T09:12:53.207435Z","submitted_at":"2026-07-24T17:32:35Z","title":"CausalForge: A Formally Grounded, Self-Improving Agentic Framework for Automated Research in Causal Inference","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T04:34:01.041527Z"},"links":{"cited_paper":"/paper/2606.20642","citing_paper":"/paper/2607.22511"},"observation_digest":"sha256:e06e9e03ec8be652a90f8412c4161fbbcf6af1bcc03d46b9e1b835a1f9fff20d","observation_id":"f3abb441-e4bd-40d2-834b-fd51a33955f4","resolution":{"observed_at":"2026-08-01T04:34:01.041527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.20642/citation-record","integrity":"/paper/2606.20642/integrity","json":"/paper/2606.20642/citation-record.json","paper":"/paper/2606.20642"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"Formal- izing concentration inequalities in Rocq: infrastructure and automation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:d2a2862b748967128e8882ca17ea0c15612ad0784a9e59fd2613f4e10d55fbe7","observation_id":"fed4dcfe-239b-4cda-9a69-b05ac4326804","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"Infotheo: A Rocq formalization of information theory and linear error-correcting codes","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:f4434c7d93877750a3bac91c18741d9de48e17e5f9232c57ef6eb9a5c651ed74","observation_id":"2c99b705-1e19-4d74-98bf-aae264df2523","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"A formally verified proof of the central limit theorem","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:4a9272e1efb60159976dd41ed349436f806e18dc0b9c87c43e28303c8190f8ac","observation_id":"3287d088-aee5-4b2e-bb00-d4f2f04ad00d","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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":"2506.19923","doi":"10.48550/arxiv.2506.19923","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Prover agent: An agent-based framework for formal mathematical proofs","venue":"ArXiv.org","work_id":"79402a33-8ac9-47f7-9c8c-444f54acbd03","year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:3a78f0de34e3ef6d181b67b3eaa0a9728a52f148fe2090e3ed4c37a77349163b","observation_id":"27d84acd-080d-450c-a766-d6685fad5bd7","resolution":{"observed_at":"2026-07-02T08:36:48.585052Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.12787","last_updated":"2026-05-22T10:39:41Z","snapshot_observed_at":"2026-08-01T15:39:50.322856Z","submitted_at":"2025-10-14T17:57:04Z","title":"Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics","version":4},"cited_work":{"arxiv_id":"2510.12787","doi":"10.48550/arxiv.2510.12787","metadata_source":"pith","pith_arxiv_id":"2510.12787","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ax-prover: A deep reasoning agentic framework for theorem proving in mathematics and quantum physics","venue":"cs.AI","work_id":"aba0c390-c33c-437e-8d78-4b8a6bad930b","year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2510.12787","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:f77cb31234f8331ddd308d5bbcbd188711f68ae588da32be0f992602b9e62edc","observation_id":"ec92262b-bf54-48bb-b8da-186ef5e6589d","resolution":{"observed_at":"2026-07-02T08:36:48.581919Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"Archon: Toward fully autonomous formalization of FirstProof’s research-level problems","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:fbc17c25baa334bc87a3b35cbaaf1941763a1cefbb63adaa932d9024f5f56a4a","observation_id":"919f4b5b-08e8-4781-92d3-47db46bd2d62","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03071","last_updated":"2026-04-03T14:51:01Z","snapshot_observed_at":"2026-08-03T21:01:45.224658Z","submitted_at":"2026-04-03T14:51:01Z","title":"Automatic Textbook Formalization","version":1},"cited_work":{"arxiv_id":"2604.03071","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.03071","snapshot_observed_at":"2026-07-03T22:39:01.167008Z","title":"Automatic Textbook Formalization","venue":"cs.AI","work_id":"4bcc5883-2e97-4c70-899b-89eda358ce73","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2604.03071","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:d8e15618d1018808327468c1eb7bc84c89dba9610552a8ca85329e82f431d3ff","observation_id":"6bd8db20-618a-45b7-957a-353af5f549d1","resolution":{"observed_at":"2026-07-02T08:36:48.588018Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.23468","last_updated":"2026-05-29T15:32:06Z","snapshot_observed_at":"2026-08-02T14:30:37.889122Z","submitted_at":"2026-04-25T23:27:10Z","title":"Progress in Formalizing Sphere Packing in Dimension 8","version":3},"cited_work":{"arxiv_id":"2604.23468","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.23468","snapshot_observed_at":"2026-07-10T23:17:41.415491Z","title":"A Milestone in Formalization: The Sphere Packing Problem in Dimension 8","venue":"math.MG","work_id":"19a9c112-1d1e-4df7-9991-f3789e015523","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2604.23468","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:d0ae04e24eea6c0a926d8e116399e528b970e1853e01de10ef7af852ed2ec32d","observation_id":"e0390c13-5017-42b3-85f3-49c359bd95c5","resolution":{"observed_at":"2026-07-02T08:36:48.590678Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"Formalization of continuous probability distributions","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:6b05ab74562d04d2be14364118f7f74efc4ad08586be50a26c5298ccf66db98c","observation_id":"99305d77-f32e-466a-9b19-ba2d1ce70d30","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"Formalization of the standard uniform random variable","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:11c1f173d3c536d626aeb308b28b9b21efaa0e0899c2af63bccec887138a6237","observation_id":"6d5002b1-4f0d-469b-931d-4302ab0d145d","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"A formalization of the Lévy-Prokhorov metric in Isabelle/HOL","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:8750672f69c8a6ccc73f8bf6de8c041f3e57b638699eb08c710d03e45e890175","observation_id":"eb77b307-632a-4351-a13a-d42f0ed3c368","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:98cd8d8fa90b506dc1232ae8ab1bc5235a844f74933a8727aad88cb94dff9501","observation_id":"a1ccbc04-c100-4015-b773-df3fc9fb5820","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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":"2603.15929","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T23:17:41.376130Z","title":"Semi-autonomous formalization of the Vlasov-Maxwell-Landau equilibrium","venue":null,"work_id":"38dbb427-ccd6-4a99-94c7-4e8271febbb9","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:e01ce5eb209c8d288464ee64bcdc26d5e280e26412de82165205364dcc651664","observation_id":"fdc7e3da-f582-4731-98ee-fdb07837b709","resolution":{"observed_at":"2026-07-02T08:36:48.593418Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.19459","last_updated":"2026-04-21T13:37:49Z","snapshot_observed_at":"2026-07-06T23:06:07.161558Z","submitted_at":"2026-04-21T13:37:49Z","title":"Do LLMs Game Formalization? Evaluating Faithfulness in Logical Reasoning","version":1},"cited_work":{"arxiv_id":"2604.19459","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.19459","snapshot_observed_at":"2026-07-02T08:36:48.566386Z","title":"Do LLMs Game Formalization? Evaluating Faithfulness in Logical Reasoning","venue":"cs.AI","work_id":"e3797fac-f960-4f95-a9e5-9431c84dd0f9","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2604.19459","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:78be0fc4e7d2c0ec9f90aaad7d881586ba6961e52d6b23d51f16e285dafda1af","observation_id":"ca12015a-b2ca-43ab-bf38-e1001c110bdf","resolution":{"observed_at":"2026-07-02T08:36:48.568140Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"LeanAgent: Lifelong learning for formal theorem proving","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:9a6efc369fa522ff81d018360c89ebc6d849ac8df0aa78e69eb68bbf1ced731e","observation_id":"40c35ab3-f2d5-421e-a3f6-78daed42efff","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"Asymptotic Methods in Statistical Decision Theory","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:279b20d6940c1ff8ec52a92e53cc1712caf19a50760c9ba1bfaf7368342fa466","observation_id":"796a6f28-181f-4d47-b067-e21550dec945","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"Asymptotics in statistics: some basic concepts","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:2100488d665be7c98a7746fbfbd21cb7cdf7f7c1f86cfc8e3d6d7c8414b87eab","observation_id":"f5a9e666-d3d5-4ee0-bd36-6058ca47ff7b","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"Autoformalize mathematical statements by symbolic equivalence and semantic consistency","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:44e61205c864fe5f774ca5252659e8ba610e8258a8edf5211f1c3a08ef1c0822","observation_id":"25432045-d5f0-47cd-a56e-51b0c6a3435a","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03613","last_updated":"2025-08-05T16:28:22Z","snapshot_observed_at":"2026-08-02T23:39:36.635461Z","submitted_at":"2025-08-05T16:28:22Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction","version":1},"cited_work":{"arxiv_id":"2508.03613","doi":"10.48550/arxiv.2508.03613","metadata_source":"pith","pith_arxiv_id":"2508.03613","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction","venue":"cs.LG","work_id":"cfdb69bb-3c0b-41d3-bd34-3167a6931bb2","year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2508.03613","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:5219e034db9de23a0c87cf4ad187809a1492cc492b174ce14fdfa4d02232f944","observation_id":"e6c09380-279b-4c4f-a34a-f1f2c47b107f","resolution":{"observed_at":"2026-07-02T08:36:48.571666Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:11.143969+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:11.143969+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.14027","doi":"10.48550/arxiv.2601.14027","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Numina-Lean-Agent: An Open and General Agentic Reasoning System for Formal Mathematics","venue":"arXiv (Cornell University)","work_id":"34238340-e9f4-4013-858e-3d9d2c91ae53","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:5a12b7989ddbc93f28303b528921c2d1ead665e710fb31f67a979a68b58862b1","observation_id":"9bff51ed-826e-42b0-8021-e79185e52ba8","resolution":{"observed_at":"2026-07-02T08:36:48.578010Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.23002","last_updated":"2026-04-24T20:47:22Z","snapshot_observed_at":"2026-07-06T23:09:19.041332Z","submitted_at":"2026-04-24T20:47:22Z","title":"FormalScience: Scalable Human-in-the-Loop Autoformalisation of Science with Agentic Code Generation in Lean","version":1},"cited_work":{"arxiv_id":"2604.23002","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.23002","snapshot_observed_at":"2026-07-02T08:36:48.563605Z","title":"FormalScience: Scalable Human-in-the-Loop Autoformalisation of Science with Agentic Code Generation in Lean","venue":"cs.AI","work_id":"8f67f910-1e6e-40eb-976f-60c49c749934","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2604.23002","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:5b878be2fe720397b28ab74d2969298043433a30e23928c4d5cdb8aa7137b438","observation_id":"526b5022-107c-4989-8e1d-e06ac5320b57","resolution":{"observed_at":"2026-07-02T08:36:48.565341Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"The Lean 4 theorem prover and programming language","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:61cd4b36ecaaaf8e1396db9321d73983912eb8936f41d3204609d609d906a1e7","observation_id":"77b412d1-9614-4963-88be-7be506442cbe","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"Paulson, and Markus Wenzel","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:a1bd32c8ee74214942ca32591d63816041a64b486598ee5887f7685a878d67f5","observation_id":"8389be22-905e-4557-bcf1-cecfaddb9c39","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"Apollo: Automated LLM and Lean collaboration for advanced formal reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:65ae3d1c63cc3e74f11a55d33748a0cb97faae2371edafb6e72a83693d8f3f46","observation_id":"33a670cc-984b-4d2e-8841-6a5d49fba32d","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21801","last_updated":"2025-07-18T08:20:23Z","snapshot_observed_at":"2026-08-02T11:46:58.603316Z","submitted_at":"2025-04-30T16:57:48Z","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","version":2},"cited_work":{"arxiv_id":"2504.21801","doi":"10.48550/arxiv.2504.21801","metadata_source":"pith","pith_arxiv_id":"2504.21801","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","venue":"cs.CL","work_id":"3579ad7c-ab73-41db-801b-bf86628c5c02","year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:79c2a9965abd2d720314d122052de0f2b1e395f0f51cc572d45a447418bf364d","observation_id":"4aa0f7c2-b8dc-4b57-9076-241d11bd9acd","resolution":{"observed_at":"2026-07-02T08:36:48.557446Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:13.361719+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:13.361719+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.12534","last_updated":"2025-05-11T09:58:48Z","snapshot_observed_at":"2026-08-04T18:01:59.080045Z","submitted_at":"2024-04-18T22:54:08Z","title":"Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean","version":3},"cited_work":{"arxiv_id":"2404.12534","doi":"10.48550/arxiv.2404.12534","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.12534","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lean copilot: Large language models as copilots for theorem proving in lean","venue":"arXiv (Cornell University)","work_id":"eb0dfb99-78da-4194-9a5e-3dac04a7ee6f","year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2404.12534","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:b8b1db8d0d3c841d40899716f9107d68f9b5586b7dbe9c9e54248e52b4e732a8","observation_id":"fbf29544-68bc-488a-8dab-7f4d01d733e2","resolution":{"observed_at":"2026-07-02T08:36:48.553589Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19605","last_updated":"2026-05-24T18:17:33Z","snapshot_observed_at":"2026-07-06T20:58:23.695292Z","submitted_at":"2025-03-25T12:40:43Z","title":"Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integral","version":5},"cited_work":{"arxiv_id":"2503.19605","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.19605","snapshot_observed_at":"2026-07-02T08:36:48.557970Z","title":"Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integral","venue":"cs.LG","work_id":"b004afcb-e402-488b-8497-681a84b50084","year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2503.19605","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:16c8db1388c4b280ca15cc30d7833dee41380603ca63239b5e1145ae68eea519","observation_id":"a54189a7-b196-4b0f-8fe3-c4d7778aebda","resolution":{"observed_at":"2026-07-02T08:36:48.559514Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"The Lean mathematical library","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:ac3beec24de0e1fc665ff4f83d5edabfe2a3d05cc22b6f9a46639b65b9575b39","observation_id":"bd040f67-a2a7-48dd-8883-d74fe3693d3b","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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":"10.5281/zenodo.19256047","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Rocq prover, version 9.2.0","venue":"Zenodo (CERN European Organization for Nuclear Research)","work_id":"065e0e7a-f848-4081-b79a-97afd716bf3b","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:f43f2ad66dca4329afaed6a7f9b8695cea23a6209898c3430b42cc067dfb44d1","observation_id":"0564b830-b63f-460c-b2fe-b7e13002cd9e","resolution":{"observed_at":"2026-06-28T06:01:40.999079Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"van der Vaart","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:8c3f93873878f3dda7e90422018de6cbc426c15f36e1441d31ef3f49980543d9","observation_id":"6a35a4bf-5152-4de2-8220-22575b8448e5","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"van der Vaart and Jon A","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:39d8e3f655e9c282f835acacfe38889898ce5cd3d49b76457dfbcd21953c0734","observation_id":"e6eaa78a-a8b8-434a-8a27-cb310fdbcdc4","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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":"2509.22819","doi":"10.48550/arxiv.2509.22819","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hilbert: Recursively building formal proofs with informal reasoning","venue":"ArXiv.org","work_id":"c6dcfbe8-c39f-4e3d-86de-0a29d75f8943","year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:d38309f969382145b59055d3ed237153ac4364d28122457a058347819719ee7f","observation_id":"7aa021d6-36bb-4f16-b8a5-77c768111f67","resolution":{"observed_at":"2026-07-02T08:36:48.562771Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"MA-LoT: Model-collaboration Lean-based long chain-of-thought reasoning enhances formal theorem proving","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:761f0208b7b0e40c8e5916ebac69ecf2825dbb217e6a8756e08c2924487e6463","observation_id":"75d8d365-f533-40f3-80fd-9dc650d4d71f","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"LeanDojo: Theorem proving with retrieval-augmented language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:aa604044bd40a7b7b7227e03b2621d0b22d414c9cb94509f74c05b25b6a505a5","observation_id":"24da52f0-9114-46f1-96ff-4049e4785733","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"MASA: LLM-driven multi-agent systems for autoformalization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:cfa7e4cb5cf89e2f9e233016cb51ccb3732d0f26d393da6f4b192d77d686f165","observation_id":"f1573ac6-f2b6-431a-b89a-11a7e30433d4","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.02285","last_updated":"2026-06-10T14:35:31Z","snapshot_observed_at":"2026-08-03T05:30:11.446580Z","submitted_at":"2026-02-02T16:24:53Z","title":"AI4SLT: Empirical Processes in Lean 4 for Formal Statistical Learning Theory","version":2},"cited_work":{"arxiv_id":"2602.02285","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.02285","snapshot_observed_at":"2026-07-08T17:25:12.494294Z","title":"Zhang, J","venue":"cs.LG","work_id":"b4f96485-2af1-48f2-a80b-376a35e22a1b","year":2026},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"cited_paper":"/paper/2602.02285","citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:12066040701b19655cec48b4af4d0082c0fc9b472bf7c4c4893095806a7c9e9b","observation_id":"97ff7729-272d-4a79-be22-fff729ba4078","resolution":{"observed_at":"2026-07-02T08:36:48.574786Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:52:05.192897Z","title":"In our case a git worktree on the same host, with the Lake package directory symlinked and the build cache copied for fast rebuilds","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:40e0cda8cd5748fd2ec7e1bbd9db2c21738d719cc02a9794ef155b7e7816d160","observation_id":"e671cc53-f9c1-457c-97b2-2b1069fc6d6d","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:3c49244853338a2e6313202233113e1e1c8e7dca3b738fd72b9054a9d82c01a1","observation_id":"1731b53d-a377-4bd3-a217-816d154d98c6","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","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-06-28T05:52:05.192897Z","title":"bowl-shaped","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T05:52:05.192897Z"},"links":{"citing_paper":"/paper/2606.20642"},"observation_digest":"sha256:87e31da15f7ad9390b877cee4a79e483229f75765bc3a26ab200d3a311d461e0","observation_id":"0c396f4f-25a5-4a20-9742-395b93cf3b21","resolution":{"observed_at":"2026-06-28T05:52:05.192897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.20642","last_updated":"2026-06-03T20:03:38Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-02T21:31:44.514997Z","submitted_at":"2026-06-03T20:03:38Z","title":"Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":24,"verified_exact":14,"verified_fuzzy":0},"total_outbound_references":39},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 1 inbound Pith citation observation for arXiv:2606.20642."}