{"as_of":"2026-08-08T08:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93b1904f6338ff5ccce6aa9fa54569cb7088f07d72498c2d4d378027b91d3a6a","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:48:57.988181Z","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-07T12:35:21.271130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.16961","last_updated":"2025-07-12T18:39:50Z","snapshot_observed_at":"2026-08-07T23:31:49.987974Z","submitted_at":"2025-01-28T14:04:49Z","title":"Instantiation-based Formalization of Logical Reasoning Tasks using Language Models and Logical Solvers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16961","snapshot_observed_at":"2026-08-07T13:48:57.988181Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20869","last_updated":"2025-05-27T08:21:07Z","snapshot_observed_at":"2026-08-07T23:32:20.126880Z","submitted_at":"2025-05-27T08:21:07Z","title":"Step-Wise Formal Verification for LLM-Based Mathematical Problem Solving","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T13:48:57.988181Z"},"links":{"cited_paper":"/paper/2501.16961","citing_paper":"/paper/2505.20869"},"observation_digest":"sha256:108aa9d0897baeb9a880b0f33e2313cdfad119c6dfd5a27f09efb3609e862c6f","observation_id":"e663a350-2a2e-427f-844d-3cb1ba44e5c0","resolution":{"observed_at":"2026-08-07T13:48:57.988181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16961","last_updated":"2025-07-12T18:39:50Z","snapshot_observed_at":"2026-08-07T23:31:49.987974Z","submitted_at":"2025-01-28T14:04:49Z","title":"Instantiation-based Formalization of Logical Reasoning Tasks using Language Models and Logical Solvers","version":3},"cited_work":{"arxiv_id":"2501.16961","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.16961","snapshot_observed_at":"2026-08-07T12:35:21.271130Z","title":"Instantiation-based Formalization of Logical Reasoning Tasks using Language Models and Logical Solvers","venue":"cs.AI","work_id":"5322b59c-96de-4652-bb5d-180bc20d8215","year":2025},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-07T12:25:00.520357Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.580682Z"},"links":{"cited_paper":"/paper/2501.16961","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:ef924edaad2451c7053636e4c42ca6790eef6211ee641bad04b845d3457d0155","observation_id":"c1f2fb47-8d4b-46ee-8ca3-cbc3001b7a98","resolution":{"observed_at":"2026-08-07T12:35:21.319763Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.16961/citation-record","integrity":"/paper/2501.16961/integrity","json":"/paper/2501.16961/citation-record.json","paper":"/paper/2501.16961"},"outbound":[],"paper":{"arxiv_id":"2501.16961","last_updated":"2025-07-12T18:39:50Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T23:31:49.987974Z","submitted_at":"2025-01-28T14:04:49Z","title":"Instantiation-based Formalization of Logical Reasoning Tasks using Language Models and Logical Solvers"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2501.16961."}