{"as_of":"2026-08-20T07:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6185861cddc231ca426babb981ffcd12bab1ef3f1e7098bb95882fb59d3704f8","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:35:27.215193Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T22:19:00.432407Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.10501","last_updated":"2020-06-11T23:20:59Z","snapshot_observed_at":"2026-08-15T12:56:55.002233Z","submitted_at":"2019-05-25T02:36:25Z","title":"Learning to Reason in Large Theories without Imitation","version":3},"cited_work":{"arxiv_id":"1905.10501","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.10501","snapshot_observed_at":"2026-07-03T22:19:00.432407Z","title":"Learning to reason in large theories without imitation","venue":null,"work_id":"f5bfea42-9a09-44a0-a9c5-6f1c4ac3ae2a","year":1905},"citing_paper":{"arxiv_id":"2009.03393","last_updated":"2020-09-07T19:50:10Z","snapshot_observed_at":"2026-08-18T11:16:18.404679Z","submitted_at":"2020-09-07T19:50:10Z","title":"Generative Language Modeling for Automated Theorem Proving","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T05:18:10.620262Z"},"links":{"cited_paper":"/paper/1905.10501","citing_paper":"/paper/2009.03393"},"observation_digest":"sha256:cea6e652f1fe0577307c73e39f8500fb434bdfd46e60906bcde5b004c367085b","observation_id":"dc2d2180-32fc-467f-b258-5a1f58e7da45","resolution":{"observed_at":"2026-05-23T05:18:10.701748Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10501","last_updated":"2020-06-11T23:20:59Z","snapshot_observed_at":"2026-08-15T12:56:55.002233Z","submitted_at":"2019-05-25T02:36:25Z","title":"Learning to Reason in Large Theories without Imitation","version":3},"cited_work":{"arxiv_id":"1905.10501","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.10501","snapshot_observed_at":"2026-07-03T22:19:00.432407Z","title":"Learning to reason in large theories without imitation","venue":null,"work_id":"f5bfea42-9a09-44a0-a9c5-6f1c4ac3ae2a","year":1905},"citing_paper":{"arxiv_id":"2109.00110","last_updated":"2022-02-28T06:03:23Z","snapshot_observed_at":"2026-08-20T02:16:40.511735Z","submitted_at":"2021-08-31T23:21:12Z","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T20:03:04.424625Z"},"links":{"cited_paper":"/paper/1905.10501","citing_paper":"/paper/2109.00110"},"observation_digest":"sha256:c74a772df4118d3f8fdd4260ddde416f0cfc29564a2864e6fe4fef272e0bb3c2","observation_id":"88f5481c-c902-4f49-895e-0ca96c32d96c","resolution":{"observed_at":"2026-05-16T20:03:04.453486Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10501","last_updated":"2020-06-11T23:20:59Z","snapshot_observed_at":"2026-08-15T12:56:55.002233Z","submitted_at":"2019-05-25T02:36:25Z","title":"Learning to Reason in Large Theories without Imitation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10501","snapshot_observed_at":"2026-08-11T12:35:27.215193Z","title":"Bansal, C","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2412.14063","last_updated":"2025-01-28T19:56:36Z","snapshot_observed_at":"2026-08-18T02:44:54.192691Z","submitted_at":"2024-12-18T17:08:42Z","title":"Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verification","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T12:35:27.215193Z"},"links":{"cited_paper":"/paper/1905.10501","citing_paper":"/paper/2412.14063"},"observation_digest":"sha256:50761a161a5b31ca1a5d38e3340d920d15729d35726b70575a2733422ca211ba","observation_id":"38355c8e-54d8-4cef-bccc-f06f0e035f20","resolution":{"observed_at":"2026-08-11T12:35:27.215193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10501","last_updated":"2020-06-11T23:20:59Z","snapshot_observed_at":"2026-08-15T12:56:55.002233Z","submitted_at":"2019-05-25T02:36:25Z","title":"Learning to Reason in Large Theories without Imitation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10501","snapshot_observed_at":"2026-08-06T15:42:05.567274Z","title":"Learning to reason in large theories without imitation.arXiv preprint arXiv:1905.10501, 2019","venue":null,"work_id":null,"year":1905},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:42:05.567274Z"},"links":{"cited_paper":"/paper/1905.10501","citing_paper":"/paper/2507.15225"},"observation_digest":"sha256:3139635a029c1c266729b69ed1ee862d3195146546883c877e6319cca5b19217","observation_id":"2e3c5bf6-5b0d-46e1-ba9a-f133544e4b90","resolution":{"observed_at":"2026-08-06T15:42:05.567274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10501","last_updated":"2020-06-11T23:20:59Z","snapshot_observed_at":"2026-08-15T12:56:55.002233Z","submitted_at":"2019-05-25T02:36:25Z","title":"Learning to Reason in Large Theories without Imitation","version":3},"cited_work":{"arxiv_id":"1905.10501","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.10501","snapshot_observed_at":"2026-07-03T22:19:00.432407Z","title":"Learning to reason in large theories without imitation","venue":null,"work_id":"f5bfea42-9a09-44a0-a9c5-6f1c4ac3ae2a","year":1905},"citing_paper":{"arxiv_id":"2606.17981","last_updated":"2026-07-24T00:53:17Z","snapshot_observed_at":"2026-08-17T04:13:54.246432Z","submitted_at":"2026-06-16T14:33:15Z","title":"Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T23:39:24.268789Z"},"links":{"cited_paper":"/paper/1905.10501","citing_paper":"/paper/2606.17981"},"observation_digest":"sha256:85c0eadcaf1dff9364d1fa7f6b8d237978ece898294e0812fec721434d4cc942","observation_id":"f59bb14a-b67d-4b17-8ded-9c1d4e7aa32f","resolution":{"observed_at":"2026-07-03T22:19:00.433815Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10501","last_updated":"2020-06-11T23:20:59Z","snapshot_observed_at":"2026-08-15T12:56:55.002233Z","submitted_at":"2019-05-25T02:36:25Z","title":"Learning to Reason in Large Theories without Imitation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10501","snapshot_observed_at":"2026-08-02T11:07:56.561219Z","title":"Lasse Blaauwbroek, Mirek Olšák, Jason Rute, Fidel Ivan Schaposnik Massolo, Jelle Piepenbrock, and Vasily Pestun","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2606.17981","last_updated":"2026-07-24T00:53:17Z","snapshot_observed_at":"2026-08-17T04:13:54.246432Z","submitted_at":"2026-06-16T14:33:15Z","title":"Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T11:07:56.561219Z"},"links":{"cited_paper":"/paper/1905.10501","citing_paper":"/paper/2606.17981"},"observation_digest":"sha256:d01165c2887c83ce43f2cf1b5fe67866095dd4f46653c9af26610df189a339e9","observation_id":"d9711988-8a67-4a45-887d-99da0c0bc5f7","resolution":{"observed_at":"2026-08-02T11:07:56.561219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.10501/citation-record","integrity":"/paper/1905.10501/integrity","json":"/paper/1905.10501/citation-record.json","paper":"/paper/1905.10501"},"outbound":[],"paper":{"arxiv_id":"1905.10501","last_updated":"2020-06-11T23:20:59Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T12:56:55.002233Z","submitted_at":"2019-05-25T02:36:25Z","title":"Learning to Reason in Large Theories without Imitation"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1905.10501."}