{"as_of":"2026-08-14T21:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1ddb6074dafff4805aedad12793af3fa9bfe20154e9ef1e5b2939d57eadf350","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T00:06:30.301566Z","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-07-10T18:17:33.729323Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.01829","last_updated":"2024-11-04T05:57:40Z","snapshot_observed_at":"2026-08-12T22:08:34.872260Z","submitted_at":"2024-11-04T05:57:40Z","title":"Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01829","snapshot_observed_at":"2026-08-10T00:06:30.301566Z","title":"First, E., Rabe, 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-12T08:26:35.957333Z","submitted_at":"2025-01-30T12:37:06Z","title":"ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure Analysis","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T00:06:30.301566Z"},"links":{"cited_paper":"/paper/2411.01829","citing_paper":"/paper/2501.18310"},"observation_digest":"sha256:d2acafe81f15d77d96426cf52f934c7de255af7a56e1a9909446a10d62bd8c11","observation_id":"9040e1f3-0816-4f49-a9a4-61cddf875516","resolution":{"observed_at":"2026-08-10T00:06:30.301566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01829","last_updated":"2024-11-04T05:57:40Z","snapshot_observed_at":"2026-08-12T22:08:34.872260Z","submitted_at":"2024-11-04T05:57:40Z","title":"Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically","version":1},"cited_work":{"arxiv_id":"2411.01829","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.01829","snapshot_observed_at":"2026-07-10T18:17:33.729323Z","title":"Google Gemini Team","venue":"cs.LG","work_id":"136f083e-4301-427f-a2bb-c5b3b0921203","year":2024},"citing_paper":{"arxiv_id":"2604.16278","last_updated":"2026-05-29T17:46:02Z","snapshot_observed_at":"2026-08-11T00:53:23.916890Z","submitted_at":"2026-04-17T17:36:21Z","title":"Learning to Reason with Insight for Informal Theorem Proving","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T08:35:11.082440Z"},"links":{"cited_paper":"/paper/2411.01829","citing_paper":"/paper/2604.16278"},"observation_digest":"sha256:d6131044c3a03532ffcb8df55bc33bca2c43e87200f0f45c6d342004714e51f8","observation_id":"80d3c204-e517-4191-9338-e5e5db0b0bd7","resolution":{"observed_at":"2026-05-10T08:53:04.884987Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01829","last_updated":"2024-11-04T05:57:40Z","snapshot_observed_at":"2026-08-12T22:08:34.872260Z","submitted_at":"2024-11-04T05:57:40Z","title":"Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically","version":1},"cited_work":{"arxiv_id":"2411.01829","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.01829","snapshot_observed_at":"2026-07-10T18:17:33.729323Z","title":"Google Gemini Team","venue":"cs.LG","work_id":"136f083e-4301-427f-a2bb-c5b3b0921203","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":62,"source":"pdf_text","source_observed_at":"2026-07-10T18:16:31.176239Z"},"links":{"cited_paper":"/paper/2411.01829","citing_paper":"/paper/2607.07779"},"observation_digest":"sha256:04e315d8d57f9a2bb7f67784b606fa6720669cd284ae50ec147a64aa9d6be501","observation_id":"417dd885-39d8-46a4-9064-d569b606327a","resolution":{"observed_at":"2026-07-10T18:17:33.730527Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.01829/citation-record","integrity":"/paper/2411.01829/integrity","json":"/paper/2411.01829/citation-record.json","paper":"/paper/2411.01829"},"outbound":[],"paper":{"arxiv_id":"2411.01829","last_updated":"2024-11-04T05:57:40Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T22:08:34.872260Z","submitted_at":"2024-11-04T05:57:40Z","title":"Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2411.01829."}