{"as_of":"2026-08-05T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3352c76d8ff8b0efc945cb2ea1b6b4051a1457a78cf25fc5069f2bd9efef8f7f","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:51:26.300760Z","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":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2510.01346","last_updated":"2025-10-10T20:12:14Z","snapshot_observed_at":"2026-08-02T06:00:59.770868Z","submitted_at":"2025-10-01T18:21:13Z","title":"Aristotle: IMO-level Automated Theorem Proving","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-15T08:51:37.827144Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2510.01346"},"observation_digest":"sha256:0b50517c662f7fc5a488fde1eadfc0e3d46728e16a123b21b4e0d72a019a9b8d","observation_id":"8b44eed6-a454-4fc1-a46c-69a3c2c1f9cf","resolution":{"observed_at":"2026-05-15T08:51:37.978735Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2601.13209","last_updated":"2026-05-02T15:26:09Z","snapshot_observed_at":"2026-07-06T22:42:08.271837Z","submitted_at":"2026-01-19T16:38:18Z","title":"AI for Mathematics: Progress, Challenges, and Prospects","version":5},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-05-16T13:24:57.923863Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2601.13209"},"observation_digest":"sha256:95a9b5dc26c3b90c72bf35ad8e8e48f6a1313bee6e575bd727395c6c514a2765","observation_id":"8d97645e-c6f3-4459-b5fc-fb2896dd03b3","resolution":{"observed_at":"2026-05-16T13:27:55.657622Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2602.24273","last_updated":"2026-05-14T16:23:55Z","snapshot_observed_at":"2026-08-02T04:41:42.758635Z","submitted_at":"2026-02-27T18:43:47Z","title":"A Minimal Agent for Automated Theorem Proving","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-15T18:44:35.600033Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2602.24273"},"observation_digest":"sha256:7c75ee07869c34563750148733cfae2dfc1506c06f1e72d1f87c8ee63ae1108f","observation_id":"2998c057-58d5-4ea4-871d-ebf1c06827ff","resolution":{"observed_at":"2026-05-15T18:46:29.031817Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2605.06651","last_updated":"2026-05-13T16:47:04Z","snapshot_observed_at":"2026-08-04T04:11:56.984099Z","submitted_at":"2026-05-07T17:56:32Z","title":"AI co-mathematician: Accelerating mathematicians with agentic AI","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-08T09:31:55.315364Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2605.06651"},"observation_digest":"sha256:03d3f9a61b374ea626dc79f48b5a8dcb32eb1a1b5d1c9031fd80a84f0e6f50c6","observation_id":"73dcc18e-88bd-4f2f-b89f-45de0cb2be59","resolution":{"observed_at":"2026-05-11T20:21:09.318332Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2605.06651","last_updated":"2026-05-13T16:47:04Z","snapshot_observed_at":"2026-08-04T04:11:56.984099Z","submitted_at":"2026-05-07T17:56:32Z","title":"AI co-mathematician: Accelerating mathematicians with agentic AI","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-14T21:04:57.852889Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2605.06651"},"observation_digest":"sha256:c629bd693f1fac5ec2553c18b56ac0285eb3164c42301d6469386c5ba7df70a4","observation_id":"6c9a20f8-c2cd-49a2-8503-8be9a6467298","resolution":{"observed_at":"2026-05-14T21:19:28.568217Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2605.17255","last_updated":"2026-05-17T04:53:47Z","snapshot_observed_at":"2026-08-02T00:45:01.850467Z","submitted_at":"2026-05-17T04:53:47Z","title":"CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-20T13:35:04.729506Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2605.17255"},"observation_digest":"sha256:477c70682f08efa6dec9d8cd1a120753477f7f9f7f847c79192d3ae953640251","observation_id":"45f4edec-69ff-43ad-87a7-74877126d2de","resolution":{"observed_at":"2026-05-20T13:38:19.345386Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2605.22257","last_updated":"2026-05-21T10:00:47Z","snapshot_observed_at":"2026-08-02T16:57:37.118659Z","submitted_at":"2026-05-21T10:00:47Z","title":"What are the Right Symmetries for Formal Theorem Proving?","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T08:15:17.849584Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2605.22257"},"observation_digest":"sha256:535e02532aba6c86dadf5a12f3be3e4aa285c2192525fefb4713d5499173c424","observation_id":"a0dbac7e-3d92-4495-b310-592f9e55707d","resolution":{"observed_at":"2026-05-22T08:16:16.013308Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2606.06468","last_updated":"2026-06-04T17:54:44Z","snapshot_observed_at":"2026-08-01T01:11:45.256948Z","submitted_at":"2026-06-04T17:54:44Z","title":"Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T00:59:54.485343Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2606.06468"},"observation_digest":"sha256:7d68a7a2a492e6a8bebf5de1051eb4929dc2c2f66aad2ac74abf850bd302a701","observation_id":"21f46200-1fe2-4092-b478-a3706cee4085","resolution":{"observed_at":"2026-07-02T13:46:59.603398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"citing_paper":{"arxiv_id":"2606.09450","last_updated":"2026-06-08T12:57:18Z","snapshot_observed_at":"2026-08-02T11:29:46.747086Z","submitted_at":"2026-06-08T12:57:18Z","title":"TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T16:19:11.123994Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2606.09450"},"observation_digest":"sha256:5d04414aae32effe86d8aa8ee1e5e346a8ed1d460c8f0e787cde29748ed5229b","observation_id":"66b453af-f1e7-4389-9262-78eb4dc5818f","resolution":{"observed_at":"2026-07-03T01:47:31.582427Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2412.20735","doi":"10.48550/arxiv.2412.20735","metadata_source":"pith","pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hun- yuanprover: A scalable data synthesis framework and guided tree search for automated theorem proving","venue":"cs.AI","work_id":"8e9a74af-6f21-4dcb-a8b5-41c07830d002","year":2024},"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":134,"source":"pdf_text","source_observed_at":"2026-07-10T18:16:31.176239Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2607.07779"},"observation_digest":"sha256:6fcc51c6631b6c3cfb6999e5557400a9846e4c5854d70055e3163dc945749912","observation_id":"8acc823b-759a-4faf-bdc9-e37849b5a1bd","resolution":{"observed_at":"2026-07-10T18:17:33.785056Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-07-14T05:57:23.399019Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11258","last_updated":"2026-07-13T08:40:33Z","snapshot_observed_at":"2026-08-03T20:32:27.270243Z","submitted_at":"2026-07-13T08:40:33Z","title":"TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-14T05:57:23.399019Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2607.11258"},"observation_digest":"sha256:92be6565812d76581bf33871019ec6565a80ebc303aba8dc78368f1551d8d24b","observation_id":"8494b9ea-c8c3-4370-a560-a4a283478cbf","resolution":{"observed_at":"2026-07-14T05:57:23.399019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20735","snapshot_observed_at":"2026-08-01T15:51:26.300760Z","title":"arXiv preprint arXiv:2412.20735 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27259","last_updated":"2026-07-29T03:25:07Z","snapshot_observed_at":"2026-08-04T00:04:19.493894Z","submitted_at":"2026-07-29T03:25:07Z","title":"CircuitProver: Agentic Lean 4 Theorem Proving with Reusable Circuit Proof Library for Hardware Verification","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T15:51:26.300760Z"},"links":{"cited_paper":"/paper/2412.20735","citing_paper":"/paper/2607.27259"},"observation_digest":"sha256:5ebbd3d489f5161eb5ba33cfc28089b4c208ba6f6c604b688e4343e613b7a987","observation_id":"829d57df-cf3b-4880-8f1f-3fbc96170c0d","resolution":{"observed_at":"2026-08-01T15:51:26.300760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.20735/citation-record","integrity":"/paper/2412.20735/integrity","json":"/paper/2412.20735/citation-record.json","paper":"/paper/2412.20735"},"outbound":[],"paper":{"arxiv_id":"2412.20735","last_updated":"2025-03-21T02:00:37Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T20:14:31.883493Z","submitted_at":"2024-12-30T06:18:33Z","title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2412.20735."}