{"as_of":"2026-08-07T15:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8e2aa5abf71f7dbb738d9f09cbd4f67ecf3aa857d158e7d4d9119e82a32de28","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T06:35:27.813995Z","state":"measured"},{"denominator":141,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":141,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4957,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:23:19.984558Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-11T03:27:46.490459Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2410.17355","last_updated":"2025-11-10T14:01:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-22T18:47:46Z","title":"All Entities are Not Created Equal: Examining the Long Tail for Ultra-Fine Entity Typing","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T18:56:47.259611Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2410.17355"},"observation_digest":"sha256:0c1eb13247e6a9969de690c94f67fc83b391fd7e404a88c6e09d0459545866a5","observation_id":"8319f46b-0bbf-466a-9493-743fffbad962","resolution":{"observed_at":"2026-05-23T18:58:20.052263Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2503.05066","last_updated":"2026-05-11T07:44:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-07T01:11:39Z","title":"Capacity-Aware Inference: Mitigating the Straggler Effect in Mixture of Experts","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T00:41:06.928901Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2503.05066"},"observation_digest":"sha256:1a366bcbe1a9853f2d3aa84e2da36c64c27cc953b7756473aa40bc71ae400ff4","observation_id":"e9c6e7e1-1fb8-44de-927e-3e710060b353","resolution":{"observed_at":"2026-05-23T00:42:18.957608Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2503.09158","last_updated":"2026-05-09T06:28:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-12T08:33:46Z","title":"FaVChat: Hierarchical Prompt-Query Guided Facial Video Understanding with Data-Efficient GRPO","version":6},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T00:21:51.621582Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2503.09158"},"observation_digest":"sha256:a408e7c328ac69451045f89c455172012dea1ba5d32b30e2292d770b1cd521d4","observation_id":"f2854fe9-85b8-4649-bfe8-acefb36cb00d","resolution":{"observed_at":"2026-05-23T00:22:18.757044Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2503.16072","last_updated":"2026-05-11T16:55:53Z","snapshot_observed_at":"2026-08-07T09:47:53.648880Z","submitted_at":"2025-03-20T12:09:01Z","title":"Toxicity Detection Should Measure Contextual Harm, Not Text-Intrinsic Badness","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T23:29:50.412674Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2503.16072"},"observation_digest":"sha256:b6d0276bbf39b8c92e8a3bc0ba9303e7a86a072c8a82663d2ff2e448b47b7c93","observation_id":"55feb9c4-2065-4363-a247-4dbf5a66dc72","resolution":{"observed_at":"2026-05-22T23:32:15.539809Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2504.01919","last_updated":"2026-01-12T12:46:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-02T17:26:40Z","title":"Bridging the Linguistic Divide: A Survey on Leveraging Large Language Models for Machine Translation","version":4},"reference_index":148,"source":"pdf_text","source_observed_at":"2026-05-22T21:38:29.497183Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2504.01919"},"observation_digest":"sha256:5d60a0ad9af4f9d670cf48acdc16c7854005a8adfbb5f642636fb3b841e61961","observation_id":"e0e706be-368f-4662-880f-3e0621feec6d","resolution":{"observed_at":"2026-05-22T21:42:11.333098Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2504.09775","last_updated":"2026-04-20T20:54:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-14T00:29:49Z","title":"MIST: A Co-Design Framework for Heterogeneous, Multi-Stage LLM Inference","version":6},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-22T21:16:31.655330Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2504.09775"},"observation_digest":"sha256:efe1bfdc1fff16f76e0f72ad30db3b5b5a80c52103eb083008e5819ea902ccd3","observation_id":"2f26588c-a1cd-44ef-8479-20a9b9b7e2ba","resolution":{"observed_at":"2026-05-22T21:17:07.975697Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2504.12501","last_updated":"2026-08-03T01:47:58Z","snapshot_observed_at":"2026-08-06T23:23:17.390247Z","submitted_at":"2025-04-16T21:36:46Z","title":"Reinforcement Learning from Human Feedback","version":9},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-22T19:27:40.991325Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2504.12501"},"observation_digest":"sha256:d11cc8be66fc6c7fa989307b5fe41519fd4d7a3dc82c05a2c193001705e6d24c","observation_id":"c33cc80c-6454-42b1-9d56-de143a8c6692","resolution":{"observed_at":"2026-05-22T19:32:01.422505Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2504.21015","last_updated":"2026-05-10T18:30:41Z","snapshot_observed_at":"2026-07-30T05:05:56.009708Z","submitted_at":"2025-04-20T08:34:10Z","title":"Don't Retrieve, Generate: Prompting LLMs for Synthetic Training Data in Dense Retrieval","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T19:35:02.029358Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2504.21015"},"observation_digest":"sha256:da9220fd319c96221fc7f7fa587083bf4c990a8471963199d062d6ae6dedf69f","observation_id":"4487c6a5-4841-4339-9e47-39ba1ebc1205","resolution":{"observed_at":"2026-05-22T19:35:03.940894Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2504.21751","last_updated":"2026-04-15T06:14:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-30T15:45:28Z","title":"CodeFlowBench: A Multi-turn, Iterative Benchmark for Complex Code Generation","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T17:42:12.022129Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2504.21751"},"observation_digest":"sha256:879ae814aa1377a344db57c648a6dbc5bdb003f2b464038ced8e6ab500bfb15c","observation_id":"8ed6b9e0-4c4b-41e3-bb69-42a68fd963dd","resolution":{"observed_at":"2026-05-22T17:45:00.484888Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.10978","last_updated":"2025-10-28T15:11:36Z","snapshot_observed_at":"2026-07-29T19:20:21.974239Z","submitted_at":"2025-05-16T08:26:59Z","title":"Group-in-Group Policy Optimization for LLM Agent Training","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-11T09:15:08.193357Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.10978"},"observation_digest":"sha256:4612b3c50b6da6cf92d0416e65c18ce04c4c1e3bf605dd69c0198e72c994736e","observation_id":"67701bec-0050-4e8a-8da0-1944ca6cce82","resolution":{"observed_at":"2026-05-11T09:15:08.708355Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.14174","last_updated":"2026-04-28T11:36:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-20T10:28:46Z","title":"Cheaper, Better, Faster, Stronger: Robust Text-to-SQL without Chain-of-Thought or Fine-Tuning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T13:49:21.132896Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.14174"},"observation_digest":"sha256:8b6a808696b941f32ea723347ab08b6cc9200794c850c665c50f06b93efe5143","observation_id":"cba1ece6-0bab-4e92-8dda-64b69ff7450f","resolution":{"observed_at":"2026-05-22T13:51:37.468231Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.14990","last_updated":"2026-04-23T19:31:56Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T00:31:13Z","title":"Language Specific Knowledge: Do Models Know Better in X than in English?","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-22T14:48:29.590965Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.14990"},"observation_digest":"sha256:297da6fcb98be93cc53ab73f3f2d12ded2ca601273f57d9bdb96ac20ac389795","observation_id":"96642d0c-7687-45bd-8e64-c79ac18355c5","resolution":{"observed_at":"2026-05-22T14:51:42.722073Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.15134","last_updated":"2025-05-21T05:39:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T05:39:11Z","title":"The Unreasonable Effectiveness of Entropy Minimization in LLM Reasoning","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-05-18T15:58:33.219451Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.15134"},"observation_digest":"sha256:dba3819baccd62b59db0a860f56f1a8aa468516ae4421000fa1cea038b456def","observation_id":"377164f0-b7b0-4839-96c2-78414a780096","resolution":{"observed_at":"2026-05-18T15:58:33.570832Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T15:23:19.984558Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15297","last_updated":"2025-05-21T09:27:18Z","snapshot_observed_at":"2026-08-07T15:18:19.208679Z","submitted_at":"2025-05-21T09:27:18Z","title":"Chinese Toxic Language Mitigation via Sentiment Polarity Consistent Rewrites","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:23:19.984558Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.15297"},"observation_digest":"sha256:d01f725e0bfbfd8fde07ca1e68543644c903607d70a052ab8d4ac2cfe4af1607","observation_id":"83e688b0-677a-4539-91be-d237a20b3e97","resolution":{"observed_at":"2026-08-07T15:23:19.984558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T15:22:57.080672Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15316","last_updated":"2025-05-21T09:46:19Z","snapshot_observed_at":"2026-08-07T15:18:00.313098Z","submitted_at":"2025-05-21T09:46:19Z","title":"Emotional Supporters often Use Multiple Strategies in a Single Turn","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:22:57.080672Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.15316"},"observation_digest":"sha256:c05c77a17534bca7726dc6a3fc939e7f4a6874ed8b51ab46ce75f9df7403645f","observation_id":"2fb173e3-2e4e-442e-a78d-48357f5f9212","resolution":{"observed_at":"2026-08-07T15:22:57.080672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.15436","last_updated":"2025-12-05T05:44:39Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T12:18:15Z","title":"Adaptive Chain-of-Focus Reasoning via Dynamic Visual Search and Zooming for Efficient VLMs","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-17T05:35:13.118221Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.15436"},"observation_digest":"sha256:38cdc17fab124b7b14332d672b7b01faf6d48afe2517d41c3e3fe5c7f1b3fcb6","observation_id":"ba1e132d-d06f-4b17-8456-1664773c3d4c","resolution":{"observed_at":"2026-05-17T05:35:13.224191Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T15:14:55.448093Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15929","last_updated":"2025-05-29T17:59:14Z","snapshot_observed_at":"2026-08-07T15:08:06.803620Z","submitted_at":"2025-05-21T18:33:50Z","title":"PhyX: Does Your Model Have the \"Wits\" for Physical Reasoning?","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:14:55.448093Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.15929"},"observation_digest":"sha256:7c31268205951d2041ac04525bc379fc9dc6e67e42344b55752dfe5d64510c97","observation_id":"d9526ef2-9bd6-4d9e-82b5-dec58b7863f2","resolution":{"observed_at":"2026-08-07T15:14:55.448093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T15:03:46.912496Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16514","last_updated":"2025-05-25T11:30:02Z","snapshot_observed_at":"2026-08-07T14:57:23.988580Z","submitted_at":"2025-05-22T10:50:33Z","title":"AppealCase: A Dataset and Benchmark for Civil Case Appeal Scenarios","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:03:46.912496Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.16514"},"observation_digest":"sha256:6a1daf1c5c7feb470d59bac5ac8ee576c950deb3ec2bcd18b8150049a300de18","observation_id":"d8395d31-a7f2-4fa0-8cde-0bc421853631","resolution":{"observed_at":"2026-08-07T15:03:46.912496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:54:54.359523Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16886","last_updated":"2025-05-22T16:41:37Z","snapshot_observed_at":"2026-08-07T14:51:20.705061Z","submitted_at":"2025-05-22T16:41:37Z","title":"Don't \"Overthink\" Passage Reranking: Is Reasoning Truly Necessary?","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T14:54:54.359523Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.16886"},"observation_digest":"sha256:e8851d0a3d9e14b28630214a974e4f7e212e7d9c93ba927e55a631b897675005","observation_id":"fd52e6cc-8252-4d78-aac0-70b14f01c4ab","resolution":{"observed_at":"2026-08-07T14:54:54.359523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.16968","last_updated":"2026-04-21T00:48:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-22T17:48:53Z","title":"CASS: Nvidia to AMD Transpilation with Data, Models, and Benchmark","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T01:29:16.468047Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.16968"},"observation_digest":"sha256:92155cf7372c625890b3e1d9d21230034b27bdeae942332621edb95edf3fe585","observation_id":"252ebfe6-4a05-4541-b586-00d36e9b8604","resolution":{"observed_at":"2026-05-22T01:30:53.403363Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:52:15.256734Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17296","last_updated":"2025-05-22T21:23:20Z","snapshot_observed_at":"2026-08-07T14:47:09.821079Z","submitted_at":"2025-05-22T21:23:20Z","title":"SELF: Self-Extend the Context Length With Logistic Growth Function","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T14:52:15.256734Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.17296"},"observation_digest":"sha256:67eccab25d32b778a700ed4faaf1e5d141cc6a65437d6a126e5ae910a56efdbf","observation_id":"844caad3-2dfa-48bd-bf34-fd79399617b0","resolution":{"observed_at":"2026-08-07T14:52:15.256734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:53:19.287940Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17391","last_updated":"2025-05-23T02:01:15Z","snapshot_observed_at":"2026-08-07T14:45:46.054518Z","submitted_at":"2025-05-23T02:01:15Z","title":"Curriculum Guided Reinforcement Learning for Efficient Multi Hop Retrieval Augmented Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:53:19.287940Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.17391"},"observation_digest":"sha256:5f9486d96f68e869eaff11eea1c02b949ed489128ae3c03e0f17a97d0c6dd9da","observation_id":"fc66a19d-d994-4fd1-a13a-76c91ce23c71","resolution":{"observed_at":"2026-08-07T14:53:19.287940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:51:52.969311Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17420","last_updated":"2025-05-23T03:10:11Z","snapshot_observed_at":"2026-08-07T14:45:14.101738Z","submitted_at":"2025-05-23T03:10:11Z","title":"DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policies","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T14:51:52.969311Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.17420"},"observation_digest":"sha256:a8eb02006d99e41f34871d82ff3ac23cb878cf7e1bbc73b2fb0bb997f41f5fd8","observation_id":"4e3742c7-26a1-4820-beaa-8c220cde2144","resolution":{"observed_at":"2026-08-07T14:51:52.969311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:46:15.763798Z","title":"Qwen3 Technical Report.arXiv e-prints, page arXiv:2505.09388, May 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17697","last_updated":"2025-05-23T10:07:18Z","snapshot_observed_at":"2026-08-07T14:40:00.899837Z","submitted_at":"2025-05-23T10:07:18Z","title":"Activation Control for Efficiently Eliciting Long Chain-of-thought Ability of Language Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:46:15.763798Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.17697"},"observation_digest":"sha256:591de1ca711885f048f0dd40cec3cbcf03e8aad4bee52c400ba2cb80e3a14596","observation_id":"74687a73-7780-467c-b8bb-ba7342c4fe3d","resolution":{"observed_at":"2026-08-07T14:46:15.763798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:45:19.631357Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17829","last_updated":"2025-05-23T12:42:50Z","snapshot_observed_at":"2026-08-07T14:37:44.536944Z","submitted_at":"2025-05-23T12:42:50Z","title":"Stepwise Reasoning Checkpoint Analysis: A Test Time Scaling Method to Enhance LLMs' Reasoning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T14:45:19.631357Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.17829"},"observation_digest":"sha256:f9d4a0102d80c6ede53a87cfbedab7f21e83056eba972f9370d57e7a6b90888b","observation_id":"0aee6a39-b94b-4531-8ad2-82b8a53dfab7","resolution":{"observed_at":"2026-08-07T14:45:19.631357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:38:43.173424Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18086","last_updated":"2025-05-23T16:43:03Z","snapshot_observed_at":"2026-08-07T14:33:24.324919Z","submitted_at":"2025-05-23T16:43:03Z","title":"Stable Reinforcement Learning for Efficient Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:38:43.173424Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.18086"},"observation_digest":"sha256:be59c277277b36ff9b6d7454f6e1d0c2d474328824dccb179ce1c324ac1544d9","observation_id":"ecb8034f-13b8-4298-b5b8-19ee820e5f47","resolution":{"observed_at":"2026-08-07T14:38:43.173424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:40:42.616883Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18149","last_updated":"2025-05-23T17:57:43Z","snapshot_observed_at":"2026-08-07T14:32:34.233639Z","submitted_at":"2025-05-23T17:57:43Z","title":"First Finish Search: Efficient Test-Time Scaling in Large Language Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:42.616883Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.18149"},"observation_digest":"sha256:fed0217c82c621e55ed60e5c2f3fe5f09f8422be4408fa9fcef61cb0aa794e1f","observation_id":"c2ef4477-229f-4c36-a4d9-fa1df9c27b32","resolution":{"observed_at":"2026-08-07T14:40:42.616883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:29:51.369166Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18744","last_updated":"2025-09-09T12:30:23Z","snapshot_observed_at":"2026-08-07T14:24:26.604894Z","submitted_at":"2025-05-24T15:23:43Z","title":"LogicCat: A Chain-of-Thought Text-to-SQL Benchmark for Complex Reasoning","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T14:29:51.369166Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.18744"},"observation_digest":"sha256:df76e0e3837837598917d600805c657cf37fb06c7855c9e3a29eafc0df1e525b","observation_id":"ed80fa01-0d62-4856-95b2-1de71de064cb","resolution":{"observed_at":"2026-08-07T14:29:51.369166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:26:09.761891Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19116","last_updated":"2025-07-20T08:57:14Z","snapshot_observed_at":"2026-08-07T14:17:54.864914Z","submitted_at":"2025-05-25T12:15:31Z","title":"Controlling Language Confusion in Multilingual LLMs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T14:26:09.761891Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.19116"},"observation_digest":"sha256:dd985c18c428c8b61262ae8d6034c2a2173bbee4b6a59e8ca6b0683f07676263","observation_id":"c6333f03-b5c1-49c0-83a6-baae930bbdb3","resolution":{"observed_at":"2026-08-07T14:26:09.761891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:21:41.859821Z","title":"Qwen3 Technical Report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19259","last_updated":"2025-05-28T02:16:52Z","snapshot_observed_at":"2026-08-07T14:15:48.105845Z","submitted_at":"2025-05-25T18:28:12Z","title":"Towards Large Reasoning Models for Agriculture","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:21:41.859821Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.19259"},"observation_digest":"sha256:f0d729f38c11ac9ee1e88af99901661071637231d40cc8cd499158b101c88cb7","observation_id":"22639d26-a1d1-48be-bcef-574e3fe14809","resolution":{"observed_at":"2026-08-07T14:21:41.859821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:08:19.359420Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19954","last_updated":"2025-05-26T13:18:32Z","snapshot_observed_at":"2026-08-07T14:00:36.143102Z","submitted_at":"2025-05-26T13:18:32Z","title":"An Explainable Diagnostic Framework for Neurodegenerative Dementias via Reinforcement-Optimized LLM Reasoning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:08:19.359420Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.19954"},"observation_digest":"sha256:47de01fc349396be6435be31e9fa52168e8dbd79f8480a8e59e030c3548c7e86","observation_id":"df01f433-ca0f-423e-8e65-c182ce9d9cb8","resolution":{"observed_at":"2026-08-07T14:08:19.359420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:07:15.031918Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20046","last_updated":"2025-05-26T14:31:48Z","snapshot_observed_at":"2026-08-07T13:58:14.039207Z","submitted_at":"2025-05-26T14:31:48Z","title":"REARANK: Reasoning Re-ranking Agent via Reinforcement Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T14:07:15.031918Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.20046"},"observation_digest":"sha256:4ef734c58276473fd8f0fd674d93338ee355a06a21ce0b6d353902654013cb64","observation_id":"47b725ec-579a-41bf-9a7f-93cddda09935","resolution":{"observed_at":"2026-08-07T14:07:15.031918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:03:50.110955Z","title":"Edward Yeo, Yuxuan Tong, Morry Niu, Graham Neubig, and Xiang Yue","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20101","last_updated":"2025-05-27T12:54:28Z","snapshot_observed_at":"2026-08-07T13:56:49.886936Z","submitted_at":"2025-05-26T15:08:51Z","title":"Adaptive Deep Reasoning: Triggering Deep Thinking When Needed","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:03:50.110955Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.20101"},"observation_digest":"sha256:50f84dfa38a998c32f1dbc5c26da670ae7166fa19c4b839e768fed5e1a9d5031","observation_id":"5adbaeaa-d4ad-420e-92ed-3ccbc521e8e8","resolution":{"observed_at":"2026-08-07T14:03:50.110955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T14:03:49.879388Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20155","last_updated":"2025-05-26T15:57:08Z","snapshot_observed_at":"2026-08-07T13:55:42.166326Z","submitted_at":"2025-05-26T15:57:08Z","title":"Pangu Light: Weight Re-Initialization for Pruning and Accelerating LLMs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:03:49.879388Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.20155"},"observation_digest":"sha256:13250032614a8f0200fbf99a52683af99d8c4b3d768b049cd0f893876b245b0d","observation_id":"5af5bdcb-e5ad-485c-a00b-53792290b617","resolution":{"observed_at":"2026-08-07T14:03:49.879388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T13:52:47.441675Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20644","last_updated":"2025-05-27T02:45:14Z","snapshot_observed_at":"2026-08-07T13:47:38.739847Z","submitted_at":"2025-05-27T02:45:14Z","title":"HCQA-1.5 @ Ego4D EgoSchema Challenge 2025","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:52:47.441675Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.20644"},"observation_digest":"sha256:a5d0193637c33165f0c1ce4fb8f8b5398d88330ebe8f019b7df7b667711ae7b2","observation_id":"8946bc22-2d2f-4797-9ed1-0c636a65981e","resolution":{"observed_at":"2026-08-07T13:52:47.441675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.20650","last_updated":"2026-05-17T16:54:39Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-27T02:55:53Z","title":"FinTagging: Benchmarking LLMs for Extracting and Structuring Financial Information","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-22T02:25:01.761434Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.20650"},"observation_digest":"sha256:8e9a3c5977a59c1c060f36da0380a2473af3088c0f8b9a82cc4c7f68041e07a6","observation_id":"27cb0c20-3d4e-4228-88cf-454d192706f2","resolution":{"observed_at":"2026-05-22T02:25:56.157915Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.20715","last_updated":"2026-04-18T02:55:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-27T04:50:07Z","title":"MUSEG: Reinforcing Video Temporal Understanding via Timestamp-Aware Multi-Segment Grounding","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T13:13:40.485342Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.20715"},"observation_digest":"sha256:ae4fc3ef77d5f66fc38f14560b34f2eeb152c4d4eaa7faf19e1a669230ed177b","observation_id":"b062386c-c594-4c2d-8f49-f356164b8325","resolution":{"observed_at":"2026-05-19T13:17:18.521743Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T13:35:55.550408Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21411","last_updated":"2025-05-28T10:42:15Z","snapshot_observed_at":"2026-08-07T13:26:15.834324Z","submitted_at":"2025-05-27T16:40:21Z","title":"Pangu Pro MoE: Mixture of Grouped Experts for Efficient Sparsity","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:55.550408Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.21411"},"observation_digest":"sha256:2d19232ca3e15c22e41e1b0ccd14f871f43c4e2d8393cfaacc01763c11ece6b0","observation_id":"1a85f877-4bf4-446d-9838-7e91a55719e4","resolution":{"observed_at":"2026-08-07T13:35:55.550408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.21649","last_updated":"2026-07-12T19:47:13Z","snapshot_observed_at":"2026-08-07T13:23:31.537960Z","submitted_at":"2025-05-27T18:22:44Z","title":"Seeing Isn't Orienting: A Cognitively Informed Hierarchical Benchmark for Object Orientation in MLLMs","version":7},"reference_index":116,"source":"pdf_text","source_observed_at":"2026-05-19T12:38:15.869606Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.21649"},"observation_digest":"sha256:4a5c58153248336352d320adcf1b76317e7223449ef2e4e72d99f54a485a2542","observation_id":"f69da418-21f9-4790-ab7f-8c464143780f","resolution":{"observed_at":"2026-05-19T12:42:18.923820Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T13:30:33.233151Z","title":"arXiv preprint arXiv:2505.09388 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21649","last_updated":"2026-07-12T19:47:13Z","snapshot_observed_at":"2026-08-07T13:23:31.537960Z","submitted_at":"2025-05-27T18:22:44Z","title":"Seeing Isn't Orienting: A Cognitively Informed Hierarchical Benchmark for Object Orientation in MLLMs","version":8},"reference_index":116,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:33.233151Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.21649"},"observation_digest":"sha256:8776773648a9fc0bab09003527895c319edf9e1cc01c5f9969281704087b4870","observation_id":"6f4fc076-09ca-4468-bc83-423a379be8f8","resolution":{"observed_at":"2026-08-07T13:30:33.233151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2505.22312","last_updated":"2025-05-29T09:07:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-28T12:56:04Z","title":"Skywork Open Reasoner 1 Technical Report","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-17T04:26:47.283983Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.22312"},"observation_digest":"sha256:ac582715749263c6938a7d441089ac0ebe3d7e704481afb5f96f443dce3f8bf2","observation_id":"ef3502e7-75fa-467e-b6cb-92ff345bf695","resolution":{"observed_at":"2026-05-17T04:26:47.359975Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T13:16:17.352539Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22375","last_updated":"2025-05-29T01:59:00Z","snapshot_observed_at":"2026-08-07T13:06:05.806802Z","submitted_at":"2025-05-28T14:03:02Z","title":"Pangu Embedded: An Efficient Dual-system LLM Reasoner with Metacognition","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:17.352539Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.22375"},"observation_digest":"sha256:f4dec744e2906b3c179bfce874c3e4a4b4c41966756296f739fb5b94821f2d0b","observation_id":"68ba2ac6-4b42-4e30-8d2e-de00626f8b10","resolution":{"observed_at":"2026-08-07T13:16:17.352539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T13:09:03.733534Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22648","last_updated":"2025-08-10T06:05:46Z","snapshot_observed_at":"2026-08-07T13:00:07.473210Z","submitted_at":"2025-05-28T17:57:07Z","title":"WebDancer: Towards Autonomous Information Seeking Agency","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T13:09:03.733534Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.22648"},"observation_digest":"sha256:27521b4c8f70348f69a04de5f73df7ca1ead70ba3eedb537c3a74aff6fc415c7","observation_id":"e657de81-cdc6-4e85-b9a9-744b767f0e82","resolution":{"observed_at":"2026-08-07T13:09:03.733534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T13:10:10.411364Z","title":"Qwen3 Technical Report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22664","last_updated":"2025-08-02T22:03:19Z","snapshot_observed_at":"2026-08-07T12:59:56.852704Z","submitted_at":"2025-05-28T17:59:59Z","title":"Zero-Shot Vision Encoder Grafting via LLM Surrogates","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:10.411364Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.22664"},"observation_digest":"sha256:c3ae8bb43e1d0c56e898b07fc58acfc6318575f02f5c75dd158e0c99a8dde738","observation_id":"8cac2992-8ccd-4fe4-b59d-3433f20693fb","resolution":{"observed_at":"2026-08-07T13:10:10.411364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T13:08:01.252738Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22785","last_updated":"2026-03-25T17:13:51Z","snapshot_observed_at":"2026-08-07T12:58:13.057603Z","submitted_at":"2025-05-28T18:57:41Z","title":"Navigating the Latent Space Dynamics of Neural Models","version":4},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T13:08:01.252738Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.22785"},"observation_digest":"sha256:79b1e2cc77643e802160a6e788d4f42dc06767d5fbdce75564d56e53d9c00377","observation_id":"1de21259-ec3d-40f4-9457-4835552f8340","resolution":{"observed_at":"2026-08-07T13:08:01.252738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:59:48.283646Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23247","last_updated":"2025-06-17T06:41:40Z","snapshot_observed_at":"2026-08-07T12:47:17.412297Z","submitted_at":"2025-05-29T08:54:06Z","title":"Accelerating RLHF Training with Reward Variance Increase","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:59:48.283646Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.23247"},"observation_digest":"sha256:c60bb77e2af206fc546ec1b5050199baa8468a6a1f425ff30201260a5a6849a1","observation_id":"fb94bad4-608f-4d77-a0c3-982c36af98d4","resolution":{"observed_at":"2026-08-07T12:59:48.283646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:49:11.083224Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23480","last_updated":"2025-05-29T14:30:02Z","snapshot_observed_at":"2026-08-07T12:42:51.966401Z","submitted_at":"2025-05-29T14:30:02Z","title":"Revisiting Overthinking in Long Chain-of-Thought from the Perspective of Self-Doubt","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:49:11.083224Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.23480"},"observation_digest":"sha256:077f6684722838c15307bdf39260332a5a1a97ee918d6e106e6a224fc8a3cc8d","observation_id":"ac662846-92cb-4c16-98a5-36742b836f23","resolution":{"observed_at":"2026-08-07T12:49:11.083224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:46:50.980711Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23585","last_updated":"2025-06-04T01:41:37Z","snapshot_observed_at":"2026-08-07T12:40:40.130754Z","submitted_at":"2025-05-29T15:58:04Z","title":"On-Policy RL with Optimal Reward Baseline","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:46:50.980711Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.23585"},"observation_digest":"sha256:2e13c960dd137da8f305a8b51d145e77f1bc889f84fd245f0ee48c456df5f43f","observation_id":"0f4e0d30-1fee-407c-b9f1-0db0ecc45304","resolution":{"observed_at":"2026-08-07T12:46:50.980711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:45:32.858599Z","title":"Qwen3 technical report.arXiv preprint CoRR, abs/2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23646","last_updated":"2025-05-29T16:53:41Z","snapshot_observed_at":"2026-08-07T12:38:52.756749Z","submitted_at":"2025-05-29T16:53:41Z","title":"Are Reasoning Models More Prone to Hallucination?","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:32.858599Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.23646"},"observation_digest":"sha256:8a58df44267cd62c817117595fdb8ccff25daa416fcef4157d0d9ace3aeb19b6","observation_id":"b5bc901d-aaa1-4ac1-9cf3-e7f4ac9af352","resolution":{"observed_at":"2026-08-07T12:45:32.858599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:45:30.321807Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23725","last_updated":"2026-06-02T01:19:21Z","snapshot_observed_at":"2026-08-07T12:36:41.591936Z","submitted_at":"2025-05-29T17:55:37Z","title":"MuLoCo: Muon is a practical inner optimizer for DiLoCo","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T12:45:30.321807Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.23725"},"observation_digest":"sha256:a79e332a029c657cb293c2ec1df9709850261b77cecd9247fbb94442052eecd4","observation_id":"d3e606a3-399b-4988-8e1d-f59e4dfde539","resolution":{"observed_at":"2026-08-07T12:45:30.321807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:25:28.082102Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24480","last_updated":"2025-05-30T11:30:18Z","snapshot_observed_at":"2026-08-07T12:19:01.571670Z","submitted_at":"2025-05-30T11:30:18Z","title":"Towards Effective Code-Integrated Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:25:28.082102Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.24480"},"observation_digest":"sha256:870dfedff1e271528dcacab5a448f131c73d769049865e7383c1f509afa2de81","observation_id":"6377a69b-c609-4fda-b5bd-f88436a42ac7","resolution":{"observed_at":"2026-08-07T12:25:28.082102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:20:47.910435Z","title":"Qwen3 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24773","last_updated":"2025-08-20T08:08:03Z","snapshot_observed_at":"2026-08-07T12:11:46.444244Z","submitted_at":"2025-05-30T16:35:32Z","title":"AFLoRA: Adaptive Federated Fine-Tuning of Large Language Models with Resource-Aware Low-Rank Adaption","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T12:20:47.910435Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2505.24773"},"observation_digest":"sha256:ccab69878203af9816711db343960feafd7e89eb0ac8b5a7a02ac4bc50b76c42","observation_id":"846a9050-78b5-46ef-94f3-6aa245c7bce2","resolution":{"observed_at":"2026-08-07T12:20:47.910435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:08:17.152295Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00482","last_updated":"2025-05-31T09:24:32Z","snapshot_observed_at":"2026-08-07T12:01:57.559855Z","submitted_at":"2025-05-31T09:24:32Z","title":"BenchHub: A Unified Benchmark Suite for Holistic and Customizable LLM Evaluation","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.152295Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.00482"},"observation_digest":"sha256:ed00305c9707c01641ffedfb389a64361dad6e9fb7b2e5c85d62e4c4b731e1d1","observation_id":"a3199245-1f8c-4d78-958b-bed6e0247619","resolution":{"observed_at":"2026-08-07T12:08:17.152295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:06:30.893164Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00577","last_updated":"2025-05-31T14:22:40Z","snapshot_observed_at":"2026-08-07T11:59:58.198859Z","submitted_at":"2025-05-31T14:22:40Z","title":"Reasoning Like an Economist: Post-Training on Economic Problems Induces Strategic Generalization in LLMs","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T12:06:30.893164Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.00577"},"observation_digest":"sha256:5e8f90414f1f50d8662e3d7684dbc0de1b08433dff93115acf9a5c2285e1546e","observation_id":"4ca12435-349e-44b7-a3ca-57e4072a1358","resolution":{"observed_at":"2026-08-07T12:06:30.893164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:56:27.058342Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.01056","last_updated":"2025-06-24T06:27:29Z","snapshot_observed_at":"2026-08-07T11:49:43.837276Z","submitted_at":"2025-06-01T15:48:53Z","title":"MCP-Zero: Active Tool Discovery for Autonomous LLM Agents","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:56:27.058342Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.01056"},"observation_digest":"sha256:d6325650f04c4b91bb963cf002704b48e63113afac8c3c5a8ee685d7e394ee2e","observation_id":"3358a102-2432-4bf3-9834-f647d55f77bd","resolution":{"observed_at":"2026-08-07T11:56:27.058342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:49:06.712106Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.01372","last_updated":"2025-06-09T09:01:24Z","snapshot_observed_at":"2026-08-07T12:17:45.194954Z","submitted_at":"2025-06-02T06:59:10Z","title":"AI Scientists Fail Without Strong Implementation Capability","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T11:49:06.712106Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.01372"},"observation_digest":"sha256:9bf44e58801d54c9e33507b8795212d0c311aa5000114f0237f7f4d8ea788aca","observation_id":"2e2b4c57-17d5-4d04-b0f0-534c632e87cc","resolution":{"observed_at":"2026-08-07T11:49:06.712106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:47:49.662405Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.01466","last_updated":"2025-06-02T09:23:58Z","snapshot_observed_at":"2026-08-07T11:38:06.223213Z","submitted_at":"2025-06-02T09:23:58Z","title":"Towards Scalable Video Anomaly Retrieval: A Synthetic Video-Text Benchmark","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.662405Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.01466"},"observation_digest":"sha256:13c869bd8e829cbfb0c7e5ea03deba939de521e3bb118ef41489c94a02ef507c","observation_id":"055c5596-8eba-47ff-951d-4c9d7a07e594","resolution":{"observed_at":"2026-08-07T11:47:49.662405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:37:29.561570Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.01934","last_updated":"2025-06-02T17:53:10Z","snapshot_observed_at":"2026-08-07T12:27:48.889414Z","submitted_at":"2025-06-02T17:53:10Z","title":"RoboEgo System Card: An Omnimodal Model with Native Full Duplexity","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:37:29.561570Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.01934"},"observation_digest":"sha256:d693ee5704af3c2ea88771b90b247187ca1925d5a02b74dea8a6678791b4cb31","observation_id":"1ce45bce-61fd-40c5-87a5-094ce26829c4","resolution":{"observed_at":"2026-08-07T11:37:29.561570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2506.01939","last_updated":"2025-11-13T10:08:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-02T17:54:39Z","title":"Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-12T12:12:08.724844Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.01939"},"observation_digest":"sha256:be94fd953244a98817e89080bc180df8b9e13859e698b8866bd4123680b0e72a","observation_id":"1eb819a6-767c-4d58-8f14-3122019b2561","resolution":{"observed_at":"2026-05-12T12:12:08.983891Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:23:20.503926Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.02683","last_updated":"2025-06-03T09:33:13Z","snapshot_observed_at":"2026-08-07T11:16:03.598768Z","submitted_at":"2025-06-03T09:33:13Z","title":"Decompose, Plan in Parallel, and Merge: A Novel Paradigm for Large Language Models based Planning with Multiple Constraints","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T11:23:20.503926Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.02683"},"observation_digest":"sha256:2f26cef2c3b34c6cc58af476a122896b5bdbe8c32c3307637c5c44ea143d47ae","observation_id":"25508bfe-25b4-490e-b61b-2b6f2fa6ca8f","resolution":{"observed_at":"2026-08-07T11:23:20.503926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:15:35.178558Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03106","last_updated":"2026-06-06T08:11:21Z","snapshot_observed_at":"2026-08-07T11:06:10.792802Z","submitted_at":"2025-06-03T17:39:02Z","title":"Critique-GRPO: Advancing LLM Reasoning with Natural Language and Numerical Feedback","version":7},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:15:35.178558Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.03106"},"observation_digest":"sha256:2f93dbc05feba2524cc7e3e01f08184268d6791513feaf8c4f54a3cfdba1e12a","observation_id":"ef39f899-e63f-45a1-b692-4364d4fae2ea","resolution":{"observed_at":"2026-08-07T11:15:35.178558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:11:54.759225Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03139","last_updated":"2025-06-03T17:58:57Z","snapshot_observed_at":"2026-08-07T11:05:42.608293Z","submitted_at":"2025-06-03T17:58:57Z","title":"SVGenius: Benchmarking LLMs in SVG Understanding, Editing and Generation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T11:11:54.759225Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.03139"},"observation_digest":"sha256:da1ca6b45a119f396c4a9e987c8230ec478919873a5c131265eae4219e6872eb","observation_id":"0072622a-b1e3-4607-8be7-2fb36be8c1eb","resolution":{"observed_at":"2026-08-07T11:11:54.759225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:13:55.027673Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03295","last_updated":"2025-06-05T03:25:20Z","snapshot_observed_at":"2026-08-07T11:04:19.054997Z","submitted_at":"2025-06-03T18:35:52Z","title":"Unleashing the Reasoning Potential of Pre-trained LLMs by Critique Fine-Tuning on One Problem","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T11:13:55.027673Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.03295"},"observation_digest":"sha256:6957d98d8d63f10227612286a7b547122400127f7985744beafc09413a49b162","observation_id":"72345245-f1cc-42a6-84b1-174caee69774","resolution":{"observed_at":"2026-08-07T11:13:55.027673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T11:05:19.713959Z","title":"Yichang Zhang, Yinger Zhang, Yu Wan, Yuqiong Liu, Zekun Wang, Zeyu Cui, Zhenru Zhang, Zhipeng Zhou, and Zihan Qiu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04280","last_updated":"2025-06-04T04:21:32Z","snapshot_observed_at":"2026-08-07T10:57:48.182894Z","submitted_at":"2025-06-04T04:21:32Z","title":"Evaluating MLLMs with Multimodal Multi-image Reasoning Benchmark","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:05:19.713959Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.04280"},"observation_digest":"sha256:369af28256665099c7e2b4a84998522c180fc8818aad28f3b74081adea10674d","observation_id":"7e2399a7-c682-4cf5-9248-a7ad6c9ad0bf","resolution":{"observed_at":"2026-08-07T11:05:19.713959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T10:46:06.663683Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04531","last_updated":"2025-06-05T00:48:55Z","snapshot_observed_at":"2026-08-07T10:37:29.647793Z","submitted_at":"2025-06-05T00:48:55Z","title":"HALoS: Hierarchical Asynchronous Local SGD over Slow Networks for Geo-Distributed Large Language Model Training","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T10:46:06.663683Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.04531"},"observation_digest":"sha256:e41f428d17a596112ef04a29bb6b83c5985b902cebab88de3b2412fbd5d541b6","observation_id":"b7610af2-5f14-43a9-ae0e-398ceb3d562f","resolution":{"observed_at":"2026-08-07T10:46:06.663683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T10:40:17.163625Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04774","last_updated":"2025-06-05T09:06:59Z","snapshot_observed_at":"2026-08-07T13:35:59.954309Z","submitted_at":"2025-06-05T09:06:59Z","title":"Fine-Grained Interpretation of Political Opinions in Large Language Models","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:40:17.163625Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.04774"},"observation_digest":"sha256:14c305963e6e5ccfeee553eb940cca3d094c99e3602a01ba583f443985f7a3ac","observation_id":"a9827d7b-aa56-4b04-8caa-010647adb60f","resolution":{"observed_at":"2026-08-07T10:40:17.163625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T10:35:39.862646Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05295","last_updated":"2025-06-12T16:25:06Z","snapshot_observed_at":"2026-08-07T10:19:20.091786Z","submitted_at":"2025-06-05T17:48:19Z","title":"Sample Complexity and Representation Ability of Test-time Scaling Paradigms","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T10:35:39.862646Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.05295"},"observation_digest":"sha256:74540cc74a10644c5fcd832778299ae43c8217a7f5e11724d6571e48dff6ff49","observation_id":"e8a684b5-ad3e-43b9-ae7f-ad43e187c278","resolution":{"observed_at":"2026-08-07T10:35:39.862646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T10:30:34.419331Z","title":"Shinn Yao, Jiaming Zhao, Dian Yu, et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05333","last_updated":"2025-06-20T01:25:25Z","snapshot_observed_at":"2026-08-07T10:18:59.977399Z","submitted_at":"2025-06-05T17:59:24Z","title":"Kinetics: Rethinking Test-Time Scaling Laws","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:34.419331Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.05333"},"observation_digest":"sha256:ab8d68f3d4594ff2097083d86e15c4c285dc1f63d4cb50f05752b345a2ab7667","observation_id":"13e7a974-fe98-4837-832b-e201e5be6bc5","resolution":{"observed_at":"2026-08-07T10:30:34.419331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T10:20:10.330064Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05579","last_updated":"2025-06-09T04:57:09Z","snapshot_observed_at":"2026-08-07T10:11:33.525019Z","submitted_at":"2025-06-05T20:48:16Z","title":"When Models Know More Than They Can Explain: Quantifying Knowledge Transfer in Human-AI Collaboration","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T10:20:10.330064Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.05579"},"observation_digest":"sha256:6f38fdd74d344e3b2d600691410090dfc2b7ef5beeb479b54622c7ff9614eead","observation_id":"704d3667-e030-4499-8d3c-3d9fb670184a","resolution":{"observed_at":"2026-08-07T10:20:10.330064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T10:17:17.819501Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05787","last_updated":"2025-08-04T22:48:35Z","snapshot_observed_at":"2026-08-07T10:11:02.494841Z","submitted_at":"2025-06-06T06:33:16Z","title":"EASG-Bench: Video Q&A Benchmark with Egocentric Action Scene Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:17:17.819501Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.05787"},"observation_digest":"sha256:0ec85a33429f78e13adec199ad3132b4d2d3dc123120f49dc4465a56671fe403","observation_id":"124428a9-3528-4ac4-a7de-a1c62531e500","resolution":{"observed_at":"2026-08-07T10:17:17.819501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T10:18:50.210221Z","title":"Qwen3 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05796","last_updated":"2025-06-06T06:43:34Z","snapshot_observed_at":"2026-08-07T10:11:04.206729Z","submitted_at":"2025-06-06T06:43:34Z","title":"Diarization-Aware Multi-Speaker Automatic Speech Recognition via Large Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:50.210221Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.05796"},"observation_digest":"sha256:30275f2ed558882de15ff0708566679a51417aa316631547e3cda45824b7ba84","observation_id":"000cff5f-cd19-42f7-8d6d-f3c63d10dc20","resolution":{"observed_at":"2026-08-07T10:18:50.210221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T06:04:16.776361Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06157","last_updated":"2025-07-30T03:58:06Z","snapshot_observed_at":"2026-08-07T05:57:11.148750Z","submitted_at":"2025-06-06T15:21:24Z","title":"Masked Language Models are Good Heterogeneous Graph Generalizers","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.776361Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.06157"},"observation_digest":"sha256:09c1a7d265a20308927bda93850dccf9b9fad1b5a88212b03863fa4108742e87","observation_id":"c10f6d60-0e90-4c96-8b3e-38fab55ec22e","resolution":{"observed_at":"2026-08-07T06:04:16.776361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:49:39.672165Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T05:39:49.423937Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:39.672165Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:d49794a8a6bf91e9451656dbf4e2ac3e1604f9846bd9ba140caa14bb2cdde258","observation_id":"66b4e1d8-cb54-4e43-bcdc-9bba618053fe","resolution":{"observed_at":"2026-08-07T05:49:39.672165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:37:29.337822Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07528","last_updated":"2025-07-31T17:12:54Z","snapshot_observed_at":"2026-08-07T10:27:48.163786Z","submitted_at":"2025-06-09T08:11:43Z","title":"Coordinating Search-Informed Reasoning and Reasoning-Guided Search in Claim Verification","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:37:29.337822Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.07528"},"observation_digest":"sha256:ac80c39e7b974d0ccad7626843c6007e50c7185c3c172e1beb5f65dcf27d3de8","observation_id":"8e8f40a4-ebdd-4935-9159-ea9048b9f5ec","resolution":{"observed_at":"2026-08-07T05:37:29.337822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:35:01.445789Z","title":"arXiv preprint arXiv:2505.09388 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07627","last_updated":"2025-06-09T10:45:35Z","snapshot_observed_at":"2026-08-07T06:32:54.058652Z","submitted_at":"2025-06-09T10:45:35Z","title":"Event-Priori-Based Vision-Language Model for Efficient Visual Understanding","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:35:01.445789Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.07627"},"observation_digest":"sha256:0829f6fc439228112c838ecb8959e0da9de1b4f76a8feb81e8406f08da612a70","observation_id":"368c729f-f95b-4e34-9f02-0663165b7530","resolution":{"observed_at":"2026-08-07T05:35:01.445789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:31:22.117240Z","title":"Onebit: Towards extremely low-bit large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07900","last_updated":"2025-09-04T16:23:02Z","snapshot_observed_at":"2026-08-07T05:20:20.993402Z","submitted_at":"2025-06-09T16:16:50Z","title":"MiniCPM4: Ultra-Efficient LLMs on End Devices","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:31:22.117240Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.07900"},"observation_digest":"sha256:381d7a686337271b8d5dfaf4f5c9da16ae436731cb6b23e5c91f1cb50ec52d21","observation_id":"be46e805-0613-44d6-a6cc-3e26a1c5d35f","resolution":{"observed_at":"2026-08-07T05:31:22.117240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:12:47.151358Z","title":"Qwen3 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08551","last_updated":"2025-06-11T05:56:27Z","snapshot_observed_at":"2026-08-07T05:05:02.757221Z","submitted_at":"2025-06-10T08:16:24Z","title":"DeepForm: Reasoning Large Language Model for Communication System Formulation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:12:47.151358Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.08551"},"observation_digest":"sha256:faf3e794b0f489b98c705b541d542ba6437b4ada121947155a05e3edb7dea65a","observation_id":"34ea3fec-8ac3-4f1c-ba0d-1603571c3b24","resolution":{"observed_at":"2026-08-07T05:12:47.151358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:13:26.501120Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08592","last_updated":"2025-08-26T03:31:26Z","snapshot_observed_at":"2026-08-07T05:04:25.791094Z","submitted_at":"2025-06-10T09:00:33Z","title":"Dense Retrievers Can Fail on Simple Queries: Revealing The Granularity Dilemma of Embeddings","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:13:26.501120Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.08592"},"observation_digest":"sha256:2362a074e4d832054296f792a537be85318dffc9fa61ed70d7c429c880e65549","observation_id":"266bf271-2c2b-4fba-bfde-e056435b9d74","resolution":{"observed_at":"2026-08-07T05:13:26.501120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2506.08849","last_updated":"2026-05-03T07:20:42Z","snapshot_observed_at":"2026-07-31T07:58:35.130346Z","submitted_at":"2025-06-10T14:37:51Z","title":"Adapting Vision-Language Foundation Model for Next Generation Medical Ultrasound Image Analysis","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-19T10:34:28.875334Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.08849"},"observation_digest":"sha256:6014bbec8282d1af9768fea73d43c4b5c9f6ad0886864621fd19980a67b1cb2b","observation_id":"cc56687e-9f39-4fef-96c2-607564c937b2","resolution":{"observed_at":"2026-05-19T10:37:15.126491Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:06:32.721183Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08889","last_updated":"2025-06-10T15:17:26Z","snapshot_observed_at":"2026-08-07T11:00:03.513055Z","submitted_at":"2025-06-10T15:17:26Z","title":"SeerAttention-R: Sparse Attention Adaptation for Long Reasoning","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T05:06:32.721183Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.08889"},"observation_digest":"sha256:4e9c7a0c76a2c9ef6028c4b4d632972284950b57bcf0bf9f6f37df3739220865","observation_id":"c2b5e48b-48d0-4ef7-8fc6-80bd77976df3","resolution":{"observed_at":"2026-08-07T05:06:32.721183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2506.08980","last_updated":"2026-04-24T10:45:51Z","snapshot_observed_at":"2026-07-31T18:53:54.954814Z","submitted_at":"2025-06-10T16:49:46Z","title":"AdaDec: A Uncertainty-Guided Lookahead Decoding Framework for LLM-Based Code Generation","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T10:19:07.701197Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.08980"},"observation_digest":"sha256:37360e20e4cf97c2bdcb91fa89e94004b4a6b01a0aed7812162d7ec719718793","observation_id":"4e68a874-88a0-400c-b57e-a1c1e84912ae","resolution":{"observed_at":"2026-05-19T10:22:14.529597Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T05:03:29.500826Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09026","last_updated":"2025-06-13T17:44:03Z","snapshot_observed_at":"2026-08-07T12:11:23.366278Z","submitted_at":"2025-06-10T17:52:42Z","title":"e3: Learning to Explore Enables Extrapolation of Test-Time Compute for LLMs","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T05:03:29.500826Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.09026"},"observation_digest":"sha256:e9f7ce9190de4ec63323162090578e5918b3c6376ef9515f58f6e45a616d51db","observation_id":"968c06be-1c7f-4e33-a8d9-a2e465a1f2d2","resolution":{"observed_at":"2026-08-07T05:03:29.500826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T04:53:58.158488Z","title":"10 An Yang, Baosong Yang, Beichen Zhang, Binyuan Hui, Bo Zheng, Bowen Yu, Chengyuan Li, Dayiheng Liu, Fei Huang, Haoran Wei, and 1 others","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.09340","last_updated":"2025-06-11T02:44:10Z","snapshot_observed_at":"2026-08-07T04:48:15.415709Z","submitted_at":"2025-06-11T02:44:10Z","title":"RePO: Replay-Enhanced Policy Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:53:58.158488Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.09340"},"observation_digest":"sha256:e54c842d9cd369bbe9cb33d666842948ccfa89f4dba587c8c3e4a95bfa3f88e3","observation_id":"0ad642a5-2ceb-4b76-bc35-7fc147ecee6a","resolution":{"observed_at":"2026-08-07T04:53:58.158488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T04:55:48.924031Z","title":"Qwen3 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09452","last_updated":"2025-06-11T06:56:12Z","snapshot_observed_at":"2026-08-07T04:45:28.192329Z","submitted_at":"2025-06-11T06:56:12Z","title":"Learning Obfuscations Of LLM Embedding Sequences: Stained Glass Transform","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:48.924031Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.09452"},"observation_digest":"sha256:6d0460a8b7099015bc1a73da8aa126b072fed9edf008aacc70462766017dc506","observation_id":"650b81db-b1f5-471c-84e7-3db71dffe943","resolution":{"observed_at":"2026-08-07T04:55:48.924031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T04:50:00.232482Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09600","last_updated":"2025-08-23T09:21:30Z","snapshot_observed_at":"2026-08-07T06:27:40.436487Z","submitted_at":"2025-06-11T10:59:47Z","title":"Effective Red-Teaming of Policy-Adherent Agents","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T04:50:00.232482Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.09600"},"observation_digest":"sha256:397b476f0c2c2595b4b471e9bfa8119049ffd7bbe9017b2b197eaacc23e9de7e","observation_id":"5f6b1128-03a9-4a3a-885e-aefa408de241","resolution":{"observed_at":"2026-08-07T04:50:00.232482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T04:42:02.695513Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09958","last_updated":"2025-06-11T17:31:38Z","snapshot_observed_at":"2026-08-07T04:34:26.913382Z","submitted_at":"2025-06-11T17:31:38Z","title":"Kvasir-VQA-x1: A Multimodal Dataset for Medical Reasoning and Robust MedVQA in Gastrointestinal Endoscopy","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:42:02.695513Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.09958"},"observation_digest":"sha256:6ef6e35d8440612271af804e3921b1648d30cf346d339ab16348cd410a8b8701","observation_id":"c7b19ffe-ac7f-4563-9322-33b9c37baa25","resolution":{"observed_at":"2026-08-07T04:42:02.695513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T04:23:45.849816Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10741","last_updated":"2025-06-12T14:28:12Z","snapshot_observed_at":"2026-08-07T04:16:58.919477Z","submitted_at":"2025-06-12T14:28:12Z","title":"PosterCraft: Rethinking High-Quality Aesthetic Poster Generation in a Unified Framework","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:23:45.849816Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.10741"},"observation_digest":"sha256:a2c58d593b01011486af3db336c4a038f1690993c2fed3580e7a87354e972132","observation_id":"da5fe36c-e54b-47ef-acda-2fe6a105a37e","resolution":{"observed_at":"2026-08-07T04:23:45.849816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T04:21:29.438704Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10972","last_updated":"2025-07-16T07:09:02Z","snapshot_observed_at":"2026-08-07T04:10:32.350663Z","submitted_at":"2025-06-12T17:59:23Z","title":"Predictable Scale: Part II, Farseer: A Refined Scaling Law in Large Language Models","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:21:29.438704Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.10972"},"observation_digest":"sha256:106a6d8c81947623b78d342268c8bc5663b4157a71f60d74b4576e27430a5d06","observation_id":"f4f17aee-5f09-4d4e-b024-16607da6ca2a","resolution":{"observed_at":"2026-08-07T04:21:29.438704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:59:56.812729Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.12278","last_updated":"2025-06-13T23:56:17Z","snapshot_observed_at":"2026-08-07T00:52:00.846828Z","submitted_at":"2025-06-13T23:56:17Z","title":"Can LLMs Generate High-Quality Test Cases for Algorithm Problems? TestCase-Eval: A Systematic Evaluation of Fault Coverage and Exposure","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:56.812729Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.12278"},"observation_digest":"sha256:8ee764578e44d43c339d87e6c5e85a169c95b2eb24a1c7c0e4038848ec7787af","observation_id":"82778f0a-c4d0-4191-882f-3d21a15b90c5","resolution":{"observed_at":"2026-08-07T00:59:56.812729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:53:26.396889Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.12609","last_updated":"2025-08-18T08:18:50Z","snapshot_observed_at":"2026-08-07T00:43:06.557925Z","submitted_at":"2025-06-14T19:10:22Z","title":"Not All Tokens and Heads Are Equally Important: Dual-Level Attention Intervention for Hallucination Mitigation","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:26.396889Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.12609"},"observation_digest":"sha256:274e48158e9e581317e4ebc0c96dcb7549f9ec9e2709cecdeced0c1f97d299d8","observation_id":"8369fb3f-6d60-45bf-89cd-5d65b3e686c5","resolution":{"observed_at":"2026-08-07T00:53:26.396889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:48:43.975368Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.12689","last_updated":"2025-07-21T03:49:38Z","snapshot_observed_at":"2026-08-07T00:41:42.854953Z","submitted_at":"2025-06-15T02:23:47Z","title":"SciSage: A Multi-Agent Framework for High-Quality Scientific Survey Generation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:48:43.975368Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.12689"},"observation_digest":"sha256:22774d0f7b1f766e2986328d3f57e0b521cd9ce30e89b159b61faa26b351f447","observation_id":"a4ba309d-8e0e-4879-8a6d-ebce417a8059","resolution":{"observed_at":"2026-08-07T00:48:43.975368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:39:55.481867Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.13192","last_updated":"2025-06-16T07:59:51Z","snapshot_observed_at":"2026-08-07T00:33:30.864367Z","submitted_at":"2025-06-16T07:59:51Z","title":"Breaking Thought Patterns: A Multi-Dimensional Reasoning Framework for LLMs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T00:39:55.481867Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.13192"},"observation_digest":"sha256:cd14cc3ccd4507ec150b227e3c5e16086a47f7cbef5855d1fc35c245eff64cdd","observation_id":"b861749a-b082-4512-a259-5db9671c3d76","resolution":{"observed_at":"2026-08-07T00:39:55.481867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:45:06.470613Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.13277","last_updated":"2025-06-17T10:12:39Z","snapshot_observed_at":"2026-08-07T00:34:20.823418Z","submitted_at":"2025-06-16T09:16:40Z","title":"SeqPE: Transformer with Sequential Position Encoding","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T00:45:06.470613Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.13277"},"observation_digest":"sha256:22de93a5eff45da29a1d576261d09a0cbbf20a9deab6cd59bd29132003ca41a2","observation_id":"49a27808-1168-4832-85ae-db7ec72b3a0c","resolution":{"observed_at":"2026-08-07T00:45:06.470613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:41:36.361667Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.13284","last_updated":"2025-06-16T09:27:48Z","snapshot_observed_at":"2026-08-07T00:34:10.663963Z","submitted_at":"2025-06-16T09:27:48Z","title":"AceReason-Nemotron 1.1: Advancing Math and Code Reasoning through SFT and RL Synergy","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T00:41:36.361667Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.13284"},"observation_digest":"sha256:f715436ae5af3f4895934459bc2d3746b716fd0e631f797f7c0eabef3292cc38","observation_id":"653ecf0f-07fd-44be-b8f6-01027a8fe71f","resolution":{"observed_at":"2026-08-07T00:41:36.361667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:32:36.710457Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.13666","last_updated":"2025-06-16T16:24:31Z","snapshot_observed_at":"2026-08-07T00:25:36.770856Z","submitted_at":"2025-06-16T16:24:31Z","title":"We Should Identify and Mitigate Third-Party Safety Risks in MCP-Powered Agent Systems","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T00:32:36.710457Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.13666"},"observation_digest":"sha256:b02763a8fb27910686dcfcd6d1fefe4145c2916ee39b4cff5f15f2f2d25b4677","observation_id":"74828f52-df54-443a-8638-be1165b46fcd","resolution":{"observed_at":"2026-08-07T00:32:36.710457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:31:49.300277Z","title":"Qwen3 technical report,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.13702","last_updated":"2026-06-01T10:55:41Z","snapshot_observed_at":"2026-08-07T13:13:53.520235Z","submitted_at":"2025-06-16T17:06:27Z","title":"Value-Free Policy Optimization via Reward Partitioning","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:31:49.300277Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.13702"},"observation_digest":"sha256:b49401f0e2e92824b44f6b9756f4e8fed8d8cb069534ad1ad00fe4d02f4898bf","observation_id":"163ec618-6992-4fcf-ae7d-625c5dd4cf0a","resolution":{"observed_at":"2026-08-07T00:31:49.300277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:28:09.993156Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14012","last_updated":"2025-06-16T21:19:27Z","snapshot_observed_at":"2026-08-07T00:43:41.235048Z","submitted_at":"2025-06-16T21:19:27Z","title":"Lost in the Mix: Evaluating LLM Understanding of Code-Switched Text","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:09.993156Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.14012"},"observation_digest":"sha256:2567aac0a9eba4c1e0539bdacfc4be21135e7897f65109458b0c2d061a831d84","observation_id":"2fb1689a-22dd-403f-a10b-205b6e54c16a","resolution":{"observed_at":"2026-08-07T00:28:09.993156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T00:24:47.991917Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14111","last_updated":"2025-06-19T19:02:41Z","snapshot_observed_at":"2026-08-07T00:16:03.841117Z","submitted_at":"2025-06-17T02:03:36Z","title":"Essential-Web v1.0: 24T tokens of organized web data","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T00:24:47.991917Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.14111"},"observation_digest":"sha256:e49e53703f00aeaa2d8ac882215c98a0d85b8ba084aeb80cfe4be555ff34663c","observation_id":"2f58b06b-4f34-48a7-89a6-3dcc25383bf6","resolution":{"observed_at":"2026-08-07T00:24:47.991917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-07T12:05:09.457899Z","title":"Qwen3 technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14794","last_updated":"2025-05-31T18:23:19Z","snapshot_observed_at":"2026-08-07T11:58:49.725641Z","submitted_at":"2025-05-31T18:23:19Z","title":"Assembly of Experts: Linear-time construction of the Chimera LLM variants with emergent and adaptable behaviors","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:05:09.457899Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.14794"},"observation_digest":"sha256:18b77f095bd454ebc8a868d828a0b096aa3fdd4c7e0bff424c87da41328e8ada","observation_id":"c30d0e6c-36b8-4395-96c2-641e88b7c491","resolution":{"observed_at":"2026-08-07T12:05:09.457899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-06T23:59:49.122177Z","title":"arXiv:2505.09388","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.15522","last_updated":"2025-06-18T14:58:13Z","snapshot_observed_at":"2026-08-06T23:51:45.224663Z","submitted_at":"2025-06-18T14:58:13Z","title":"Lessons from Training Grounded LLMs with Verifiable Rewards","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:59:49.122177Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2506.15522"},"observation_digest":"sha256:c652a7bacf0ee19c9c46cd8764f3505d81a4008f7462e65aa86fa83254809fee","observation_id":"38d883f4-49ef-47d8-9173-84b1fcecba0e","resolution":{"observed_at":"2026-08-06T23:59:49.122177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.09388/citation-record","integrity":"/paper/2505.09388/integrity","json":"/paper/2505.09388/citation-record.json","paper":"/paper/2505.09388"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08905","last_updated":"2024-12-12T03:37:41Z","snapshot_observed_at":"2026-08-05T04:04:21.846023Z","submitted_at":"2024-12-12T03:37:41Z","title":"Phi-4 Technical Report","version":1},"cited_work":{"arxiv_id":"2412.08905","doi":"10.48550/arxiv.2412.08905","metadata_source":"pith","pith_arxiv_id":"2412.08905","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Phi-4 Technical Report","venue":"cs.CL","work_id":"b6274271-7af9-4ee8-993b-ba1ba4205ba8","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2412.08905","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:7bdff62447176e7239bd2a7e6d2d9cd7ffcaaf2d534f258895dd10c6afa8b0d4","observation_id":"2592102c-482c-45f7-acc9-c6df1065bf64","resolution":{"observed_at":"2026-05-11T06:34:04.627981Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-02T03:08:11.323957+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-02T03:08:11.323957+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17463","last_updated":"2024-05-29T05:44:58Z","snapshot_observed_at":"2026-08-06T08:11:58.702104Z","submitted_at":"2024-02-27T12:39:23Z","title":"Training-Free Long-Context Scaling of Large Language Models","version":2},"cited_work":{"arxiv_id":"2402.17463","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.17463","snapshot_observed_at":"2026-07-10T20:07:33.544111Z","title":"Training-free long-context scaling of large language models","venue":"cs.CL","work_id":"a17fa8b4-29df-4838-80b2-c9d3440e8ed5","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2402.17463","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:de40c7c9ce936abda8b920e568b9b6019792e976a0fc36538c1ac305c0305be8","observation_id":"5560fb24-2758-484d-b191-16663ffb6136","resolution":{"observed_at":"2026-05-09T06:35:28.411146Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2108.07732","doi":"10.1007/s11390-025-5518-5","metadata_source":"pith","pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Program Synthesis with Large Language Models","venue":"cs.PL","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","year":2021},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:18250144d3b3261d560f2759756d3cda9548650fb31283224dca9a89e2bac0c5","observation_id":"46311583-9490-4cd3-bd39-92e7abaaf507","resolution":{"observed_at":"2026-05-09T06:35:28.426565Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":"2309.16609","doi":"10.48550/arxiv.2309.16609","metadata_source":"pith","pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen Technical Report","venue":"cs.CL","work_id":"bb1fd52f-6b2f-437c-9516-37bdf6eb9be8","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:6d5972da86f650f7931ea8d8b8ac77a262b06d9becb0610cefb73f748cce13fc","observation_id":"2cca310d-c012-43b5-a232-d9e3dea8a6f3","resolution":{"observed_at":"2026-05-09T06:35:28.432599Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-15T23:50:15.620681+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-15T23:50:15.620681+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13923","last_updated":"2025-02-19T18:00:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-19T18:00:14Z","title":"Qwen2.5-VL Technical Report","version":1},"cited_work":{"arxiv_id":"2502.13923","doi":"10.48550/arxiv.2502.13923","metadata_source":"pith","pith_arxiv_id":"2502.13923","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2.5-VL Technical Report","venue":"cs.CV","work_id":"69dffacb-bfe8-442d-be86-48624c60426f","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2502.13923","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:75f92f2702c061836f558df66eff24e5870fe480812269d2ded9a512bee1fb47","observation_id":"149ce03c-abd7-43fa-91a9-6f292ea4d26b","resolution":{"observed_at":"2026-05-09T06:35:28.441368Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-12T05:19:13.082554+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T05:19:13.082554+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.16884","last_updated":"2024-07-25T04:30:15Z","snapshot_observed_at":"2026-07-06T16:12:55.132006Z","submitted_at":"2023-08-31T17:43:08Z","title":"The Belebele Benchmark: a Parallel Reading Comprehension Dataset in 122 Language Variants","version":2},"cited_work":{"arxiv_id":"2308.16884","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.16884","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Belebele benchmark: A parallel reading comprehension dataset in 122 language variants","venue":null,"work_id":"91c4ea9e-a739-4a11-bea8-79d36c3618e4","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2308.16884","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:d92653835def070890daf90910a6e37e1cfeae40c782b73ff8f110560bc98fb7","observation_id":"ae538013-3ffe-476a-807a-4989d90432be","resolution":{"observed_at":"2026-05-09T06:35:28.449337Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":"2107.03374","doi":"10.48550/arxiv.2107.03374","metadata_source":"pith","pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating Large Language Models Trained on Code","venue":"cs.LG","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","year":2021},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:63453383b675c2b16286fb6f2d60bf7eb1397cde270f60bd98abece2dbf4577b","observation_id":"1f507d91-7dcb-4e69-bc06-95d5ad6a39fb","resolution":{"observed_at":"2026-05-09T06:35:28.456117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-01T08:08:23.404839+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T08:08:23.404839+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":"2110.14168","doi":"10.1002/j.1545-","metadata_source":"pith","pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Training Verifiers to Solve Math Word Problems","venue":"cs.LG","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2021},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:97ff0b221022de434c98762f87a1cc085bd1ec4be606ce3d55ea203cd8a20e3a","observation_id":"92779c05-4c8d-4428-a55b-fc9698b05359","resolution":{"observed_at":"2026-05-09T06:35:28.461265Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06066","last_updated":"2024-01-11T17:31:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-11T17:31:42Z","title":"DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models","version":1},"cited_work":{"arxiv_id":"2401.06066","doi":"10.48550/arxiv.2401.06066","metadata_source":"pith","pith_arxiv_id":"2401.06066","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models","venue":"cs.CL","work_id":"a9888d6d-bf47-4324-9834-7cc12ac3a78c","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2401.06066","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:20fb169aa8fd92f7ed9ac5bd85a7703713b662263d03123152a3ed15b33832ba","observation_id":"75064666-870a-4b7a-b891-31c2f33eb0c0","resolution":{"observed_at":"2026-05-11T22:50:20.439308Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0adac4b9-d13e-4d15-950d-2ebc066186b4","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:c75fdb95b4174868b0bfec8784a67e6868a2def8e61fb14cf226926c402ae1ed","observation_id":"db1c2ddf-3ece-452c-a5f4-8f84522acfe7","resolution":{"observed_at":"2026-05-09T06:35:28.639192Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14739","last_updated":"2025-03-28T15:21:44Z","snapshot_observed_at":"2026-07-29T21:41:16.650188Z","submitted_at":"2025-02-20T17:05:58Z","title":"SuperGPQA: Scaling LLM Evaluation across 285 Graduate Disciplines","version":4},"cited_work":{"arxiv_id":"2502.14739","doi":"10.48550/arxiv.2502.14739","metadata_source":"pith","pith_arxiv_id":"2502.14739","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SuperGPQA: Scaling LLM Evaluation across 285 Graduate Disciplines","venue":"cs.CL","work_id":"58a97b2d-494b-4c1a-bd65-13fa6bb7f8f6","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2502.14739","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:c001174745eff62c681ac5a934a778adcc91a868d7e6796c575206f1fa105a65","observation_id":"d079850d-5e14-4808-863b-7949174fd1a9","resolution":{"observed_at":"2026-05-16T00:47:04.366365Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-22T13:52:42.853111+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T13:52:42.853111+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":"2407.21783","doi":"10.1016/s0749-0720(15","metadata_source":"pith","pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Llama 3 Herd of Models","venue":"cs.AI","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:c10c4e429bf65f323be7a9cc1f6456599bcbdf7b735f7ca920c85f949763680e","observation_id":"b482f24f-bbd4-4ed7-81d0-4af0bee93b0f","resolution":{"observed_at":"2026-05-09T06:35:28.488468Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.15393","last_updated":"2024-02-05T16:33:05Z","snapshot_observed_at":"2026-07-06T16:37:31.409792Z","submitted_at":"2023-10-23T22:51:58Z","title":"DoGE: Domain Reweighting with Generalization Estimation","version":2},"cited_work":{"arxiv_id":"2310.15393","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.15393","snapshot_observed_at":"2026-07-03T17:58:46.763967Z","title":"Doge: Domain reweighting with generalization estimation","venue":null,"work_id":"8ad6c744-7172-4f32-8b84-442db774e9b6","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2310.15393","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:e14ac9f8755986670ec8e8ca169ce07e29a1897bcd2e6452c49b4c64219ba55a","observation_id":"0e69eb72-b581-491f-aef7-6907b899adb2","resolution":{"observed_at":"2026-05-09T06:35:28.492131Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04127","last_updated":"2025-01-10T14:31:21Z","snapshot_observed_at":"2026-08-02T00:54:17.243656Z","submitted_at":"2024-06-06T14:49:06Z","title":"Are We Done with MMLU?","version":3},"cited_work":{"arxiv_id":"2406.04127","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04127","snapshot_observed_at":"2026-07-04T19:20:05.653512Z","title":"Are we done with mmlu? CoRR, abs/2406.04127","venue":null,"work_id":"ed71a0fb-b1cc-4fbc-a1d5-01a096a4e957","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2406.04127","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:15a2b2c419778f17eafe5acd2dea07f865a8ea5e5123d5b8b5933810cf98cebf","observation_id":"2f74c340-97fe-47bd-91f8-12ded746f83d","resolution":{"observed_at":"2026-05-09T06:35:28.499063Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.03065","last_updated":"2024-01-05T20:53:51Z","snapshot_observed_at":"2026-07-06T17:12:10.787061Z","submitted_at":"2024-01-05T20:53:51Z","title":"CRUXEval: A Benchmark for Code Reasoning, Understanding and Execution","version":1},"cited_work":{"arxiv_id":"2401.03065","doi":"10.48550/arxiv.2401.03065","metadata_source":"pith","pith_arxiv_id":"2401.03065","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CRUXEval: A Benchmark for Code Reasoning, Understanding and Execution","venue":"cs.SE","work_id":"0daed386-84ea-40ec-bdeb-546f8991fca5","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2401.03065","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:72620cf241cc245b0b12215e5f9a11accfe38062938d580fc3a16cc951051369","observation_id":"3d3bd831-348d-4b8e-ab23-bdb31d9cc0e1","resolution":{"observed_at":"2026-05-14T20:57:16.443569Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-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":"2501.12948","doi":"10.1016/j.artmed.2024.103001","metadata_source":"pith","pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":"cs.CL","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:b91b4772956013c83fbbcfb058bb9f9fec80f1c560751dd43459c1bd429d3310","observation_id":"de132211-36e5-4928-943e-0d0bfd0276ff","resolution":{"observed_at":"2026-05-09T06:35:28.514089Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.15553","last_updated":"2024-11-13T04:26:13Z","snapshot_observed_at":"2026-07-06T19:36:45.701678Z","submitted_at":"2024-10-21T00:59:47Z","title":"Multi-IF: Benchmarking LLMs on Multi-Turn and Multilingual Instructions Following","version":2},"cited_work":{"arxiv_id":"2410.15553","doi":"10.48550/arxiv.2410.15553","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.15553","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multi-if: Benchmarking llms on multi-turn and multilingual instructions following","venue":"arXiv (Cornell University)","work_id":"2e46fb28-13e3-4c54-88b5-a2d47f2a064b","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2410.15553","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:7770b150797a295e64547761e94b545c3df9740b0b07ceb3bc4e00ac19a6b521","observation_id":"23eff24a-7695-4818-97ec-809f5d827dfb","resolution":{"observed_at":"2026-05-09T06:35:28.517996Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06654","last_updated":"2024-08-06T21:48:58Z","snapshot_observed_at":"2026-07-06T17:58:00.820879Z","submitted_at":"2024-04-09T23:41:27Z","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","version":3},"cited_work":{"arxiv_id":"2404.06654","doi":"10.48550/arxiv.2404.06654","metadata_source":"pith","pith_arxiv_id":"2404.06654","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","venue":"cs.CL","work_id":"c0bc4689-3ce8-4e3d-9442-bd74869445bb","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2404.06654","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:34386fd8c4b8ff81c65b000f93404afb0e460023bc9c9658a791bb694b4c5c8e","observation_id":"a77f06ac-0280-4426-aa3b-217160ca3878","resolution":{"observed_at":"2026-05-11T03:55:20.729537Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":"2409.12186","doi":"10.48550/arxiv.2409.12186","metadata_source":"pith","pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2.5-Coder Technical Report","venue":"cs.CL","work_id":"09ba463d-6377-4017-9801-444ffb94b056","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:af0f024e2e0b105e3a11cfc833ad3034354a9b8f0d1c288f42eb490d68ec38c1","observation_id":"e8cf0e69-ee17-4a5a-b03f-614d0f7ece95","resolution":{"observed_at":"2026-05-10T12:33:39.124611Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:18:55.772185+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":"2403.07974","doi":"10.1109/icsme52107.2021.00025","metadata_source":"pith","pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","venue":"cs.SE","work_id":"ea9e51ce-1e75-4182-92d8-4d25f70d2ee4","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:6e9129e4dfe2fa62718ec0df0a9a8d3496ad0561cfa4fd8265b96ee277d4262b","observation_id":"f63573d7-c331-42c2-aec4-b1336a2f0489","resolution":{"observed_at":"2026-05-10T17:34:43.229714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14858","last_updated":"2023-10-26T04:32:49Z","snapshot_observed_at":"2026-07-06T15:32:18.583350Z","submitted_at":"2023-05-24T08:08:26Z","title":"Pre-RMSNorm and Pre-CRMSNorm Transformers: Equivalent and Efficient Pre-LN Transformers","version":2},"cited_work":{"arxiv_id":"2305.14858","doi":"10.48550/arxiv.2305.14858","metadata_source":"arxiv_reference","pith_arxiv_id":"2305.14858","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Shantanu Jain","venue":"arXiv (Cornell University)","work_id":"0dd4090a-6c7b-4585-a4ed-15f4805ab39d","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2305.14858","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:b961d0818850f3e410385cf64b3463a74ccb1a9e2299cdb07ca9242293dd6ef2","observation_id":"16dfbadf-cf28-4349-ae55-b220e447db1a","resolution":{"observed_at":"2026-05-09T06:35:28.540718Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15124","last_updated":"2025-04-14T22:39:09Z","snapshot_observed_at":"2026-07-06T19:55:37.400185Z","submitted_at":"2024-11-22T18:44:04Z","title":"Tulu 3: Pushing Frontiers in Open Language Model Post-Training","version":5},"cited_work":{"arxiv_id":"2411.15124","doi":"10.48550/arxiv.2411.15124","metadata_source":"pith","pith_arxiv_id":"2411.15124","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tulu 3: Pushing Frontiers in Open Language Model Post-Training","venue":"cs.CL","work_id":"28c9dbea-056a-48c2-8000-85f809827e45","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2411.15124","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:62aec077724ca49dbaa69c2b158d0747bdf4035c48e53cbf6efad4b8c42a397b","observation_id":"a7e29e59-5235-4963-bdc1-ea08784dd5a8","resolution":{"observed_at":"2026-05-11T05:06:39.239829Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-23T21:53:00.522112+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T21:53:00.522112+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11939","last_updated":"2024-10-14T18:11:58Z","snapshot_observed_at":"2026-08-02T11:33:41.297984Z","submitted_at":"2024-06-17T17:26:10Z","title":"From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipeline","version":2},"cited_work":{"arxiv_id":"2406.11939","doi":"10.48550/arxiv.2406.11939","metadata_source":"pith","pith_arxiv_id":"2406.11939","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipeline","venue":"cs.LG","work_id":"ad4ca175-a846-44ce-add1-5fd69a8d5c41","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2406.11939","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:f0e3e6bc0f1463b6ade972fd052ce3075de141fd593f8950729f659a16dc3c0a","observation_id":"eb5e6986-17d3-4e71-9ca3-c7408c504eac","resolution":{"observed_at":"2026-05-09T06:35:28.553855Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-05-20T23:23:28.73804+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T23:23:28.73804+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-05T13:11:04.104454Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":"2305.20050","doi":"10.1007/bf00262952","metadata_source":"pith","pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Let's Verify Step by Step","venue":"cs.LG","work_id":"6d05b790-04c5-4fd2-91b2-ba1dfdd5770f","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:219d775830fcf7be8a05bd169170f43fcc7d11c0e3cf2c789e2b71a6a64f2e09","observation_id":"78d9d743-9321-4479-95cf-2c42899e7d5b","resolution":{"observed_at":"2026-05-10T15:37:21.446492Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01100","last_updated":"2025-07-15T01:14:25Z","snapshot_observed_at":"2026-07-06T20:30:02.903743Z","submitted_at":"2025-02-03T06:44:49Z","title":"ZebraLogic: On the Scaling Limits of LLMs for Logical Reasoning","version":2},"cited_work":{"arxiv_id":"2502.01100","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01100","snapshot_observed_at":"2026-07-04T18:30:01.604649Z","title":"Zebralogic: On the scaling limits of llms for logical reasoning","venue":null,"work_id":"a87849c2-9339-401d-8ff9-7776817fe025","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2502.01100","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:b52efecdb46a1f1d112388d7054f1a00696432be1eb4f58da5c08224a9a7d16d","observation_id":"dc506c94-06cc-4389-8fe7-c0f6d25fa85b","resolution":{"observed_at":"2026-05-09T06:35:28.564170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":"2412.19437","doi":"10.1016/j.neucom.2023.127063.url:https://www.sciencedirect","metadata_source":"pith","pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"DeepSeek-V3 Technical Report","venue":"cs.CL","work_id":"57d2791d-2219-4c31-a077-afc04b12a75c","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:7ac0618b313ab94ce2e646f033af31bdbee835b50149ecaf610c26fff9b8867b","observation_id":"d9fade7b-f7a2-4cb1-bb88-9bc0b3a71a01","resolution":{"observed_at":"2026-05-09T06:35:28.570224Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00071","last_updated":"2026-02-06T19:40:50Z","snapshot_observed_at":"2026-08-01T02:15:47.181936Z","submitted_at":"2023-08-31T18:18:07Z","title":"YaRN: Efficient Context Window Extension of Large Language Models","version":3},"cited_work":{"arxiv_id":"2309.00071","doi":"10.48550/arxiv.2309.00071","metadata_source":"pith","pith_arxiv_id":"2309.00071","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"YaRN: Efficient Context Window Extension of Large Language Models","venue":"cs.CL","work_id":"31f454a9-7de2-4696-86f2-9bfa1410f80d","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2309.00071","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:41b0f49489444d5bbfb4c1ddc51fb6d1565a8ea0bfa984e1c2e0195503577c6f","observation_id":"59c6e2d2-9f2c-46f4-b7ba-a57a24b25829","resolution":{"observed_at":"2026-05-12T06:46:51.373347Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11873","last_updated":"2025-02-04T02:07:37Z","snapshot_observed_at":"2026-07-06T20:23:40.374376Z","submitted_at":"2025-01-21T04:04:39Z","title":"Demons in the Detail: On Implementing Load Balancing Loss for Training Specialized Mixture-of-Expert Models","version":2},"cited_work":{"arxiv_id":"2501.11873","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.11873","snapshot_observed_at":"2026-07-04T06:29:38.231668Z","title":"Demons in the detail: On implementing load balancing loss for training specialized mixture-of-expert models, 2025 a","venue":null,"work_id":"1625236e-e6d2-4e4d-bc26-db51815098e7","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2501.11873","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:28474135a86f668e58226428006049c6468e246aea6263dfd005ab447bfed5ed","observation_id":"3fb5fb12-d4c3-4807-a719-3be2e722a6dd","resolution":{"observed_at":"2026-05-09T06:35:28.577251Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01257","last_updated":"2025-01-03T16:36:12Z","snapshot_observed_at":"2026-07-31T19:08:41.925451Z","submitted_at":"2025-01-02T13:49:00Z","title":"CodeElo: Benchmarking Competition-level Code Generation of LLMs with Human-comparable Elo Ratings","version":2},"cited_work":{"arxiv_id":"2501.01257","doi":"10.48550/arxiv.2501.01257","metadata_source":"pith","pith_arxiv_id":"2501.01257","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Codeelo: Benchmarking competition-level code generation of llms with human-comparable elo ratings","venue":"cs.CL","work_id":"0e51dc65-57bb-4087-88e2-fae021a4fec7","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2501.01257","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:4845ca8a86f7b28066f3c7d1db933c61cc1c6a187799c5638504ca1954e4008a","observation_id":"d3ac7d4f-3fd2-4b35-abfa-1568aaa272c6","resolution":{"observed_at":"2026-05-09T06:35:28.581174Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12022","last_updated":"2023-11-20T18:57:34Z","snapshot_observed_at":"2026-08-04T22:55:15.345443Z","submitted_at":"2023-11-20T18:57:34Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","version":1},"cited_work":{"arxiv_id":"2311.12022","doi":"10.48550/arxiv.2311.12022","metadata_source":"pith","pith_arxiv_id":"2311.12022","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","venue":"cs.AI","work_id":"9e2a976b-f5ad-4aee-af5c-243fe0fe75d2","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2311.12022","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:b5522403d192953db8c6054b5e61bdad0e0c033d15289d07295103491dab30db","observation_id":"97e30be8-daf7-437a-a61e-c6eee9123e02","resolution":{"observed_at":"2026-05-11T04:00:34.729655Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-01T04:38:46.941438+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T04:38:46.941438+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.19799","last_updated":"2024-11-29T16:03:14Z","snapshot_observed_at":"2026-07-06T19:58:57.119904Z","submitted_at":"2024-11-29T16:03:14Z","title":"INCLUDE: Evaluating Multilingual Language Understanding with Regional Knowledge","version":1},"cited_work":{"arxiv_id":"2411.19799","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.19799","snapshot_observed_at":"2026-07-02T13:26:58.833519Z","title":"Include: Evaluating multilingual language understanding with regional knowledge","venue":null,"work_id":"3d4055bc-6a62-4823-a62b-b5457a2d6114","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2411.19799","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:b2de9d224befbb1eb8420cbf0da31e85109dabf089da32f55daff9f5a0dbe3bf","observation_id":"7559d1bd-ac40-4eb6-99cc-2e47914b6272","resolution":{"observed_at":"2026-05-09T06:35:28.592152Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":"2402.03300","doi":"10.1016/0004-3702(73)90011-8","metadata_source":"pith","pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","venue":"cs.CL","work_id":"c5006563-f3ec-438a-9e35-b7b484f34828","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:9e28079c17c4ee1afd36b4aab781b96ccf375636f6ac0396a841085ac2e92c05","observation_id":"fddf4c5b-6d6f-4393-b59a-d2934a7e0fe0","resolution":{"observed_at":"2026-05-09T06:35:28.596752Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17407","last_updated":"2025-08-01T10:09:29Z","snapshot_observed_at":"2026-07-06T20:41:51.646955Z","submitted_at":"2025-02-24T18:36:15Z","title":"Linguistic Generalizability of Test-Time Scaling in Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":"2502.17407","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.17407","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Linguistic generalizability of test-time scaling in mathematical reasoning","venue":null,"work_id":"1c0fbadc-b9cd-4bd8-b1dc-e11bf6d14485","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2502.17407","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:7a282845b7a786bd8d9f976bda73b03f14b2bbb90fde181299f8de5948879930","observation_id":"fd670f32-af9d-43d2-ba4c-3222834f5dcd","resolution":{"observed_at":"2026-05-09T06:35:28.604218Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19786","last_updated":"2025-03-25T15:52:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-25T15:52:34Z","title":"Gemma 3 Technical Report","version":1},"cited_work":{"arxiv_id":"2503.19786","doi":"10.1007/978-3-540-48085-3_36","metadata_source":"pith","pith_arxiv_id":"2503.19786","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gemma 3 Technical Report","venue":"cs.CL","work_id":"f93e08bf-9e96-409b-8ac6-b8385fd17fd7","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:b42059e9a2cdecefd4e17ba90b2a77a3fc9a9189b3af4b9829de9f7837f5fb90","observation_id":"62295fd4-ecaf-4dc4-80fa-d10bed31b59e","resolution":{"observed_at":"2026-05-09T06:35:28.607501Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01574","last_updated":"2024-11-06T02:54:00Z","snapshot_observed_at":"2026-08-06T00:29:17.674418Z","submitted_at":"2024-06-03T17:53:00Z","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark","version":6},"cited_work":{"arxiv_id":"2406.01574","doi":"10.1145/3711896.3737413","metadata_source":"pith","pith_arxiv_id":"2406.01574","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark","venue":"cs.CL","work_id":"3c028052-035a-4c22-b80e-3046edb44adc","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2406.01574","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:e83c386cd232e76fac6a684881744da908865ae1e13a92c16a0b362fb8606a78","observation_id":"add70447-8e26-4327-81e8-9795bd1463e3","resolution":{"observed_at":"2026-05-11T15:51:14.588885Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19314","last_updated":"2025-04-18T19:36:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-27T16:47:42Z","title":"LiveBench: A Challenging, Contamination-Limited LLM Benchmark","version":2},"cited_work":{"arxiv_id":"2406.19314","doi":"10.48550/arxiv.2406.19314","metadata_source":"pith","pith_arxiv_id":"2406.19314","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LiveBench: A Challenging, Contamination-Limited LLM Benchmark","venue":"cs.CL","work_id":"6b2b33bf-350e-4ee2-b8a7-f011e53384e7","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2406.19314","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:b8becdf02fcf6af8d7e583b82adfa8b56e0632d0390ae723402a670cba9b3a66","observation_id":"16f5ea87-354e-44e3-80b1-635c47bebc15","resolution":{"observed_at":"2026-05-15T04:48:26.603034Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.05244","doi":"10.48550/arxiv.2503.05244","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Writingbench: A comprehensive benchmark for generative writing","venue":"ArXiv.org","work_id":"5774b752-d28b-4cfa-a210-263ec3308ef7","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:4d6060c91e4fc199c593b28f4dc2497d6446d3059dc6b9a18d04c91dceb32975","observation_id":"e5e4eab7-1a19-4637-93e3-28c5a550f22a","resolution":{"observed_at":"2026-05-09T06:35:28.621261Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16039","last_updated":"2023-11-14T01:40:13Z","snapshot_observed_at":"2026-07-06T16:24:38.375055Z","submitted_at":"2023-09-27T21:41:49Z","title":"Effective Long-Context Scaling of Foundation Models","version":3},"cited_work":{"arxiv_id":"2309.16039","doi":"10.48550/arxiv.2309.16039","metadata_source":"arxiv_reference","pith_arxiv_id":"2309.16039","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A., Oguz, B., et al","venue":"arXiv (Cornell University)","work_id":"100ca4eb-be6f-4510-9c7f-bbb24f10d946","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2309.16039","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:403aebe2f435fffa3b5ec1e473d25bee61fb4733a9356ae028243403a02c2ec4","observation_id":"a8d8f529-d730-47bb-b74f-28e120acbda6","resolution":{"observed_at":"2026-05-09T06:35:28.628333Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":"2407.10671","doi":"10.18653/v1/2024.naacl-long.246","metadata_source":"pith","pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2 Technical Report","venue":"cs.CL","work_id":"a1857881-ab9b-4b80-9b5f-9ae4b5c2566d","year":2024},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:0772889d9a393bb26cb3e8e2a77102050035b7633ce7cb4ada34e08508539bcd","observation_id":"838077f3-4074-49ab-9cd0-a8faccda9e42","resolution":{"observed_at":"2026-05-10T14:09:09.439499Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07911","last_updated":"2023-11-14T05:13:55Z","snapshot_observed_at":"2026-07-06T16:47:08.877195Z","submitted_at":"2023-11-14T05:13:55Z","title":"Instruction-Following Evaluation for Large Language Models","version":1},"cited_work":{"arxiv_id":"2311.07911","doi":"10.48550/arxiv.2311.07911","metadata_source":"pith","pith_arxiv_id":"2311.07911","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Instruction-Following Evaluation for Large Language Models","venue":"cs.CL","work_id":"3aa06177-125a-4f5a-8f4a-8070c5986c26","year":2023},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2311.07911","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:4c443daf5b0203870d6823daea92cf015bd4e33f923d499b5363860132f48202","observation_id":"3a12e641-6d06-489f-989c-c1cf2aeb82ff","resolution":{"observed_at":"2026-05-09T06:35:28.636806Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16906","last_updated":"2025-02-24T07:02:31Z","snapshot_observed_at":"2026-08-05T03:35:32.910265Z","submitted_at":"2025-02-24T07:02:31Z","title":"AutoLogi: Automated Generation of Logic Puzzles for Evaluating Reasoning Abilities of Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.16906","doi":"10.48550/arxiv.2502.16906","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16906","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Autologi: Automated generation of logic puzzles for evaluating reasoning abilities of large language models","venue":"ArXiv.org","work_id":"b873f3d4-53ba-4291-9d0a-45aacb41b687","year":2025},"citing_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-09T06:35:27.813995Z"},"links":{"cited_paper":"/paper/2502.16906","citing_paper":"/paper/2505.09388"},"observation_digest":"sha256:2877846dc37fb5463e5c9de3d043c19ceee37da6c4897fcbdf6aa5fc4cfb9eda","observation_id":"61d70467-2d93-4894-ab2b-12127d00e68c","resolution":{"observed_at":"2026-05-09T06:35:28.391593Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":6,"parse_uncertain":0,"unresolved":1,"verified_exact":34,"verified_fuzzy":0},"total_outbound_references":41},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 100 inbound Pith citation observations for arXiv:2505.09388."}