{"as_of":"2026-08-08T03:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74eac455213c457663a9007be01a1e85a352efd6fe55f8189ac71eff321b1f91","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-07T06:34:17.273281+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-07T14:06:30.223009Z","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-05-11T20:46:14.557251Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.01379","last_updated":"2024-10-11T11:54:35Z","snapshot_observed_at":"2026-07-06T18:08:52.053005Z","submitted_at":"2024-05-02T15:20:01Z","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01379","snapshot_observed_at":"2026-08-07T14:06:30.223009Z","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving.arXiv preprint arXiv:2405.01379,","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":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:30.223009Z"},"links":{"cited_paper":"/paper/2405.01379","citing_paper":"/paper/2505.20047"},"observation_digest":"sha256:af1687d6b93c7f3130b10fd6ac2a4bc9afa701bf462be64b4910ea368d661cd2","observation_id":"5894d4ff-3ce2-452b-828a-ad0ab1158df2","resolution":{"observed_at":"2026-08-07T14:06:30.223009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01379","last_updated":"2024-10-11T11:54:35Z","snapshot_observed_at":"2026-07-06T18:08:52.053005Z","submitted_at":"2024-05-02T15:20:01Z","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01379","snapshot_observed_at":"2026-08-07T04:22:32.618962Z","title":"Verification and refinement of natural language explanations through llm-symbolic theorem proving,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10704","last_updated":"2025-06-12T13:55:01Z","snapshot_observed_at":"2026-08-07T04:17:35.474642Z","submitted_at":"2025-06-12T13:55:01Z","title":"Formalising Software Requirements using Large Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:32.618962Z"},"links":{"cited_paper":"/paper/2405.01379","citing_paper":"/paper/2506.10704"},"observation_digest":"sha256:574af75e393faa634dbe27797d110b51ea30d773b0688d5444b0959f8aa32f6c","observation_id":"0677d04a-6515-4019-b1cc-8f396a307ee0","resolution":{"observed_at":"2026-08-07T04:22:32.618962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01379","last_updated":"2024-10-11T11:54:35Z","snapshot_observed_at":"2026-07-06T18:08:52.053005Z","submitted_at":"2024-05-02T15:20:01Z","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01379","snapshot_observed_at":"2026-08-07T01:07:26.821274Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11874","last_updated":"2025-06-13T15:26:58Z","snapshot_observed_at":"2026-08-07T00:59:41.634916Z","submitted_at":"2025-06-13T15:26:58Z","title":"A Short Survey on Formalising Software Requirements using Large Language Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T01:07:26.821274Z"},"links":{"cited_paper":"/paper/2405.01379","citing_paper":"/paper/2506.11874"},"observation_digest":"sha256:0c3e41a5f4fe90dafe371eb661b74a82de433556d68670601413d17b5cfa379f","observation_id":"01cb34fd-2da7-469e-a76b-04fd576f38ff","resolution":{"observed_at":"2026-08-07T01:07:26.821274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01379","last_updated":"2024-10-11T11:54:35Z","snapshot_observed_at":"2026-07-06T18:08:52.053005Z","submitted_at":"2024-05-02T15:20:01Z","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01379","snapshot_observed_at":"2026-08-06T16:13:49.215071Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14330","last_updated":"2025-08-28T13:50:56Z","snapshot_observed_at":"2026-08-06T15:56:20.113627Z","submitted_at":"2025-07-18T19:15:50Z","title":"Leveraging LLMs for Formal Software Requirements -- Challenges and Prospects","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:13:49.215071Z"},"links":{"cited_paper":"/paper/2405.01379","citing_paper":"/paper/2507.14330"},"observation_digest":"sha256:b682c975c2d31bb5c76d06b16391f548bd7cf6192afc2b0976c5b1c484e39148","observation_id":"95701591-969b-4024-8c52-33761089e888","resolution":{"observed_at":"2026-08-06T16:13:49.215071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01379","last_updated":"2024-10-11T11:54:35Z","snapshot_observed_at":"2026-07-06T18:08:52.053005Z","submitted_at":"2024-05-02T15:20:01Z","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving","version":4},"cited_work":{"arxiv_id":"2405.01379","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.01379","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Explanation-refiner: iterative LLM refinement under formal verifier feedback","venue":null,"work_id":"dc4bc0d9-2978-4775-b657-3ce301a3feba","year":2024},"citing_paper":{"arxiv_id":"2604.23398","last_updated":"2026-04-25T18:11:01Z","snapshot_observed_at":"2026-08-02T11:01:13.564458Z","submitted_at":"2026-04-25T18:11:01Z","title":"When Corrective Hints Hurt: Prompt Design in Reasoner-Guided Repair of LLM Overcaution on Entailed Negations under OWL~2~DL","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-08T07:59:54.260305Z"},"links":{"cited_paper":"/paper/2405.01379","citing_paper":"/paper/2604.23398"},"observation_digest":"sha256:1b169b2a50dea1e567f126526c958d15942264bdff9952e11d958af2924e03a1","observation_id":"47ea0f62-985d-4aa6-938d-c7bc67e6aaae","resolution":{"observed_at":"2026-05-11T20:46:14.561791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.01379/citation-record","integrity":"/paper/2405.01379/integrity","json":"/paper/2405.01379/citation-record.json","paper":"/paper/2405.01379"},"outbound":[],"paper":{"arxiv_id":"2405.01379","last_updated":"2024-10-11T11:54:35Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T18:08:52.053005Z","submitted_at":"2024-05-02T15:20:01Z","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2405.01379."}