{"as_of":"2026-08-07T03:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5bb4aba3bceb7afa09d443cee9a073f5421aec4df1b174399760f79fada2e4f1","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:07:02.537106Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.04771/citation-record","integrity":"/paper/2608.04771/integrity","json":"/paper/2608.04771/citation-record.json","paper":"/paper/2608.04771"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.18893","last_updated":"2026-05-27T05:57:00Z","snapshot_observed_at":"2026-07-06T20:57:57.039376Z","submitted_at":"2025-03-24T17:06:37Z","title":"xKV: Cross-Layer KV-Cache Compression via Aligned Singular Vector Extraction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18893","snapshot_observed_at":"2026-08-06T17:07:00.541065Z","title":"Chang,C.-C.;Lin,W.-C.;Lin,C.-Y.;Chen,C.-Y.;Hu,Y.-F.; Wang,P.-S.;Huang,N.-C.;Ceze,L.;Abdelfattah,M.S.;and Wu,K.-C.2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:00.541065Z"},"links":{"cited_paper":"/paper/2503.18893","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:d078441843b123cb825c9d98acb3b61831b53cd1668ed2b86cdb2600f99d85ae","observation_id":"3f7401b1-e66e-4a35-82f9-b95cfafdcffa","resolution":{"observed_at":"2026-08-06T17:07:00.541065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21187","snapshot_observed_at":"2026-08-06T17:07:00.657571Z","title":"Chen, Z.; Wei, Z.; Bai, Y.; Xiong, X.; and Wu, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:00.657571Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:d792d75c2ebc1152162be9567e174290e03e0c97e932bf26e56823e5e5f02e64","observation_id":"23052acf-81c3-4cd9-a423-071ef0845d51","resolution":{"observed_at":"2026-08-06T17:07:00.657571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:07:04.100401Z","title":"InFindings of the Association for Computational Linguistics: ACL 2025, 21539–21564","venue":null,"work_id":"bf6176ee-5bea-4963-9448-28c324340d76","year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:00.768651Z"},"links":{"citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:3e807eaf1a3d33ee9e9810c8601e9aa9b3ab3b9a5da407992cf242889c42981a","observation_id":"fc845da2-56de-4b98-bd43-00d02756bb98","resolution":{"observed_at":"2026-08-06T17:07:04.195709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06261","last_updated":"2025-12-19T14:25:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:36:04Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.06261","snapshot_observed_at":"2026-08-06T17:07:00.917179Z","title":"Feng,S.;Fang,G.;Ma,X.;andWang,X.2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:00.917179Z"},"links":{"cited_paper":"/paper/2507.06261","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:33df9877a92a752b3cb51708ae7153c50dd5f312ffb8867d0cedb2a553467882","observation_id":"2eb70d07-703f-49c1-860c-461436066125","resolution":{"observed_at":"2026-08-06T17:07:00.917179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:07:03.746994Z","title":"InFindings of the Asso- ciation for Computational Linguistics: ACL 2026, 17051– 17064","venue":null,"work_id":"ce069f02-ff3d-4bbd-8a8b-d71d0b97c049","year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.067843Z"},"links":{"citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:138d473c6b730e36a5595cc7c107ddfc0b932101ae9c7dad10805658d87e4ed0","observation_id":"a0cfa119-adc9-4e40-ae43-174ab5186bf9","resolution":{"observed_at":"2026-08-06T17:07:03.795551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-06T17:07:01.139839Z","title":"Han,I.;Kacham,P.;Karbasi,A.;Mirrokni,V.;andZandieh, A.2025a","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.139839Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:1ef69c495b631921fd4d181f665bb6200e47aaf0542364fe2fcc045bb0da9abc","observation_id":"49a984e6-6c44-4cab-b23a-d2eec4bfe0fe","resolution":{"observed_at":"2026-08-06T17:07:01.139839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-06T17:07:01.200943Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.200943Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:ad40da286cc7d2bf192f9819462572e53695754da67488307bed83fd42983c5b","observation_id":"4910617c-f844-4da1-8e5b-cac80449faa1","resolution":{"observed_at":"2026-08-06T17:07:01.200943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.02980","last_updated":"2026-07-03T05:39:00Z","snapshot_observed_at":"2026-08-06T12:25:06.959262Z","submitted_at":"2026-07-03T05:39:00Z","title":"Hierarchical Sparse Attention Done Right: Toward Infinite Context Modeling","version":1},"cited_work":{"arxiv_id":"2607.02980","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.02980","snapshot_observed_at":"2026-08-06T17:07:03.329153Z","title":"Hierarchical Sparse Attention Done Right: Toward Infinite Context Modeling","venue":"cs.CL","work_id":"9e6be9af-8472-4d97-8e59-905972eb1992","year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.285318Z"},"links":{"cited_paper":"/paper/2607.02980","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:1ccca253949d583f9d4eb32d3b57b590633142e16504b60d44f51492cff7ada4","observation_id":"1c088ec5-3752-46d1-85fc-26178c07292f","resolution":{"observed_at":"2026-08-06T17:07:03.397949Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-06T17:07:01.346455Z","title":"Li, H.; Li, Y.; Tian, A.; Tang, T.; Xu, Z.; Chen, X.; Hu, N.; Dong, W.; Li, Q.; and Chen, L","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.346455Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:eab2121a3a96aec1fca3116d5db92caf120f014cc0fbb0c48b04c49975335685","observation_id":"e5d6b42c-067e-41e5-9e1e-efc67620bace","resolution":{"observed_at":"2026-08-06T17:07:01.346455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19825","last_updated":"2025-01-23T08:45:52Z","snapshot_observed_at":"2026-08-06T05:46:44.376142Z","submitted_at":"2024-07-29T09:21:52Z","title":"Concise Thoughts: Impact of Output Length on LLM Reasoning and Cost","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19825","snapshot_observed_at":"2026-08-06T17:07:01.424636Z","title":"Ning, Y.; Li, W.; Fang, J.; Tan, N.; and Liu, H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.424636Z"},"links":{"cited_paper":"/paper/2407.19825","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:5f2fe563daf3d7378f9e6ef5fda060cd88d1b896c83684c41a2f4e98647371da","observation_id":"4a0002bf-6639-46c2-bd20-44e0d630bdf3","resolution":{"observed_at":"2026-08-06T17:07:01.424636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11827","last_updated":"2025-05-25T04:09:29Z","snapshot_observed_at":"2026-08-05T09:49:18.872955Z","submitted_at":"2025-05-17T04:26:39Z","title":"Not All Thoughts are Generated Equal: Efficient LLM Reasoning via Multi-Turn Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11827","snapshot_observed_at":"2026-08-06T17:07:01.503753Z","title":"Ong,I.;Almahairi,A.;Wu,V.;Chiang,W.-L.;Wu,T.;Gon- zalez, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.503753Z"},"links":{"cited_paper":"/paper/2505.11827","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:a80ae588849259fb199eaaf704c79f014aa009db1de4395f8d5615a6da53232f","observation_id":"59fc4700-df1c-4469-b7c4-14d4160378d4","resolution":{"observed_at":"2026-08-06T17:07:01.503753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-07-30T15:06:18.011623Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-06T17:07:01.589061Z","title":"Qiao, Z.; Deng, Y.; Zeng, J.; Wang, D.; Wei, L.; Wang, G.; Meng, F.; Zhou, J.; Ren, J.; and Zhang, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.589061Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:934c92b8561f00882194b3e7bc806b192c7e28f70ecba2ed97f17f4e7571487a","observation_id":"db03dc27-dd94-410c-aad5-6827c9ad12df","resolution":{"observed_at":"2026-08-06T17:07:01.589061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:07:01.673043Z","title":"InProceedingsofthe2025ConferenceonEmpirical Methods in Natural Language Processing, 8021–8040","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.673043Z"},"links":{"citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:1ecbd2e27d3404d24b1eb7a5fb91233709a67380e14b8b0a54e0f2f241d8285b","observation_id":"ebdb3aa2-b3ba-4ebc-b39e-6308be8b0f6a","resolution":{"observed_at":"2026-08-06T17:07:01.673043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.05618","last_updated":"2024-10-19T19:37:40Z","snapshot_observed_at":"2026-08-06T16:36:39.506339Z","submitted_at":"2024-01-11T01:52:25Z","title":"The Benefits of a Concise Chain of Thought on Problem-Solving in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.05618","snapshot_observed_at":"2026-08-06T17:07:01.843310Z","title":"Shi,L.;Zhang,H.;Yao,Y.;Li,Z.;andZhao,H.2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.843310Z"},"links":{"cited_paper":"/paper/2401.05618","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:a107d4f02f47538e1082fa295dd3415fc020736d89a1b1a691901150be1ba533","observation_id":"805f982d-50e4-4eb7-acbc-6268eb00bdc9","resolution":{"observed_at":"2026-08-06T17:07:01.843310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.08324","last_updated":"2026-05-25T15:41:17Z","snapshot_observed_at":"2026-08-03T03:25:21.079471Z","submitted_at":"2026-02-09T06:57:15Z","title":"Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.08324","snapshot_observed_at":"2026-08-06T17:07:01.912817Z","title":"InPro- ceedings of the 63rd Annual Meeting of the Association for ComputationalLinguistics(Volume1:LongPapers),15629– 15644","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.912817Z"},"links":{"cited_paper":"/paper/2602.08324","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:1d67e91e0049e4b33cfa41d40a65fc4cf8e0e67d843b94ae4c58836fed605c20","observation_id":"3d84b4c5-e307-46b6-ab4b-e2182e7b85a1","resolution":{"observed_at":"2026-08-06T17:07:01.912817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13035","last_updated":"2025-03-13T03:16:43Z","snapshot_observed_at":"2026-08-05T10:25:57.608223Z","submitted_at":"2024-06-18T20:01:51Z","title":"D2O: Dynamic Discriminative Operations for Efficient Long-Context Inference of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13035","snapshot_observed_at":"2026-08-06T17:07:01.982112Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.982112Z"},"links":{"cited_paper":"/paper/2406.13035","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:e76bb5e1fe7c82277a100d85453e166baa9d3eb60a1df00e7abf57d0d7b18d12","observation_id":"c3d48be3-8fe0-4a3b-af0c-ffec19f407d7","resolution":{"observed_at":"2026-08-06T17:07:01.982112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.08343","last_updated":"2025-06-18T14:43:36Z","snapshot_observed_at":"2026-07-06T21:39:28.134075Z","submitted_at":"2025-06-10T01:54:04Z","title":"Wait, We Don't Need to \"Wait\"! Removing Thinking Tokens Improves Reasoning Efficiency","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.08343","snapshot_observed_at":"2026-08-06T17:07:02.070191Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.070191Z"},"links":{"cited_paper":"/paper/2506.08343","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:a5acf7b0c0aa29ccf8f1b3aca067f538a5c10ed234990b0f7afe4148d863ec5c","observation_id":"549eccfd-5e7e-4c97-8cf8-65d628511f39","resolution":{"observed_at":"2026-08-06T17:07:02.070191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08454","last_updated":"2024-07-21T02:37:11Z","snapshot_observed_at":"2026-07-06T18:44:49.512236Z","submitted_at":"2024-07-11T12:50:42Z","title":"Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08454","snapshot_observed_at":"2026-08-06T17:07:02.153112Z","title":"Xu, J.; Zhu, Q.; Wu, Y.; Wang, Z.; Zhang, D.; Tian, M.; Duan,Y.;Li,S.;Wei,J.;Han,S.;etal.2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.153112Z"},"links":{"cited_paper":"/paper/2407.08454","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:63df62ae40da3bcba07eed12c9a36c3656bbaec8b6c221750989ad237cce016c","observation_id":"e0cfc844-8e03-42d8-bbfe-f86823a3b740","resolution":{"observed_at":"2026-08-06T17:07:02.153112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.25475","last_updated":"2026-05-25T06:29:43Z","snapshot_observed_at":"2026-08-02T08:45:15.831498Z","submitted_at":"2026-05-25T06:29:43Z","title":"IndexMem: Learned KV-Cache Eviction with Latent Memory for Long-Context LLM Inference","version":1},"cited_work":{"arxiv_id":"2605.25475","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.25475","snapshot_observed_at":"2026-08-06T17:07:02.846094Z","title":"IndexMem: Learned KV-Cache Eviction with Latent Memory for Long-Context LLM Inference","venue":"cs.CL","work_id":"9d4ba6e4-29e1-4ba4-b861-d66dfcaa1846","year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.216605Z"},"links":{"cited_paper":"/paper/2605.25475","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:2ed09a4bc349cdab69e86d63fc2b28c5586c1e545ab49dd9e87f036d20b4a08e","observation_id":"93959c88-548e-4514-83e4-ab896f40bf64","resolution":{"observed_at":"2026-08-06T17:07:02.935451Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03373","last_updated":"2025-02-05T17:13:32Z","snapshot_observed_at":"2026-07-06T20:31:41.231839Z","submitted_at":"2025-02-05T17:13:32Z","title":"Demystifying Long Chain-of-Thought Reasoning in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03373","snapshot_observed_at":"2026-08-06T17:07:02.311998Z","title":"Yue, L.; Du, Y.; Wang, Y.; Gao, W.; Yao, F.; Wang, L.; Liu, Y.;Xu,Z.;Liu,Q.;Di,S.;etal.2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.311998Z"},"links":{"cited_paper":"/paper/2502.03373","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:ea035bd5bfa71a3831622ccb8b064772b309057165a253cd96f378c0763ac9b1","observation_id":"3f881354-a945-4269-a6ce-f1f8beb34ef0","resolution":{"observed_at":"2026-08-06T17:07:02.311998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19874","last_updated":"2025-04-28T15:05:35Z","snapshot_observed_at":"2026-08-01T14:10:27.172555Z","submitted_at":"2025-04-28T15:05:35Z","title":"TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19874","snapshot_observed_at":"2026-08-06T17:07:02.376649Z","title":"Zeng, Z.; Huang, X.; Li, B.; Zhang, H.; and Deng, Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.376649Z"},"links":{"cited_paper":"/paper/2504.19874","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:232ffe87030f4caf9fa74311c2e60afd358fb769665e267bc3f12e9bff91e138","observation_id":"b09b1b72-a8b6-4ee0-b50d-d90f19642436","resolution":{"observed_at":"2026-08-06T17:07:02.376649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19788","last_updated":"2025-06-05T03:15:25Z","snapshot_observed_at":"2026-08-02T13:09:16.561749Z","submitted_at":"2025-05-26T10:18:57Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","version":2},"cited_work":{"arxiv_id":"2505.19788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.19788","snapshot_observed_at":"2026-08-06T17:07:02.637116Z","title":"Done Is Better than Perfect: Unlocking Efficient Reasoning by Structured Multi-Turn Decomposition","venue":"cs.AI","work_id":"c4584192-057e-4110-a44b-c96494460498","year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.442534Z"},"links":{"cited_paper":"/paper/2505.19788","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:df081d86abca0919126d5f312d864fe95ef6f46600a01668654316f6ad93886d","observation_id":"6f0be876-e02f-4e36-a750-4c5dbe3c5d05","resolution":{"observed_at":"2026-08-06T17:07:02.699059Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:07:03.621388Z","title":"InForty-firstinternationalconferenceonmachine learning","venue":null,"work_id":"a84a69fc-0964-4c07-86e7-2f611968dc07","year":2026},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:02.537106Z"},"links":{"citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:914abe169672a44b7d08204e63acd9f5ca38566a63f633a6bb5558a095bc1fa9","observation_id":"39209269-5347-455c-a632-467254c6e068","resolution":{"observed_at":"2026-08-06T17:07:03.659023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-06T17:07:00.834739Z","title":"arXiv preprint arXiv:2110.14168","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:00.834739Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:4f54df08617bb064e54222a23ac8ba52381d0db85c42817bc24c42bd38c3ad4e","observation_id":"c13a16ea-9bbc-4ca1-8f42-ebcf4ab8af63","resolution":{"observed_at":"2026-08-06T17:07:00.834739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12022","snapshot_observed_at":"2026-08-06T17:07:01.757657Z","title":"Renze, M.; and Guven, E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.757657Z"},"links":{"cited_paper":"/paper/2311.12022","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:c3408ccd2d90ce4225e9395b2b0226039ca14af30e089b7a331faed2b1bc6947","observation_id":"a614b709-e4d9-4874-87f2-c23eaaf79da8","resolution":{"observed_at":"2026-08-06T17:07:01.757657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02069","last_updated":"2025-05-15T17:18:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-04T07:51:30Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-06T17:07:00.437098Z","title":"Cao,C.;Li,M.;Dai,J.;Yang,J.;Zhao,Z.;Zhang,S.;Shi,W.; Liu,C.;Han,S.;andGuo,Y.2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:00.437098Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:379f1f9303fedf23b9551440c4b9fba32bcb53b765cb7aa8bd691c8658edaf56","observation_id":"f19a1cce-233f-4218-b01c-f50a35e21906","resolution":{"observed_at":"2026-08-06T17:07:00.437098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.04697","last_updated":"2025-10-03T01:55:58Z","snapshot_observed_at":"2026-08-06T08:53:09.095000Z","submitted_at":"2025-03-06T18:43:29Z","title":"L1: Controlling How Long A Reasoning Model Thinks With Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.04697","snapshot_observed_at":"2026-08-06T17:07:00.309946Z","title":"arXiv preprint arXiv:2503.04697","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:00.309946Z"},"links":{"cited_paper":"/paper/2503.04697","citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:35ae2128a4cbd0452617bf174b873745d30d43eada79cd11eedfcb7f4a349799","observation_id":"7d523cba-690a-46f3-9833-5a0d50c287b0","resolution":{"observed_at":"2026-08-06T17:07:00.309946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:07:03.900986Z","title":"Fu,Y.;Chen,J.;Zhuang,Y.;Fu,Z.;Stoica,I.;andZhang,H","venue":null,"work_id":"790809ab-784c-478e-b853-ef31a75d94b7","year":2025},"citing_paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-06T17:07:01.005716Z"},"links":{"citing_paper":"/paper/2608.04771"},"observation_digest":"sha256:4a5c17484fd447dbc65121c08cd2b6362bfec58fffc6ea21bd4d5295b9907162","observation_id":"5db40434-4347-4daa-9515-279f3e5efbb0","resolution":{"observed_at":"2026-08-06T17:07:03.996112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.04771","last_updated":"2026-08-05T12:36:28Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T03:20:07.616210Z","submitted_at":"2026-08-05T12:36:28Z","title":"Fewer Tokens, Smaller Cache: Reward-Coordinated Efficient Reasoning"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":28},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2608.04771."}