{"as_of":"2026-08-06T06:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10b55a1d039cbeeadbe06135905f63f6d038bd4cde3ea17772f53e0516386f7b","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-05T06:32:48.257954+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-05T16:11:23.282888Z","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-01T09:45:40.447075Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.16366","last_updated":"2023-05-25T11:35:52Z","snapshot_observed_at":"2026-07-06T15:33:34.832607Z","submitted_at":"2023-05-25T11:35:52Z","title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16366","snapshot_observed_at":"2026-08-05T16:11:23.282888Z","title":"Decomposing the enigma: Subgoal-based demonstration learning for formal theorem proving, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.18914","last_updated":"2025-08-26T10:38:18Z","snapshot_observed_at":"2026-08-05T16:11:09.217502Z","submitted_at":"2025-08-26T10:38:18Z","title":"FormaRL: Enhancing Autoformalization with no Labeled Data","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T16:11:23.282888Z"},"links":{"cited_paper":"/paper/2305.16366","citing_paper":"/paper/2508.18914"},"observation_digest":"sha256:fc48dee675b158b147f46d5681982ef58184247e8c2bde68b4c67d4cef3c0f36","observation_id":"a4bb4ad3-cd92-4155-8927-362760e4f1a6","resolution":{"observed_at":"2026-08-05T16:11:23.282888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16366","last_updated":"2023-05-25T11:35:52Z","snapshot_observed_at":"2026-07-06T15:33:34.832607Z","submitted_at":"2023-05-25T11:35:52Z","title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","version":1},"cited_work":{"arxiv_id":"2305.16366","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.16366","snapshot_observed_at":"2026-07-01T09:45:40.447075Z","title":"arXiv preprint arXiv:2305.16366 (2023).https: //arxiv.org/abs/2305.16366","venue":null,"work_id":"56546033-347c-44a8-9aa4-9d2c4ec95134","year":2023},"citing_paper":{"arxiv_id":"2605.23643","last_updated":"2026-05-22T13:55:11Z","snapshot_observed_at":"2026-08-02T12:37:45.812132Z","submitted_at":"2026-05-22T13:55:11Z","title":"Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-25T04:09:10.588205Z"},"links":{"cited_paper":"/paper/2305.16366","citing_paper":"/paper/2605.23643"},"observation_digest":"sha256:373409badaac0425d2c3490a51d66ba3a10ee71afcd1649700a6e0b18b2bfca4","observation_id":"2ce60bed-b1c9-4b0f-8c05-20227f33e069","resolution":{"observed_at":"2026-05-25T04:10:19.421794Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16366","last_updated":"2023-05-25T11:35:52Z","snapshot_observed_at":"2026-07-06T15:33:34.832607Z","submitted_at":"2023-05-25T11:35:52Z","title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving","version":1},"cited_work":{"arxiv_id":"2305.16366","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.16366","snapshot_observed_at":"2026-07-01T09:45:40.447075Z","title":"arXiv preprint arXiv:2305.16366 (2023).https: //arxiv.org/abs/2305.16366","venue":null,"work_id":"56546033-347c-44a8-9aa4-9d2c4ec95134","year":2023},"citing_paper":{"arxiv_id":"2606.31048","last_updated":"2026-06-30T02:34:45Z","snapshot_observed_at":"2026-07-07T00:04:48.748126Z","submitted_at":"2026-06-30T02:34:45Z","title":"Knowledge Distillation from Large Reasoning Models to Compact Student Models: A Case Study on the John O Bryan Mathematics Competition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-01T06:12:33.386915Z"},"links":{"cited_paper":"/paper/2305.16366","citing_paper":"/paper/2606.31048"},"observation_digest":"sha256:767da4de1ca268b5293461e1c725014aaa86b0dea7f0f279e3dbff2b072de8eb","observation_id":"63093732-3028-407c-9823-41cbbb51c0c8","resolution":{"observed_at":"2026-07-01T09:45:40.448656Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.16366/citation-record","integrity":"/paper/2305.16366/integrity","json":"/paper/2305.16366/citation-record.json","paper":"/paper/2305.16366"},"outbound":[],"paper":{"arxiv_id":"2305.16366","last_updated":"2023-05-25T11:35:52Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T15:33:34.832607Z","submitted_at":"2023-05-25T11:35:52Z","title":"Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal 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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2305.16366."}