{"as_of":"2026-08-22T08:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b1d2bb17d462457f1c2e5a3c7c44b5bef32abd35ca285a030e62cfa9d7c20c47","coverage":[{"denominator":75,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":75,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T17:17:48.969969Z","state":"measured"},{"denominator":75,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":75,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2605.20531/citation-record","integrity":"/paper/2605.20531/integrity","json":"/paper/2605.20531/citation-record.json","paper":"/paper/2605.20531"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.12099","last_updated":"2021-08-27T02:56:06Z","snapshot_observed_at":"2026-08-18T14:37:02.517030Z","submitted_at":"2021-08-27T02:56:06Z","title":"Learning to Give Checkable Answers with Prover-Verifier Games","version":1},"cited_work":{"arxiv_id":"2108.12099","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.12099","snapshot_observed_at":"2026-07-03T03:57:38.322466Z","title":"Learning to give checkable answers with prover-verifier games","venue":null,"work_id":"b4ef9754-0f6b-4762-803a-deb82707f2d3","year":2021},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2108.12099","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:aaf8a761da33a8a194a41ef7be4912495c505504cf42d47a8a5add1b9efecef1","observation_id":"79a42ac6-dfca-4f6f-b3d3-cccc261b3f67","resolution":{"observed_at":"2026-06-30T17:24:57.679420Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.610408Z","title":"Towards a Lean proof of Fermat’s Last Theorem.https: //imperialcollegelondon.github.io/FLT/blueprint.pdf","venue":null,"work_id":"bbd1100f-62fe-43f5-b78c-b0da622ca888","year":2024},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:c0f306648d0f8e4a7fe79b75874f39f7132da75ef08948aa3e11e34191d18a45","observation_id":"06f618b9-ead7-4000-8ec6-0111dc39c918","resolution":{"observed_at":"2026-07-08T09:34:48.611852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19162","last_updated":"2025-05-17T14:32:38Z","snapshot_observed_at":"2026-08-17T00:05:00.684117Z","submitted_at":"2025-04-27T08:45:06Z","title":"SPC: Evolving Self-Play Critic via Adversarial Games for LLM Reasoning","version":2},"cited_work":{"arxiv_id":"2504.19162","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.19162","snapshot_observed_at":"2026-07-02T02:26:27.242958Z","title":"Spc: Evolving self-play critic via adversarial games for llm reasoning","venue":null,"work_id":"17d073b5-d246-4ecc-8a4b-944b453f8590","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2504.19162","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:5f2baa565b708f2f35bc64682d475f2adda4e8744805ecff066bea2238db49c2","observation_id":"33f4a043-fb6c-4b9f-bbc3-3c9edc09d1b8","resolution":{"observed_at":"2026-06-30T17:24:57.676445Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.612518Z","title":"Power-free palindromes and reversed primes: S","venue":null,"work_id":"11676eb1-0e5c-431c-a6ee-80decea96916","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:fd557c266254066d0079df17f12b34656a9acced14e789d1ffd196f7c56af821","observation_id":"9e9198fa-0026-468a-a64d-346d3b39dfe2","resolution":{"observed_at":"2026-07-08T09:34:48.613939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.627127Z","title":"Escaping the cognitive well: Efficient competition math with off-the-shelf models","venue":null,"work_id":"a28823e4-5d24-45da-ac2d-257037eb3be0","year":null},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:7896d905c90adef8fcdc5437fe9701c58858152041232f328c529d9e39052554","observation_id":"4faa5e7b-951c-4d9e-8532-36ca13d3e30d","resolution":{"observed_at":"2026-07-08T09:34:48.628391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.16793","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T17:24:57.731955Z","title":"Escaping the cognitive well: Efficient competition math with off-the-shelf models.arXiv preprint arXiv:2602.16793","venue":null,"work_id":"122f4150-56a0-4e98-a0aa-0fc5efc6c27e","year":2026},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:3a3ad7689953f1bd3e17dce39c8464b33057dbcdbcade42530d90a82c744492e","observation_id":"4c2df4cf-848f-40fe-bae0-a659cf5d9959","resolution":{"observed_at":"2026-06-30T17:24:57.733457Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.605111Z","title":"The lean theorem prover (system description)","venue":null,"work_id":"dfe56708-1f06-4137-9b91-890e122d30e0","year":2015},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:b880225c27c1ddea4264e314f952df2a7d2e9caf668690557c8ed93f5b4a736a","observation_id":"e1da4547-c12f-46b5-9aa4-3deec5b95f25","resolution":{"observed_at":"2026-07-08T09:34:48.606261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00898","last_updated":"2025-06-19T11:33:23Z","snapshot_observed_at":"2026-08-09T20:14:23.316390Z","submitted_at":"2025-02-02T20:16:50Z","title":"Finite codimension stability of invariant surfaces","version":2},"cited_work":{"arxiv_id":"2502.00898","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00898","snapshot_observed_at":"2026-06-30T17:24:57.737143Z","title":"Finite codimension stability of invariant surfaces","venue":null,"work_id":"3696058c-5000-46fa-b1e9-674e62db3542","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2502.00898","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:ad7773a996c050cd4bd130b5087a9383bcbeae4e8897b8604ace0220f6d8f2d1","observation_id":"9e55acf8-9cb7-49a6-9c5f-d5f672e621cd","resolution":{"observed_at":"2026-06-30T17:24:57.738610Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.599930Z","title":"Llm critics help catch bugs in mathematics: Towards a better mathematical verifier with natural language feedback","venue":null,"work_id":"63a3871f-204a-4081-b4ee-e74e5cd13990","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:46b056428e967ff45cf71c0c08f43716ee3599330704469607f43f22e047971d","observation_id":"39c4ffc5-576b-44df-b224-7b0f85c0fed2","resolution":{"observed_at":"2026-07-08T09:34:48.601192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.623711Z","title":"Formal proof – theory and practice.Notices of the American Mathematical Society, 55:1395–1406","venue":null,"work_id":"0bcc0600-4c08-4239-be0a-2b488688c7f9","year":2008},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:175a366a5aede04b38a03521a8591d2cb50602c0a96e176d1c62a7425d5948e7","observation_id":"f7fe30b7-ade9-4403-9a73-e78bc2186db6","resolution":{"observed_at":"2026-07-08T09:34:48.624945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.641950Z","title":"Context rot: How increasing input tokens impacts llm performance.URL https://research","venue":null,"work_id":"bbdc472e-247f-43b9-bf16-732be0438395","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:ee248396b519d6c62fdf89fd20be6a7e20f26badf39df87c9f536cf0935eda22","observation_id":"8d564df2-e49c-4c1e-85d0-fc995836f4ae","resolution":{"observed_at":"2026-07-08T09:34:48.643129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.21522","last_updated":"2026-06-22T07:20:43Z","snapshot_observed_at":"2026-08-19T19:09:55.083149Z","submitted_at":"2025-11-26T15:52:52Z","title":"Pessimistic Verification for Open Ended Math Questions","version":2},"cited_work":{"arxiv_id":"2511.21522","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.21522","snapshot_observed_at":"2026-06-30T17:24:57.739735Z","title":"Pessimistic verification for open ended math questions","venue":"cs.AI","work_id":"7db81a11-2c96-4a96-b909-2ee566b376a1","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2511.21522","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:af64be91c6be5be6eb9a073d0afc73b998b00a636218828e41f32126f7c66da0","observation_id":"4fea4ef0-55a9-4eb4-aa2b-a603089081ee","resolution":{"observed_at":"2026-06-30T17:24:57.740882Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.15855","doi":"10.48550/arxiv.2507.15855","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Winning gold at imo 2025 with a model-agnostic verification- and-refinement pipeline","venue":"arXiv (Cornell University)","work_id":"32562c8f-ed95-45bc-b280-a6a82b5fba12","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:c2b8aebbad65ab7c27a359a1798d2bec2c25351df9c4e7f76af2ddb9ffcf44f1","observation_id":"68c3ac76-28ca-4797-9cb2-90e292ff2c9b","resolution":{"observed_at":"2026-06-30T17:24:57.722800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.13692","last_updated":"2024-08-01T17:18:54Z","snapshot_observed_at":"2026-08-18T23:52:17.487601Z","submitted_at":"2024-07-18T16:58:18Z","title":"Prover-Verifier Games improve legibility of LLM outputs","version":2},"cited_work":{"arxiv_id":"2407.13692","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.13692","snapshot_observed_at":"2026-07-09T02:35:53.846004Z","title":"Prover-verifier games improve legibility of llm outputs","venue":"cs.CL","work_id":"2bebdadc-2df7-4816-93c8-70252a1645eb","year":2024},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2407.13692","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:1956b0d9d8de7140bf4843eaa452baa5fd7e09902a58199d0b1ea24349c40976","observation_id":"1b043fc1-21d6-4cfc-bff1-08db1ed04fdb","resolution":{"observed_at":"2026-06-30T17:24:57.725305Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.582969Z","title":"PrimeNumberTheoremAnd: A formalization of the prime number theorem and related results in Lean 4","venue":null,"work_id":"637ed536-bd93-41ab-b72f-20e7874f248b","year":2024},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:898b1f2ae7fba0efdfe49fc88cf32a0218af001b8b89210ebfab2b1fe5c69fdd","observation_id":"60145fb5-a19a-4b3e-9cc0-68c9377986fc","resolution":{"observed_at":"2026-07-08T09:34:48.584185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.593449Z","title":"Let’s verify step by step","venue":null,"work_id":"b81e87b7-70fa-44b4-8d35-f8a992e4f9d2","year":2024},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:cd269e6fa0662d95c2a307d2942d98fdcec09528f5b6cbbdc27093164cb71ccb","observation_id":"d99d4411-273a-401a-99ef-61f1760d915d","resolution":{"observed_at":"2026-07-08T09:34:48.594496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07640","last_updated":"2025-04-19T13:53:05Z","snapshot_observed_at":"2026-08-19T20:10:21.442760Z","submitted_at":"2025-02-11T15:27:35Z","title":"Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving","version":3},"cited_work":{"arxiv_id":"2502.07640","doi":"10.48550/arxiv.2502.07640","metadata_source":"pith","pith_arxiv_id":"2502.07640","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Goedel-prover: A frontier model for open-source automated theorem proving","venue":"cs.LG","work_id":"d493c962-6f13-4605-9836-61b0d15ca1d6","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2502.07640","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:c4209b2ab61b59a4f9a015f1d86d76f22bc0f1cf2141517788d817907f6abf8f","observation_id":"964db1a5-43f5-423c-ae3d-f6a091f29fe5","resolution":{"observed_at":"2026-06-30T17:24:57.728053Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03613","last_updated":"2025-08-05T16:28:22Z","snapshot_observed_at":"2026-08-22T06:16:13.377123Z","submitted_at":"2025-08-05T16:28:22Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction","version":1},"cited_work":{"arxiv_id":"2508.03613","doi":"10.48550/arxiv.2508.03613","metadata_source":"pith","pith_arxiv_id":"2508.03613","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction","venue":"cs.LG","work_id":"cfdb69bb-3c0b-41d3-bd34-3167a6931bb2","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2508.03613","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:16606e3211ce411591eeb1d0f06e6e2eef1d2c57b0b217245bf15b66fb8ab6b8","observation_id":"dd2ad225-be36-4299-a26d-df495c24f920","resolution":{"observed_at":"2026-06-30T17:24:57.728045Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:11.143969+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:11.143969+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.576974Z","title":"Trust, but verify: A self-verification approach to reinforcement learning with verifiable rewards","venue":null,"work_id":"4f7f5877-ce62-45d9-8709-efb743f641cc","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:c241650717e917882249e1cf3c4f5341199c0a7369dd83c80a364e6e319d738f","observation_id":"c53d7d5e-2445-4b4c-af00-473db18c4a4e","resolution":{"observed_at":"2026-07-08T09:34:48.578814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.573661Z","title":"Towards robust mathematical reasoning","venue":null,"work_id":"ef7e19ff-177f-4f46-9419-83ae727c30fe","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:3a5379c7f555274db062de825cfe38d6d398c84541d425ab84606800ce7af3a9","observation_id":"1db0e006-9de9-4d0c-af03-20726d5c20c7","resolution":{"observed_at":"2026-07-08T09:34:48.574859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.13027","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T17:24:57.688706Z","title":"Scaling generative verifiers for natural language mathematical proof verification and selection.arXiv preprint arXiv:2511.13027","venue":null,"work_id":"1e579e2a-40f4-4743-b3b2-c13f07229e93","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:41ef9ab1d0771f6b08fdb2ebbc2a8f6d03331eedd71298d5f3618c5ef30bdf01","observation_id":"079f52f3-3440-42c7-89da-cc5f09f1eb31","resolution":{"observed_at":"2026-06-30T17:24:57.690404Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07923","last_updated":"2024-04-11T18:03:53Z","snapshot_observed_at":"2026-08-16T23:21:29.490443Z","submitted_at":"2023-10-11T22:35:18Z","title":"The Expressive Power of Transformers with Chain of Thought","version":5},"cited_work":{"arxiv_id":"2310.07923","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.07923","snapshot_observed_at":"2026-07-10T22:47:37.037905Z","title":"and Sabharwal, A","venue":"cs.LG","work_id":"63096903-9f44-418b-b53b-f7debf28d7a9","year":2023},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2310.07923","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:4a26fd228838fab046d3e45475801ec68667a7bf6f309f8a3e0a7f7d2eacd76c","observation_id":"27579b8c-6be2-43b7-8c25-91898a9b27ff","resolution":{"observed_at":"2026-06-30T17:24:57.694418Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.579421Z","title":"The lean 4 theorem prover and programming language","venue":null,"work_id":"10520149-3035-4b70-af7f-75fc93180c55","year":2021},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:d20cc0ca0a7ff0b367da58b33ecafd99c378e06ff468b3003130c36ee8bfbe87","observation_id":"070ba25d-d8dd-4f56-8fc1-0fcae0e87647","resolution":{"observed_at":"2026-07-08T09:34:48.580580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.567776Z","title":"Springer","venue":null,"work_id":"0a76cb36-5a18-48ca-bf66-37b0e3b9ba74","year":2002},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:c93a18b0e7199d1242fed2e063235981655714a69d2decb8a41bb2bf861164ca","observation_id":"0d1cd5b0-8b56-493c-8826-341f59fb2edd","resolution":{"observed_at":"2026-07-08T09:34:48.568835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.13744","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T13:55:45.340348Z","title":"Hard2verify: A step-level verification benchmark for open-ended frontier math","venue":null,"work_id":"00324b79-de65-433f-84f7-73d66210c0eb","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:385941de3f1285bd2ccd09c9b01ea1a649d0ebfad06781b0f1a431cd81f732e1","observation_id":"84390bf3-e4bd-408e-bfe2-e7419dca1b93","resolution":{"observed_at":"2026-06-30T17:24:57.695934Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.08957","last_updated":"2026-05-26T16:49:23Z","snapshot_observed_at":"2026-08-16T12:50:55.825346Z","submitted_at":"2025-03-11T23:20:33Z","title":"Real algebraic surfaces biholomorphically equivalent but not algebraically equivalent","version":4},"cited_work":{"arxiv_id":"2503.08957","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.08957","snapshot_observed_at":"2026-06-30T17:24:57.703071Z","title":"Real algebraic surfaces biholomorphically equivalent but not algebraically equivalent","venue":"math.CV","work_id":"cfd2741c-a913-423b-aa03-afd635d1c861","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2503.08957","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:b477683c1704a6c404400e694201aba8e2df3ca4917ec434b0269dc55cc08eaf","observation_id":"3560a904-2168-44ab-afcd-9634fdd732c9","resolution":{"observed_at":"2026-06-30T17:24:57.720007Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.584746Z","title":"Liquid tensor experiment.Experimental Mathematics, 31(2):349–354","venue":null,"work_id":"212656d6-3a67-416c-ab52-a5ff3cb38d19","year":2022},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:61fdd814515a2a6e5c2e968d02aea383cb41f257c9c7bb99d18cea1cc4164195","observation_id":"e430d50e-0a77-478a-b85b-4605b2a059a4","resolution":{"observed_at":"2026-07-08T09:34:48.585935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.22570","doi":"10.48550/arxiv.2511.22570","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deepseekmath-v2: Towards self-verifiable mathematical reasoning","venue":"ArXiv.org","work_id":"b98ba1e9-8a01-4da9-b050-43dff9ef5fab","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:760dd6f3d633a8b1108eac7322a5c379be24d93a71b8564ea80b14f488a0ae35","observation_id":"7e38257b-12d9-4832-96ea-81a9518f4c3a","resolution":{"observed_at":"2026-06-30T17:24:57.686554Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10337","last_updated":"2025-04-16T14:58:26Z","snapshot_observed_at":"2026-08-19T01:36:32.130981Z","submitted_at":"2025-04-14T15:46:33Z","title":"Heimdall: test-time scaling on the generative verification","version":2},"cited_work":{"arxiv_id":"2504.10337","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10337","snapshot_observed_at":"2026-06-30T17:24:57.682547Z","title":"Heimdall: test-time scaling on the generative verification","venue":null,"work_id":"31cb01fc-631e-4040-96af-bbcbd0f338d0","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2504.10337","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:76dde0bd2a750f069a2f061f550d8febc754d4d5699b609065f1c5afcf227017","observation_id":"bccfd1ef-cd00-45cc-bdd6-9b3866db07f6","resolution":{"observed_at":"2026-06-30T17:24:57.683949Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.581145Z","title":"A promising path towards autoformalization and general artificial intelli- gence","venue":null,"work_id":"9957fdd2-596d-4de4-b46a-92f9fdd23d90","year":2020},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:feaf88f57484bb363624e1c16bf5dccedcbead875cfc72999a62c072d465f343","observation_id":"5a95f614-22a4-4992-b31a-f8317bb00329","resolution":{"observed_at":"2026-07-08T09:34:48.582404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.15137","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T17:24:57.690508Z","title":"From solving to verifying: A unified objective for robust reasoning in llms","venue":null,"work_id":"0c7eae33-23a8-4e53-a0b7-91a99afb3cd8","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:a85fc6470fa213300c3df4669331c4fb8377ce62f14945dc0f1c49f8824c6bbf","observation_id":"f5cd6e4c-a664-4d03-9427-b80d1d75f41c","resolution":{"observed_at":"2026-06-30T17:24:57.691865Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.565974Z","title":"Autoformalization with large language models.Advances in neural information processing systems, 35:32353–32368","venue":null,"work_id":"695a8747-9ce0-4a3c-9b6c-327798d0cb22","year":2022},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:08c9520cbb946f909bc40d6286559f52ab370acbe1a6f1e7b1f5b1f4f55adfa6","observation_id":"5f649650-5dad-4c81-9a07-fc37db7f083a","resolution":{"observed_at":"2026-07-08T09:34:48.567222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14337","last_updated":"2025-07-06T22:23:16Z","snapshot_observed_at":"2026-08-19T21:25:56.416918Z","submitted_at":"2025-03-18T15:14:14Z","title":"PENCIL: Long Thoughts with Short Memory","version":2},"cited_work":{"arxiv_id":"2503.14337","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.14337","snapshot_observed_at":"2026-07-09T11:36:11.926974Z","title":"Pencil: Long thoughts with short memory","venue":"cs.LG","work_id":"76e293b3-6f7a-4405-ae44-e2a7c1f2906a","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2503.14337","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:9271d3dc0349f1d583583bb2b0a90037b03151d09861390db6d6b4e8059348ff","observation_id":"ee2a97a3-8d9a-4e7d-8192-14c56ac69d43","resolution":{"observed_at":"2026-06-30T17:24:57.736550Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.02112","last_updated":"2026-07-02T05:43:06Z","snapshot_observed_at":"2026-08-09T08:24:42.187628Z","submitted_at":"2026-03-02T17:37:10Z","title":"Recursive Models for Long-Horizon Reasoning","version":2},"cited_work":{"arxiv_id":"2603.02112","doi":null,"metadata_source":"pith","pith_arxiv_id":"2603.02112","snapshot_observed_at":"2026-07-09T11:36:11.901941Z","title":"Recursive models for long-horizon reasoning","venue":"cs.LG","work_id":"7502aa80-6eb6-4bc5-9123-380d178a6a14","year":2026},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2603.02112","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:1339174cafde0f7bc68ffd846b293e4f3ea4f70cdcb72a2016772c973dda4188","observation_id":"d118b28f-2bfd-4ef8-ba05-3ceec6eb8488","resolution":{"observed_at":"2026-07-03T02:17:09.880536Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.07962","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T17:24:57.732204Z","title":"Loca-bench: Benchmarking language agents under controllable and extreme context growth","venue":null,"work_id":"af38fdcc-1566-4560-bed5-59b85c41a330","year":2026},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:106a12b98058ba7bf3b88d0a311928c7fc88ae05492663a7a9c5ce8fa38cc0f2","observation_id":"de214421-6c3c-4737-a5c7-ee1450b7fa89","resolution":{"observed_at":"2026-06-30T17:24:57.733896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15240","last_updated":"2025-02-22T10:21:46Z","snapshot_observed_at":"2026-08-20T17:13:38.857103Z","submitted_at":"2024-08-27T17:57:45Z","title":"Generative Verifiers: Reward Modeling as Next-Token Prediction","version":3},"cited_work":{"arxiv_id":"2408.15240","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.15240","snapshot_observed_at":"2026-07-08T21:25:38.629808Z","title":"Generative Verifiers: Reward Modeling as Next-Token Prediction","venue":"cs.LG","work_id":"dbe9c116-8030-4e7c-a259-b52c80846d0e","year":2024},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2408.15240","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:baf0f6d7429b9308ef10c0bd11b3e08837038e542312611bfc93bdda241cbddd","observation_id":"aa5b3004-feb1-4f72-9ba2-6db373df0f5d","resolution":{"observed_at":"2026-06-30T17:24:57.743520Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01839","last_updated":"2025-02-20T18:52:18Z","snapshot_observed_at":"2026-08-15T09:04:36.886862Z","submitted_at":"2025-02-03T21:31:07Z","title":"Sample, Scrutinize and Scale: Effective Inference-Time Search by Scaling Verification","version":2},"cited_work":{"arxiv_id":"2502.01839","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01839","snapshot_observed_at":"2026-07-03T11:08:03.073392Z","title":"Sample, scrutinize and scale: Effective inference-time search by scaling verification","venue":null,"work_id":"f874b4d2-a4c7-4eab-bd1d-545e2e79c966","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"cited_paper":"/paper/2502.01839","citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:18d8605b18221eba9ad6a4e693165de83aa5eed56cce8822350a8d4011a078b6","observation_id":"7bb176e1-23a5-4116-a50b-ee48947e0763","resolution":{"observed_at":"2026-06-30T17:24:57.745979Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.569383Z","title":"Processbench: Identifying process errors in mathematical reasoning","venue":null,"work_id":"2cca88f9-785f-4692-995f-c7ffef5676cc","year":2025},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:4aafcc1ef32b9a314cb7cb1ddf5a213efd53e72024d063178f587c66281cfb65","observation_id":"a9e30482-a722-4d24-a180-71a0259cf9bf","resolution":{"observed_at":"2026-07-08T09:34:48.570558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.571114Z","title":"Leanarchitect: Automating blueprint generation for humans and ai","venue":null,"work_id":"0a0f639d-debb-46a7-90c8-034b0e2fbe21","year":2026},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:d25d0723d4b5176749a81a44bf7e9c262bb42d411af77ab00bc4980f7428fc79","observation_id":"2227c853-fa29-4adf-93ad-bb36fb991248","resolution":{"observed_at":"2026-07-08T09:34:48.573054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.591815Z","title":null,"venue":null,"work_id":"0ac49af6-acec-4540-9550-42db2484dacb","year":null},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:cb9e07451f4568e939324acb4e3febf45bb2bce954d0dd4e35c8a6463dd2a8a8","observation_id":"ed1d0f70-b0bb-4c89-8511-032d7f79eed1","resolution":{"observed_at":"2026-07-08T09:34:48.592887Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.560393Z","title":"Definition 3(Block-wise verification algorithm).Let P= (G , T) be a Pseudo-Formal proof with node set V={v 1","venue":null,"work_id":"fe6ccad9-11a3-478f-ab5d-3881228cbc68","year":2026},"citing_paper":{"arxiv_id":"2605.20531","last_updated":"2026-06-17T20:49:55Z","snapshot_observed_at":"2026-08-02T23:01:03.272596Z","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-30T17:17:48.969969Z"},"links":{"citing_paper":"/paper/2605.20531"},"observation_digest":"sha256:c7730556e02608e8fc8f468b5a877e12fe3b2c4df70793f22c67d5febb790e86","observation_id":"22b1fd37-7880-4dd4-a6da-e280683a8ff2","resolution":{"observed_at":"2026-07-08T09:34:48.561951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-08T09:34:48.562591Z","title":"1\"> Assumptions / Conditions / Definitions. - ... Statement : ... may cite any of the propositions; a