{"as_of":"2026-08-07T20:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:427b7cd4a79d731a461c6e64273da171347b7795d8dc9412e317a35f12138f93","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:50:42.290920Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:45:12.458150Z","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-05-16T13:27:55.680505Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07047","snapshot_observed_at":"2026-08-06T19:45:12.458150Z","title":"Mathesis: Towards formal theorem proving from natural languages","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.04719","last_updated":"2025-07-07T07:27:45Z","snapshot_observed_at":"2026-08-06T19:38:53.449978Z","submitted_at":"2025-07-07T07:27:45Z","title":"Advocate for Complete Benchmarks for Formal Reasoning with Formal/Informal Statements and Formal/Informal Proofs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T19:45:12.458150Z"},"links":{"cited_paper":"/paper/2506.07047","citing_paper":"/paper/2507.04719"},"observation_digest":"sha256:2dfcc63eefc44b1005d342c6eea47f031569457a932a12b7bdffa8f2330b3cfc","observation_id":"1c535df0-d201-4c60-8e09-330d4e4d6be9","resolution":{"observed_at":"2026-08-06T19:45:12.458150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07047","snapshot_observed_at":"2026-08-05T22:28:12.165536Z","title":"Mathesis: Towards formal theorem proving from natural languages.arXiv preprint arXiv:2506.07047,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06926","last_updated":"2025-08-09T10:41:03Z","snapshot_observed_at":"2026-08-07T05:33:43.822779Z","submitted_at":"2025-08-09T10:41:03Z","title":"Integrating Rules and Semantics for LLM-Based C-to-Rust Translation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T22:28:12.165536Z"},"links":{"cited_paper":"/paper/2506.07047","citing_paper":"/paper/2508.06926"},"observation_digest":"sha256:dfc409ded11561e28f96a80ce3384173765f9beddb4de2285a2d667504012b35","observation_id":"b143c005-bc89-4b4c-a68e-b00d7d9f52d8","resolution":{"observed_at":"2026-08-05T22:28:12.165536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07047","snapshot_observed_at":"2026-08-04T11:31:40.086569Z","title":"Mathesis: Towards formal theorem proving from natural languages","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.04520","last_updated":"2026-07-02T09:05:29Z","snapshot_observed_at":"2026-08-04T11:31:34.257102Z","submitted_at":"2025-10-06T06:25:11Z","title":"Aria: An Agent For Retrieval and Iterative Auto-Formalization via Dependency Graph","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T11:31:40.086569Z"},"links":{"cited_paper":"/paper/2506.07047","citing_paper":"/paper/2510.04520"},"observation_digest":"sha256:8da2f16357fa302ac196d019e956a3af38c00a96e3d69ac4e7909cc558fb08be","observation_id":"dca4f4c4-e827-4a4d-b1af-461262ca4ad8","resolution":{"observed_at":"2026-08-04T11:31:40.086569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07047","snapshot_observed_at":"2026-08-03T20:43:43.527974Z","title":"Mathesis: Towards formal theorem proving from natural languages.CoRR, abs/2506.07047, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.18760","last_updated":"2026-05-29T09:54:53Z","snapshot_observed_at":"2026-08-07T08:32:25.045481Z","submitted_at":"2025-11-24T04:50:18Z","title":"HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T20:43:43.527974Z"},"links":{"cited_paper":"/paper/2506.07047","citing_paper":"/paper/2511.18760"},"observation_digest":"sha256:c08b91f170fc20d64af7e6123ad8d33abe3b1e334b26da1bce68881a38172b7c","observation_id":"ee04abcf-1a3b-4ed7-9570-81bed414fc51","resolution":{"observed_at":"2026-08-03T20:43:43.527974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"cited_work":{"arxiv_id":"2506.07047","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.07047","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","venue":null,"work_id":"cdbf34d6-c82b-4409-8060-1a0388afbb31","year":2025},"citing_paper":{"arxiv_id":"2601.13209","last_updated":"2026-05-02T15:26:09Z","snapshot_observed_at":"2026-07-06T22:42:08.271837Z","submitted_at":"2026-01-19T16:38:18Z","title":"AI for Mathematics: Progress, Challenges, and Prospects","version":5},"reference_index":161,"source":"pdf_text","source_observed_at":"2026-05-16T13:24:57.923863Z"},"links":{"cited_paper":"/paper/2506.07047","citing_paper":"/paper/2601.13209"},"observation_digest":"sha256:40c19c6596e0bcb0a8f8cb2f110c137c1d7f38ba7a7dbd55255f06c46c8579a7","observation_id":"d534cd9d-8bdd-487a-a27d-cb33bb9cca8c","resolution":{"observed_at":"2026-05-16T13:27:55.682857Z","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":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.07047","snapshot_observed_at":"2026-07-11T15:42:50.296348Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04655","last_updated":"2026-07-06T04:20:06Z","snapshot_observed_at":"2026-08-06T12:02:55.996940Z","submitted_at":"2026-07-06T04:20:06Z","title":"FormalRx: Rectify and eXamine Semantic Failures in Autoformalization","version":1},"reference_index":142,"source":"arxiv_source","source_observed_at":"2026-07-11T15:42:50.296348Z"},"links":{"cited_paper":"/paper/2506.07047","citing_paper":"/paper/2607.04655"},"observation_digest":"sha256:bcce757b9e9be27b1c85283d17e3b4c75cdcaf81dd13303dbdcd2411ba98f364","observation_id":"58baadfb-7911-40cc-b832-8eef48029dab","resolution":{"observed_at":"2026-07-11T15:42:50.296348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.07047/citation-record","integrity":"/paper/2506.07047/integrity","json":"/paper/2506.07047/citation-record.json","paper":"/paper/2506.07047"},"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-07T05:50:48.804930Z","title":"Formal mathematical reasoning: A new frontier in AI","venue":null,"work_id":"8d276baa-985b-41aa-8e08-4c00d9d9253f","year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.134922Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:a4db239c95d7a96e709b1134d7c5bf4dc938c682744fa91c75fc148b22d07780","observation_id":"05bcee8c-2d5f-493f-9b0e-d931338baee8","resolution":{"observed_at":"2026-08-07T05:50:48.889595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:48.654020Z","title":"The lean mathematical library","venue":null,"work_id":"0065d1e0-cd0e-4cc3-92cb-3b2a4c66a85c","year":2020},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.198777Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:9011dfd96d63db93249e7368af6a91b059f4b11a76c7902a0883ff1f4b7c8627","observation_id":"5a16395a-1abc-4ba0-91cc-f2c23d6a2c1d","resolution":{"observed_at":"2026-08-07T05:50:48.722946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T05:50:36.242579Z","title":"Springer, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.242579Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:b7244701a0718ddfb897471e3d893d4d42248e71f0f0db984df1502838681825","observation_id":"e8c694c1-6023-4322-bd96-f84cf33fec09","resolution":{"observed_at":"2026-08-07T05:50:36.242579Z","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-08-07T05:50:36.307173Z","title":"The coq proof assistant a tutorial","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.307173Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:4880f7c83def90ac26da31de3204fd905c8b7f13b4e532d446adbed4323dd21a","observation_id":"5c954eee-df7f-46c4-b71a-5f02f38f1769","resolution":{"observed_at":"2026-08-07T05:50:36.307173Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21801","snapshot_observed_at":"2026-08-07T05:50:36.365465Z","title":"Deepseek-prover-v2: Advancing formal mathematical reasoning via reinforcement learning for subgoal decomposition.arXiv preprint arXiv:2504.21801, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.365465Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:7dcfba7c6a34ef398864cd3045bc04b7faef27f19ddaf6b4771ecca94e27722f","observation_id":"b7394868-f82f-49dc-91be-a518ca073da1","resolution":{"observed_at":"2026-08-07T05:50:36.365465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11354","last_updated":"2025-04-15T16:23:44Z","snapshot_observed_at":"2026-08-03T03:38:06.953412Z","submitted_at":"2025-04-15T16:23:44Z","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11354","snapshot_observed_at":"2026-08-07T05:50:36.422154Z","title":"Kimina-prover preview: Towards large formal reasoning models with reinforcement learning.arXiv preprint arXiv:2504.11354, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.422154Z"},"links":{"cited_paper":"/paper/2504.11354","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:764b97df0524cdc3d0123b6931eaa22a2d949aa7cdbd6b2b2bf372aa6bb23d57","observation_id":"a0c7107e-ce95-4adf-98f4-99e4f36314d5","resolution":{"observed_at":"2026-08-07T05:50:36.422154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07640","last_updated":"2025-04-19T13:53:05Z","snapshot_observed_at":"2026-07-06T20:34:48.850154Z","submitted_at":"2025-02-11T15:27:35Z","title":"Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07640","snapshot_observed_at":"2026-08-07T05:50:36.509326Z","title":"Goedel-prover: A frontier model for open-source automated theorem proving.arXiv preprint arXiv:2502.07640, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.509326Z"},"links":{"cited_paper":"/paper/2502.07640","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:b9f7bd5e2b26a40a2bc77dde2fee41f48991c48659d82afde8a4d3638280ea35","observation_id":"ab1ef9eb-4206-400f-af07-b3d715460e26","resolution":{"observed_at":"2026-08-07T05:50:36.509326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00110","last_updated":"2022-02-28T06:03:23Z","snapshot_observed_at":"2026-08-06T09:47:40.209642Z","submitted_at":"2021-08-31T23:21:12Z","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00110","snapshot_observed_at":"2026-08-07T05:50:36.579526Z","title":"Minif2f: a cross-system benchmark for formal olympiad-level mathematics.arXiv preprint arXiv:2109.00110, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.579526Z"},"links":{"cited_paper":"/paper/2109.00110","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:100cfc3fe89020843e117fe323d91256f599dd7a46996cdb627da6165feb03eb","observation_id":"3c5baec0-9b04-4285-b11e-260c1197cb06","resolution":{"observed_at":"2026-08-07T05:50:36.579526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12433","last_updated":"2023-02-24T03:28:46Z","snapshot_observed_at":"2026-07-06T14:55:19.727805Z","submitted_at":"2023-02-24T03:28:46Z","title":"ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12433","snapshot_observed_at":"2026-08-07T05:50:36.632581Z","title":"Proofnet: Autoformalizing and formally proving undergraduate-level mathematics.arXiv preprint arXiv:2302.12433, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.632581Z"},"links":{"cited_paper":"/paper/2302.12433","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:b67b19468eb9ab292632ec753f42f430f064c395b6b0a7f59f8b791c60c054a6","observation_id":"de8f74a5-a6cb-4e09-8046-353793a8efe0","resolution":{"observed_at":"2026-08-07T05:50:36.632581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11214","last_updated":"2024-11-03T17:14:37Z","snapshot_observed_at":"2026-08-05T18:50:54.811289Z","submitted_at":"2024-07-15T19:57:15Z","title":"PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11214","snapshot_observed_at":"2026-08-07T05:50:36.692151Z","title":"Putnambench: Evaluating neural theorem-provers on the putnam mathematical competition.arXiv preprint arXiv:2407.11214, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.692151Z"},"links":{"cited_paper":"/paper/2407.11214","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:2307c9e61fd21b8f791ff824ebd09b991ea10278fb5dd69a166526801bea98d3","observation_id":"db110a9d-160a-4049-b9d8-16211cbc2dbd","resolution":{"observed_at":"2026-08-07T05:50:36.692151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10878","last_updated":"2025-02-27T07:01:28Z","snapshot_observed_at":"2026-08-06T19:54:54.569805Z","submitted_at":"2024-10-09T10:11:24Z","title":"Herald: A Natural Language Annotated Lean 4 Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10878","snapshot_observed_at":"2026-08-07T05:50:36.762208Z","title":"Herald: A natural language annotated lean 4 dataset.arXiv preprint arXiv:2410.10878, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.762208Z"},"links":{"cited_paper":"/paper/2410.10878","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:6dabade9be794c13da8fc3c0995b2f47098259c02880324211163ba183a6a01c","observation_id":"ee24dec5-d7f2-4671-81a3-0edf49ef0a2a","resolution":{"observed_at":"2026-08-07T05:50:36.762208Z","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-08-07T05:50:36.829899Z","title":"Numinamath: The largest public dataset in ai4maths with 860k pairs of competition math problems and solutions.Hugging Face repository, 13:9, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.829899Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:c25a5013dc6a5ada79d4b604b05785f3242ba880e1aee9e2d178e4ecf37e1a5f","observation_id":"698052c7-3971-43a7-841b-6a52c86b7207","resolution":{"observed_at":"2026-08-07T05:50:36.829899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03755","last_updated":"2023-11-09T09:58:15Z","snapshot_observed_at":"2026-07-06T16:44:03.023664Z","submitted_at":"2023-11-07T06:42:15Z","title":"Multilingual Mathematical Autoformalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03755","snapshot_observed_at":"2026-08-07T05:50:36.883025Z","title":"Multilingual mathematical autoformalization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.883025Z"},"links":{"cited_paper":"/paper/2311.03755","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:3ff99623867de1bdec20bec72d47e8c03adb51137beeef1bb7fbf3a3db98eb9b","observation_id":"d8364161-c690-4e77-84d9-4699d761cb2c","resolution":{"observed_at":"2026-08-07T05:50:36.883025Z","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-08-07T05:50:36.935899Z","title":"Atlas: Autoformalizing theorems through lifting, augmentation, and synthesis of data","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:36.935899Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:9c0cd55fad1c405f2c885ab632232e6ab23890526bfef3a836768c57e60a07d6","observation_id":"d280d6af-4783-4aed-b6f2-a2cac83cb4b1","resolution":{"observed_at":"2026-08-07T05:50:36.935899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.10962","last_updated":"2025-05-16T07:56:03Z","snapshot_observed_at":"2026-08-07T15:44:48.892414Z","submitted_at":"2025-05-16T07:56:03Z","title":"MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.10962","snapshot_observed_at":"2026-08-07T05:50:37.013730Z","title":"Mps-prover: Advancing stepwise theorem proving by multi-perspective search and data curation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.013730Z"},"links":{"cited_paper":"/paper/2505.10962","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:316a5d8e8622a318ce55efd844b48918992b20a4f2c45ca98a1f13b68fee1d8e","observation_id":"d743b85d-b090-4b1d-a8bf-bcfdb6271a56","resolution":{"observed_at":"2026-08-07T05:50:37.013730Z","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-08-07T05:50:37.074901Z","title":"Bfs-prover: Scalable best-first tree search for llm-based automatic theorem proving","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.074901Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:4ccaf56d2193a60e1f37fa10f1b1a4cc5b012ca2a444adc8509e9c41cf4d5739","observation_id":"5bb78a4c-4623-4e56-9777-c241ac654cc3","resolution":{"observed_at":"2026-08-07T05:50:37.074901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-07T05:50:37.158535Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving.arXiv preprint arXiv:2412.20735, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.158535Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:51b193af1caee0055adca8c82e92beec6817c4c1baef1a8a40bb602bbdb1ec3a","observation_id":"4c7f8f53-b7b0-4856-b7c2-aca6d19e0681","resolution":{"observed_at":"2026-08-07T05:50:37.158535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18310","last_updated":"2025-06-06T13:30:31Z","snapshot_observed_at":"2026-08-06T23:03:00.486036Z","submitted_at":"2025-01-30T12:37:06Z","title":"ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18310","snapshot_observed_at":"2026-08-07T05:50:37.246144Z","title":"Efficient neural theorem proving via fine-grained proof structure analysis.arXiv preprint arXiv:2501.18310, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.246144Z"},"links":{"cited_paper":"/paper/2501.18310","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:63d365fa5bef83bb47f08c67de17c2a6fe5e8d63884c94ac526467639e28cf5b","observation_id":"f1a947d8-2868-4d9b-ab75-4f139789a856","resolution":{"observed_at":"2026-08-07T05:50:37.246144Z","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-07T05:50:48.462778Z","title":"Carts: Advancing neural theorem proving with diversified tactic calibration and bias- resistant tree search","venue":null,"work_id":"3afe70a8-f916-4020-9f4a-797615815066","year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.373142Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:282d4b1b44353f69a910b7e0634324191dfa5701fdcd6807de559a07a91aa2c1","observation_id":"1eea232b-6c6f-488c-85e6-baaa5b975d15","resolution":{"observed_at":"2026-08-07T05:50:48.545084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2305.16366","last_updated":"2023-05-25T11:35:52Z","snapshot_observed_at":"2026-07-06T15:33:34.832607Z","submitted_at":"2023-05-25T11:35:52Z","title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16366","snapshot_observed_at":"2026-08-07T05:50:37.459534Z","title":"Decomposing the enigma: Subgoal-based demonstration learning for formal theorem proving.arXiv preprint arXiv:2305.16366, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.459534Z"},"links":{"cited_paper":"/paper/2305.16366","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:6cc045f2754790d20ba8e7393174cb5bd0e35c359d27b1ed2970944ed3b1b41b","observation_id":"e07071c2-82e2-49eb-869d-280508153009","resolution":{"observed_at":"2026-08-07T05:50:37.459534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-04T09:49:13.140822Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-07T05:50:37.582568Z","title":"Lego-prover: Neural theorem proving with growing libraries.arXiv preprint arXiv:2310.00656, 2023","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.582568Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:bc0c9974232afd4b9bc9fbdae98d25684f3ba7253fd732eccee1946e3710d1b7","observation_id":"d2058df4-a660-4a3f-874a-272d5e29756d","resolution":{"observed_at":"2026-08-07T05:50:37.582568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12283","last_updated":"2023-02-20T16:10:20Z","snapshot_observed_at":"2026-07-06T14:08:57.404437Z","submitted_at":"2022-10-21T22:37:22Z","title":"Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12283","snapshot_observed_at":"2026-08-07T05:50:37.674228Z","title":"Draft, sketch, and prove: Guiding formal theorem provers with informal proofs.arXiv preprint arXiv:2210.12283, 2022","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.674228Z"},"links":{"cited_paper":"/paper/2210.12283","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:6aeb42c9dd37f800e1fddd9bc540808ebca7070f362724a05c6b19f5983e8925","observation_id":"80630227-d98b-4a07-b4a9-eb531ca127da","resolution":{"observed_at":"2026-08-07T05:50:37.674228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08152","last_updated":"2024-08-15T13:40:03Z","snapshot_observed_at":"2026-07-06T19:01:06.124684Z","submitted_at":"2024-08-15T13:40:03Z","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08152","snapshot_observed_at":"2026-08-07T05:50:37.770014Z","title":"Deepseek-prover-v1","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.770014Z"},"links":{"cited_paper":"/paper/2408.08152","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:6ed9c1976f837ab1062d3f562b27843f72179a7387521cd5a4c27cf8e62ebe48","observation_id":"74fc557b-0362-4402-a155-a95122ec2aa9","resolution":{"observed_at":"2026-08-07T05:50:37.770014Z","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-07T05:50:48.281432Z","title":"Autoformalization with large language models.Advances in Neural Information Processing Systems, 35:32353–32368, 2022","venue":null,"work_id":"0b283b97-0ec8-4c12-983f-66b9eb3fb03c","year":2022},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.833381Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:d53ba1c62346e6b7cb7453706ca35b521f01ffac3358eb95052283d490f8be9f","observation_id":"a2279ac1-3080-4c12-8b4b-a5bdb7660473","resolution":{"observed_at":"2026-08-07T05:50:48.365527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:48.126065Z","title":"The Claude 3 model family: Opus, Sonnet, Haiku","venue":null,"work_id":"98c4af27-75de-4d0e-91a8-f8274df57851","year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:37.963295Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:372a7d3c31d9628a2a4ef005c9094d1b6650447e7708483373a28e07a81f8aed","observation_id":"6b717b6f-5ae0-4622-ad4b-97c0799155c6","resolution":{"observed_at":"2026-08-07T05:50:48.202263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:47.898647Z","title":"DeepSeek-R1: Incentivizing reasoning capability in LLMs via reinforcement learning, 2025","venue":null,"work_id":"d9b03bcc-09d9-41a7-ad26-f11d93aa63c5","year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.052360Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:62ded3a11f8f295d9b0107d541ec913418eca8c9d10fda59dea64518f3c5795d","observation_id":"51d7b07c-5a26-4e6e-8d18-539e333fee6b","resolution":{"observed_at":"2026-08-07T05:50:48.025766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:47.711077Z","title":null,"venue":null,"work_id":"8bd8f646-104d-4e7b-9998-f9c692f8fd6a","year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.180713Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:12c32a2ba237f4562927a5a3e1eaecb4c8e321e12f87582a5d333d15e9040fa9","observation_id":"73d22d98-e1e0-4404-8c51-7a7c245f5975","resolution":{"observed_at":"2026-08-07T05:50:47.784996Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2203.05794","last_updated":"2022-03-11T08:35:15Z","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T08:35:15Z","title":"BERTopic: Neural topic modeling with a class-based TF-IDF procedure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.05794","snapshot_observed_at":"2026-08-07T05:50:38.314644Z","title":"Bertopic: Neural topic modeling with a class-based tf-idf procedure","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.314644Z"},"links":{"cited_paper":"/paper/2203.05794","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:662d43deac51a89c49a41cde16e18b07af645facf506f69295ef2c16e7f13e15","observation_id":"edd21762-19a3-4c28-8fec-810b2a709701","resolution":{"observed_at":"2026-08-07T05:50:38.314644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03847","last_updated":"2025-06-18T16:07:47Z","snapshot_observed_at":"2026-08-04T21:20:03.990804Z","submitted_at":"2024-06-06T08:25:43Z","title":"Lean Workbook: A large-scale Lean problem set formalized from natural language math problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03847","snapshot_observed_at":"2026-08-07T05:50:38.418249Z","title":"Lean workbook: A large-scale lean problem set formalized from natural language math problems.arXiv preprint arXiv:2406.03847, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.418249Z"},"links":{"cited_paper":"/paper/2406.03847","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:30935575e5acb444b915f9aa2407605c6944f976db46aac2958f1327cec29f3c","observation_id":"9f65112d-f25c-4bbd-944b-af4c9112077c","resolution":{"observed_at":"2026-08-07T05:50:38.418249Z","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-08-07T05:50:38.553707Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.553707Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:feb88be3d90ce3ae5806a73915fe2dc0a8f19bfeba497dfce590e9e2efc56289","observation_id":"f48e558f-9701-42aa-95fc-ef2359ebc624","resolution":{"observed_at":"2026-08-07T05:50:38.553707Z","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-08-07T05:50:38.678554Z","title":"Training language models to follow instructions with human feedback.Advances in neural information processing systems, 35:27730–27744, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.678554Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:e67164e985465b28862e55bcc16a6a988de591300863eeee65c5a75df55c2b79","observation_id":"4257dc0e-42cf-4522-b6cb-029e6747d77f","resolution":{"observed_at":"2026-08-07T05:50:38.678554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.12854","last_updated":"2025-07-28T17:46:50Z","snapshot_observed_at":"2026-08-07T16:58:56.832845Z","submitted_at":"2025-03-17T06:28:25Z","title":"Enhancing LLM Reasoning with Iterative DPO: A Comprehensive Empirical Investigation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.12854","snapshot_observed_at":"2026-08-07T05:50:38.778526Z","title":"Enhancing llm reasoning with iterative dpo: A comprehensive empirical investigation.arXiv preprint arXiv:2503.12854, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.778526Z"},"links":{"cited_paper":"/paper/2503.12854","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:0a65ce10b5c1e89efac7b44b69d92020dafb2c62a24ca29fce3a1708066ebc08","observation_id":"beacce03-b4a2-4061-b7a1-b2e2731349e0","resolution":{"observed_at":"2026-08-07T05:50:38.778526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18248","last_updated":"2024-07-25T17:59:16Z","snapshot_observed_at":"2026-08-05T00:01:46.859793Z","submitted_at":"2024-07-25T17:59:16Z","title":"Self-Training with Direct Preference Optimization Improves Chain-of-Thought Reasoning","version":1},"cited_work":{"arxiv_id":"2407.18248","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.18248","snapshot_observed_at":"2026-08-07T05:50:42.560369Z","title":"Self-Training with Direct Preference Optimization Improves Chain-of-Thought Reasoning","venue":"cs.CL","work_id":"5a00d22a-3da5-40da-abdd-242197a86a9d","year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:38.943317Z"},"links":{"cited_paper":"/paper/2407.18248","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:510b3e74cf5d819b9b80e1a2ea4b8fe9d8a27b5343035cdfd04c7fe5e4c0d1f9","observation_id":"82bb1ed3-d7fd-4eff-b99b-7a65b964e075","resolution":{"observed_at":"2026-08-07T05:50:42.695376Z","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-08-07T05:50:39.056612Z","title":"Pre-dpo: Improving data utilization in direct preference optimization using a guiding reference model.arXiv preprint arXiv:2504.15843, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.056612Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:05bc96b4f77fb334194bd2628f14b50f86d170bce9c2175d7b9627c70d313aaf","observation_id":"669892cd-5c27-4905-9082-47891c6b5d76","resolution":{"observed_at":"2026-08-07T05:50:39.056612Z","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-07T05:50:47.472846Z","title":"Theory of fuzzy integrals and its applications.Doctoral Thesis, Tokyo Institute of Technology, 1974","venue":null,"work_id":"b9655a1a-0b01-4de2-92eb-cccd4a9f27f7","year":1974},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.195245Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:2b6d8e38fe2b1490e0d7f22dcb46ac630a847c16d481e6d5e7c133b24b290c89","observation_id":"9bbb2442-b1b8-4242-b5dd-532164fab24a","resolution":{"observed_at":"2026-08-07T05:50:47.576647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:47.240905Z","title":"Application of the sugeno integral in fuzzy rule-based classification.Applied Soft Computing, 167:112265, 2024","venue":null,"work_id":"e6620793-9ad3-4532-a5d0-24e771c0eb46","year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.342830Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:b716cf10481c5077e1d9298e487c23cad92e1b992d9bac24fdc42d4a951cf3fb","observation_id":"a95ca5ec-1c2f-4299-b1d9-50491465851b","resolution":{"observed_at":"2026-08-07T05:50:47.358074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2409.12122","last_updated":"2024-09-18T16:45:37Z","snapshot_observed_at":"2026-07-06T19:17:41.512834Z","submitted_at":"2024-09-18T16:45:37Z","title":"Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvement","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12122","snapshot_observed_at":"2026-08-07T05:50:39.489541Z","title":"Qwen2.5-math technical report: Toward mathematical expert model via self-improvement.arXiv preprint arXiv:2409.12122, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.489541Z"},"links":{"cited_paper":"/paper/2409.12122","citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:ef8178fa4a7436a97c5b320149b0b8663ede0fb08578ff8ec77960e9b6185375","observation_id":"b55d7aa3-c848-49bb-a308-9662483ef43d","resolution":{"observed_at":"2026-08-07T05:50:39.489541Z","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-08-07T05:50:39.623991Z","title":"Deepseek-v3 technical report, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.623991Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:dfbd7d46e1dd3fe2dd9d3cf09a403c15eaf0ef990b640a1c97e4dee5fc372bbc","observation_id":"d30a6fa5-7c4d-4eed-85df-45911afd7663","resolution":{"observed_at":"2026-08-07T05:50:39.623991Z","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-07T05:50:47.048278Z","title":"Kimi k1.5: Scaling reinforcement learning with LLMs, 2025","venue":null,"work_id":"9f79e74d-7e1f-431e-a6a9-a6e3c4577b3f","year":2025},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.757372Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:14c9bf0fa760babfbe3a4dd8fbca1c5e0ebaabf0802e08ecf0420a8e6ff95ff1","observation_id":"d4e79df5-902f-46a6-ac17-5f2d02f20895","resolution":{"observed_at":"2026-08-07T05:50:47.122190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-07T05:50:39.856684Z","title":"Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.856684Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:cbbe03c6bddcae2f3e8c9f686b66a35c49cc09ade216e4e7a6c39e7d70a998a9","observation_id":"fcdd6394-64b4-42ce-a7e8-302f1a0482d5","resolution":{"observed_at":"2026-08-07T05:50:39.856684Z","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-08-07T05:50:39.936764Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:39.936764Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:5362c4c0891f15cc9f89f3ac79259f4fd9aab84586a396b429d99ca81426dad8","observation_id":"d2951e4d-c24b-4fed-acb2-ea203bc38039","resolution":{"observed_at":"2026-08-07T05:50:39.936764Z","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-07T05:50:46.801155Z","title":null,"venue":null,"work_id":"1b802daf-39d9-4842-a663-ab9065fdda7d","year":2020},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.051293Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:2787ecfe71ac4c6d7fa4dc85abe435fedb7c0e752e7001b85d11d1444b168af8","observation_id":"01a66eab-e67a-45af-8cce-3751135f225d","resolution":{"observed_at":"2026-08-07T05:50:46.919021Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:46.574464Z","title":"Trl: Transformer reinforcement learning.https://github.com/huggingface/trl, 2020-2024","venue":null,"work_id":"ca1c79f2-b32b-4cd4-858b-71bbc207443a","year":2020},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.161917Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:aa1b02ee4a4a978c03a9ecedc76046d8e2c09ab6bbd8770dc51a38ea26e1e365","observation_id":"9e27a981-eda9-4dd2-8b07-5fbd184d43be","resolution":{"observed_at":"2026-08-07T05:50:46.700782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:46.377923Z","title":"Experiment tracking with weights and biases","venue":null,"work_id":"eb5aea66-c913-4cab-ab1f-61eb25e253fb","year":2020},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.270316Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:cd024ec50e60ceca0cee8eaf798db2f22a2038fa2b20e545718720f596fcc9d8","observation_id":"c4867639-dca6-4b3f-a45e-f39353862d1c","resolution":{"observed_at":"2026-08-07T05:50:46.475780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:46.216702Z","title":null,"venue":null,"work_id":"145952f1-3245-418f-be0b-f6d85530b244","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.352823Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:c4d2e584f621d77950bc20dcabfe76ab4fb54683dca237777fc0320507f77438","observation_id":"5870205e-4cfa-45ea-8c8c-7d00addc7d73","resolution":{"observed_at":"2026-08-07T05:50:46.304078Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:45.978587Z","title":null,"venue":null,"work_id":"b1e50709-fe02-47dc-ad0e-cebd56d29d04","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.456877Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:3c0bd9997f08ded48541f4876ec245ff56d6c160a28cb0265d4848b679b1d19e","observation_id":"5e9e7f32-0747-45a7-b925-b8419a58e0e2","resolution":{"observed_at":"2026-08-07T05:50:46.099733Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:45.755387Z","title":null,"venue":null,"work_id":"3f5b90b9-1298-4d2c-a35e-0988bc4aef77","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.563780Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:c26cef21576bc34081e29ee7593bd654b4e23d851ea2492ac78a6da38f55f392","observation_id":"60c01a48-ad17-4e77-934f-438303439c33","resolution":{"observed_at":"2026-08-07T05:50:45.865122Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:45.557903Z","title":null,"venue":null,"work_id":"7701094a-1c6c-4fc7-9337-14d398e82ac8","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.712879Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:2d54cbfe5efb87b675df2ff0af3ca8362dfd0351f4f847e725c6fd7f21ee4297","observation_id":"96155911-8264-4f3a-843f-c07bf0de3390","resolution":{"observed_at":"2026-08-07T05:50:45.656512Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:45.338138Z","title":":= by sorry","venue":null,"work_id":"2693bf3a-c61c-4fd3-a8d4-d24d4269e262","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.830640Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:7c8a32e3ec7b3053362b643a95a4e7cbde5a25248edd612e56520d5485f76ed3","observation_id":"31c7a83c-4872-4a92-b9f7-e169bf4182cd","resolution":{"observed_at":"2026-08-07T05:50:45.466427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:45.167636Z","title":"Please evaluate whether the formal LEAN statement appropriately translates the natural language statement based on the following criteria","venue":null,"work_id":"174b170d-fdb4-4bc9-bede-afc85427cfe3","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:40.912057Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:1b60b90963d9b61985602434b0aea92cdc6e3f4f2b556dd8c36b0679ab8ff64e","observation_id":"feb8319e-46ad-47e5-8cbb-2d1e1d20b166","resolution":{"observed_at":"2026-08-07T05:50:45.256263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:44.949666Z","title":null,"venue":null,"work_id":"0146081f-d3a0-41c4-b8b8-e4cbb4e00a2d","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.028282Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:ef64663cbed905106660acf8100878ae8e39cda6ad66fdfb9f9906c7f091cce4","observation_id":"6a6f59b7-d892-4a77-8b9e-e432e0e87587","resolution":{"observed_at":"2026-08-07T05:50:45.027508Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:44.707354Z","title":null,"venue":null,"work_id":"36c37747-9d45-44d2-a63b-1da609c46f33","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.120071Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:52f016256583f4095c488669094b7e869f7ef7373d57bf430648ef24835b77fe","observation_id":"b6aa76f9-db7c-499d-b395-0e6ec633458d","resolution":{"observed_at":"2026-08-07T05:50:44.808612Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:44.473184Z","title":null,"venue":null,"work_id":"b9ac0ca5-c8af-42d0-bdd3-f4b1243aca76","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.214493Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:8596c0bf6fc8b53c831571a2e80f79661b5592634bc536d2106d4b27c2f49c0d","observation_id":"3097b18b-9896-46ce-a536-1305559377fb","resolution":{"observed_at":"2026-08-07T05:50:44.589016Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:44.273133Z","title":"opposite angles/sides","venue":null,"work_id":"3e341dbe-ead6-4611-8d0d-bf545cc3a8b0","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.313154Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:32ea63359a74286834bded0e349c2164d1c742cc76269a0c7e531a4fa1025db2","observation_id":"6e75596f-2a8b-4ad3-96ce-b15647f75758","resolution":{"observed_at":"2026-08-07T05:50:44.396148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:44.030629Z","title":"- Lean: ‘(hq : 1 < q)’","venue":null,"work_id":"a66b81d6-ee73-4f70-8000-686f84f75551","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.455707Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:3fe50ef066f938c4ee867c2d6b4656d00aaf2d07d5a9c68b4c7a8e866e02a6e7","observation_id":"48163c34-8265-4127-828c-406b71ccc241","resolution":{"observed_at":"2026-08-07T05:50:44.157013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:43.870305Z","title":"- Lean: ‘(hn : 1 < n)’","venue":null,"work_id":"d1e3104a-f48c-40bb-8680-4f7c2ecd5462","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.582082Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:0c16621ec307653e5a8b31fee7e690406dfa9e3cb51696300753d5d7dd8a6802","observation_id":"f1be11e6-4c77-482a-ac02-3387937dba22","resolution":{"observed_at":"2026-08-07T05:50:43.956089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:43.714019Z","title":"- Lean: ‘(M : FinsetN:= Finset.range q)’","venue":null,"work_id":"f8f78af5-3c23-4975-a4d0-a29684206c51","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.736936Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:67e2b817a61ef8aeadf67af945a287d7cdb5a33426275f34a69be606d805936e","observation_id":"852e838d-3198-48a6-85de-c799aa95abb2","resolution":{"observed_at":"2026-08-07T05:50:43.783654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:43.513422Z","title":"- Lean: ‘A : Set N := {x | ∃ (x_vec : N→N ), (∀ i, x_vec i ∈ M) ∧ x = P i in Finset.range n, x_vec(i + 1) * q ^i}’","venue":null,"work_id":"6154cbc4-ed5f-405c-a3c9-f0d0e4b9957f","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.859287Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:42a320772cd6655bbb13fa45481765f85a0e43b40c1fc31d08e06b742bcb896b","observation_id":"97aa0e7f-e48f-43c2-bf42-08c4c026d184","resolution":{"observed_at":"2026-08-07T05:50:43.619049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:43.350345Z","title":"- Lean: ‘s = P i in Finset.range n, a (i + 1) * q ^i’, ‘t = P i in Finset.range n, b (i + 1) * q ^i’, with ‘∀i, a i∈M’ and ‘∀i, b i∈M’","venue":null,"work_id":"8e878917-5062-43df-a4b1-2a637f3b149f","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:41.989868Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:ac3c41612a3d7316adccc35ad4ea28237d220ce3452789cdc012461094c2ec7f","observation_id":"c2349b89-820c-4289-8b88-30065eeacbe6","resolution":{"observed_at":"2026-08-07T05:50:43.438897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:43.172975Z","title":"- Lean: ‘(hab : a n < b n)’","venue":null,"work_id":"35adc172-62b5-40c1-9b9f-c0a8e133f57d","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:42.136302Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:c60cc182347ecd17ab48d338ed4dfe0a0ee597d41d748766ff74fda8c53363ac","observation_id":"2f6b8197-587a-4a4e-96ac-d1ff36928e30","resolution":{"observed_at":"2026-08-07T05:50:43.257875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:50:43.054609Z","title":"- Lean: ‘s <= t’","venue":null,"work_id":"2dc0e039-a7f4-448b-bc16-3988f06b8a9a","year":null},"citing_paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T05:50:42.290920Z"},"links":{"citing_paper":"/paper/2506.07047"},"observation_digest":"sha256:ea8eb599f5186ca6f412a7301f874759dbd18e76dd127f28451e5541a0df45c0","observation_id":"78ef4e67-4e8a-4d04-b29e-e34c43438ecc","resolution":{"observed_at":"2026-08-07T05:50:43.099101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2506.07047","last_updated":"2025-06-08T09:04:14Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T05:40:58.238740Z","submitted_at":"2025-06-08T09:04:14Z","title":"Mathesis: Towards Formal Theorem Proving from Natural Languages"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":61},"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 61 of 61 outbound references and 6 inbound Pith citation observations for arXiv:2506.07047."}