{"as_of":"2026-08-10T01:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17b4e8ac4a56b4997679f66db8bcd1b5e6bd427b8a82c4b160d29e7b1500bbfb","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T00:06:30.367315Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T15:42:10.748568Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.14414","last_updated":"2024-05-23T10:35:08Z","snapshot_observed_at":"2026-07-06T18:18:30.066741Z","submitted_at":"2024-05-23T10:35:08Z","title":"Proving Theorems Recursively","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14414","snapshot_observed_at":"2026-08-10T00:06:30.367315Z","title":"Wang, H., Unsal, M., Lin, X., Baksys, M., Liu, J., Santos, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.18310","last_updated":"2025-06-06T13:30:31Z","snapshot_observed_at":"2026-08-09T23:54:43.528750Z","submitted_at":"2025-01-30T12:37:06Z","title":"ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T00:06:30.367315Z"},"links":{"cited_paper":"/paper/2405.14414","citing_paper":"/paper/2501.18310"},"observation_digest":"sha256:30c402912d9a446f455a356ec5ba2604241a66310d500cd65104db019f331aca","observation_id":"1ddb718f-f2b4-4471-9536-63d4b9336b34","resolution":{"observed_at":"2026-08-10T00:06:30.367315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14414","last_updated":"2024-05-23T10:35:08Z","snapshot_observed_at":"2026-07-06T18:18:30.066741Z","submitted_at":"2024-05-23T10:35:08Z","title":"Proving Theorems Recursively","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14414","snapshot_observed_at":"2026-08-07T14:06:30.451938Z","title":"Proving Theorems Recursively.arXiv preprint arXiv:2405.14414,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20047","last_updated":"2025-05-26T14:34:04Z","snapshot_observed_at":"2026-08-07T23:31:54.437843Z","submitted_at":"2025-05-26T14:34:04Z","title":"Grammars of Formal Uncertainty: When to Trust LLMs in Automated Reasoning Tasks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:30.451938Z"},"links":{"cited_paper":"/paper/2405.14414","citing_paper":"/paper/2505.20047"},"observation_digest":"sha256:95e5c42344313eedaf866174cf24a10a4dce4b9b9b24c0092f10ee6fa57e6988","observation_id":"f5f7fc77-3ba5-4e58-baec-1c94e59c31db","resolution":{"observed_at":"2026-08-07T14:06:30.451938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14414","last_updated":"2024-05-23T10:35:08Z","snapshot_observed_at":"2026-07-06T18:18:30.066741Z","submitted_at":"2024-05-23T10:35:08Z","title":"Proving Theorems Recursively","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14414","snapshot_observed_at":"2026-08-07T06:08:26.801891Z","title":"Proving theorems recursively.arXiv preprint arXiv:2405.14414, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06034","last_updated":"2025-06-06T12:33:12Z","snapshot_observed_at":"2026-08-09T18:24:38.296461Z","submitted_at":"2025-06-06T12:33:12Z","title":"MATP-BENCH: Can MLLM Be a Good Automated Theorem Prover for Multimodal Problems?","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T06:08:26.801891Z"},"links":{"cited_paper":"/paper/2405.14414","citing_paper":"/paper/2506.06034"},"observation_digest":"sha256:d2a6488197bef204c02320df6e3efafb2cda5997cfa7503034cce621e3d583da","observation_id":"fcd33a01-a62e-4fd9-9be8-14d4b9b53fac","resolution":{"observed_at":"2026-08-07T06:08:26.801891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14414","last_updated":"2024-05-23T10:35:08Z","snapshot_observed_at":"2026-07-06T18:18:30.066741Z","submitted_at":"2024-05-23T10:35:08Z","title":"Proving Theorems Recursively","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14414","snapshot_observed_at":"2026-08-07T04:09:12.311536Z","title":"Proving theorems recursively","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11487","last_updated":"2025-06-13T06:25:59Z","snapshot_observed_at":"2026-08-07T23:35:00.623427Z","submitted_at":"2025-06-13T06:25:59Z","title":"Reviving DSP for Advanced Theorem Proving in the Era of Reasoning Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:12.311536Z"},"links":{"cited_paper":"/paper/2405.14414","citing_paper":"/paper/2506.11487"},"observation_digest":"sha256:c5aa390475448b9e13d68edcc9a9cd42089072015ab6f79281beae574bdbe872","observation_id":"d60fc604-e1a3-4174-a478-793c63152586","resolution":{"observed_at":"2026-08-07T04:09:12.311536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14414","last_updated":"2024-05-23T10:35:08Z","snapshot_observed_at":"2026-07-06T18:18:30.066741Z","submitted_at":"2024-05-23T10:35:08Z","title":"Proving Theorems Recursively","version":1},"cited_work":{"arxiv_id":"2405.14414","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.14414","snapshot_observed_at":"2026-08-06T15:42:10.748568Z","title":"Proving Theorems Recursively","venue":"cs.AI","work_id":"bba3e724-eb9b-4ac9-bfc0-94213d93c5d3","year":2024},"citing_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-08-06T17:33:28.833666Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T15:42:08.608512Z"},"links":{"cited_paper":"/paper/2405.14414","citing_paper":"/paper/2507.15225"},"observation_digest":"sha256:56e50e7b8df68df659736cea4ef937c0523c20cd8a5cb7c2cb83d20a7d7fcfdc","observation_id":"b7755d51-ab5b-4161-84da-96813b7f2d01","resolution":{"observed_at":"2026-08-06T15:42:10.830714Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.14414/citation-record","integrity":"/paper/2405.14414/integrity","json":"/paper/2405.14414/citation-record.json","paper":"/paper/2405.14414"},"outbound":[],"paper":{"arxiv_id":"2405.14414","last_updated":"2024-05-23T10:35:08Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T18:18:30.066741Z","submitted_at":"2024-05-23T10:35:08Z","title":"Proving Theorems Recursively"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2405.14414."}