{"as_of":"2026-08-10T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9b70a2370f46987538b9b3c3e024d6f966c67ee576d577a2e2a0b414b05e21f","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:35:20.705342Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-07T04:18:33.164701Z","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-03T01:17:30.580394Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.24264","snapshot_observed_at":"2026-08-07T04:18:33.164701Z","title":"Faithful and robust llm-driven theorem proving for nli explanations","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10903","last_updated":"2025-06-12T17:09:51Z","snapshot_observed_at":"2026-08-09T13:17:37.670421Z","submitted_at":"2025-06-12T17:09:51Z","title":"Beyond Gold Standards: Epistemic Ensemble of LLM Judges for Formal Mathematical Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:18:33.164701Z"},"links":{"cited_paper":"/paper/2505.24264","citing_paper":"/paper/2506.10903"},"observation_digest":"sha256:e16ba6096c0f33b851dfc0079919279cc5ab6b13b02ecfe10658ab94418fa278","observation_id":"18ad6655-73c1-46cd-81ce-1d69c186e9d8","resolution":{"observed_at":"2026-08-07T04:18:33.164701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"cited_work":{"arxiv_id":"2505.24264","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.24264","snapshot_observed_at":"2026-07-03T01:17:30.580394Z","title":"and Freitas, Andr","venue":null,"work_id":"8cbff8f6-c812-41a0-9e25-a6c0a7ffc4da","year":null},"citing_paper":{"arxiv_id":"2606.09449","last_updated":"2026-06-08T12:57:09Z","snapshot_observed_at":"2026-07-06T23:48:48.962930Z","submitted_at":"2026-06-08T12:57:09Z","title":"Reasoning without Gold Standards: A Proxy-Judge Theory of Autoformalization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-27T16:44:03.889425Z"},"links":{"cited_paper":"/paper/2505.24264","citing_paper":"/paper/2606.09449"},"observation_digest":"sha256:e5936b9a2aa6270a683de51d1ea6b08a54d39c7430f7634c377084bbaadbcdab","observation_id":"8f3ab411-6f43-4b59-864e-0e53782dc012","resolution":{"observed_at":"2026-07-03T01:17:30.581839Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.24264/citation-record","integrity":"/paper/2505.24264/integrity","json":"/paper/2505.24264/citation-record.json","paper":"/paper/2505.24264"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.07524","last_updated":"2022-11-14T16:52:32Z","snapshot_observed_at":"2026-08-07T23:33:09.684973Z","submitted_at":"2022-11-14T16:52:32Z","title":"Towards a Mathematics Formalisation Assistant using Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07524","snapshot_observed_at":"2026-08-07T12:35:15.731803Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:15.731803Z"},"links":{"cited_paper":"/paper/2211.07524","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:eac33b798148a600d3a258ea75be0c896531128c5f50d6e66388045eec88c52b","observation_id":"64645f5a-97bf-414c-bfec-77c2fff01910","resolution":{"observed_at":"2026-08-07T12:35:15.731803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:15.823227Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:15.823227Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:9d0171c3740ede906d0fedd3495d831ad81a8480a89f451c1dae33d715684871","observation_id":"5742ce08-a145-4157-b664-969605f22cae","resolution":{"observed_at":"2026-08-07T12:35:15.823227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2021.acl-long.196","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:20.880971Z","title":null,"venue":null,"work_id":"977c0c8d-57d7-4ad7-ac7b-771ea5d34b1a","year":2021},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:15.995027Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:b791efb355f07c7718b0084330c2dd2e4b9f7676ecfb38b192b4e29e91f3150d","observation_id":"4b4e4bed-82cc-41ec-9a88-9d8556b0aaa9","resolution":{"observed_at":"2026-08-07T12:35:20.919044Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:16.105741Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.105741Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:d84ba6c7230afa9631df2eea9b6e968606086d34b0a292d459d2c568eb8cd150","observation_id":"5b63f6f1-148b-45be-a2f0-4a852d664985","resolution":{"observed_at":"2026-08-07T12:35:16.105741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-07T12:35:16.202092Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.202092Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:d26bcfa2bab89b1a80becd1318dce565911ca592f3b3dec6ecbed4e66a73463b","observation_id":"7eb3e218-9feb-435d-b8d1-bc76da450488","resolution":{"observed_at":"2026-08-07T12:35:16.202092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04910","last_updated":"2023-03-16T01:09:08Z","snapshot_observed_at":"2026-08-05T15:17:11.739277Z","submitted_at":"2023-03-08T22:00:15Z","title":"Baldur: Whole-Proof Generation and Repair with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04910","snapshot_observed_at":"2026-08-07T12:35:16.313759Z","title":"Rabe, Talia Ringer, and Yuriy Brun","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.313759Z"},"links":{"cited_paper":"/paper/2303.04910","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:47191fe00cc7927475620787bfa472c1a457df7ea4af22cf01e8642bca92ad94","observation_id":"9bd7e4db-c3e4-4723-acaf-53f0f40e7ade","resolution":{"observed_at":"2026-08-07T12:35:16.313759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04556","last_updated":"2024-04-02T14:35:40Z","snapshot_observed_at":"2026-08-09T21:40:25.265708Z","submitted_at":"2023-12-07T18:59:29Z","title":"Large Language Models for Mathematicians","version":2},"cited_work":{"arxiv_id":"2312.04556","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.04556","snapshot_observed_at":"2026-08-07T12:35:21.752329Z","title":"Large Language Models for Mathematicians","venue":"cs.CL","work_id":"51efbaad-a4f2-41e1-83a9-914b4a21a598","year":2023},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.441656Z"},"links":{"cited_paper":"/paper/2312.04556","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:31520e5e1bf6e4c0bc34864686c7682d293b1d4c5568d41cff57ecad222c74b0","observation_id":"34db7fb4-a34e-431b-97a5-fe0662ef0686","resolution":{"observed_at":"2026-08-07T12:35:21.815931Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.16779","last_updated":"2025-01-14T14:26:03Z","snapshot_observed_at":"2026-08-09T21:41:09.665508Z","submitted_at":"2024-08-15T16:41:00Z","title":"Inductive Learning of Logical Theories with LLMs: An Expressivity-Graded Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.16779","snapshot_observed_at":"2026-08-07T12:35:16.556436Z","title":"Carvalho, and André Freitas","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.556436Z"},"links":{"cited_paper":"/paper/2408.16779","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:d79dd262f6013f94fc241785ee95b714d0682dc8613e263d767209d5d69b101b","observation_id":"adf89628-98fd-48b0-809b-fd1f5a1b3292","resolution":{"observed_at":"2026-08-07T12:35:16.556436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T12:35:16.671047Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.671047Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:af436b1087b1525cb29d9515fab3466d119e3c7534f2ac70cc42a3a9b754ad2f","observation_id":"f3281cee-7c03-43b4-bf0f-0a0c8a7b694c","resolution":{"observed_at":"2026-08-07T12:35:16.671047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:16.842889Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.842889Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:218085745f216035f185a4f88732bc7ff5b754a8f2fe7b2a649c05756bf342e3","observation_id":"7c8e2418-2672-478b-8d0f-a434fa2da86b","resolution":{"observed_at":"2026-08-07T12:35:16.842889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:23.647725Z","title":null,"venue":null,"work_id":"30de6bf0-b8ec-4541-9351-bc90af38d63a","year":2018},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:16.992670Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:0a541c15a1c672365c997b01b43119993048d5f1c0e5eafca9d2866d6f217f2d","observation_id":"fdad9188-cf3f-44bb-b2de-74cf7a6ac54f","resolution":{"observed_at":"2026-08-07T12:35:23.818662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:23.319011Z","title":null,"venue":null,"work_id":"17035b80-a7b2-4e59-90cc-2f27c02a3e4e","year":2022},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.129123Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:955f7add3546d91e9f077e1888ed6c50a33eb0213d7bda95d88cf7e5499c1303","observation_id":"4097ae4d-b15a-42d9-8e70-dde0802916b9","resolution":{"observed_at":"2026-08-07T12:35:23.484213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12283","last_updated":"2023-02-20T16:10:20Z","snapshot_observed_at":"2026-08-09T00:42:45.030767Z","submitted_at":"2022-10-21T22:37:22Z","title":"Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12283","snapshot_observed_at":"2026-08-07T12:35:17.230533Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.230533Z"},"links":{"cited_paper":"/paper/2210.12283","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:5932e30c0d5c3486645b211756638945c884587510b347ea73ba1e50e6b9f9d7","observation_id":"256d4e5a-62ec-4803-909b-161d377e0160","resolution":{"observed_at":"2026-08-07T12:35:17.230533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:17.358975Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.358975Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:80cda9b656ca6567205ce3c6f96e2c5c1e4d42b967794a931ae8e47089159f48","observation_id":"c6f2098d-644e-4898-bc42-f311ee385b42","resolution":{"observed_at":"2026-08-07T12:35:17.358975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:23.051107Z","title":null,"venue":null,"work_id":"838a5252-e162-4fce-af23-795849d14299","year":2019},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.466588Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:bea620cc866304e26bfb0ce57aa8bdc47c3e0830f2429003990dea90101c55a0","observation_id":"b1deab77-380c-490a-8339-9ea36e7ed810","resolution":{"observed_at":"2026-08-07T12:35:23.198958Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.883181Z","title":null,"venue":null,"work_id":"b8ff93d7-8040-4172-98d8-fb20692c44b7","year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.607390Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:143bec38cb6fb4501a9accc67660085c201f7286db717bc300a37010e2d6efb7","observation_id":"57ec5103-e527-4699-889d-a1a33624fced","resolution":{"observed_at":"2026-08-07T12:35:22.944176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:17.712492Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.712492Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:68a5e83cf26c29ec8e14c0c76fc6d55bfa2f3d26a96f90dd1a4c588c399c3b98","observation_id":"9666dd8c-51aa-48f8-b951-e388f0b0892f","resolution":{"observed_at":"2026-08-07T12:35:17.712492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16757","last_updated":"2025-02-24T00:18:17Z","snapshot_observed_at":"2026-08-09T17:47:59.116534Z","submitted_at":"2025-02-24T00:18:17Z","title":"Entailment-Preserving First-order Logic Representations in Natural Language Entailment","version":1},"cited_work":{"arxiv_id":"2502.16757","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.16757","snapshot_observed_at":"2026-08-07T12:35:21.549347Z","title":"Entailment-Preserving First-order Logic Representations in Natural Language Entailment","venue":"cs.CL","work_id":"70fcbf02-6e4d-45a9-9d7e-63e476bbf2d7","year":2025},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.801972Z"},"links":{"cited_paper":"/paper/2502.16757","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:3debce43e1347f11a9266a6d82e8081b06949b48216edb1f3cfc69be4c42c69e","observation_id":"1b14e316-50e7-4ebd-bcd6-6601032a2e54","resolution":{"observed_at":"2026-08-07T12:35:21.585685Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.783836Z","title":null,"venue":null,"work_id":"a06208b0-bf69-4ef6-b576-f91cac31c8e0","year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:17.955696Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:a077afdccefd5f3c79462838502b7fca9ee8d8e85ae815acb46d4d82a612754b","observation_id":"894abc15-cd82-420d-ab3e-58ae047ed7f1","resolution":{"observed_at":"2026-08-07T12:35:22.817243Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17539","last_updated":"2025-02-07T01:16:53Z","snapshot_observed_at":"2026-07-06T19:22:32.667859Z","submitted_at":"2024-09-26T04:59:45Z","title":"Logic-of-Thought: Injecting Logic into Contexts for Full Reasoning in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17539","snapshot_observed_at":"2026-08-07T12:35:18.039212Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.039212Z"},"links":{"cited_paper":"/paper/2409.17539","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:930ed73df037801975dc5f0954309bcd0ba2a409a5b80c804287ac03d0825e71","observation_id":"99c6dd54-14d4-4541-a4b5-4aed1124880c","resolution":{"observed_at":"2026-08-07T12:35:18.039212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10135","last_updated":"2024-10-14T03:58:35Z","snapshot_observed_at":"2026-08-07T23:32:58.884993Z","submitted_at":"2024-10-14T03:58:35Z","title":"FormalAlign: Automated Alignment Evaluation for Autoformalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10135","snapshot_observed_at":"2026-08-07T12:35:18.170586Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.170586Z"},"links":{"cited_paper":"/paper/2410.10135","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:be76d2d291b2bd794339e4fa43f78df020516eea4899473d5ea6465771a6bb12","observation_id":"ae943ddf-77b0-4d5d-a27e-269c04b1b4c9","resolution":{"observed_at":"2026-08-07T12:35:18.170586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01940","last_updated":"2024-10-14T03:46:00Z","snapshot_observed_at":"2026-08-05T18:55:10.658942Z","submitted_at":"2024-06-04T03:48:08Z","title":"Process-Driven Autoformalization in Lean 4","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01940","snapshot_observed_at":"2026-08-07T12:35:18.277953Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.277953Z"},"links":{"cited_paper":"/paper/2406.01940","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:fa5f2d5db9179d3cfe813485546382c76cb84120ca75e91e0b6f445d7d0269db","observation_id":"ddcbce80-c323-4f9f-be30-9edc311eb6e0","resolution":{"observed_at":"2026-08-07T12:35:18.277953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.667099Z","title":"Maienborn, K","venue":null,"work_id":"af801a72-e82b-4f37-a3fa-a42611117f76","year":2011},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.350861Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:fc48563729277b58580ac0c2de27fea4df438c90802eca3d60d3c5ac5918aa5c","observation_id":"5660deb3-ac99-44c0-9164-597d58712142","resolution":{"observed_at":"2026-08-07T12:35:22.715769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:18.484862Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.484862Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:b08e442093db6ff3382c7a72352ce213b4db6db63c54a873483c6a22a4d59b1f","observation_id":"3115dc25-dbe7-46f9-ab5c-d5724f062131","resolution":{"observed_at":"2026-08-07T12:35:18.484862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.527549Z","title":null,"venue":null,"work_id":"b4d4679b-bafd-4bc2-a567-cb1097168c32","year":2002},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.562198Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:6fe42a1fdc92d10ca9240625f27c354626d89d1852d214db50c11a2c11caf498","observation_id":"78060f3d-547b-476a-832c-76b63ce6faac","resolution":{"observed_at":"2026-08-07T12:35:22.593958Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:18.667644Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.667644Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:b91e79d826e6d0d3367e25cab181850a693093d5ab161f5ae40436180be27a9b","observation_id":"f7910bb8-173d-4d58-b686-7d6a20ac9506","resolution":{"observed_at":"2026-08-07T12:35:18.667644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T12:35:18.757245Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.757245Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:4f6766dd0d1bd9a73ff77b8bcd21ebc519b879a1c65b8ffb16d39028e080e11b","observation_id":"93374cb4-522b-40da-9c7d-6824ac15cb25","resolution":{"observed_at":"2026-08-07T12:35:18.757245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:18.850063Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.850063Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:c711fe345b6b67597cf6e807aec7c42f25eb3b17b5366cd9a2f8d87b885f4b8d","observation_id":"41e7e76e-9066-461f-ad25-fd3a866af208","resolution":{"observed_at":"2026-08-07T12:35:18.850063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.400044Z","title":null,"venue":null,"work_id":"cbfa421b-3383-4b68-982c-a1c800fae5b1","year":1990},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:18.928935Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:9418f483fe67d2491772e8d28c3d9b9d17d333aceb496414e65ff75fcf5691ed","observation_id":"11ea7c16-c3c4-48bb-9b38-f5a3f368f124","resolution":{"observed_at":"2026-08-07T12:35:22.468672Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.270384Z","title":null,"venue":null,"work_id":"fb2a4cda-f7e1-4c33-8334-7b2aef78a825","year":2012},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.044729Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:e4d256e62e2d0da7cd2dc990649ba5f03706684040691f59e91552b3d6816524","observation_id":"94e3b956-d7e8-4718-bc4e-8a170b6471aa","resolution":{"observed_at":"2026-08-07T12:35:22.326327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03393","last_updated":"2020-09-07T19:50:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-09-07T19:50:10Z","title":"Generative Language Modeling for Automated Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03393","snapshot_observed_at":"2026-08-07T12:35:19.123684Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.123684Z"},"links":{"cited_paper":"/paper/2009.03393","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:c915d5c554345d4a80c74408955a5c219fd21778fa8e85d5121e0373aa7f33cc","observation_id":"0a3c9637-b8aa-4a32-8a75-358be4ebaaf2","resolution":{"observed_at":"2026-08-07T12:35:19.123684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:19.190177Z","title":"Becker, Arto Hellas, Paul Denny, and Brent N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.190177Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:d86b3a0ba79167e47e440000536795179b707b16448432065556d9bd49e4bfa2","observation_id":"b388d6fe-b624-4164-9f10-c7da147995c0","resolution":{"observed_at":"2026-08-07T12:35:19.190177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06563","last_updated":"2025-03-02T16:38:28Z","snapshot_observed_at":"2026-08-08T15:00:36.926597Z","submitted_at":"2025-02-10T15:31:54Z","title":"Large Language Models Meet Symbolic Provers for Logical Reasoning Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06563","snapshot_observed_at":"2026-08-07T12:35:19.306365Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.306365Z"},"links":{"cited_paper":"/paper/2502.06563","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:48fe22195bbe505e7aa103e38b23b9ca6a86d26f786f8534968b9011c7921ad7","observation_id":"68c99d71-793b-42b3-84bd-46ce86b62c49","resolution":{"observed_at":"2026-08-07T12:35:19.306365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.175678Z","title":null,"venue":null,"work_id":"e1b53d53-5522-4941-9161-f9e58e4ac56b","year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.398220Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:f7d5dee5c94986c1c9b32789f2feafb134176b3c97c92d9a991680d2722a55e5","observation_id":"7c68f8a2-15f4-42a5-bfba-e6d7e7656608","resolution":{"observed_at":"2026-08-07T12:35:22.208976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:19.492657Z","title":"Dennis, and Andre Freitas","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.492657Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:33699b160c4be4ea4f7ec3811cd677db4d9956402b8d96e3286e265726638359","observation_id":"5a0c14d9-b753-4d84-9c50-afd214fb894b","resolution":{"observed_at":"2026-08-07T12:35:19.492657Z","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-09T15:00:46.551272Z","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-09T08:54:46.686321Z","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:e595aac7968a16287764e7a7de083acd7704caf72c2aeb4b5094b5d6e7eadd00","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04353","last_updated":"2024-08-08T04:15:31Z","snapshot_observed_at":"2026-08-07T23:31:29.854288Z","submitted_at":"2023-10-06T16:21:22Z","title":"An In-Context Learning Agent for Formal Theorem-Proving","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04353","snapshot_observed_at":"2026-08-07T12:35:19.670076Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.670076Z"},"links":{"cited_paper":"/paper/2310.04353","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:36a1d69607840243747d990b794b76bcc33888c504d0c5e0fe210780807f1c4a","observation_id":"82a89a40-98e0-4ce3-a677-c4f054ca48ef","resolution":{"observed_at":"2026-08-07T12:35:19.670076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.00389","last_updated":"2020-10-01T13:26:58Z","snapshot_observed_at":"2026-08-07T23:31:59.315299Z","submitted_at":"2020-10-01T13:26:58Z","title":"A Survey on Explainability in Machine Reading Comprehension","version":1},"cited_work":{"arxiv_id":"2010.00389","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.00389","snapshot_observed_at":"2026-08-07T12:35:21.087100Z","title":"A Survey on Explainability in Machine Reading Comprehension","venue":"cs.CL","work_id":"cdf875c2-7d98-4083-a86e-b67974196b03","year":2020},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.764789Z"},"links":{"cited_paper":"/paper/2010.00389","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:249a6b4061b06d47dd5a269e9483ca1c68ae7843b641b829b1e8d9978b114379","observation_id":"bf174839-6141-49f5-804a-f94b9f76c000","resolution":{"observed_at":"2026-08-07T12:35:21.159133Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:22.044717Z","title":null,"venue":null,"work_id":"1a422431-9b27-4976-a531-03739082fba7","year":2022},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.837754Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:d1940708145a2e880c07ac038713d01d9b78e6bbf158d3a377388f8f2daad581","observation_id":"bf613cff-1d2e-4c10-9773-ecaf624fadb6","resolution":{"observed_at":"2026-08-07T12:35:22.114053Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18457","last_updated":"2023-10-27T20:10:56Z","snapshot_observed_at":"2026-08-07T23:31:53.556397Z","submitted_at":"2023-10-27T20:10:56Z","title":"LLMSTEP: LLM proofstep suggestions in Lean","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18457","snapshot_observed_at":"2026-08-07T12:35:19.988186Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:19.988186Z"},"links":{"cited_paper":"/paper/2310.18457","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:b1a1708e51e16a0d8bb6fec27bff4016b96506302b50cd266eb9dde42781201a","observation_id":"b3e6e4c1-938e-4d67-bd70-b145e51e865d","resolution":{"observed_at":"2026-08-07T12:35:19.988186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.12060","last_updated":"2021-12-07T18:56:13Z","snapshot_observed_at":"2026-08-07T23:31:38.197461Z","submitted_at":"2021-02-24T04:25:01Z","title":"Teach Me to Explain: A Review of Datasets for Explainable Natural Language Processing","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.12060","snapshot_observed_at":"2026-08-07T12:35:20.069212Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.069212Z"},"links":{"cited_paper":"/paper/2102.12060","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:d6b41132bb6b52bf35b4cf9e489c205594d08fbc7a374f0a63b28ff7ae43545b","observation_id":"583cbf75-f2b8-4c51-b051-fcaf269b7f07","resolution":{"observed_at":"2026-08-07T12:35:20.069212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:21.922771Z","title":null,"venue":null,"work_id":"d868e8bf-1354-40d2-8fb6-cd0ffd59e200","year":2022},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.159768Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:21f31c8184a751004522cc4b0d158bbaa9fde66f2e0df428ebd4fa557df23209","observation_id":"a4c3e85c-2cd9-4602-9bf9-336db9b55df4","resolution":{"observed_at":"2026-08-07T12:35:21.982221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14333","last_updated":"2024-05-23T09:03:42Z","snapshot_observed_at":"2026-07-06T18:18:25.746022Z","submitted_at":"2024-05-23T09:03:42Z","title":"DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14333","snapshot_observed_at":"2026-08-07T12:35:20.250684Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.250684Z"},"links":{"cited_paper":"/paper/2405.14333","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:2e851e7315c930c187b9a442da01d7900b4b04aa39c63c39d09557ec0b488dc9","observation_id":"3e5a0e32-52e0-453d-91d9-dcaa83f7db67","resolution":{"observed_at":"2026-08-07T12:35:20.250684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08152","last_updated":"2024-08-15T13:40:03Z","snapshot_observed_at":"2026-07-06T19:01:06.124684Z","submitted_at":"2024-08-15T13:40:03Z","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08152","snapshot_observed_at":"2026-08-07T12:35:20.322445Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.322445Z"},"links":{"cited_paper":"/paper/2408.08152","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:e7cb8013fc6a36816bed6b31e5d367eb193316bd6d99ca617793a560900cc35d","observation_id":"4fd7d77d-3e81-4f63-83c4-4d4f65a1cad8","resolution":{"observed_at":"2026-08-07T12:35:20.322445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:20.396558Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.396558Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:0563d48f223ca94330fc38e5c669d332a4aadbddc501946a9687f42142c790dc","observation_id":"4f7e98b6-3900-4078-8ac0-7a62ad5db13d","resolution":{"observed_at":"2026-08-07T12:35:20.396558Z","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-08-07T23:31:32.304192Z","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-07T12:35:20.514785Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.514785Z"},"links":{"cited_paper":"/paper/2305.16366","citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:c3d6ea5db875737b959edd7a7f2e5926821fea0ce41f8a9951926f71a2b6964a","observation_id":"d5d0b85c-113d-4e43-af5d-28c0403b0ff5","resolution":{"observed_at":"2026-08-07T12:35:20.514785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:20.591682Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.591682Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:3ec07cf35a5cdb37a89d4a756f206a76ac3b911cd65e151e63b2ee7d34ca6434","observation_id":"efe4f4ed-995b-49a7-a05b-61ac5bf86c84","resolution":{"observed_at":"2026-08-07T12:35:20.591682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:35:20.705342Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:20.705342Z"},"links":{"citing_paper":"/paper/2505.24264"},"observation_digest":"sha256:83bbdcea379f62f0e91045ccd3fc3961856af38d7592e4bc9e1f50489e388c46","observation_id":"d12bb582-72f0-496c-b71d-a1539e55006f","resolution":{"observed_at":"2026-08-07T12:35:20.705342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.24264","last_updated":"2025-05-30T06:38:39Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T08:54:46.686321Z","submitted_at":"2025-05-30T06:38:39Z","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":5,"verified_fuzzy":1},"total_outbound_references":48},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 2 inbound Pith citation observations for arXiv:2505.24264."}