{"as_of":"2026-08-23T22:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf147094ce40ade89fc9811b17309255c046a23db207108444f6e30e06b6a516","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T10:30:44.735604Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":40,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:11:38.192972Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-07T14:34:06.418482Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18492","last_updated":"2026-06-30T15:33:33Z","snapshot_observed_at":"2026-08-13T18:45:46.181688Z","submitted_at":"2025-05-24T03:52:25Z","title":"Formally Solving Answer-Construction Problems in Lean","version":6},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T14:34:06.418482Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2505.18492"},"observation_digest":"sha256:509d8aadce7f170af27687164cfe18e2be40620dfb65d54c0639bfff78a87996","observation_id":"df4cdbc7-90bd-4b69-bcfe-150180358098","resolution":{"observed_at":"2026-08-07T14:34:06.418482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T18:29:15.640959Z","title":"Art of Problem Solving","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.14644","last_updated":"2025-08-20T11:55:19Z","snapshot_observed_at":"2026-08-15T06:07:09.904480Z","submitted_at":"2025-08-20T11:55:19Z","title":"LeanGeo: Formalizing Competitional Geometry problems in Lean","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T18:29:15.640959Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2508.14644"},"observation_digest":"sha256:108408caf0c383208ac84845a4485ba81e190bc08c3116bdcc2c00812c2aa671","observation_id":"e5a79f9f-ed3c-4925-9f8c-e20a5e5ba41f","resolution":{"observed_at":"2026-08-05T18:29:15.640959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2510.01346","last_updated":"2025-10-10T20:12:14Z","snapshot_observed_at":"2026-08-23T17:05:08.642901Z","submitted_at":"2025-10-01T18:21:13Z","title":"Aristotle: IMO-level Automated Theorem Proving","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-15T08:51:37.827144Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2510.01346"},"observation_digest":"sha256:5413b50f947956338f91c47064c353bc1d987429b28ad9729350ff831e6bbf45","observation_id":"54ffb43a-0d43-4575-ba51-d20e38a51236","resolution":{"observed_at":"2026-05-15T08:51:38.019630Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-04T11:31:37.421643Z","title":"Seed- Prover : Deep and Broad Reasoning for Automated Theorem Proving , August 2025","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-17T01:38:39.465410Z","submitted_at":"2025-10-06T06:25:11Z","title":"Aria: An Agent For Retrieval and Iterative Auto-Formalization via Dependency Graph","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T11:31:37.421643Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2510.04520"},"observation_digest":"sha256:220268e8f83d5d377729d3908e495d995f748552b1de9a863fdfc751b92ef3ec","observation_id":"027caf48-0a0c-404c-8d98-20e68c9873e8","resolution":{"observed_at":"2026-08-04T11:31:37.421643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2510.12787","last_updated":"2026-05-22T10:39:41Z","snapshot_observed_at":"2026-08-15T15:11:46.787854Z","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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T07:46:30.936002Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2510.12787"},"observation_digest":"sha256:2cf616f60aaedd9d5ebce0712febbdc99f235a1734e697b37c52e494fc222b7f","observation_id":"1be85c56-c33a-4903-9e0d-5fea6eccf2cd","resolution":{"observed_at":"2026-05-25T07:46:42.293176Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-03T20:43:43.492098Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving.CoRR, abs/2507.23726, 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-21T06:52:43.363402Z","submitted_at":"2025-11-24T04:50:18Z","title":"HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T20:43:43.492098Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2511.18760"},"observation_digest":"sha256:712375c0ac82684316e24a1e8bb18c1dd42f1dbdb76669bd721d3aba22547350","observation_id":"018682fd-97a1-4686-a51a-7b2bbaa3d7cc","resolution":{"observed_at":"2026-08-03T20:43:43.492098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-04T06:40:23.612497Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving.arXiv preprint arXiv:2507.23726, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.10739","last_updated":"2026-08-03T08:17:50Z","snapshot_observed_at":"2026-08-16T02:54:35.299466Z","submitted_at":"2025-12-11T15:26:28Z","title":"Intern-S1-MO: Long-horizon Reasoning Agent for Olympiad?Level Mathematical Problem Solving","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T06:40:23.612497Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2512.10739"},"observation_digest":"sha256:d0f95c766bdccc495475b80360b09656483e6ee868deb6a7f0fcc3c53d9cdefb","observation_id":"29799628-afe5-4a3d-9348-6e5c57770324","resolution":{"observed_at":"2026-08-04T06:40:23.612497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2512.18857","last_updated":"2026-05-07T11:50:40Z","snapshot_observed_at":"2026-08-19T21:20:56.873761Z","submitted_at":"2025-12-21T19:01:35Z","title":"CORE: Concept-Oriented Reinforcement for Bridging the Definition-Application Gap in Mathematical Reasoning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T20:25:35.573805Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2512.18857"},"observation_digest":"sha256:63f92dab113b432ecb504914f09fddaf5e6ef51152449d68cc5fdbb100878649","observation_id":"a85cf655-c58f-42ff-a5c5-3eaea53a4d8b","resolution":{"observed_at":"2026-05-16T20:28:24.102168Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-03T01:09:03.382579Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.10538","last_updated":"2026-05-22T18:21:47Z","snapshot_observed_at":"2026-08-21T22:41:46.362681Z","submitted_at":"2026-02-11T05:22:24Z","title":"Why Agentic Theorem Prover Works: A Statistical Provability Theory of Mathematical Reasoning Models","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T01:09:03.382579Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2602.10538"},"observation_digest":"sha256:519a890e4f86a054aee9553a80b2c33c7142091f334c6c5cd1470c1132bcf2ca","observation_id":"0f245968-8a2f-407a-af31-bffd098f1eed","resolution":{"observed_at":"2026-08-03T01:09:03.382579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2602.24273","last_updated":"2026-05-14T16:23:55Z","snapshot_observed_at":"2026-08-15T04:03:37.203141Z","submitted_at":"2026-02-27T18:43:47Z","title":"A Minimal Agent for Automated Theorem Proving","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-15T18:44:35.600033Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2602.24273"},"observation_digest":"sha256:33d8eb79e6f2c7194de3d9e660ce3640a8ca88c36b46517af3e84cdb56bd3455","observation_id":"a282cc50-46cf-42e0-a54c-875c6fa3ad81","resolution":{"observed_at":"2026-05-15T18:46:29.339886Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-07-13T14:28:35.916911Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.01301","last_updated":"2026-06-09T22:21:28Z","snapshot_observed_at":"2026-08-13T11:08:33.154775Z","submitted_at":"2026-04-01T18:05:32Z","title":"Numerically Optimizing Shortcuts to Adiabaticity: A Hybrid Control Strategy","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T14:28:35.916911Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2604.01301"},"observation_digest":"sha256:e5601b224f71e42c4241055b31c542217f2179d2662258f3ded50f7e6a563b70","observation_id":"5420dcd3-d2c1-4351-bf1c-046d87ebd6b0","resolution":{"observed_at":"2026-07-13T14:28:35.916911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2604.16347","last_updated":"2026-03-16T14:19:33Z","snapshot_observed_at":"2026-07-06T23:03:43.854612Z","submitted_at":"2026-03-16T14:19:33Z","title":"Lean Atlas: An Integrated Proof Environment for Scalable Human-AI Collaborative Formalization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T10:24:19.295736Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2604.16347"},"observation_digest":"sha256:1bd0c9d792c780bdd1204301c34b04c529fbc51e7b3f7b85802c7ffc6b1e8add","observation_id":"d82de128-0587-427f-876a-f6787b187b44","resolution":{"observed_at":"2026-05-15T10:25:26.551979Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2604.20209","last_updated":"2026-08-11T17:43:40Z","snapshot_observed_at":"2026-08-14T23:11:41.818755Z","submitted_at":"2026-04-22T05:50:23Z","title":"Scaling Self-Play with Self-Guidance","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-10T01:31:06.090698Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2604.20209"},"observation_digest":"sha256:efaf1371ae89a9e58302ad0d20b8bf8fb27dd4544895bfa7b0973f72e32317b1","observation_id":"c4b657c7-6a30-4907-b0ed-793f1cb14d2c","resolution":{"observed_at":"2026-05-11T13:36:03.233177Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2604.24797","last_updated":"2026-05-04T23:21:56Z","snapshot_observed_at":"2026-08-11T16:10:58.282395Z","submitted_at":"2026-04-26T19:46:06Z","title":"The Network Structure of Mathlib","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T05:04:47.735361Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2604.24797"},"observation_digest":"sha256:9584066cc45194d95a7c54375d6cbf916ca8195456cc128e506b0a3f60f7c8c9","observation_id":"7028ba3c-0c4c-4ef7-adb8-da5601e2c95d","resolution":{"observed_at":"2026-05-11T21:36:13.410731Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.06184","last_updated":"2026-05-07T13:01:06Z","snapshot_observed_at":"2026-08-16T08:10:37.933368Z","submitted_at":"2026-05-07T13:01:06Z","title":"Teaching LLMs Program Semantics via Symbolic Execution Traces","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T08:56:25.022619Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.06184"},"observation_digest":"sha256:ca7d7ef20605ddabd569beb6f985a5ac6df5113bf6cc8af02e1963dfb0bc9c1b","observation_id":"4eca7f45-15f6-4429-bc3c-2fc7ef5ab018","resolution":{"observed_at":"2026-05-11T20:26:13.201374Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.08817","last_updated":"2026-05-09T09:10:03Z","snapshot_observed_at":"2026-07-06T23:21:02.177557Z","submitted_at":"2026-05-09T09:10:03Z","title":"How You Begin is How You Reason: Driving Exploration in RLVR via Prefix-Tuned Priors","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T03:25:04.955816Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.08817"},"observation_digest":"sha256:ea3669f7228a6ffd1fb10a9e2994c3b6a72323f1c8319c777540e6a8bc223df3","observation_id":"439ee1c2-8708-4a96-aed9-9632c154ff14","resolution":{"observed_at":"2026-05-12T03:26:19.268538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.11905","last_updated":"2026-05-12T10:18:28Z","snapshot_observed_at":"2026-08-12T16:25:27.387244Z","submitted_at":"2026-05-12T10:18:28Z","title":"Rethinking Supervision Granularity: Segment-Level Learning for LLM-Based Theorem Proving","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-13T06:07:29.492413Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.11905"},"observation_digest":"sha256:54f47894aed740c30597b4c64401ba2452bd7ac8064cde39d30523a8761711dc","observation_id":"4f68c5a0-e9ef-483d-bf2e-a4352e35d56f","resolution":{"observed_at":"2026-05-13T06:12:22.925046Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.16379","last_updated":"2026-05-11T01:27:59Z","snapshot_observed_at":"2026-08-15T16:37:44.029774Z","submitted_at":"2026-05-11T01:27:59Z","title":"An Information-Theoretic Criterion for Efficient Data Synthesis","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-20T22:16:57.983741Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.16379"},"observation_digest":"sha256:b9f984dca68f4de319c3858406f2e2624e4de3e86a9de1428b5517d0f0de9f55","observation_id":"c3a03f5b-1bfc-43ce-a844-452850b5a5cc","resolution":{"observed_at":"2026-05-20T22:19:07.416252Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.17255","last_updated":"2026-05-17T04:53:47Z","snapshot_observed_at":"2026-08-15T03:34:50.153850Z","submitted_at":"2026-05-17T04:53:47Z","title":"CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T13:35:04.729506Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.17255"},"observation_digest":"sha256:dbc7651600fdea1293f468428d971a12dd49d8d019b7b8631e21890a239b6f9c","observation_id":"14c1515f-c2d7-47a4-b288-a82afe79326d","resolution":{"observed_at":"2026-05-20T13:38:19.356333Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.17283","last_updated":"2026-05-17T06:39:05Z","snapshot_observed_at":"2026-08-14T15:06:22.101894Z","submitted_at":"2026-05-17T06:39:05Z","title":"OProver: A Unified Framework for Agentic Formal Theorem Proving","version":1},"reference_index":155,"source":"arxiv_source","source_observed_at":"2026-05-20T14:43:46.517807Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.17283"},"observation_digest":"sha256:d0e4cbfe71604de62605cf18f5817bbdb4571dbfa359535cde6a9650ece82d16","observation_id":"e0d52671-a4a6-4bcd-b557-07dee4e13d4c","resolution":{"observed_at":"2026-05-20T14:48:23.542935Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.20244","last_updated":"2026-08-04T13:49:27Z","snapshot_observed_at":"2026-08-14T08:01:44.432124Z","submitted_at":"2026-05-18T04:19:41Z","title":"Lean Refactor: Multi-Objective Controllable Proof Optimization via Agentic Strategy Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T08:51:59.101930Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.20244"},"observation_digest":"sha256:a8e126b0b255d100df72c83f1706ef331b10350930add5b61398d76a58c0b87d","observation_id":"8455fcd3-f71f-46aa-a764-568813d11380","resolution":{"observed_at":"2026-05-21T08:54:05.955864Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.23772","last_updated":"2026-05-22T15:41:27Z","snapshot_observed_at":"2026-08-21T21:52:03.961082Z","submitted_at":"2026-05-22T15:41:27Z","title":"Agentic Proving for Program Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T04:02:22.170884Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.23772"},"observation_digest":"sha256:3e7050d438e154d49b46958e3107aae1a3c5d0fbfbc6fbe7c2c13de44e962d21","observation_id":"c29c1302-bcd5-432f-a858-f49314b7c0b1","resolution":{"observed_at":"2026-05-25T04:05:20.640235Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.29955","last_updated":"2026-05-28T14:00:22Z","snapshot_observed_at":"2026-08-14T02:24:14.986926Z","submitted_at":"2026-05-28T14:00:22Z","title":"Formalizing Mathematics at Scale","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-29T07:35:06.858835Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.29955"},"observation_digest":"sha256:d0056de242fd7376945f41af995fe7f92dca1a6ad1d4b35868d35ff1eb3d01eb","observation_id":"9685a3e4-af88-49c0-8d95-c192ccb46f9f","resolution":{"observed_at":"2026-06-29T07:53:14.296844Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2605.30914","last_updated":"2026-05-29T06:59:28Z","snapshot_observed_at":"2026-08-14T18:21:58.376831Z","submitted_at":"2026-05-29T06:59:28Z","title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T23:52:36.891080Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2605.30914"},"observation_digest":"sha256:0ddbdb8d8d1b72d5e5756bc71729e3a840a90ab88463778c70d04831d43ba5b0","observation_id":"cd6c4bb4-f620-4c79-9670-51ccd1728bdb","resolution":{"observed_at":"2026-06-28T23:52:49.314230Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.04273","last_updated":"2026-08-07T18:52:22Z","snapshot_observed_at":"2026-08-17T17:53:08.332284Z","submitted_at":"2026-06-02T22:58:19Z","title":"Human agency in initial human-AI proof formalization workflows","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T09:29:50.282874Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.04273"},"observation_digest":"sha256:ae215e57a1310ad3ded509f3a94883f1b7670cbefd254521f036334875b9589f","observation_id":"034f15ba-11d4-4b76-8f9e-6545bdee5c44","resolution":{"observed_at":"2026-07-02T04:06:34.817699Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.04883","last_updated":"2026-06-23T10:56:57Z","snapshot_observed_at":"2026-08-16T14:40:32.865550Z","submitted_at":"2026-06-03T13:46:20Z","title":"Optimizing the Cost-Quality Tradeoff of Agentic Theorem Provers in Lean","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T06:01:44.894830Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.04883"},"observation_digest":"sha256:1a4ad2f27385d1885693c1a68fe72a572d28d057c3dec7788e024f293c1a5836","observation_id":"7c9c38d1-f00d-4622-83d1-ce655377097b","resolution":{"observed_at":"2026-06-28T06:11:42.523171Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.05400","last_updated":"2026-06-03T20:09:39Z","snapshot_observed_at":"2026-08-09T05:03:29.602227Z","submitted_at":"2026-06-03T20:09:39Z","title":"LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T05:48:56.691155Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.05400"},"observation_digest":"sha256:d89f6b764f6f2d1ad74d221a30efc19ded1b71a1e36caacc0a6d92d8dd922ab6","observation_id":"ff209482-1616-4462-ae79-17c28e15faff","resolution":{"observed_at":"2026-07-02T08:36:48.754629Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.17581","last_updated":"2026-06-16T06:43:08Z","snapshot_observed_at":"2026-08-15T06:49:19.878535Z","submitted_at":"2026-06-16T06:43:08Z","title":"Visored: A Controlled-Natural-Language Prover for LLM-Generated Mathematics","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T22:23:42.299674Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.17581"},"observation_digest":"sha256:cdca91a9b2e33ca9f714bd85c0d01425f905f14c5cad67b2dcc8cc31d89f17d5","observation_id":"3583153a-1e51-42b8-9189-f820da69b3fc","resolution":{"observed_at":"2026-07-03T23:19:04.432472Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.23666","last_updated":"2026-06-22T17:51:19Z","snapshot_observed_at":"2026-08-12T11:42:29.607789Z","submitted_at":"2026-06-22T17:51:19Z","title":"Statistical Proof as a Window into Human-AI Collaboration: Practical Insights and a Community Agenda","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T01:44:07.592041Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.23666"},"observation_digest":"sha256:bd46cf84f97ed8bf8b71af75851d8a7bbbd885cdf2636b21829462784dab9948","observation_id":"907e80a3-60fd-4225-9c7e-42c221487330","resolution":{"observed_at":"2026-07-04T15:19:56.590404Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.24443","last_updated":"2026-06-23T11:24:49Z","snapshot_observed_at":"2026-08-11T03:26:09.956622Z","submitted_at":"2026-06-23T11:24:49Z","title":"Verifiable Auto-Formalization of Mathematics Using a Relaxed Natural Formal Language","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-25T21:59:02.948726Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.24443"},"observation_digest":"sha256:0fe2ac609579e34367373d55faaa40a99a0b259eee22e83b9f418409e897359e","observation_id":"7cef7394-64c8-41df-877d-58edd0838ef3","resolution":{"observed_at":"2026-07-04T19:10:04.242246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.26442","last_updated":"2026-06-24T23:09:49Z","snapshot_observed_at":"2026-08-13T01:00:06.591204Z","submitted_at":"2026-06-24T23:09:49Z","title":"AXLE: A Cloud Infrastructure for Lean 4 Theorem Proving Utilities","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-26T00:26:02.757706Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.26442"},"observation_digest":"sha256:e9bd1421f00eb66267a94ee45a91c1b8c42842446f14f2b626675f28d212f82c","observation_id":"b7687a9a-bcef-4deb-8505-3e0d9f4ef85b","resolution":{"observed_at":"2026-07-04T16:39:57.369390Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.31134","last_updated":"2026-08-05T20:38:33Z","snapshot_observed_at":"2026-08-13T20:40:45.791855Z","submitted_at":"2026-06-30T05:05:03Z","title":"Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-01T05:54:51.200436Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.31134"},"observation_digest":"sha256:bcb6a2ce163243baf952fd513c70d20b3bc60fda5b22b84863ec640b2cfdde3b","observation_id":"8947e8fd-8fba-459c-be7c-2154cc07fad9","resolution":{"observed_at":"2026-07-01T10:05:40.897005Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2606.31134","last_updated":"2026-08-05T20:38:33Z","snapshot_observed_at":"2026-08-13T20:40:45.791855Z","submitted_at":"2026-06-30T05:05:03Z","title":"Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-03T22:34:08.241014Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2606.31134"},"observation_digest":"sha256:1bbf5f755d32f3306dd94ad99a671cfd0f2794766c58bbde2bb805793f8e31f3","observation_id":"f4104e80-1a3c-4e08-b631-800607cb0324","resolution":{"observed_at":"2026-07-03T22:39:01.147848Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-07-11T15:42:50.296348Z","title":"CoRR , volume =","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-18T06:29:44.667648Z","submitted_at":"2026-07-06T04:20:06Z","title":"FormalRx: Rectify and eXamine Semantic Failures in Autoformalization","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-11T15:42:50.296348Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2607.04655"},"observation_digest":"sha256:c52025ec6cb4ef1e458a37dc791bcde4c49ea4b07693d027bfffae70b1c6f5b3","observation_id":"ead68570-dafc-4a3e-8cbc-dd01321aed31","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"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2607.06820","last_updated":"2026-07-07T21:29:59Z","snapshot_observed_at":"2026-08-16T19:05:13.709899Z","submitted_at":"2026-07-07T21:29:59Z","title":"Evaluating SageMath-Augmented LLM Agents for Computational and Experimental Mathematics","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-10T20:39:42.009312Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2607.06820"},"observation_digest":"sha256:b6c1c0fcb5ceda6d4d49b3e755eec28aa25c7d012d17352ff007b5c2373dfe6d","observation_id":"265e7fb2-de35-4cad-b8a2-10376b0421b3","resolution":{"observed_at":"2026-07-10T20:47:34.622094Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":"2507.23726","doi":"10.48550/arxiv.2507.23726","metadata_source":"pith","pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seed-prover: Deep and broad reasoning for automated theorem proving","venue":"cs.AI","work_id":"a5329c4e-41eb-48e2-b93a-3c8a6e30eec9","year":2025},"citing_paper":{"arxiv_id":"2607.07779","last_updated":"2026-07-08T17:46:36Z","snapshot_observed_at":"2026-07-12T23:17:59.879344Z","submitted_at":"2026-07-08T17:46:36Z","title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T18:16:31.176239Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2607.07779"},"observation_digest":"sha256:cc5be973c0998a986dedd18a4b206ef50c037f09079b801c8faa3cbe68a87bce","observation_id":"f2ef4793-d3a8-4dc6-a58d-d9fb451d4937","resolution":{"observed_at":"2026-07-10T18:17:33.747659Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:08.802822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-02T01:44:43.074222Z","title":"Luoxin Chen, Jinming Gu, Liankai Huang, Wenhao Huang, Zhicheng Jiang, Allan Jie, Xiaoran Jin, Xing Jin, Chenggang Li, Kaijing Ma, et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14582","last_updated":"2026-07-16T05:22:40Z","snapshot_observed_at":"2026-08-15T06:07:12.546901Z","submitted_at":"2026-07-16T05:22:40Z","title":"MathCoPilot: An Interactive System for Human-AI Symbiotic Paradigm of Mathematical Research","version":1},"reference_index":1970,"source":"pdf_text","source_observed_at":"2026-08-02T01:44:43.074222Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2607.14582"},"observation_digest":"sha256:5c34012411b0e1f72eae2e5eb82d7670fd9ee75903057b1f06da60047a821ac5","observation_id":"0a01a1f4-34d8-450a-a72c-54b3e884f696","resolution":{"observed_at":"2026-08-02T01:44:43.074222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-02T10:57:08.710656Z","title":"ByteDance Seed Team","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19374","last_updated":"2026-06-17T15:27:17Z","snapshot_observed_at":"2026-08-20T15:37:19.446652Z","submitted_at":"2026-06-17T15:27:17Z","title":"Euclean: Automated Geometry Problem Formalization with Unified Verification in Lean","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-02T10:57:08.710656Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2607.19374"},"observation_digest":"sha256:0373d7aaebb3c095b81071822fd5bb97e136a4b31a8ad1e042e0a5549932dc10","observation_id":"2529c564-4e5c-4e78-aad0-b0cc5a5d49fe","resolution":{"observed_at":"2026-08-02T10:57:08.710656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-04T09:50:36.314424Z","title":"Michael Beeson, Julien Narboux, and Freek Wiedijk","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02295","last_updated":"2026-08-03T14:24:12Z","snapshot_observed_at":"2026-08-20T15:32:13.580498Z","submitted_at":"2026-08-03T14:24:12Z","title":"MechGeo: Autoformalizing and Proving Euclidean Geometry in Lean 4","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-04T09:50:36.314424Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2608.02295"},"observation_digest":"sha256:508bb530edf9f1ac59f45edf1a8bf66130ef88a38c6a0afe24aba2e89bc26f58","observation_id":"99fdb566-6666-467b-8cd1-77341a8be84e","resolution":{"observed_at":"2026-08-04T09:50:36.314424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23726","snapshot_observed_at":"2026-08-11T23:11:38.192972Z","title":"arXiv preprint arXiv:2507.23726 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09123","last_updated":"2026-08-10T05:02:28Z","snapshot_observed_at":"2026-08-16T07:10:56.288467Z","submitted_at":"2026-08-10T05:02:28Z","title":"RISE-RL: Rubric-Informed Selective Exploration for Open-Ended Reinforcement Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T23:11:38.192972Z"},"links":{"cited_paper":"/paper/2507.23726","citing_paper":"/paper/2608.09123"},"observation_digest":"sha256:f4e01e37e70964e9250eac19592b47c3c3e2bba6bcb6a4cd9466805dc7bf2d21","observation_id":"e2b52015-9197-4f6a-948a-1c52fc66f927","resolution":{"observed_at":"2026-08-11T23:11:38.192972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.23726/citation-record","integrity":"/paper/2507.23726/integrity","json":"/paper/2507.23726/citation-record.json","paper":"/paper/2507.23726"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.17387","last_updated":"2025-02-24T18:14:01Z","snapshot_observed_at":"2026-08-18T07:57:35.968161Z","submitted_at":"2025-02-24T18:14:01Z","title":"Big-Math: A Large-Scale, High-Quality Math Dataset for Reinforcement Learning in Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.17387","snapshot_observed_at":"2026-08-06T10:30:44.585630Z","title":"Big-math: A large-scale, high-quality math dataset for reinforcement learning in language models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.585630Z"},"links":{"cited_paper":"/paper/2502.17387","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:80dc76ed9f463aec89042f22a8b54775a1ab795ebb3172796b842b22a72497a8","observation_id":"92b27c15-f29f-4181-a11c-98ad96e447ed","resolution":{"observed_at":"2026-08-06T10:30:44.585630Z","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-06T10:30:44.591533Z","title":"Gold-medalist performance in solving olympiad geometry with alphageometry2","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.591533Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:4345032076396d7341947276fb9405d37aaf03b6961c85c0a5d8543108cbf8ab","observation_id":"24ede97b-b3ab-4dc1-ad13-94222ab22074","resolution":{"observed_at":"2026-08-06T10:30:44.591533Z","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-06T10:30:45.487209Z","title":"Ai solves imo problems at silver medal level","venue":null,"work_id":"4c091cb5-8af1-4f81-809b-7bd5514b62ed","year":2024},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.596671Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:bb08c88ab794069a464f66204af33a13b0c50018ff2ecc703f0bba62b422ca88","observation_id":"65661ded-ce4b-4e32-9b34-973d0926fda4","resolution":{"observed_at":"2026-08-06T10:30:45.493105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-06T10:30:44.602247Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.602247Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:b9819a14fbb2d83da0e72d5e1c2724fb099bc8403a67e1bd8c927328a5bf201e","observation_id":"8070de7f-a7c2-4cfa-800b-e09a7607be09","resolution":{"observed_at":"2026-08-06T10:30:44.602247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00212","last_updated":"2025-03-21T03:27:55Z","snapshot_observed_at":"2026-08-21T17:15:25.819680Z","submitted_at":"2025-01-31T23:01:48Z","title":"STP: Self-play LLM Theorem Provers with Iterative Conjecturing and Proving","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00212","snapshot_observed_at":"2026-08-06T10:30:44.607322Z","title":"Stp: Self-play llm theorem provers with iterative conjecturing and proving, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.607322Z"},"links":{"cited_paper":"/paper/2502.00212","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:cb8fbb901473c81f859d01890e60da710f9ddd726751c1e60d8ca251a54a4990","observation_id":"c9efde40-5d11-4810-b1f2-7af930db3781","resolution":{"observed_at":"2026-08-06T10:30:44.607322Z","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-06T10:30:45.471161Z","title":"miniCTX: Neural theorem proving with (long-)contexts","venue":null,"work_id":"dc191d4b-d0d9-48a8-87fb-75dbcdb39c9e","year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.612310Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:050090f83b84efa252acacaeaeb7ab2e5fb8fbb771ce41785fe362f00bf5bb66","observation_id":"ea9507e7-0f19-4e39-a1d0-77c76d99081f","resolution":{"observed_at":"2026-08-06T10:30:45.476400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T10:30:45.455133Z","title":"Draft, sketch, and prove: Guiding formal theorem provers with informal proofs","venue":null,"work_id":"982b957f-b33f-46d3-890a-9c11545d8991","year":2023},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.617681Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:e2aa153ea1561ab5204755303533282d26609b6f12fa17ff31274e2b86d1d7bc","observation_id":"3aa34567-5d02-464f-82ff-1e4c4a312b4b","resolution":{"observed_at":"2026-08-06T10:30:45.460425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T10:30:45.439628Z","title":"Numinamath.[https://github.com/project-numina/aimo-progress-prize](https://github","venue":null,"work_id":"041f02fb-51b0-450a-a129-3499542e6cb0","year":2024},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.622461Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:80f1f8741511133a92066b2d1f3ed6541a4ecce741fbc247a68f353ecd0e3e46","observation_id":"6aa1c31d-4fad-4ead-a7c3-34e2a6567cdc","resolution":{"observed_at":"2026-08-06T10:30:45.444479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07640","last_updated":"2025-04-19T13:53:05Z","snapshot_observed_at":"2026-08-19T20:10:21.442760Z","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-06T10:30:44.627009Z","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":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.627009Z"},"links":{"cited_paper":"/paper/2502.07640","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:a7b3503f312020645804a3058760c82daed4625fe122aa28bbd1ad2068a07ff4","observation_id":"5c29982a-4218-4c05-bcdd-968d0eeb5d7e","resolution":{"observed_at":"2026-08-06T10:30:44.627009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-06T10:30:44.632329Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.632329Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:abbff68e2023130113497d14b604d5201e5acfc181ed0c44c18934631ecb8f19","observation_id":"7b6d46b7-1d1b-4ec0-a8ca-b228f0b511fa","resolution":{"observed_at":"2026-08-06T10:30:44.632329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-08-19T11:46:55.171293Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-06T10:30:44.637287Z","title":"Openai o1 system card, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.637287Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:1c636bdfa79a2ef40ac08043143ee7110864c573bf00d5198b6ed73f950f6519","observation_id":"44e735b8-38d1-4aff-8938-d0e3213cb13d","resolution":{"observed_at":"2026-08-06T10:30:44.637287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06181","last_updated":"2025-07-08T17:03:39Z","snapshot_observed_at":"2026-08-07T16:09:15.554628Z","submitted_at":"2025-07-08T17:03:39Z","title":"CriticLean: Critic-Guided Reinforcement Learning for Mathematical Formalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.06181","snapshot_observed_at":"2026-08-06T10:30:44.642401Z","title":"Criticlean: Critic-guided reinforcement learning for mathematical formalization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.642401Z"},"links":{"cited_paper":"/paper/2507.06181","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:608ccf026a4f484850b13e826ef75de24e87718f9b7a71a663b93756dad91bdc","observation_id":"f319233b-38c9-488e-8be0-e08162fba288","resolution":{"observed_at":"2026-08-06T10:30:44.642401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21934","last_updated":"2025-09-04T19:36:32Z","snapshot_observed_at":"2026-08-20T04:36:24.449082Z","submitted_at":"2025-03-27T19:21:05Z","title":"Proof or Bluff? Evaluating LLMs on 2025 USA Math Olympiad","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21934","snapshot_observed_at":"2026-08-06T10:30:44.646893Z","title":"Proof or bluff? evaluating llms on 2025 usa math olympiad, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.646893Z"},"links":{"cited_paper":"/paper/2503.21934","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:c10e973063212950893e3d50d9de0300c0af08fcdbeee1b479e30a3cd79a6892","observation_id":"0e0d4d6e-709f-4c24-9038-60039d47a15a","resolution":{"observed_at":"2026-08-06T10:30:44.646893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01344","last_updated":"2022-02-03T00:17:00Z","snapshot_observed_at":"2026-08-18T15:11:03.601000Z","submitted_at":"2022-02-03T00:17:00Z","title":"Formal Mathematics Statement Curriculum Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01344","snapshot_observed_at":"2026-08-06T10:30:44.651424Z","title":"Formal mathematics statement curriculum learning.arXiv preprint arXiv:2202.01344, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.651424Z"},"links":{"cited_paper":"/paper/2202.01344","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:8e1e17e4f94dacb96532c7c782746970345f4582594c85ea1c89a3909931ccfe","observation_id":"0b5fc2ff-3100-412c-aab9-077def46bdf5","resolution":{"observed_at":"2026-08-06T10:30:44.651424Z","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-06T10:30:44.655904Z","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":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.655904Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:d433b809307fb0b3615165671d4c450a9a4b3ace3dc6ca6f919f246b6ae87b96","observation_id":"c498b331-c24e-4ac8-80b9-bdde0b3f2b75","resolution":{"observed_at":"2026-08-06T10:30:44.655904Z","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-06T10:30:45.423213Z","title":"miniCTX leaderboard.https://cmu-l3.github.io/ minictx/leaderboard.html, 2025","venue":null,"work_id":"c7627eaa-9f1b-403a-91ae-cb75480ed6f9","year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.660428Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:74b6e1da33810658ac4ac58ab29669e20330f6cd8ff989de629884e60a4cb339","observation_id":"0981d642-60df-4129-84ac-3ad8b74e6687","resolution":{"observed_at":"2026-08-06T10:30:45.428246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T10:30:44.664921Z","title":"Seed1.5-thinking: Advancing superb reasoning models with reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.664921Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:f493a00ee2664ca277546e9eb7dad7c16eb4a5223c05423ec64d24d845b64b40","observation_id":"5033138a-fb19-411e-b2a6-56f0203cda11","resolution":{"observed_at":"2026-08-06T10:30:44.664921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.07909","last_updated":"2016-06-10T14:45:08Z","snapshot_observed_at":"2026-08-17T07:28:37.146698Z","submitted_at":"2015-08-31T16:37:31Z","title":"Neural Machine Translation of Rare Words with Subword Units","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.07909","snapshot_observed_at":"2026-08-06T10:30:44.669095Z","title":"Neural machine translation of rare words with subword units","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.669095Z"},"links":{"cited_paper":"/paper/1508.07909","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:717ce0d771de89944d83f9517c5c1fa83017775040f3bd36c097d3753cd53d19","observation_id":"b74f9aae-8bf2-4a91-ae4b-8c71166066d9","resolution":{"observed_at":"2026-08-06T10:30:44.669095Z","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-06T10:30:44.673968Z","title":"Solving olympiad geometry without human demonstrations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.673968Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:bb238467b506cfc65b23ce61ddf3436b1c2349bb03f183cec684403a3e8cb163","observation_id":"e090e207-ae76-4a38-a555-20ddb8e1d04b","resolution":{"observed_at":"2026-08-06T10:30:44.673968Z","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-06T10:30:45.396145Z","title":"Putnambench: Evaluating neural theorem-provers on the putnam mathematical competition","venue":null,"work_id":"27cdf088-6b59-4963-8b14-8c004aa53414","year":null},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.678244Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:65e861b572853285754550efdd35cb68b533cc578c91c78e41dbd690030c8dba","observation_id":"94f62ec9-577d-4ae5-8eaa-f94b364d9846","resolution":{"observed_at":"2026-08-06T10:30:45.400950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11354","last_updated":"2025-04-15T16:23:44Z","snapshot_observed_at":"2026-08-15T23:16:36.618851Z","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-06T10:30:44.683267Z","title":"Kimina-prover preview: Towards large formal reasoning models with reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.683267Z"},"links":{"cited_paper":"/paper/2504.11354","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:104d9d0e1c19f10d25d811be4a8e5b4c62d7cccb90ea50f42ca145061382b8e9","observation_id":"cc3abb4f-9f57-49c0-bf42-4abc057fda8c","resolution":{"observed_at":"2026-08-06T10:30:44.683267Z","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-06T10:30:44.687916Z","title":"Internlm2.5- stepprover: Advancing automated theorem proving via expert iteration on large-scale lean problems, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.687916Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:4a2529eff6b55ee0d0d8eec2d3dbe481c6a7524aaefcac9373b13e49daf0316e","observation_id":"4f759c08-fe24-4f9b-8cba-421e1f017c8e","resolution":{"observed_at":"2026-08-06T10:30:44.687916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17227","last_updated":"2024-07-24T12:28:03Z","snapshot_observed_at":"2026-08-17T23:43:18.251924Z","submitted_at":"2024-07-24T12:28:03Z","title":"LEAN-GitHub: Compiling GitHub LEAN repositories for a versatile LEAN prover","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17227","snapshot_observed_at":"2026-08-06T10:30:44.692716Z","title":"Lean-github: Compiling github lean repositories for a versatile lean prover, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.692716Z"},"links":{"cited_paper":"/paper/2407.17227","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:126c910d4025cb7d45632df7099bb5707b608cf8b67685be8b0237c5fd59d2b2","observation_id":"51886c4c-fc73-4a8e-9987-91cd5634f79b","resolution":{"observed_at":"2026-08-06T10:30:44.692716Z","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-06T10:30:45.379820Z","title":"Ren, Junxiao Song, Zhihong Shao, Wanjia Zhao, Haocheng Wang, Bo Liu, Liyue Zhang, Xuan Lu, Qiushi Du, Wenjun Gao, Haowei Zhang, Qihao Zhu, Dejian Yang, Zhibin Gou, Z.F","venue":null,"work_id":"93c641db-90d5-46e8-88d1-364d1481be2c","year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.697384Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:b662faa3da54ddc5e59440b2779cbd5f542b345670d47b8c36ed74a8bedd4d0b","observation_id":"212d796f-4c16-44cc-82c6-9db256127385","resolution":{"observed_at":"2026-08-06T10:30:45.384677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T10:30:44.701832Z","title":"Bfs-prover: Scalable best-first tree search for llm-based automatic theorem proving, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.701832Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:bcf47228777e4dfb043d030cfb6c14b047e1dd835bd3901f2619851a08b1f884","observation_id":"54f99cb9-3576-4a8a-93f3-07dbcfae309a","resolution":{"observed_at":"2026-08-06T10:30:44.701832Z","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-06T10:30:44.706464Z","title":"Leandojo: Theorem proving with retrieval-augmented language models.Advances in Neural Information Processing Systems, 36:21573–21612, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.706464Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:626f0c8b7989058d8e86b2eb68bf2ddba446222e2d14768e53e6d18081d386c0","observation_id":"0d189e7a-e6fa-4eaa-8525-14965d03d4d2","resolution":{"observed_at":"2026-08-06T10:30:44.706464Z","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-06T10:30:45.352519Z","title":"Lean workbook: A large-scale lean problem set formalized from natural language math problems","venue":null,"work_id":"0873d5d6-0f32-493b-a592-8d0d9fc4086f","year":null},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.711225Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:3b6aec9b742597245b8ad965c1bfeb87e483892edd0ef285ebd179548d233ea2","observation_id":"68f8c3d3-3bc8-4684-a3db-83a1f1e6a167","resolution":{"observed_at":"2026-08-06T10:30:45.357844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14476","last_updated":"2025-05-20T01:37:34Z","snapshot_observed_at":"2026-08-18T05:01:20.543826Z","submitted_at":"2025-03-18T17:49:06Z","title":"DAPO: An Open-Source LLM Reinforcement Learning System at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.14476","snapshot_observed_at":"2026-08-06T10:30:44.715822Z","title":"Dapo: An open-source llm reinforcement learning system at scale","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.715822Z"},"links":{"cited_paper":"/paper/2503.14476","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:173d03927c6112855d18b77a3888f969190fce4c83c49751e5179672dabe210d","observation_id":"be2ab4ec-e958-4776-bb53-2feaed79e455","resolution":{"observed_at":"2026-08-06T10:30:44.715822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.05118","last_updated":"2025-04-11T02:54:58Z","snapshot_observed_at":"2026-08-14T16:01:52.772456Z","submitted_at":"2025-04-07T14:21:11Z","title":"VAPO: Efficient and Reliable Reinforcement Learning for Advanced Reasoning Tasks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.05118","snapshot_observed_at":"2026-08-06T10:30:44.720568Z","title":"Vapo: Efficient and reliable reinforcement learning for advanced reasoning tasks, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.720568Z"},"links":{"cited_paper":"/paper/2504.05118","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:103bb5730ec580e38c0ba70d633f2b3fc02a9a7b306a12fe418bb97ff855ebd7","observation_id":"82ae6b57-19d1-4374-887c-9e3150957299","resolution":{"observed_at":"2026-08-06T10:30:44.720568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.10673","last_updated":"2024-12-14T04:20:47Z","snapshot_observed_at":"2026-08-18T00:11:38.473299Z","submitted_at":"2024-12-14T04:20:47Z","title":"Proposing and solving olympiad geometry with guided tree search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.10673","snapshot_observed_at":"2026-08-06T10:30:44.725641Z","title":"Proposing and solving olympiad geometry with guided tree search.arXiv preprint arXiv:2412.10673, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.725641Z"},"links":{"cited_paper":"/paper/2412.10673","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:027686c5bf33c5c89188e095b53c1ebc990f721e261ce58503ae0dbac26bdfe1","observation_id":"742ac160-d0db-4f78-b181-0067e120d3db","resolution":{"observed_at":"2026-08-06T10:30:44.725641Z","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-06T10:30:45.333259Z","title":"minif2f: a cross-system benchmark for formal olympiad-level mathematics","venue":null,"work_id":"fbd43b45-8a2b-40b0-b517-604ad664f571","year":null},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.730840Z"},"links":{"citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:9cec949285f63ed8ec4f0964fdb2fb27112d4c36b5b63a2c0c4d3837dd7ea9eb","observation_id":"06a16cdf-ea0b-476b-bb00-d2916c2ab5ae","resolution":{"observed_at":"2026-08-06T10:30:45.340679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-08-17T10:57:47.099296Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-06T10:30:44.735604Z","title":"Solving formal math problems by decomposition and iterative reflection.arXiv preprint arXiv:2507.15225, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.735604Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:fb8ce19b493656e26b0909c9ff5e30fbaf6dc4afa8883ac6ea30d6d9c465ef3f","observation_id":"87e9bb34-b118-4874-8887-e22cfa502c59","resolution":{"observed_at":"2026-08-06T10:30:44.735604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":32},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 40 inbound Pith citation observations for arXiv:2507.23726."}