{"as_of":"2026-08-10T15:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b9610bed1a1199cc54d84eab98e16fb018ee29433876caa69af4c7171a67241","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:13:58.102702Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":58,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:06:37.731877Z","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":5,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2503.09567","last_updated":"2025-07-18T15:57:54Z","snapshot_observed_at":"2026-08-08T22:33:20.124926Z","submitted_at":"2025-03-12T17:35:03Z","title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","version":5},"reference_index":173,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:57bb83f9025f91365cfbd720aab29858c1cc81db2f1df8f104ff4c6acd1fc1a5","observation_id":"ac518908-2f16-4ab7-8fcc-0d3522a2f260","resolution":{"observed_at":"2026-05-12T08:41:23.494181Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T15:06:37.731877Z","title":"Competitive programming with large reasoning models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16366","last_updated":"2025-05-22T08:21:39Z","snapshot_observed_at":"2026-08-10T09:56:06.079392Z","submitted_at":"2025-05-22T08:21:39Z","title":"ReCopilot: Reverse Engineering Copilot in Binary Analysis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:06:37.731877Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.16366"},"observation_digest":"sha256:f59f0edb2c9b3f37bda45beaa1c5f57022b3981a7338a2d5747767b1b0f78cdf","observation_id":"fa596536-ab67-460b-bfcb-3588c5c0f400","resolution":{"observed_at":"2026-08-07T15:06:37.731877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T14:47:54.628265Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17667","last_updated":"2025-05-27T09:39:47Z","snapshot_observed_at":"2026-08-09T18:30:22.847305Z","submitted_at":"2025-05-23T09:31:55Z","title":"QwenLong-L1: Towards Long-Context Large Reasoning Models with Reinforcement Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:54.628265Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.17667"},"observation_digest":"sha256:4367816666d3bac1bc37ad3e536a61f02e143d66ffa1b334eb43fb37eb964ca2","observation_id":"76e19ce2-d0ac-4641-90bf-8a32e2b248e1","resolution":{"observed_at":"2026-08-07T14:47:54.628265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T14:41:41.482480Z","title":"Competitive Programming with Large Reasoning Models , 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17988","last_updated":"2025-08-05T11:46:13Z","snapshot_observed_at":"2026-08-09T20:50:22.177201Z","submitted_at":"2025-05-23T14:55:22Z","title":"Towards Revealing the Effectiveness of Small-Scale Fine-tuning in R1-style Reinforcement Learning","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T14:41:41.482480Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.17988"},"observation_digest":"sha256:c41e580febb30fc3bfec93de63862cd9bbf3b74e248f60d270acda2a949d8b77","observation_id":"0878badd-2b52-442b-baf4-111d63fbec82","resolution":{"observed_at":"2026-08-07T14:41:41.482480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T14:13:44.797973Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19628","last_updated":"2025-05-27T07:26:36Z","snapshot_observed_at":"2026-08-09T09:46:40.475247Z","submitted_at":"2025-05-26T07:47:39Z","title":"HomeBench: Evaluating LLMs in Smart Homes with Valid and Invalid Instructions Across Single and Multiple Devices","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T14:13:44.797973Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.19628"},"observation_digest":"sha256:df4b360ad1c9f5567c6f5957344563102cf90d0dd54cf3a5dc24865e51dc5048","observation_id":"4812c028-8191-471b-8303-c72322123e79","resolution":{"observed_at":"2026-08-07T14:13:44.797973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T14:01:24.248102Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20236","last_updated":"2025-05-26T17:16:36Z","snapshot_observed_at":"2026-08-10T10:40:45.124856Z","submitted_at":"2025-05-26T17:16:36Z","title":"Seeing is Believing, but How Much? A Comprehensive Analysis of Verbalized Calibration in Vision-Language Models","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T14:01:24.248102Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.20236"},"observation_digest":"sha256:f995fb564fbb1dbd534a223b10c7171d18b4cba2dbfa388401bc4f610ca4d797","observation_id":"784c145e-d28b-486f-8ede-99c514aad554","resolution":{"observed_at":"2026-08-07T14:01:24.248102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T13:57:23.521521Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20573","last_updated":"2025-06-03T19:33:56Z","snapshot_observed_at":"2026-08-07T20:38:25.271078Z","submitted_at":"2025-05-26T23:14:16Z","title":"Collision- and Reachability-Aware Multi-Robot Control with Grounded LLM Planners","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:57:23.521521Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.20573"},"observation_digest":"sha256:41a816624b62c2e6e2774cd616f9ec7ee5429858074c7cf7a86c8c3c457954f0","observation_id":"5e14007f-8e82-48c7-82ca-15348a966e2c","resolution":{"observed_at":"2026-08-07T13:57:23.521521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T13:21:18.875663Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22068","last_updated":"2025-05-28T07:47:46Z","snapshot_observed_at":"2026-08-07T13:13:34.125452Z","submitted_at":"2025-05-28T07:47:46Z","title":"Beyond path selection: Better LLMs for Scientific Information Extraction with MimicSFT and Relevance and Rule-induced(R$^2$)GRPO","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:21:18.875663Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.22068"},"observation_digest":"sha256:a2744ee3e4a111ec38dc9a953743cbee7227565b0b8f4c08d7a25c1f0a06523c","observation_id":"13dec200-0d14-48b3-96be-be1c4cf7a765","resolution":{"observed_at":"2026-08-07T13:21:18.875663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T12:45:25.443666Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24034","last_updated":"2025-06-02T01:49:51Z","snapshot_observed_at":"2026-08-07T23:13:48.148542Z","submitted_at":"2025-05-29T22:14:15Z","title":"LlamaRL: A Distributed Asynchronous Reinforcement Learning Framework for Efficient Large-scale LLM Training","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:45:25.443666Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.24034"},"observation_digest":"sha256:b3d9ce4e8c2ccb46d73531a1024aaaee1fdf09677ad8cc8df11ea396580ced68","observation_id":"e708a75c-3b4d-428f-943b-9da9ad7ccb01","resolution":{"observed_at":"2026-08-07T12:45:25.443666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T12:39:57.365862Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24098","last_updated":"2025-05-30T01:00:34Z","snapshot_observed_at":"2026-08-09T17:58:14.173767Z","submitted_at":"2025-05-30T01:00:34Z","title":"HardTests: Synthesizing High-Quality Test Cases for LLM Coding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:39:57.365862Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2505.24098"},"observation_digest":"sha256:10eaa4ad5785ed85454d5a1950b81855c48248ad8f64a1f538db4b869d35741b","observation_id":"82330be4-dce1-4de6-8fb7-88075f7db129","resolution":{"observed_at":"2026-08-07T12:39:57.365862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T10:33:50.836223Z","title":"https://doi.org/10.48550/ arXiv.2502.06807, arXiv:2502.06807 [cs.LG]","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04965","last_updated":"2025-06-05T12:41:20Z","snapshot_observed_at":"2026-08-09T22:08:37.129045Z","submitted_at":"2025-06-05T12:41:20Z","title":"From Struggle (06-2024) to Mastery (02-2025) LLMs Conquer Advanced Algorithm Exams and Pave the Way for Editorial Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:33:50.836223Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.04965"},"observation_digest":"sha256:cf742b30856cdd5d12c9565c16bc3dd6a29c315f5a7e1cbf12684a7e525f2516","observation_id":"6aa5dc2d-dc85-4d43-86b2-2fd13bbecda2","resolution":{"observed_at":"2026-08-07T10:33:50.836223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T10:18:57.485714Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05566","last_updated":"2025-07-15T21:44:21Z","snapshot_observed_at":"2026-08-09T09:46:49.462038Z","submitted_at":"2025-06-05T20:24:58Z","title":"ScaleRTL: Scaling LLMs with Reasoning Data and Test-Time Compute for Accurate RTL Code Generation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:57.485714Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.05566"},"observation_digest":"sha256:a3d6cda38d826ab243ef00c7399b69c533c002cb6b611ec6b39d263b10186c80","observation_id":"2e21133f-de9e-4342-a340-1738f3805185","resolution":{"observed_at":"2026-08-07T10:18:57.485714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T10:22:10.290482Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05692","last_updated":"2025-06-20T12:42:57Z","snapshot_observed_at":"2026-08-09T09:46:21.168984Z","submitted_at":"2025-06-06T02:48:02Z","title":"SafeGenBench: A Benchmark Framework for Security Vulnerability Detection in LLM-Generated Code","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:22:10.290482Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.05692"},"observation_digest":"sha256:94017b36e28fbd1550e1c210b48e7d677888cb1794aae4a1c1c06bd1e0220070","observation_id":"54ac5407-6ff4-4676-afd7-abc8a2c5a588","resolution":{"observed_at":"2026-08-07T10:22:10.290482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T10:16:52.953682Z","title":"Competitive programming with large reasoning models, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05817","last_updated":"2025-06-06T07:29:01Z","snapshot_observed_at":"2026-08-09T19:50:40.350535Z","submitted_at":"2025-06-06T07:29:01Z","title":"CodeContests+: High-Quality Test Case Generation for Competitive Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:16:52.953682Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.05817"},"observation_digest":"sha256:44419658f7a1d18103f2fc0b5c9d785b1f59c518a609468d82c0e12b9987d053","observation_id":"ff870720-553e-41ae-ac1e-7aa79506a2df","resolution":{"observed_at":"2026-08-07T10:16:52.953682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-07T00:23:46.916094Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14299","last_updated":"2025-06-17T08:18:20Z","snapshot_observed_at":"2026-08-09T09:46:23.571557Z","submitted_at":"2025-06-17T08:18:20Z","title":"ADRD: LLM-Driven Autonomous Driving Based on Rule-based Decision Systems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:23:46.916094Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.14299"},"observation_digest":"sha256:d425407d37091b63e60bcf6fe1990d234f3455b91bb659e5e3ced4207ad6c095","observation_id":"0808d3c6-2c62-4c08-8d18-0031b96b9eff","resolution":{"observed_at":"2026-08-07T00:23:46.916094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2506.14611","last_updated":"2026-04-09T10:10:15Z","snapshot_observed_at":"2026-08-02T20:19:45.371740Z","submitted_at":"2025-06-17T15:10:01Z","title":"Exploring MLLMs Perception of Network Visualization Principles","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T09:10:43.284468Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.14611"},"observation_digest":"sha256:f500c6bd005e847dc607c0c8382c5f5f6485acdb616bee77cc89fcd4a5655489","observation_id":"817dac2c-c798-48c9-bc48-13ca53e3ae5a","resolution":{"observed_at":"2026-05-19T09:12:13.896817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2506.18315","last_updated":"2026-05-01T05:53:57Z","snapshot_observed_at":"2026-08-02T07:45:21.500873Z","submitted_at":"2025-06-23T06:01:12Z","title":"Effective LLM Code Refinement via Property-Oriented and Structurally Minimal Feedback","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T08:36:58.880345Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2506.18315"},"observation_digest":"sha256:4c46f98e446c0a01c45505abf0e998186423795d48e88a30042af922a16b68b1","observation_id":"efd088bb-b7f7-4aab-9d40-c3c7b463a8e0","resolution":{"observed_at":"2026-05-19T08:37:11.729005Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2507.00748","last_updated":"2026-04-12T11:20:16Z","snapshot_observed_at":"2026-08-08T09:01:59.914584Z","submitted_at":"2025-07-01T13:48:57Z","title":"Improving the Reasoning of Multi-Image Grounding in MLLMs via Reinforcement Learning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-19T06:50:02.607136Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2507.00748"},"observation_digest":"sha256:ce16e4404771572079cdba5f4a37bd24d6a8a75f9eed17f2de4345cda4da8a61","observation_id":"d69a98b6-3209-4a51-8324-b7a7d9321b86","resolution":{"observed_at":"2026-05-19T06:52:08.025692Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-06T19:15:32.356639Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.06138","last_updated":"2025-07-08T16:20:43Z","snapshot_observed_at":"2026-08-09T09:48:26.239549Z","submitted_at":"2025-07-08T16:20:43Z","title":"Coding Triangle: How Does Large Language Model Understand Code?","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:32.356639Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2507.06138"},"observation_digest":"sha256:f838d73a0eacf421a5201fe938df021109b859c19445b6f056a5abf6cb92ddd5","observation_id":"dd9e01b2-eeaf-47c1-9956-99dfd4999c7c","resolution":{"observed_at":"2026-08-06T19:15:32.356639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-06T18:58:21.076658Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06920","last_updated":"2025-07-10T03:12:09Z","snapshot_observed_at":"2026-08-07T06:30:37.706756Z","submitted_at":"2025-07-09T14:58:47Z","title":"Rethinking Verification for LLM Code Generation: From Generation to Testing","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:58:21.076658Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2507.06920"},"observation_digest":"sha256:a09a617312412c4d18df3de55d8a27f1592176a9fe9e91e883494fe015522112","observation_id":"de6ddd58-c8d1-4c1e-8b64-77ba6616c4b5","resolution":{"observed_at":"2026-08-06T18:58:21.076658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-06T18:58:21.079886Z","title":"URL https://doi.org/10.48550/arXiv.2502","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06920","last_updated":"2025-07-10T03:12:09Z","snapshot_observed_at":"2026-08-07T06:30:37.706756Z","submitted_at":"2025-07-09T14:58:47Z","title":"Rethinking Verification for LLM Code Generation: From Generation to Testing","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T18:58:21.079886Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2507.06920"},"observation_digest":"sha256:23806a43bd7eb970d226d05333d4d20ea40b02324edbfaf0a522050afe882a78","observation_id":"a123188d-a098-497a-8960-3d787a79616a","resolution":{"observed_at":"2026-08-06T18:58:21.079886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-06T18:26:08.512634Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.08267","last_updated":"2025-07-11T02:26:01Z","snapshot_observed_at":"2026-08-08T01:06:58.092959Z","submitted_at":"2025-07-11T02:26:01Z","title":"A Practical Two-Stage Recipe for Mathematical LLMs: Maximizing Accuracy with SFT and Efficiency with Reinforcement Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:26:08.512634Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2507.08267"},"observation_digest":"sha256:e214ef40920bcf4e76dcf3d7e2034c7f0bf1ac3eabdf0a3690de7a54c3233d7d","observation_id":"8bd696b0-af35-491a-bd05-22225f5cf6a0","resolution":{"observed_at":"2026-08-06T18:26:08.512634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-06T15:42:05.884442Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.15225","last_updated":"2025-07-21T03:56:35Z","snapshot_observed_at":"2026-08-06T17:33:28.833666Z","submitted_at":"2025-07-21T03:56:35Z","title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T15:42:05.884442Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2507.15225"},"observation_digest":"sha256:a5838793db8388cc7350a1ed7ba1194103e417d172712f901925c058eeb19e21","observation_id":"c002421f-92d1-4623-9b82-094a2932aa10","resolution":{"observed_at":"2026-08-06T15:42:05.884442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-06T13:47:37.756626Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20199","last_updated":"2025-08-13T10:58:50Z","snapshot_observed_at":"2026-08-07T10:10:33.604674Z","submitted_at":"2025-07-27T09:38:32Z","title":"StepFun-Prover Preview: Let's Think and Verify Step by Step","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T13:47:37.756626Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2507.20199"},"observation_digest":"sha256:6d4bd51efc9eab987bc4c7087b804677f2405631220c0d426aaac210d9674aa7","observation_id":"95c92c55-e0a9-407c-9898-55306b066785","resolution":{"observed_at":"2026-08-06T13:47:37.756626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T20:17:08.011061Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.10874","last_updated":"2025-08-14T17:46:01Z","snapshot_observed_at":"2026-08-06T03:19:32.559275Z","submitted_at":"2025-08-14T17:46:01Z","title":"SSRL: Self-Search Reinforcement Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T20:17:08.011061Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2508.10874"},"observation_digest":"sha256:56c3be3653b2d7ff20d2fc6838df701bbf2aa8cdaa634140382d91ea212c0643","observation_id":"42c01a12-0b8f-491c-bbc5-b0c84ccbab26","resolution":{"observed_at":"2026-08-05T20:17:08.011061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T12:56:35.051163Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.01142","last_updated":"2025-09-01T05:30:56Z","snapshot_observed_at":"2026-08-08T06:17:53.010186Z","submitted_at":"2025-09-01T05:30:56Z","title":"Dream-Coder 7B: An Open Diffusion Language Model for Code","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T12:56:35.051163Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2509.01142"},"observation_digest":"sha256:ca651381e83507ea5309002afda2b899685498b6eff166c93ecc4dcc48a83d56","observation_id":"1455458b-f84c-44ae-932b-5f09f4cbad13","resolution":{"observed_at":"2026-08-05T12:56:35.051163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T15:17:13.755616Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.03537","last_updated":"2025-08-27T17:26:44Z","snapshot_observed_at":"2026-08-09T15:45:12.294838Z","submitted_at":"2025-08-27T17:26:44Z","title":"AR$^2$: Adversarial Reinforcement Learning for Abstract Reasoning in Large Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:17:13.755616Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2509.03537"},"observation_digest":"sha256:92f69ae8642d99261e3bcd965e612c6c7518d074ad8b7aee196eca0cd8ca7bda","observation_id":"b8753fe9-fef7-4f22-9d23-1e4dc5afc420","resolution":{"observed_at":"2026-08-05T15:17:13.755616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2509.08827","last_updated":"2025-10-09T17:08:52Z","snapshot_observed_at":"2026-08-06T15:38:05.011922Z","submitted_at":"2025-09-10T17:59:43Z","title":"A Survey of Reinforcement Learning for Large Reasoning Models","version":3},"reference_index":125,"source":"arxiv_source","source_observed_at":"2026-05-18T00:02:24.352947Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2509.08827"},"observation_digest":"sha256:2efb9a31327c74f8509bd76f3cd8211226c9a3e9a81f8ec205d6e284078e9603","observation_id":"b1b2c3af-7ae6-403b-bac2-cec99d88f96d","resolution":{"observed_at":"2026-05-18T00:02:25.326920Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2509.26574","last_updated":"2026-05-08T21:22:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-30T17:34:03Z","title":"Probing the Critical Point (CritPt) of AI Reasoning: a Frontier Physics Research Benchmark","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-18T11:52:10.205796Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2509.26574"},"observation_digest":"sha256:f011ce5253f724c0d24c71b3198ba0a84b99c50ac7d028454cd4526b0c077876","observation_id":"0999756f-6a33-4c27-bead-70db137bb4c1","resolution":{"observed_at":"2026-05-18T11:52:35.346332Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-04T10:44:29.807746Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08977","last_updated":"2026-06-02T08:25:17Z","snapshot_observed_at":"2026-08-10T15:22:25.025944Z","submitted_at":"2025-10-10T03:38:17Z","title":"Breaking the Self-Confirming Loop: Diagnosing and Mitigating Systemic Reward Bias in Self-Rewarding RL","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T10:44:29.807746Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2510.08977"},"observation_digest":"sha256:1f162836013fcea0a03af6f0b781495c1a57878e1ca944ffdeb50f3321431f49","observation_id":"c68cb155-faeb-4da6-bf8c-fb738596cfef","resolution":{"observed_at":"2026-08-04T10:44:29.807746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2510.14232","last_updated":"2026-04-14T23:27:33Z","snapshot_observed_at":"2026-08-05T22:28:09.248293Z","submitted_at":"2025-10-16T02:19:25Z","title":"Scaling Test-Time Compute to Achieve IOI Gold Medal with Open-Weight Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-18T06:20:16.941026Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2510.14232"},"observation_digest":"sha256:6aaf6d93c546b05b4fa559a39e4eb1ac6c7c7a5a7c2615b385d8a9fb54ce6a85","observation_id":"042ab8e3-56d5-4201-8a7d-d3ae2bf088ee","resolution":{"observed_at":"2026-05-18T06:20:58.215219Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-04T09:38:46.237278Z","title":"Competitive programming with large reasoning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.14717","last_updated":"2026-07-27T17:12:10Z","snapshot_observed_at":"2026-08-07T22:51:49.378334Z","submitted_at":"2025-10-16T14:17:38Z","title":"Seesaw: Accelerating Training by Balancing Learning Rate and Batch Size Scheduling","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T09:38:46.237278Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2510.14717"},"observation_digest":"sha256:3e0b2fab9b1d271fc00bd45f018ad53fb37bf1660a2a4a225cf7436c47759fb6","observation_id":"0517d095-d571-4a15-8344-df8ba99e3b39","resolution":{"observed_at":"2026-08-04T09:38:46.237278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2512.07538","last_updated":"2026-04-27T07:13:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-12-08T13:17:27Z","title":"SwissGov-RSD: A Human-annotated, Cross-lingual Benchmark for Token-level Recognition of Semantic Differences Between Related Documents","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-17T00:52:17.308293Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2512.07538"},"observation_digest":"sha256:0ba945e75b02f106ee00176563c1fb54943ff0563076b3c92b089558dcfc46b1","observation_id":"69333ba0-4b29-499e-af5c-e7f7b80c7970","resolution":{"observed_at":"2026-05-17T00:53:46.188225Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-07-13T14:33:35.834383Z","title":"Competitive Programming with Large Reasoning Models.CoRR, abs/2502.06807,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.01193","last_updated":"2026-06-24T22:44:36Z","snapshot_observed_at":"2026-08-02T16:28:38.685624Z","submitted_at":"2026-04-01T17:39:50Z","title":"Embarrassingly Simple Self-Distillation Improves Code Generation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T14:33:35.834383Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2604.01193"},"observation_digest":"sha256:6bcbaa9fa0f7024b48a2c7c7ef4c96ddc7a72e422b4e5b4f4e9fb393ec2ee823","observation_id":"61c0ddbb-1c56-47a2-8e74-816ed380f792","resolution":{"observed_at":"2026-07-13T14:33:35.834383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2604.02721","last_updated":"2026-04-03T04:26:56Z","snapshot_observed_at":"2026-08-01T01:27:54.176469Z","submitted_at":"2026-04-03T04:26:56Z","title":"GrandCode: Achieving Grandmaster Level in Competitive Programming via Agentic Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T20:30:17.791973Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2604.02721"},"observation_digest":"sha256:a7ef4defeae62fd5b43402b6f8aeeb8dbb976aa1c71236673fc0cb95dab38c4a","observation_id":"62ec5938-c0cb-4c31-89e0-f2ba1a719adf","resolution":{"observed_at":"2026-05-13T20:33:16.686666Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2604.24396","last_updated":"2026-04-27T12:23:00Z","snapshot_observed_at":"2026-07-06T23:10:24.992210Z","submitted_at":"2026-04-27T12:23:00Z","title":"Global Context or Local Detail? Adaptive Visual Grounding for Hallucination Mitigation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T04:29:59.246652Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2604.24396"},"observation_digest":"sha256:8cc8feffe5d38df9f04e884d2a1facd94948c18b93e042eaf60673b561409542","observation_id":"e0d6ef87-69ff-4a89-85dd-0824165bd72d","resolution":{"observed_at":"2026-05-11T21:46:19.541829Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.04431","last_updated":"2026-05-06T02:50:00Z","snapshot_observed_at":"2026-07-06T23:17:13.770090Z","submitted_at":"2026-05-06T02:50:00Z","title":"Towards Robust LLM Post-Training: Automatic Failure Management for Reinforcement Fine-Tuning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T18:19:41.302164Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.04431"},"observation_digest":"sha256:dd4bcf4d29673d6e77391a69cbe74be8b187f3e0405b0ae82c51304f4c3394e6","observation_id":"8dbfb412-0981-4673-a541-462f9b3f4a0b","resolution":{"observed_at":"2026-05-09T06:35:39.098340Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.06840","last_updated":"2026-05-22T00:29:09Z","snapshot_observed_at":"2026-08-03T21:39:56.998797Z","submitted_at":"2026-05-07T18:45:46Z","title":"Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-11T00:52:59.406190Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.06840"},"observation_digest":"sha256:a61ec1c00782533a72703b7df5e9d3e7642dc69e80fe44d6a7230d4b3a1026f8","observation_id":"ec967a74-856c-4f48-8bc0-654a31c5ef80","resolution":{"observed_at":"2026-05-11T05:05:56.753585Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.06840","last_updated":"2026-05-22T00:29:09Z","snapshot_observed_at":"2026-08-03T21:39:56.998797Z","submitted_at":"2026-05-07T18:45:46Z","title":"Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-12T02:23:55.323250Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.06840"},"observation_digest":"sha256:a7a54534b8c8846f60c2e6f23d9752566b019ea92847940188f2d699250aa5dd","observation_id":"c95700f6-a9b2-49b8-85eb-493617f8bfba","resolution":{"observed_at":"2026-05-12T07:41:28.948464Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.06840","last_updated":"2026-05-22T00:29:09Z","snapshot_observed_at":"2026-08-03T21:39:56.998797Z","submitted_at":"2026-05-07T18:45:46Z","title":"Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-13T06:21:00.353334Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.06840"},"observation_digest":"sha256:e9bd08bc0d43f083c9b94ce0f5bfb8c42255f0c7577ee7f226968a7c510ebff6","observation_id":"7ab984f0-f1e6-4333-acb9-4b6878229743","resolution":{"observed_at":"2026-05-13T06:22:23.228104Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.06840","last_updated":"2026-05-22T00:29:09Z","snapshot_observed_at":"2026-08-03T21:39:56.998797Z","submitted_at":"2026-05-07T18:45:46Z","title":"Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-14T20:55:31.770238Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.06840"},"observation_digest":"sha256:9d74f89ad7eb19d85f65a955383dc001f772f5da89367b08e1cce0bd15afdf53","observation_id":"5601bec8-e68c-416d-b120-a838a4e08a28","resolution":{"observed_at":"2026-05-14T20:59:27.870006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.06840","last_updated":"2026-05-22T00:29:09Z","snapshot_observed_at":"2026-08-03T21:39:56.998797Z","submitted_at":"2026-05-07T18:45:46Z","title":"Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T05:57:58.487109Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.06840"},"observation_digest":"sha256:0aafaa6fccd3a3d9b54848c285f3de4bf477891118e7776bc073826698db6f75","observation_id":"6df33421-7414-49b6-8150-3244562b809d","resolution":{"observed_at":"2026-05-25T06:00:23.421754Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.08478","last_updated":"2026-05-08T20:53:51Z","snapshot_observed_at":"2026-07-06T23:20:43.010758Z","submitted_at":"2026-05-08T20:53:51Z","title":"When Independent Sampling Outperforms Agentic Reasoning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-12T02:46:48.375901Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.08478"},"observation_digest":"sha256:15d724f905e5f90d9fa64c05508c4120339251d3660ce308d0c7a79167250975","observation_id":"7b190f90-bf69-4a8a-91df-a642921648e1","resolution":{"observed_at":"2026-05-12T07:31:24.683235Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.09217","last_updated":"2026-05-09T23:28:22Z","snapshot_observed_at":"2026-08-06T02:11:01.231228Z","submitted_at":"2026-05-09T23:28:22Z","title":"Learning the Preferences of a Learning Agent","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-12T03:36:27.719658Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.09217"},"observation_digest":"sha256:5ea7bf0c178600616de25dea450296769f20fafe950e52070b65ae62b3de9cb5","observation_id":"0118417a-3e73-45eb-8df0-1e64e5ab5822","resolution":{"observed_at":"2026-05-12T07:11:27.177045Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.13050","last_updated":"2026-05-14T12:47:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-13T06:15:32Z","title":"Context Training with Active Information Seeking","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-14T20:03:01.429424Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.13050"},"observation_digest":"sha256:4a94ca3d9889e215303f907ab84aecbd1e787d16999f7a3dfef07fa7aa4eb0c5","observation_id":"d48282b5-0eb8-49e8-8d7f-4755749229b6","resolution":{"observed_at":"2026-05-14T20:07:53.321483Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.13050","last_updated":"2026-05-14T12:47:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-13T06:15:32Z","title":"Context Training with Active Information Seeking","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-15T06:07:10.805180Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.13050"},"observation_digest":"sha256:32e34d6045bbb68c2405c696ff3b4e0029d2c10efba2fdcb269077830088582e","observation_id":"be960553-289a-4598-92a1-2c0b586d0d77","resolution":{"observed_at":"2026-05-15T06:09:48.392107Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.22211","last_updated":"2026-05-21T09:16:27Z","snapshot_observed_at":"2026-07-06T23:32:35.159280Z","submitted_at":"2026-05-21T09:16:27Z","title":"CLORE: Content-Level Optimization for Reasoning Efficiency","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T05:50:23.111591Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.22211"},"observation_digest":"sha256:17de7ddc65b95b5f088fe738990b81da823f33ea60ff009e01fb38b2c8ed9e24","observation_id":"6a483081-dd8a-49a2-8f83-3101c90ede19","resolution":{"observed_at":"2026-05-22T05:51:08.235559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.23945","last_updated":"2026-05-03T05:53:32Z","snapshot_observed_at":"2026-08-08T23:27:34.267121Z","submitted_at":"2026-05-03T05:53:32Z","title":"Accelerating Long-Tail Generation in Synchronous RLHF Training via Adaptive Tensor Parallelism","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-01T00:54:27.551174Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.23945"},"observation_digest":"sha256:6d15141ab1dfcdb83707882375de2b458cc4d8747bbf1a1a6cac8cf603384c25","observation_id":"49849608-d296-447f-ac75-2bbd12723399","resolution":{"observed_at":"2026-07-01T00:55:11.581169Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.24693","last_updated":"2026-05-23T18:13:41Z","snapshot_observed_at":"2026-08-03T16:34:39.940462Z","submitted_at":"2026-05-23T18:13:41Z","title":"CP-Agent: A Calibrated Risk-Controlled Agent for Feedback-Driven Competitive Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T13:19:22.541146Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.24693"},"observation_digest":"sha256:1e09c73b4580a4846f032f775ccf9b103b0addf250797729a3929accc6f557ed","observation_id":"7a4b89a5-b275-44fc-923d-6e271ba83dc1","resolution":{"observed_at":"2026-06-30T13:24:40.186769Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2605.28713","last_updated":"2026-05-27T16:36:01Z","snapshot_observed_at":"2026-08-04T05:13:09.102189Z","submitted_at":"2026-05-27T16:36:01Z","title":"Thinking as Compression: Your Reasoning Model is Secretly a Context Compressor","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T12:10:13.843464Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2605.28713"},"observation_digest":"sha256:eea0a535a436379b50dfa0cb3c3c80104125912c404a4dc51e47d61923f5dd95","observation_id":"02da19c4-1998-4137-9021-c492079c7c48","resolution":{"observed_at":"2026-06-29T12:13:26.705538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2606.02218","last_updated":"2026-06-01T13:20:00Z","snapshot_observed_at":"2026-08-09T09:45:26.382031Z","submitted_at":"2026-06-01T13:20:00Z","title":"Faster Synchronous On-Policy RL via Straggler-Aware Group Sizing","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T15:40:55.535914Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2606.02218"},"observation_digest":"sha256:82ed1242d3e6a85d44b32b7dc1860a38d1e6b72fdc36501201ae526cea10cdfd","observation_id":"7ae2de51-3686-4e24-8f72-b0c0ed2da0dc","resolution":{"observed_at":"2026-07-01T22:06:17.117726Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2606.11445","last_updated":"2026-06-09T20:56:23Z","snapshot_observed_at":"2026-08-07T19:33:11.551966Z","submitted_at":"2026-06-09T20:56:23Z","title":"Forecasting Future Behavior as a Learning Task","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-27T12:55:39.494339Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2606.11445"},"observation_digest":"sha256:d4307c020ad85b0e97e41feae7f95f8cbd6b21809feafcf14034d330b6a7d18b","observation_id":"1ebfc060-6a08-4c26-be2e-e5e230a6a45a","resolution":{"observed_at":"2026-07-03T06:07:41.314682Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":"2502.06807","doi":"10.48550/arxiv.2502.06807","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive programming with large reasoning models","venue":"ArXiv.org","work_id":"872d4377-f88a-4ea0-9f62-88c513266130","year":2025},"citing_paper":{"arxiv_id":"2606.11470","last_updated":"2026-06-09T21:59:37Z","snapshot_observed_at":"2026-07-06T23:50:35.052764Z","submitted_at":"2026-06-09T21:59:37Z","title":"The Periodic Table of LLM Reasoning: A Structured Survey of Reasoning Paradigms, Methods, and Failure Modes","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-27T12:59:51.091008Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2606.11470"},"observation_digest":"sha256:e4e28d480b9aa3a19e56c8d13fb7773850fd8624f5ff827182ec92a22fdbc70a","observation_id":"00784dc8-6369-48fc-882c-740006e155e1","resolution":{"observed_at":"2026-07-03T05:57:41.619032Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-01T21:31:04.320966Z","title":"arXiv preprint arXiv:2502.06807 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16072","last_updated":"2026-07-17T15:56:52Z","snapshot_observed_at":"2026-08-05T22:03:26.987913Z","submitted_at":"2026-07-17T15:56:52Z","title":"Frontier Language Models Struggle to Copy: Text Can Be Better Viewed in 2D","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T21:31:04.320966Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2607.16072"},"observation_digest":"sha256:6ace13bf5d0d11ed560f9760ab4256689bd50d3b2ed4857ba54b0fa147f7df56","observation_id":"c2b7e743-30e6-4245-a79f-bf349fa2d55a","resolution":{"observed_at":"2026-08-01T21:31:04.320966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-01T13:15:35.096517Z","title":"Competitive programming with large reasoning models.arXiv preprint arXiv:2502.06807,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19181","last_updated":"2026-07-21T15:15:56Z","snapshot_observed_at":"2026-08-07T22:32:59.398321Z","submitted_at":"2026-07-21T15:15:56Z","title":"Reasoning Before Translation: Enhancing Legal Machine Translation with Structured Reasoning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T13:15:35.096517Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2607.19181"},"observation_digest":"sha256:339af6aaa3863be0e2981649a1cbd91a4fbfddf01590b97a33db90b7f8f563fa","observation_id":"be6c5d64-b6d8-46ea-bacc-ca2be6be9ebb","resolution":{"observed_at":"2026-08-01T13:15:35.096517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-07-31T23:50:09.732467Z","title":"Competitive programming with large reasoning models.arXiv preprint arXiv:2502.06807,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23332","last_updated":"2026-07-31T16:23:16Z","snapshot_observed_at":"2026-08-08T00:58:17.007941Z","submitted_at":"2026-07-25T19:05:29Z","title":"AllocBench: Measuring Online Tool Allocation Capability in LLM Agents","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T23:50:09.732467Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2607.23332"},"observation_digest":"sha256:81a0c48a3bba2337a4b73cc01ab70760acb7ca8dfacc944575607df3b5b28040","observation_id":"1344f62d-0cf6-42bc-b9b2-75b65492cdec","resolution":{"observed_at":"2026-07-31T23:50:09.732467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-08-03T01:53:20.374589Z","title":"Competitive programming with large reasoning models.arXiv preprint arXiv:2502.06807,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23332","last_updated":"2026-07-31T16:23:16Z","snapshot_observed_at":"2026-08-08T00:58:17.007941Z","submitted_at":"2026-07-25T19:05:29Z","title":"AllocBench: Measuring Online Tool Allocation Capability in LLM Agents","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T01:53:20.374589Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2607.23332"},"observation_digest":"sha256:68838696b1bbd898e986ac52e23dfd6fac526547129a270a8f75b9f6194dc40c","observation_id":"83dbb220-241f-4523-8687-8c4cefa42f49","resolution":{"observed_at":"2026-08-03T01:53:20.374589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06807","snapshot_observed_at":"2026-07-30T22:49:43.453537Z","title":"arXiv preprint arXiv:2502.06807 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23420","last_updated":"2026-07-26T02:35:47Z","snapshot_observed_at":"2026-08-09T02:00:49.295859Z","submitted_at":"2026-07-26T02:35:47Z","title":"LA-RL: Label-Aware Self-Reflection for Reinforcement Learning in Information Extraction","version":1},"reference_index":162,"source":"arxiv_source","source_observed_at":"2026-07-30T22:49:43.453537Z"},"links":{"cited_paper":"/paper/2502.06807","citing_paper":"/paper/2607.23420"},"observation_digest":"sha256:9387287bb258a8a72e1539694d1f42631ec51d6db9363393d6925609a201ef35","observation_id":"167cbab3-394e-48cc-9ff8-7cc52e595a52","resolution":{"observed_at":"2026-07-30T22:49:43.453537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06807/citation-record","integrity":"/paper/2502.06807/integrity","json":"/paper/2502.06807/citation-record.json","paper":"/paper/2502.06807"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-09T14:13:58.044473Z","title":"Program synthesis with large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.044473Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:9a7aecb34da752a81c439dedf66ef43946e5fee9e3313ab8b2dc10302acfc9ac","observation_id":"c11d5183-0d47-4152-8367-f7dc911cc37d","resolution":{"observed_at":"2026-08-09T14:13:58.044473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-09T14:13:58.050456Z","title":"Evaluating large language models trained on code","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.050456Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:1eaa695c1f994f701d359658ce96da8af61ad4f4106c018bb9029a2325aaef8f","observation_id":"02b60c1d-aa64-432b-af12-02be784f2e2e","resolution":{"observed_at":"2026-08-09T14:13:58.050456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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-09T14:13:58.054942Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.054942Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:f43a45b6c2fb88596a866431cb09628c72443709d2ba93787908aa66171ecc55","observation_id":"9ba1c1e9-7386-4018-a7f2-c580af35d9eb","resolution":{"observed_at":"2026-08-09T14:13:58.054942Z","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-07-06T02:11:23.670680Z","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-09T14:13:58.059700Z","title":"Openai o1 system card","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.059700Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:eb27121cb4523371df2fa66601b694b768130ed9426c2c964f2c7138aabe21ab","observation_id":"fb6c4f2f-8c49-4267-bbec-dae8ad7a3efa","resolution":{"observed_at":"2026-08-09T14:13:58.059700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06770","last_updated":"2024-11-11T23:05:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T16:47:29Z","title":"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06770","snapshot_observed_at":"2026-08-09T14:13:58.063874Z","title":"Swe-bench: Can language models resolve real-world github issues? arXiv preprint arXiv:2310.06770, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.063874Z"},"links":{"cited_paper":"/paper/2310.06770","citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:61f538abcf7c0aeeaa478c664061cbf8582d8eba5e4ad0d39ceb05d2324b60de","observation_id":"9dce5394-ceaa-4b2c-9ba6-b789d6e8a6a3","resolution":{"observed_at":"2026-08-09T14:13:58.063874Z","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-09T14:13:58.264691Z","title":"Alphacode 2 technical report","venue":null,"work_id":"e1701e2b-5130-4696-833d-3ceb5fcb2f4e","year":2023},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.067865Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:737a34b3047fc1b0f76becf946ccce35597100eba523844af5377c5a5fe73631","observation_id":"85a483d2-4a6f-4fc8-9dd9-4bc6d135598a","resolution":{"observed_at":"2026-08-09T14:13:58.268617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T14:13:58.071701Z","title":"Competition-level code generation with alphacode","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.071701Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:52a7c9fa49403eed309df83baf0faf6645c1d14d5ee8bb6d713b0b18dfffbcc1","observation_id":"0ab2d4ca-9ce1-455a-b7e1-0b94c056c5ca","resolution":{"observed_at":"2026-08-09T14:13:58.071701Z","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-09T14:13:58.248540Z","title":"Codeforces rating system","venue":null,"work_id":"4b5e92c3-0736-4afa-9a15-748d0986df2e","year":2010},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.075128Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:36b72588dc3e4a0f5f08767d17f7e66a261db8e6e743cb702de340902719382a","observation_id":"d8233e2b-b075-4581-8f2a-2a29fa80395a","resolution":{"observed_at":"2026-08-09T14:13:58.251894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T14:13:58.238602Z","title":"Open codeforces rating system","venue":null,"work_id":"f41607ee-13b2-4b36-9b8c-d83035d2e291","year":2016},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.078750Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:dc8ae9a286fc6d6fe6272a5a46c96e5585478107a2e4f0d93c28576c84b8ee2d","observation_id":"8f121f04-d765-4526-bf46-058693150abe","resolution":{"observed_at":"2026-08-09T14:13:58.242075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T14:13:58.228994Z","title":"Codeforces: Soon we will change the rating calculation for new accounts","venue":null,"work_id":"15da5406-13ee-4ecf-890a-4b1513229aeb","year":2020},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.082211Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:3e8989a739e5ae12e33b78b30344746dd5bd23b2aa381f5a192d217187780113","observation_id":"509d0c2a-3ee9-4fbe-bd0d-e84f72e2f747","resolution":{"observed_at":"2026-08-09T14:13:58.232356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T14:13:58.218697Z","title":"Introducing swe-bench verified","venue":null,"work_id":"2a7c5ee8-eb19-42b1-93ad-da1e0233b6ff","year":2024},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.086340Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:162648f1e68ac113f93ea8a39d7525ae90e18008b6c184560cd892c079a1261f","observation_id":"ad1925d7-1b2d-4d34-b87b-710e1fc4e063","resolution":{"observed_at":"2026-08-09T14:13:58.222622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T14:13:58.209019Z","title":"Learning to reason with llms","venue":null,"work_id":"f4a77b49-0fad-49d3-b68c-65bafe650b08","year":2024},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.089809Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:2a06e8e52247ae84005d114330ce788abfa6de5a97ab4f18e968e57b176aa602","observation_id":"42f95214-5382-4fff-9b7c-73ebf2cd7771","resolution":{"observed_at":"2026-08-09T14:13:58.212421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T14:13:58.092892Z","title":"Openai o3 system card","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.092892Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:46febdd1dd326c8c37ffef15c041b5bcff1ba4386ee01f7a8c73bed95b9b9e75","observation_id":"a785e40a-e8bd-4ca9-8a0a-36c60625fdfd","resolution":{"observed_at":"2026-08-09T14:13:58.092892Z","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-09T14:13:58.095963Z","title":"Toolformer: Language models can teach themselves to use tools","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.095963Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:5ee6d96f8b15681564e47b9d44b528316467ae1035ff4ddd77c0156573aa99fb","observation_id":"c9852893-459d-4df2-871f-2766bdf7a506","resolution":{"observed_at":"2026-08-09T14:13:58.095963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-09T14:13:58.099088Z","title":"Kimi k1.5: Scaling reinforcement learning with llms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.099088Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:12e8d2dae1744c851864b90e63f315aef820fb7071424fd65e0e2f984a0f1649","observation_id":"3ba5ee28-644b-4316-88ff-fa1301e022dd","resolution":{"observed_at":"2026-08-09T14:13:58.099088Z","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-09T14:13:58.184455Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":"de8862c6-e101-4e08-a96f-33f905fc96e9","year":2022},"citing_paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T14:13:58.102702Z"},"links":{"citing_paper":"/paper/2502.06807"},"observation_digest":"sha256:199679b5bf6be31595aa25539d1851586208f0fb6aacac6f7c25a09c441ded92","observation_id":"f47cc8b0-d0c0-4a43-9d77-2f3f5a72360c","resolution":{"observed_at":"2026-08-09T14:13:58.190162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.06807","last_updated":"2025-02-18T22:21:40Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T14:06:29.234036Z","submitted_at":"2025-02-03T23:00:15Z","title":"Competitive Programming with Large Reasoning Models"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":16},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 58 inbound Pith citation observations for arXiv:2502.06807."}