{"as_of":"2026-08-05T14:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b035edc57e48dc17e3a1fc17b6ecda4d88b30998be40b13fa88772fd1f7949c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T06:40:28.465639Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2510.01346","last_updated":"2025-10-10T20:12:14Z","snapshot_observed_at":"2026-08-02T06:00:59.770868Z","submitted_at":"2025-10-01T18:21:13Z","title":"Aristotle: IMO-level Automated Theorem Proving","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-15T08:51:37.827144Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2510.01346"},"observation_digest":"sha256:c396ed7ff82b228c5487c365950240bc3cc1a835e58bf69458363d176bf74e6b","observation_id":"e759d0aa-fb1d-4bf0-bbc6-ea76c7eb3733","resolution":{"observed_at":"2026-05-15T08:51:37.996641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-04T06:40:28.465639Z","title":"Solving formal math problems by decomposition and iterative reflection","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.10739","last_updated":"2026-08-03T08:17:50Z","snapshot_observed_at":"2026-08-05T14:43:04.089909Z","submitted_at":"2025-12-11T15:26:28Z","title":"Intern-S1-MO: Long-horizon Reasoning Agent for Olympiad?Level Mathematical Problem Solving","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T06:40:28.465639Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2512.10739"},"observation_digest":"sha256:d336fa34e0114516d6293943b932ae26105617cd4b501f7eb7da515db00ae24b","observation_id":"2e3f882a-6262-46a8-8af9-8937dd02f28a","resolution":{"observed_at":"2026-08-04T06:40:28.465639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2601.13209","last_updated":"2026-05-02T15:26:09Z","snapshot_observed_at":"2026-07-06T22:42:08.271837Z","submitted_at":"2026-01-19T16:38:18Z","title":"AI for Mathematics: Progress, Challenges, and Prospects","version":5},"reference_index":179,"source":"pdf_text","source_observed_at":"2026-05-16T13:24:57.923863Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2601.13209"},"observation_digest":"sha256:1c141eabc6fff970673508128fbed63df4e8752b0501f5d197f71e5783667188","observation_id":"ecf4eff8-730f-4797-92b2-c533df2341a6","resolution":{"observed_at":"2026-05-16T13:27:55.755637Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2605.09271","last_updated":"2026-05-10T02:42:29Z","snapshot_observed_at":"2026-07-06T23:21:26.017420Z","submitted_at":"2026-05-10T02:42:29Z","title":"Shaping Schema via Language Representation as the Next Frontier for LLM Intelligence Expanding","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-12T05:01:38.118237Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2605.09271"},"observation_digest":"sha256:c6644aeb2c7a712b59a440adc88a498c360dc3be9422dd4867f4ded7640ed562","observation_id":"87f1f480-c86e-4b78-b2ee-bfe2d23bdecf","resolution":{"observed_at":"2026-05-12T05:41:27.258616Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2605.27485","last_updated":"2026-05-26T14:50:47Z","snapshot_observed_at":"2026-08-02T13:15:11.614769Z","submitted_at":"2026-05-26T14:50:47Z","title":"Automating Formal Verification with Agent-Guided Tree Search","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-06-29T14:54:59.333847Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2605.27485"},"observation_digest":"sha256:4ebd5199b72754784e36e8c7e80747ab70c0ef7b880b29de13865717ff1c764e","observation_id":"4afafc7f-5efe-450c-bc81-3531a61e46b8","resolution":{"observed_at":"2026-06-29T15:03:31.273724Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2606.01861","last_updated":"2026-06-01T08:12:47Z","snapshot_observed_at":"2026-07-06T23:42:21.252086Z","submitted_at":"2026-06-01T08:12:47Z","title":"A Theoretical Framework for Self-Play Theorem Proving Algorithms","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-28T15:34:31.689776Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2606.01861"},"observation_digest":"sha256:c58b8f62ae29c7de0c157813505dd0b7b153af356bd7ba6a4ce9611d2d0bb5f1","observation_id":"a4e246d7-c8f0-43dd-8e14-b75bd0ab3b92","resolution":{"observed_at":"2026-07-01T22:16:16.409707Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2606.04883","last_updated":"2026-06-23T10:56:57Z","snapshot_observed_at":"2026-07-06T23:44:57.208389Z","submitted_at":"2026-06-03T13:46:20Z","title":"Optimizing the Cost-Quality Tradeoff of Agentic Theorem Provers in Lean","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T06:01:44.894830Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2606.04883"},"observation_digest":"sha256:bd730e59e4ecc2f790f5574fb174170fec6dc314cbef8d8ae5436cd52ab95b8c","observation_id":"de1c0342-6d97-4479-92aa-1596ed4194d8","resolution":{"observed_at":"2026-06-28T06:11:42.512242Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2606.31134","last_updated":"2026-07-01T19:08:57Z","snapshot_observed_at":"2026-07-07T00:04:53.774826Z","submitted_at":"2026-06-30T05:05:03Z","title":"Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-01T05:54:51.200436Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2606.31134"},"observation_digest":"sha256:157174087f0f940c03cb39451a08886d167390ca7c3b74d8d69fde614e0e35bd","observation_id":"12131c7b-c684-4574-ae79-0ece491e1e2f","resolution":{"observed_at":"2026-07-01T10:05:40.835473Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":"2507.15225","doi":"10.48550/arxiv.2507.15225","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","venue":"ArXiv.org","work_id":"4bf03543-b94b-4814-abf2-de9413158010","year":2025},"citing_paper":{"arxiv_id":"2606.31134","last_updated":"2026-07-01T19:08:57Z","snapshot_observed_at":"2026-07-07T00:04:53.774826Z","submitted_at":"2026-06-30T05:05:03Z","title":"Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-03T22:34:08.241014Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2606.31134"},"observation_digest":"sha256:b89e4c787620710ea0d47c381e2efc0d09cc1fdfd48a38302b1e809ad526331f","observation_id":"5fc62fd6-af42-4470-9ec9-92ea737c744a","resolution":{"observed_at":"2026-07-03T22:39:01.195388Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T04:49:09.048852+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.15225","snapshot_observed_at":"2026-07-11T15:42:50.296348Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04655","last_updated":"2026-07-06T04:20:06Z","snapshot_observed_at":"2026-08-02T16:20:05.798847Z","submitted_at":"2026-07-06T04:20:06Z","title":"FormalRx: Rectify and eXamine Semantic Failures in Autoformalization","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-11T15:42:50.296348Z"},"links":{"cited_paper":"/paper/2507.15225","citing_paper":"/paper/2607.04655"},"observation_digest":"sha256:2e1e99474603907326815294950fba8028cd175fe1635a0f3a35265edd1f4a65","observation_id":"6ba83a62-b79f-477d-8470-283238da8290","resolution":{"observed_at":"2026-07-11T15:42:50.296348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.15225/citation-record","integrity":"/paper/2507.15225/integrity","json":"/paper/2507.15225/citation-record.json","paper":"/paper/2507.15225"},"outbound":[],"paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T22:00:08.908202Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2507.15225."}