{"as_of":"2026-08-18T03:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af900069a2c59d60a471eb3bb83f309f775461d532d29c5244dc226a4d4b5139","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:29:44.327508Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T05:40:01.827929Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10558","snapshot_observed_at":"2026-08-02T05:40:01.827929Z","title":"Tyukin , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13292","last_updated":"2026-08-05T04:34:27Z","snapshot_observed_at":"2026-08-14T06:49:58.232795Z","submitted_at":"2026-07-14T21:58:52Z","title":"Theory-Level Autoformalization: From Isolated Statements to Unified Formal Knowledge Bases","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-02T05:40:01.827929Z"},"links":{"cited_paper":"/paper/2506.10558","citing_paper":"/paper/2607.13292"},"observation_digest":"sha256:49c28cac4d9647e90218e1cb68e1f73336b73a9309d094867e5e39fa9edb43b2","observation_id":"34072f5b-4427-4c65-a8f2-7d07815629ae","resolution":{"observed_at":"2026-08-02T05:40:01.827929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.10558/citation-record","integrity":"/paper/2506.10558/integrity","json":"/paper/2506.10558/citation-record.json","paper":"/paper/2506.10558"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:29:48.416562Z","title":"History of interactive theorem proving","venue":null,"work_id":"7c5ed5d7-aefa-40c5-b6bd-1875a51f015c","year":2014},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:38.936644Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:fe68f70fc46bb3ad9eadf708d954f30d55337e261960e68a97947b693891c1e6","observation_id":"a4e4956b-b7d4-4884-9293-81fcf41d2657","resolution":{"observed_at":"2026-08-07T04:29:48.505467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:48.183541Z","title":"A survey of interactive theorem proving","venue":null,"work_id":"8db41fd9-8e88-48ea-8e27-21b4270f32fb","year":2015},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.046274Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:05433148c6075b985d3ffb9f16b767a14c79447b65a48879701e2cfa84df8fc7","observation_id":"9938a94f-8d89-4423-ace6-8fb181cd5650","resolution":{"observed_at":"2026-08-07T04:29:48.297050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.03028","last_updated":"2019-12-06T09:05:38Z","snapshot_observed_at":"2026-08-15T22:41:44.056861Z","submitted_at":"2019-12-06T09:05:38Z","title":"A Survey on Theorem Provers in Formal Methods","version":1},"cited_work":{"arxiv_id":"1912.03028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.03028","snapshot_observed_at":"2026-08-07T04:29:45.218678Z","title":"A Survey on Theorem Provers in Formal Methods","venue":"cs.SE","work_id":"6b1c894f-5e4d-4f60-9f86-d06f389ad32f","year":2019},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.145519Z"},"links":{"cited_paper":"/paper/1912.03028","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:b6876e02e6398694ea03c04edf28c5ff185765368e82aef1fb421674a953636b","observation_id":"3eaf6296-fbf8-41c9-b2d5-6e10e01a7de6","resolution":{"observed_at":"2026-08-07T04:29:45.340968Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-14T10:40:26.323157Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.18223","snapshot_observed_at":"2026-08-07T04:29:39.266472Z","title":"A survey of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.266472Z"},"links":{"cited_paper":"/paper/2303.18223","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:c857083c3ac5b591aef602dac709710b6644c8f1d679f1b4d5f7999a936bf95e","observation_id":"28dedfe2-01a3-4b9a-9932-9f895f60d142","resolution":{"observed_at":"2026-08-07T04:29:39.266472Z","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-07T04:29:47.983501Z","title":"Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing","venue":null,"work_id":"7c8b21d3-d321-4754-baa2-c17190c7a5f6","year":2023},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.412495Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:578fa5bbb742bff791f27ff8eb4be6a08f9a719b14a20ddb76b79f8fd7748c08","observation_id":"5a0f0bbf-c070-4643-8fd2-479cd51973a1","resolution":{"observed_at":"2026-08-07T04:29:48.055157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:39.532894Z","title":"Generalizing from a few examples: A survey on few-shot learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.532894Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:e612f087070e09e853c6c1792e54a7702f9ab68c418116b2642c6db16b070e7a","observation_id":"612e2a3b-2f0e-4ad7-bcc8-f283ece5a08c","resolution":{"observed_at":"2026-08-07T04:29:39.532894Z","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-17T09:58:46.058102Z","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-07T04:29:39.658638Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.658638Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:b99afe7b944fd4a185584a1dca0eb6656304d3cdd4831f95dac33ae038f6231d","observation_id":"114b28f8-9faf-4e73-9652-2c44b26837c7","resolution":{"observed_at":"2026-08-07T04:29:39.658638Z","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-07T04:29:39.770246Z","title":"Survey of hallucination in natural language generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.770246Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:a8ebce219939b1089a37a57b896a083ceb098caddbede0fc8b5290f02f80561a","observation_id":"898aff92-2a32-4279-8f9d-a423515e891f","resolution":{"observed_at":"2026-08-07T04:29:39.770246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01798","last_updated":"2024-03-14T04:27:52Z","snapshot_observed_at":"2026-08-13T03:11:04.678829Z","submitted_at":"2023-10-03T04:56:12Z","title":"Large Language Models Cannot Self-Correct Reasoning Yet","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01798","snapshot_observed_at":"2026-08-07T04:29:39.947787Z","title":"Large language models cannot self-correct reasoning yet","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:39.947787Z"},"links":{"cited_paper":"/paper/2310.01798","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:7adfe6e63e768800ece86e1aec601f6985d5a3b7741b2612379966523ece7932","observation_id":"a23d382c-2d55-42df-9de1-e1a8988e3382","resolution":{"observed_at":"2026-08-07T04:29:39.947787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.09939","last_updated":"2024-08-22T03:56:45Z","snapshot_observed_at":"2026-08-16T14:00:45.602483Z","submitted_at":"2024-04-15T17:07:55Z","title":"A Survey on Deep Learning for Theorem Proving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.09939","snapshot_observed_at":"2026-08-07T04:29:40.066926Z","title":"A survey on deep learning for theorem proving","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.066926Z"},"links":{"cited_paper":"/paper/2404.09939","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:480f495e828873409db9d451a2d108bee943b6d395bc204ef3f0f389c0ac546a","observation_id":"32c7d1ec-d19b-4f36-967e-b5f21de60a56","resolution":{"observed_at":"2026-08-07T04:29:40.066926Z","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-07T04:29:47.646532Z","title":"A survey on interactive theorem proving","venue":null,"work_id":"31d3eacb-32e9-423a-a375-5bacf5371d98","year":2009},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.188337Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:67e947c930da857a704a4d508771222b213a4aeaa5a5158986fa466e30c4b74c","observation_id":"bdffaf22-8f6b-4633-a362-436e16f99fd7","resolution":{"observed_at":"2026-08-07T04:29:47.784679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:47.377156Z","title":"A survey of automated theorem proving","venue":null,"work_id":"3ef6340e-dd97-4694-9314-c2d47b96a4b5","year":2013},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.319549Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:bc6418abe39fc3cff9bd80997dd3edf274cfc0c48585acb360aaebd983e2291c","observation_id":"8671de5c-4728-4eba-8a9b-ad411668c4f7","resolution":{"observed_at":"2026-08-07T04:29:47.484422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:40.476573Z","title":"Isabelle: A generic theorem prover","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.476573Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:dc7c96ea0ec1781cc1466b55d645ca8dd9a48f15179bdbdd546f03049c07c48a","observation_id":"7e030e64-f9f5-44e6-a8c2-e71af7ef1b92","resolution":{"observed_at":"2026-08-07T04:29:40.476573Z","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-07T04:29:47.110513Z","title":"The coq proof assistant a tutorial","venue":null,"work_id":"c4e00ee7-87d7-4bf8-9bd2-e03789b12ad7","year":1997},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.583495Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:78531c962df91b93ef26361765c9715f02a24ec96c8e25e93ebf8ae5bdf4c042","observation_id":"e07bc7b8-4f73-4425-ad50-fc7d40fc0dfb","resolution":{"observed_at":"2026-08-07T04:29:47.195089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:46.793231Z","title":"The lean theorem prover (system description)","venue":null,"work_id":"34ddc829-3e19-4be1-bf6a-35b1dc1920be","year":2015},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.695367Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:9c5277738d6c408c74bb4af7047b092a1b84617e4f190fbc35989b17dad5a5cb","observation_id":"a82bd82f-773a-49be-8964-dae94d483a1f","resolution":{"observed_at":"2026-08-07T04:29:46.922757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.09701","last_updated":"2018-09-06T22:05:30Z","snapshot_observed_at":"2026-08-14T18:35:45.841668Z","submitted_at":"2018-08-29T09:33:58Z","title":"Comparison of Two Theorem Provers: Isabelle/HOL and Coq","version":2},"cited_work":{"arxiv_id":"1808.09701","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.09701","snapshot_observed_at":"2026-08-07T04:29:44.871449Z","title":"Comparison of Two Theorem Provers: Isabelle/HOL and Coq","venue":"cs.LO","work_id":"0520f839-1356-4e89-876e-f47dba2c0926","year":2018},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.789175Z"},"links":{"cited_paper":"/paper/1808.09701","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:f8f9315b9f36eaf0096e08e3b90001a6a5dcca78c5e8d56c66cbd33c23594e46","observation_id":"a2f5097d-b921-49f7-b256-0a34b04581f9","resolution":{"observed_at":"2026-08-07T04:29:44.973309Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","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-07T04:29:40.903743Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:40.903743Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:c1100147c8c4e8e01aa1dd499ea1e496f44e95abfe41c0f86f8b63d6c33877d7","observation_id":"a923cc8c-de07-463e-ba2a-cd86e154655e","resolution":{"observed_at":"2026-08-07T04:29:40.903743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10420","last_updated":"2023-12-23T12:53:02Z","snapshot_observed_at":"2026-08-16T15:47:12.666051Z","submitted_at":"2023-03-18T14:02:04Z","title":"A Comprehensive Capability Analysis of GPT-3 and GPT-3.5 Series Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10420","snapshot_observed_at":"2026-08-07T04:29:41.010720Z","title":"A comprehensive capability analysis of gpt-3 and gpt-3.5 series models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.010720Z"},"links":{"cited_paper":"/paper/2303.10420","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:e1ea4ebbcc1a47c8cf3675d30b3a98f23f150a583dba5ea2d53e047a743c9691","observation_id":"f3f8fa41-d970-4077-9468-5c49a4ec452c","resolution":{"observed_at":"2026-08-07T04:29:41.010720Z","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-07T04:29:41.141837Z","title":"Chatglm: A family of large language models from glm-130b to glm-4 all tools, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.141837Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:ecc454f1e287ad47d22b3a1196da81a0103d6dc963683ab01345f5caab9a353d","observation_id":"37f789de-57ea-4368-a3c2-f8bbf89f28c3","resolution":{"observed_at":"2026-08-07T04:29:41.141837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12091","last_updated":"2024-02-19T12:12:35Z","snapshot_observed_at":"2026-08-16T14:17:21.918268Z","submitted_at":"2024-02-19T12:12:35Z","title":"Do Large Language Models Understand Logic or Just Mimick Context?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12091","snapshot_observed_at":"2026-08-07T04:29:41.237959Z","title":"Do large language models understand logic or just mimick context? arXiv preprint arXiv:2402.12091, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.237959Z"},"links":{"cited_paper":"/paper/2402.12091","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:cf5a02f8b8a84769ee763304f961d6671c5b75b98575ae838a6e65d1c02bb638","observation_id":"4e0d78eb-656f-4ab4-8254-d99392e4d803","resolution":{"observed_at":"2026-08-07T04:29:41.237959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00757","last_updated":"2024-10-08T14:34:37Z","snapshot_observed_at":"2026-08-16T14:30:29.998089Z","submitted_at":"2024-01-01T13:53:53Z","title":"LogicAsker: Evaluating and Improving the Logical Reasoning Ability of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.00757","snapshot_observed_at":"2026-08-07T04:29:41.363509Z","title":"A & b== b & a: Triggering logical reasoning failures in large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.363509Z"},"links":{"cited_paper":"/paper/2401.00757","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:6e3df4ff912983743f19187cb5fb6cb5fcb520148fcdc8fdface5a33fb532104","observation_id":"24762c14-0475-4b2b-b180-0298dac30bd5","resolution":{"observed_at":"2026-08-07T04:29:41.363509Z","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-07T04:29:46.556837Z","title":"Assessing the strengths and weaknesses of large language models","venue":null,"work_id":"a8713025-2cdf-46c4-898c-c02e1a55eb80","year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.476183Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:80943871416ae48c337d17ad3600f5f44961833537d7279736ba23e397e1fe1e","observation_id":"817c7eb7-543e-40f3-a30b-12c2d4259015","resolution":{"observed_at":"2026-08-07T04:29:46.665451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:41.595031Z","title":"A survey on rag meeting llms: Towards retrieval-augmented large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.595031Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:ad320fcc5d6c3d98260e530cd9abf43c366cc6fe9ad52b914d9774a97a25ecea","observation_id":"7f9911b8-ff50-40e3-ac3e-5380bb2fd9e2","resolution":{"observed_at":"2026-08-07T04:29:41.595031Z","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-07T04:29:41.731293Z","title":"Chain-of-thought prompting elicits reasoning in large language models.Advances in neural information processing systems, 35:24824–24837, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.731293Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:dab96f9e9e435fcbf351e22fea0ce9948efefebec09d848def836759bc7870c8","observation_id":"5c3e5cd2-2606-423c-9dcf-fa025c02086c","resolution":{"observed_at":"2026-08-07T04:29:41.731293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.02406","last_updated":"2023-04-11T19:39:17Z","snapshot_observed_at":"2026-08-15T11:54:04.569366Z","submitted_at":"2022-10-05T17:28:20Z","title":"Decomposed Prompting: A Modular Approach for Solving Complex Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.02406","snapshot_observed_at":"2026-08-07T04:29:41.846035Z","title":"Decomposed prompting: A modular approach for solving complex tasks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.846035Z"},"links":{"cited_paper":"/paper/2210.02406","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:61e3c57d84d0d0021380faa0346705b6a801e060cf9f23147d5624d8f3f8d22b","observation_id":"9484b2e8-01f0-47b1-9aa8-a074d7b30809","resolution":{"observed_at":"2026-08-07T04:29:41.846035Z","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-07T04:29:46.269360Z","title":"Relation extraction: Perspective from convolutional neural networks","venue":null,"work_id":"6ced0175-8159-4045-bd31-e19b07296621","year":2015},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:41.984507Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:d8fcb9d6f235c1a67c6740d3f1bf0ad82d41d209159568cee0d4288e164075ea","observation_id":"106c8051-eefe-4c63-9a10-fa1020a9df86","resolution":{"observed_at":"2026-08-07T04:29:46.369937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.06544","last_updated":"2020-02-16T09:22:32Z","snapshot_observed_at":"2026-08-10T21:00:35.073746Z","submitted_at":"2020-02-16T09:22:32Z","title":"Exploring Neural Models for Parsing Natural Language into First-Order Logic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.06544","snapshot_observed_at":"2026-08-07T04:29:42.108781Z","title":"Exploring neural models for parsing natural language into first-order logic","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:42.108781Z"},"links":{"cited_paper":"/paper/2002.06544","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:5da29dd0f0bfba0d81d79c812f37ffc5bdfa2af0df89b3f0d44b79933ea610c8","observation_id":"cdf6610a-3389-4210-9eed-7f211d38ea97","resolution":{"observed_at":"2026-08-07T04:29:42.108781Z","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-07T04:29:45.989286Z","title":"Parsing natural language into propositional and first-order logic with dual reinforcement learning","venue":null,"work_id":"ffe72c41-b523-400d-b624-76c11dd4c379","year":2022},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:42.198556Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:9e3a22f4f4005cd677ca705e046efbecc60631754b239a59812d339cdaafffe6","observation_id":"6b137dc8-0ae0-4728-9402-f8fe0100f675","resolution":{"observed_at":"2026-08-07T04:29:46.101510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:45.738450Z","title":"Exploration of neural machine translation in autoformalization of mathematics in mizar","venue":null,"work_id":"3adf1ba5-ee68-478d-9a6a-9eb51aeb5054","year":2020},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:42.456499Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:5ea855ac6016c9dc652a3409f833411e4960c63b4d919c969a804d7891e420bd","observation_id":"021e879c-f2d0-4c48-89be-aa5fc4e6f559","resolution":{"observed_at":"2026-08-07T04:29:45.844947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:43.512775Z","title":"Solving quantitative reasoning problems with language models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:43.512775Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:462bf9df30aa8733fc6e89418380591662e21bbd77af9b304ff963d0eede4a1f","observation_id":"b5a99230-bc96-4fe4-9c70-695a5eeaa37b","resolution":{"observed_at":"2026-08-07T04:29:43.512775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12283","last_updated":"2023-02-20T16:10:20Z","snapshot_observed_at":"2026-08-16T16:22:05.693119Z","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-07T04:29:43.631961Z","title":"Draft, sketch, and prove: Guiding formal theorem provers with informal proofs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:43.631961Z"},"links":{"cited_paper":"/paper/2210.12283","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:e0b6219f85bda72bfab573d6598cdcfd8ddbefab4956e9bd55f5726cd52e9348","observation_id":"f6abb32d-adc8-4f39-a87d-a28b6bcdf0c4","resolution":{"observed_at":"2026-08-07T04:29:43.631961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.18120","last_updated":"2024-03-26T22:01:13Z","snapshot_observed_at":"2026-08-16T14:06:05.605423Z","submitted_at":"2024-03-26T22:01:13Z","title":"Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18120","snapshot_observed_at":"2026-08-07T04:29:43.741667Z","title":"Don’t trust: Verify–grounding llm quantitative reasoning with autoformalization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:43.741667Z"},"links":{"cited_paper":"/paper/2403.18120","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:0a7eb605d55cd651d7d3f8c6ba1e0b02656ae32fb4ab99ed16095a3e508c44e9","observation_id":"39197d42-937a-4c6b-a105-276629058944","resolution":{"observed_at":"2026-08-07T04:29:43.741667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00656","last_updated":"2023-10-27T12:44:32Z","snapshot_observed_at":"2026-08-16T14:56:07.682640Z","submitted_at":"2023-10-01T12:47:59Z","title":"LEGO-Prover: Neural Theorem Proving with Growing Libraries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00656","snapshot_observed_at":"2026-08-07T04:29:43.837522Z","title":"Lego-prover: Neural theorem proving with growing libraries","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:43.837522Z"},"links":{"cited_paper":"/paper/2310.00656","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:942d0b2041cae58ecda064cd658f09da1dd209e6c924f4b4a6bb93fc24f81724","observation_id":"7d5b99e8-5c14-4a34-bdd8-4a0f4264ef87","resolution":{"observed_at":"2026-08-07T04:29:43.837522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T04:29:43.964008Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:43.964008Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:f7df933071ff80e846483b7ee197766596ac86d47ad80af6096ec3dcbf79e8b9","observation_id":"b98ed609-4301-407f-954e-dbe98a7d29f1","resolution":{"observed_at":"2026-08-07T04:29:43.964008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.11173","last_updated":"2022-12-09T12:05:28Z","snapshot_observed_at":"2026-08-17T09:28:15.292613Z","submitted_at":"2022-12-09T12:05:28Z","title":"Python client for Isabelle server","version":1},"cited_work":{"arxiv_id":"2212.11173","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.11173","snapshot_observed_at":"2026-08-07T04:29:44.485185Z","title":"Python client for Isabelle server","venue":"cs.LO","work_id":"5bb31c51-49f7-499e-bb41-04083350716b","year":2022},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:44.124475Z"},"links":{"cited_paper":"/paper/2212.11173","citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:16bd6160fc22a68e452a82d2c9f54ea35a35666f6422869ceb8859c0b22c99c9","observation_id":"b0bd8c2a-b75c-4798-a10d-f054b71f3663","resolution":{"observed_at":"2026-08-07T04:29:44.563050Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T04:29:44.229446Z","title":"Measuring mathematical problem solving with the math dataset","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:44.229446Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:21881d94950179c881fa8045125653e096fe15c557ee2f11ab1617e6a5b4669e","observation_id":"6e75f372-59a4-4118-af0e-3af0918ff091","resolution":{"observed_at":"2026-08-07T04:29:44.229446Z","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-07T04:29:45.475072Z","title":"We know that 7−1 exists modulo 50 because 7 and 50 are relatively prime","venue":null,"work_id":"08b87c7e-e3b9-49d0-8b0b-f2999b93ccb3","year":2024},"citing_paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:29:44.327508Z"},"links":{"citing_paper":"/paper/2506.10558"},"observation_digest":"sha256:a458f73a4d379c6fad60546409842045a2cfefadf6fa4fb263157f6c3a8838c0","observation_id":"051e4ff5-f2e2-40ba-be46-2ea77d576137","resolution":{"observed_at":"2026-08-07T04:29:45.591765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.10558","last_updated":"2025-06-30T10:59:44Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-15T11:54:40.366120Z","submitted_at":"2025-06-12T10:31:23Z","title":"StepProof: Step-by-step verification of natural language mathematical proofs"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":3,"verified_fuzzy":12},"total_outbound_references":37},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2506.10558."}