{"as_of":"2026-08-19T18:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78ec929eac7c72b2f0258124bf916d2bc0adef5323e86983678f7f43c9108f7f","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:04:38.456180Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:18:57.397021Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T18:17:33.661610Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-07T14:34:08.568419Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics, 2025 a","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18492","last_updated":"2026-06-30T15:33:33Z","snapshot_observed_at":"2026-08-13T18:45:46.181688Z","submitted_at":"2025-05-24T03:52:25Z","title":"Formally Solving Answer-Construction Problems in Lean","version":6},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T14:34:08.568419Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2505.18492"},"observation_digest":"sha256:2c13e9a1231239fa61572acb0996ca61b29a0afb691d7e88b41980c30f24ad4e","observation_id":"12d6cf0d-b1a6-4584-8b73-eec6eaf0fd33","resolution":{"observed_at":"2026-08-07T14:34:08.568419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-07T12:45:45.804899Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:45.804899Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:c2275c9adf856907e416ff666d7bbbaf354bbfda522a0eb5cd3b6d7dabdf0304","observation_id":"afa26eea-fd01-4f0f-b282-3c0315185717","resolution":{"observed_at":"2026-08-07T12:45:45.804899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-06T10:30:44.632329Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.23726","last_updated":"2025-08-01T03:36:47Z","snapshot_observed_at":"2026-08-15T06:06:32.807242Z","submitted_at":"2025-07-31T17:00:30Z","title":"Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T10:30:44.632329Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2507.23726"},"observation_digest":"sha256:abbff68e2023130113497d14b604d5201e5acfc181ed0c44c18934631ecb8f19","observation_id":"7b6d46b7-1d1b-4ec0-a8ca-b228f0b511fa","resolution":{"observed_at":"2026-08-06T10:30:44.632329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-05T18:08:41.447037Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.15180","last_updated":"2026-05-28T16:12:56Z","snapshot_observed_at":"2026-08-15T06:52:27.067194Z","submitted_at":"2025-08-21T02:36:16Z","title":"PuzzleClone: A DSL-Powered Framework for Synthesizing Verifiable Data","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T18:08:41.447037Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2508.15180"},"observation_digest":"sha256:80549b10331444ed24b1595a1e6d2486080a433084d232db7cb05dc645390b39","observation_id":"411ff25b-e1c7-4732-bc91-1fa4d83bc43f","resolution":{"observed_at":"2026-08-05T18:08:41.447037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":"2505.03171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-07-10T18:17:33.661610Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics","venue":"cs.AI","work_id":"230b19a5-b9eb-44ac-a3fb-65265e7a5f55","year":2025},"citing_paper":{"arxiv_id":"2605.17255","last_updated":"2026-05-17T04:53:47Z","snapshot_observed_at":"2026-08-15T03:34:50.153850Z","submitted_at":"2026-05-17T04:53:47Z","title":"CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-20T13:35:04.729506Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2605.17255"},"observation_digest":"sha256:bf830616f01350029f1fd4f16b2348bac1b33040abec6cbf7570aee096459271","observation_id":"ea9c2fc6-5462-481f-9c62-f7f119be5068","resolution":{"observed_at":"2026-05-20T13:38:19.375605Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":"2505.03171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-07-10T18:17:33.661610Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics","venue":"cs.AI","work_id":"230b19a5-b9eb-44ac-a3fb-65265e7a5f55","year":2025},"citing_paper":{"arxiv_id":"2606.03144","last_updated":"2026-06-02T04:40:25Z","snapshot_observed_at":"2026-08-12T16:32:20.828123Z","submitted_at":"2026-06-02T04:40:25Z","title":"GTBench: A Curriculum-Grounded Benchmark for Evaluating LLMs as Mathematical Research Assistants in Graph Theory","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T10:19:03.670540Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2606.03144"},"observation_digest":"sha256:c72ca2bd65d523a7816f6cb8a9bd99eb0d59c85cc8e6a9128a31ccdda391bf48","observation_id":"8ad20165-ffd4-4808-b141-ac450dcfb472","resolution":{"observed_at":"2026-07-02T03:06:30.307295Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":"2505.03171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-07-10T18:17:33.661610Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics","venue":"cs.AI","work_id":"230b19a5-b9eb-44ac-a3fb-65265e7a5f55","year":2025},"citing_paper":{"arxiv_id":"2606.09450","last_updated":"2026-06-08T12:57:18Z","snapshot_observed_at":"2026-08-02T11:29:46.747086Z","submitted_at":"2026-06-08T12:57:18Z","title":"TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T16:19:11.123994Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2606.09450"},"observation_digest":"sha256:0b82f68c8750fca401317520c06ff1517dcc694191f02dc12a31c4540b91f9ee","observation_id":"8adee818-56e3-4c85-b038-e6a0001730c9","resolution":{"observed_at":"2026-07-03T01:47:31.569259Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":"2505.03171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-07-10T18:17:33.661610Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics","venue":"cs.AI","work_id":"230b19a5-b9eb-44ac-a3fb-65265e7a5f55","year":2025},"citing_paper":{"arxiv_id":"2606.29493","last_updated":"2026-06-28T16:46:36Z","snapshot_observed_at":"2026-08-18T21:04:46.495934Z","submitted_at":"2026-06-28T16:46:36Z","title":"Faults in Our Formal Benchmarking: Dataset Defects and Evaluation Failures in Lean Theorem Proving","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T06:56:32.253843Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2606.29493"},"observation_digest":"sha256:8859adf2f46ca3cd4daedc06e399b7e39ce6d8953dbf6ce77ac9d292f1cebd09","observation_id":"359d3628-9664-4e30-96f0-1ea0999c09ff","resolution":{"observed_at":"2026-06-30T07:04:21.947161Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-07-11T15:42:50.296348Z","title":null,"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-18T06:29:44.667648Z","submitted_at":"2026-07-06T04:20:06Z","title":"FormalRx: Rectify and eXamine Semantic Failures in Autoformalization","version":1},"reference_index":111,"source":"arxiv_source","source_observed_at":"2026-07-11T15:42:50.296348Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2607.04655"},"observation_digest":"sha256:bd3861466aeff2c5229fc68e5193f99426e02721ff4a92d0a0c9d1eac92c8b76","observation_id":"37f7c2a0-21c8-4a60-967c-08b179a944c0","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"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":"2505.03171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-07-10T18:17:33.661610Z","title":"Combibench: Benchmarking llm capability for combinatorial mathematics","venue":"cs.AI","work_id":"230b19a5-b9eb-44ac-a3fb-65265e7a5f55","year":2025},"citing_paper":{"arxiv_id":"2607.07779","last_updated":"2026-07-08T17:46:36Z","snapshot_observed_at":"2026-07-12T23:17:59.879344Z","submitted_at":"2026-07-08T17:46:36Z","title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","version":1},"reference_index":150,"source":"pdf_text","source_observed_at":"2026-07-10T18:16:31.176239Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2607.07779"},"observation_digest":"sha256:6e5827f2c6552642b0738563b20a0dd9d3c1bba846a379012722e80973afd6d9","observation_id":"79717f3b-2b55-47a3-8743-0a1cc9b819e3","resolution":{"observed_at":"2026-07-10T18:17:33.662864Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-11T15:30:26.803162Z","title":"CombiBench: Benchmarking LLM capability for combinatorial mathematics.arXiv preprint arXiv:2505.03171, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-19T01:22:14.174611Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:30:26.803162Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:a8bcc813344b50033ad41177032b546fc237395e160c95e75bec2b34e5b44431","observation_id":"aeafd0f9-a93b-410d-a445-b0bb8f5d0e21","resolution":{"observed_at":"2026-08-11T15:30:26.803162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03171","snapshot_observed_at":"2026-08-14T04:18:57.397021Z","title":"CombiBench: Benchmarking LLM capability for combinatorial mathematics.arXiv preprint arXiv:2505.03171, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-19T01:22:14.174611Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T04:18:57.397021Z"},"links":{"cited_paper":"/paper/2505.03171","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:547b99f832f6bc97c4cd75513cec3890b6005160c64b80496a2236f95e02bbdb","observation_id":"45e50f55-3e41-4643-a318-260d8c62b23b","resolution":{"observed_at":"2026-08-14T04:18:57.397021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.03171/citation-record","integrity":"/paper/2505.03171/integrity","json":"/paper/2505.03171/citation-record.json","paper":"/paper/2505.03171"},"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-16T00:04:39.151080Z","title":"Claude 3.7 sonnet, 2025","venue":null,"work_id":"35d48cf5-4d39-4168-b0e9-5a36d363cf81","year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.299189Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:c9457ae053ee044644078a39b63aebb2de1e224e83cc176f2c3d114c2c37d2bf","observation_id":"271822d3-054f-45d0-b4e2-499584185f04","resolution":{"observed_at":"2026-08-16T00:04:39.155918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12433","last_updated":"2023-02-24T03:28:46Z","snapshot_observed_at":"2026-08-19T15:00:47.908932Z","submitted_at":"2023-02-24T03:28:46Z","title":"ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12433","snapshot_observed_at":"2026-08-16T00:04:38.304499Z","title":"Azerbayev, B","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.304499Z"},"links":{"cited_paper":"/paper/2302.12433","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:f8a6e3f34123154022d8aba67885f2226dd8938730589a96f37a0fb02e4db7c7","observation_id":"e36eddec-9d3c-4c99-a0a1-a35ae194a975","resolution":{"observed_at":"2026-08-16T00:04:38.304499Z","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-16T00:04:39.136391Z","title":null,"venue":null,"work_id":"e38828ad-e4f9-43af-83f5-e8abba1df402","year":2013},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.309416Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:b822aa9f96c7f3444fbf90e77f6c3b82c919f0172a8625a0b603f78095339c80","observation_id":"e87f5c6d-e14a-4a48-ac02-1d8295c98467","resolution":{"observed_at":"2026-08-16T00:04:39.140843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:39.121693Z","title":null,"venue":null,"work_id":"e38c20c4-095b-4f49-a00d-7cfb898057dc","year":2004},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.314486Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:c3097855e595edbf77b962c678e53ddecd47912f5de7d05a281567f124b6e41b","observation_id":"5f571164-bf15-4283-90ef-c718c4c2d972","resolution":{"observed_at":"2026-08-16T00:04:39.126277Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:39.106886Z","title":null,"venue":null,"work_id":"246ebed6-fbea-4821-8781-66127de53b0b","year":2019},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.318943Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:04ba4f26f00a211aedc1508c21584eb74f3966a46462dbdbe3289c6ff599b47b","observation_id":"38e7c6d4-4175-4071-89b1-b8a822688dbb","resolution":{"observed_at":"2026-08-16T00:04:39.111430Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:39.090501Z","title":"Chou, X.-S","venue":null,"work_id":"62293484-2451-43b1-8218-ef1cade246d1","year":2000},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.323862Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:778d36f16d149a8ed87830aff818eca1c6e53a16a27fc7902d5c50131361b9c7","observation_id":"bf58b874-5a58-40f9-be13-0863eb03d1da","resolution":{"observed_at":"2026-08-16T00:04:39.095644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:39.074502Z","title":"de Moura, S","venue":null,"work_id":"0af78047-a95c-4a48-92ed-d223f4e44615","year":2015},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.329100Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:55d75b3d24a1c42a4588a9518b89ec8e9dbc536cc6da0c4a0e98526a55f77c8c","observation_id":"e10fc8cc-e407-424f-8124-b1a8c030f144","resolution":{"observed_at":"2026-08-16T00:04:39.079183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:39.058710Z","title":"Dong and T","venue":null,"work_id":"3e81d8db-8007-45fa-b4ba-ea9fa8c24d8f","year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.333926Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:59163366162d17490e1e9150625cf21764f4e5b8e891bd0365c8a5e83ec0948a","observation_id":"34828bb5-7f77-4451-8c4e-a76f11f231ef","resolution":{"observed_at":"2026-08-16T00:04:39.063348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:39.042766Z","title":"Gemini 2.5: Our most intelligent ai model, 2025","venue":null,"work_id":"4205c72f-f4da-4a0d-bc27-f773f5879088","year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.338423Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:2ec947bd4e342b49716e8c00515b857301452b4035815dd6c09dfea57dab429e","observation_id":"1eb05b40-8015-44be-a945-3f934e1fea40","resolution":{"observed_at":"2026-08-16T00:04:39.047931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-16T00:04:38.342897Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.342897Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:2f354123072c92dfba45f2a007b1ac28cfdfb46d999dfcbc724dfba359eb5bfc","observation_id":"273ac6bc-9ae9-4cec-8e31-83d8d3a181ae","resolution":{"observed_at":"2026-08-16T00:04:38.342897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-08-19T11:46:55.171293Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-16T00:04:38.347962Z","title":"Jaech, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.347962Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:8fe83357360c2863e8bc52e545b0bd7e948586fbaa592d16ee0adb5d3c29af86","observation_id":"d44e4573-b102-44b8-b335-6a6bab842091","resolution":{"observed_at":"2026-08-16T00:04:38.347962Z","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-18T21:03:18.814311Z","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-16T00:04:38.352880Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.352880Z"},"links":{"cited_paper":"/paper/2210.12283","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:488fa77302d0c271642b2c91eaa2577500cede6252d52b4d442f381d6ca6e29b","observation_id":"0be5b01d-6e81-4fb6-8e98-d384e2bc29f9","resolution":{"observed_at":"2026-08-16T00:04:38.352880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07640","last_updated":"2025-04-19T13:53:05Z","snapshot_observed_at":"2026-08-15T13:54:00.996017Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07640","snapshot_observed_at":"2026-08-16T00:04:38.357808Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.357808Z"},"links":{"cited_paper":"/paper/2502.07640","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:b97905b5b3aff84e582b1a2967c0b34e274a2460150dc48cbb79eb6e37b2e730","observation_id":"23b6e7a1-b02d-4512-9ce0-2d2d77826670","resolution":{"observed_at":"2026-08-16T00:04:38.357808Z","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-16T00:04:39.026964Z","title":null,"venue":null,"work_id":"0fcc06e0-3cef-4ca8-bb9b-e279acd7a262","year":2023},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.362606Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:78793f09a749761734526ceae570630f492e2a9f10d4b140a39a22fe36b9be27","observation_id":"33da42c2-99b2-4f58-92de-8c31a49504e6","resolution":{"observed_at":"2026-08-16T00:04:39.031934Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:38.366963Z","title":"mathlib Community","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.366963Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:debc4c9ccfb9abbda65ac7af4ceef2110fb019d6f1e2499fcbeeb3fadb90bc4e","observation_id":"cf369646-4a8e-439b-a112-d5eb45a337e5","resolution":{"observed_at":"2026-08-16T00:04:38.366963Z","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-16T00:04:39.011413Z","title":null,"venue":null,"work_id":"ecbf8bed-035c-4d9a-b63b-b24c9ccdb192","year":2021},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.372185Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:820523c8f679a227c17df74827650cb4c159142ef11e54421610795649c87bdb","observation_id":"796942e2-beee-4e06-938e-e8ab2921a59e","resolution":{"observed_at":"2026-08-16T00:04:39.016230Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:38.377268Z","title":"Openai o3-mini, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.377268Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:87ae9611b180044b72d91bcd094c1df5a59b29cba2888ddb336db75de6845312","observation_id":"fa95f311-9cac-435a-8adb-6dc0b9470d52","resolution":{"observed_at":"2026-08-16T00:04:38.377268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03393","last_updated":"2020-09-07T19:50:10Z","snapshot_observed_at":"2026-08-18T11:16:18.404679Z","submitted_at":"2020-09-07T19:50:10Z","title":"Generative Language Modeling for Automated Theorem Proving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03393","snapshot_observed_at":"2026-08-16T00:04:38.382016Z","title":"Polu and I","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.382016Z"},"links":{"cited_paper":"/paper/2009.03393","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:91e049da79fef47badd4cf87689bc321c7e10c592fcb4b733805b99590cbca36","observation_id":"10f860fd-a62e-4db2-a761-3e114f5e85a7","resolution":{"observed_at":"2026-08-16T00:04:38.382016Z","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-16T00:04:38.986202Z","title":"A I M O P rize --- aimoprize.com","venue":null,"work_id":"b4befc01-446b-4b54-acb3-c767e61cc5a9","year":2023},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.386785Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:e1de953038cb4b675b059a68f7680b78f6a49488d39ab5b7e91df468bd4ecc49","observation_id":"7abc47ef-ac8a-49a3-bf9c-737cd25084ed","resolution":{"observed_at":"2026-08-16T00:04:38.990862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:38.971279Z","title":null,"venue":null,"work_id":"c8b66701-4a71-49cf-b441-996105451fb2","year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.391434Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:ce69437de2b5c1fd7cecf44a59856bd27ad54718c58e90185077eb75e4e1290e","observation_id":"d49227e7-a579-4d05-b219-e13e64bdfdf7","resolution":{"observed_at":"2026-08-16T00:04:38.975932Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:38.954902Z","title":null,"venue":null,"work_id":"fe2de588-2465-4bd1-81ce-a263ffee94c8","year":2002},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.395968Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:468250a1b852ae656f2e0757f08662af394bfbab5c543d7cfa06cb39ea4cf036","observation_id":"2ce0e71f-0f97-4312-831c-5c3ff5b79273","resolution":{"observed_at":"2026-08-16T00:04:38.960185Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:38.938018Z","title":"The Coq Proof Assistant , Sept","venue":null,"work_id":"48c0f705-b6d0-48c8-9c41-39e49f840fc2","year":2023},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.400540Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:b391c932d0caa4ab075d1e379cf4fcaec624c9ac72fe41d0575b8b42fc0e9836","observation_id":"a3367479-a069-42f7-b8d6-a67f3e4772fb","resolution":{"observed_at":"2026-08-16T00:04:38.942752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11214","last_updated":"2024-11-03T17:14:37Z","snapshot_observed_at":"2026-08-16T13:33:59.748410Z","submitted_at":"2024-07-15T19:57:15Z","title":"PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11214","snapshot_observed_at":"2026-08-16T00:04:38.404967Z","title":"Tsoukalas, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.404967Z"},"links":{"cited_paper":"/paper/2407.11214","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:0b26f95fcb8a385d2eef84cc24ca445438515c1722d95ef35df94de970626c1d","observation_id":"5ad56077-1b7b-4cfc-b005-e1e453a7c7ac","resolution":{"observed_at":"2026-08-16T00:04:38.404967Z","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-16T00:04:38.922350Z","title":null,"venue":null,"work_id":"e44b2998-75fe-4ab0-ab23-6106a5603d1c","year":2023},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.409614Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:823f3ff8204e64ac37aecafabee14b7e4f28d3f87c1e39e7418ffc191b1cad61","observation_id":"7246e3c0-dcd5-436f-ae25-9b6a87e60d4a","resolution":{"observed_at":"2026-08-16T00:04:38.927133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:38.906603Z","title":null,"venue":null,"work_id":"d08bb033-6dc9-4a64-b832-c544f6aa8251","year":2023},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.414144Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:a513bc7d1012287c13212dc94253e48c84766e8f41bd4db4f636301365f2b150","observation_id":"4543389d-6284-4d0c-af4a-ae42adaf444a","resolution":{"observed_at":"2026-08-16T00:04:38.911865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11354","last_updated":"2025-04-15T16:23:44Z","snapshot_observed_at":"2026-08-15T23:16:36.618851Z","submitted_at":"2025-04-15T16:23:44Z","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11354","snapshot_observed_at":"2026-08-16T00:04:38.418720Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.418720Z"},"links":{"cited_paper":"/paper/2504.11354","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:77ba1fede0d0a19d80915cca6df6a18816339a147877c21b4314df0b95f6eca6","observation_id":"6631b2b5-a931-4f4f-990e-ce329e9b6dc1","resolution":{"observed_at":"2026-08-16T00:04:38.418720Z","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-16T00:04:38.890582Z","title":"Wenzel, L","venue":null,"work_id":"2ce54f1d-8c7c-44fd-b827-ea6fe43d031e","year":2008},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.423749Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:28734b19d0f28b26f0b44d737f7997212b7fc5203a11cdaf15e47d73f2d226b9","observation_id":"8fc8521d-0820-4770-989d-7bc862e0d60b","resolution":{"observed_at":"2026-08-16T00:04:38.895485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:04:38.874477Z","title":null,"venue":null,"work_id":"300e0397-30ed-4073-9c3b-06e576deebeb","year":2024},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.429150Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:1fb09388afb3d087f0c8503cdb74831c2ac8c5d072c0325d7a91d56c9821587c","observation_id":"d823ffda-1738-442e-a47d-ede3af7289d8","resolution":{"observed_at":"2026-08-16T00:04:38.879361Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08152","last_updated":"2024-08-15T13:40:03Z","snapshot_observed_at":"2026-08-16T13:26:15.351308Z","submitted_at":"2024-08-15T13:40:03Z","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08152","snapshot_observed_at":"2026-08-16T00:04:38.434922Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.434922Z"},"links":{"cited_paper":"/paper/2408.08152","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:2bc90f2e183a13b556551d52cd992a8b8034c1f2b73239088bf064ceeacad631","observation_id":"284f4414-06e2-4d28-8895-f4b2f4677108","resolution":{"observed_at":"2026-08-16T00:04:38.434922Z","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-16T00:04:38.439891Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.439891Z"},"links":{"citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:7631f77bbd2367550a3bb508ba2a70542ba068757ca90eb87ada0cd5fd470143","observation_id":"9f1a46e6-a02e-4ff3-a25e-4f937c99b49c","resolution":{"observed_at":"2026-08-16T00:04:38.439891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17840","last_updated":"2025-02-25T04:41:49Z","snapshot_observed_at":"2026-08-16T12:55:30.468720Z","submitted_at":"2025-02-25T04:41:49Z","title":"A Combinatorial Identities Benchmark for Theorem Proving via Automated Theorem Generation","version":1},"cited_work":{"arxiv_id":"2502.17840","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.17840","snapshot_observed_at":"2026-08-16T00:04:38.529345Z","title":"A Combinatorial Identities Benchmark for Theorem Proving via Automated Theorem Generation","venue":"cs.AI","work_id":"b24d170b-75b7-4f2e-8654-28aedc69dca3","year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.444500Z"},"links":{"cited_paper":"/paper/2502.17840","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:4b09e7f0debba55268fcbb0e0f34a70584c8ca3d38baac2cf92d95fea9f9a9e7","observation_id":"191eccc6-f994-406f-953c-c4214ba4e372","resolution":{"observed_at":"2026-08-16T00:04:38.537787Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06122","last_updated":"2025-07-14T04:41:15Z","snapshot_observed_at":"2026-08-16T12:42:58.361121Z","submitted_at":"2025-04-08T15:15:26Z","title":"Leanabell-Prover: Posttraining Scaling in Formal Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.06122","snapshot_observed_at":"2026-08-16T00:04:38.449760Z","title":"Zhang, Q","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.449760Z"},"links":{"cited_paper":"/paper/2504.06122","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:dcbac8eb53a41f4d08d68fa8c0c7ce6f18c9c24914b679298d99f1034fc7e09f","observation_id":"1d08fa3b-94ae-490f-b486-935800308495","resolution":{"observed_at":"2026-08-16T00:04:38.449760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00110","last_updated":"2022-02-28T06:03:23Z","snapshot_observed_at":"2026-08-16T23:45:44.761660Z","submitted_at":"2021-08-31T23:21:12Z","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00110","snapshot_observed_at":"2026-08-16T00:04:38.456180Z","title":"Zheng, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T00:04:38.456180Z"},"links":{"cited_paper":"/paper/2109.00110","citing_paper":"/paper/2505.03171"},"observation_digest":"sha256:af8764b6cf477858af6b1e02cd721ec6056deefbef239730095df748ae0f76f7","observation_id":"5a883dde-249b-4b4c-b293-4a07491a0194","resolution":{"observed_at":"2026-08-16T00:04:38.456180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.03171","last_updated":"2025-05-06T04:32:17Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T21:04:01.915215Z","submitted_at":"2025-05-06T04:32:17Z","title":"CombiBench: Benchmarking LLM Capability for Combinatorial Mathematics"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":33},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 12 inbound Pith citation observations for arXiv:2505.03171."}