{"as_of":"2026-08-06T13:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb40f2d8cec61e66a4e9ce31643b73082a2b4cdb3adf7972c46f3760b6621950","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T05:48:30.118982Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T00:48:56.892634Z","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-03T21:08:58.855149Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"cited_work":{"arxiv_id":"2605.22106","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.22106","snapshot_observed_at":"2026-07-03T21:08:58.855149Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","venue":"cs.AI","work_id":"ea00e12a-97da-4cdb-8f15-310c63c24484","year":2026},"citing_paper":{"arxiv_id":"2606.17735","last_updated":"2026-06-16T09:55:45Z","snapshot_observed_at":"2026-08-06T04:38:28.462018Z","submitted_at":"2026-06-16T09:55:45Z","title":"Shattering the Autoregressive Curse: Dynamic Epistemic Entropy Orchestrated Erasable Reinforcement Learning for LLMs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T00:48:56.892634Z"},"links":{"cited_paper":"/paper/2605.22106","citing_paper":"/paper/2606.17735"},"observation_digest":"sha256:f41170414ff0fc0546b739408146cdf13b44f0e259d64bea9b793e339257f2f6","observation_id":"aa43bd65-83b7-400c-83d7-429dca86b6c5","resolution":{"observed_at":"2026-07-03T21:08:58.857588Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2605.22106/citation-record","integrity":"/paper/2605.22106/integrity","json":"/paper/2605.22106/citation-record.json","paper":"/paper/2605.22106"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.13245","last_updated":"2023-12-23T17:55:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-22T17:16:38Z","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","version":3},"cited_work":{"arxiv_id":"2305.13245","doi":"10.48550/arxiv.2305.13245","metadata_source":"pith","pith_arxiv_id":"2305.13245","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","venue":"cs.CL","work_id":"b73ad5b2-e553-4c71-b0c9-67e67ba7b158","year":2023},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2305.13245","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:73320a549eb79b4ae704a147d752fe569d74a8c39d4a410c7a8b0230a44b83a5","observation_id":"07ee87d1-5f1d-4078-bb59-2e304af20053","resolution":{"observed_at":"2026-05-22T05:51:08.787907Z","resolver_source":"local_arxiv","status":"verified_exact"},"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.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":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2502.13923","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:0833755879b2ef8afdb803f1fc74a7d3cab8483b52b1a54f68bdd9ce3c81de0f","observation_id":"b5a0769d-3b4a-4ae1-b370-c9fd7f80fa10","resolution":{"observed_at":"2026-05-22T05:51:08.737797Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-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-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-04T15:46:25.710484Z","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":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:24272643e71eeec57d53e6f14c9d52ee4afc76f68b1a8df544de7cf5eef7f69d","observation_id":"f720a30c-1ba0-4fbd-897e-2cf8f40a088c","resolution":{"observed_at":"2026-05-22T05:51:08.727280Z","resolver_source":"local_arxiv","status":"verified_exact"},"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.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-07-06T20:41:01.690687Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":"2502.16235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic parallel tree search for efficient llm reasoning.arXiv preprint arXiv:2502.16235","venue":null,"work_id":"083bbe1b-b7d3-44f0-af4a-830cc2bd105f","year":2025},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:273684ef1fcce01548c81dd9475b52bd0ea103dd66d55aad2868838d011eee7d","observation_id":"c49bdb0d-81f4-447a-89c5-7033e0d8c3ed","resolution":{"observed_at":"2026-05-22T05:51:08.777955Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"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":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:27c85e46b6065db5727e541341b5989fea4c321be4b0e40fcc68c65befcc023a","observation_id":"757ea361-b228-427a-baff-53c3187369f1","resolution":{"observed_at":"2026-05-22T05:51:08.732645Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2407.11550","last_updated":"2025-10-16T13:25:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-16T09:53:32Z","title":"Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference","version":5},"cited_work":{"arxiv_id":"2407.11550","doi":"10.48550/arxiv.2407.11550","metadata_source":"pith","pith_arxiv_id":"2407.11550","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference","venue":"cs.CL","work_id":"b41eb6db-193f-48ba-8278-6b1698524755","year":2024},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2407.11550","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:1f836493e48afccaecf30a3ea15bc5f0609c35ee225c76890be7c6df139a2d09","observation_id":"618041a0-879a-4b29-910b-00e4247ace06","resolution":{"observed_at":"2026-05-22T05:51:08.742724Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-05-25T13:53:26.442662+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.442662+00:00","source":"openalex_status_cache"},{"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-06-05T21:23:00.469572Z","title":"Springer Nature","venue":null,"work_id":"9744a0e4-d414-43a9-858c-61b8d79764c2","year":2024},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:9c506b28c2cab1073263f777bd91d78e209d6b9ad323921c3f3818c783546628","observation_id":"dd2cc7c0-06f3-4db3-b9c0-f51e40f4103a","resolution":{"observed_at":"2026-05-22T05:54:39.746658Z","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":"2310.01801","last_updated":"2024-10-29T18:26:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-03T05:17:08Z","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","version":4},"cited_work":{"arxiv_id":"2310.01801","doi":"10.48550/arxiv.2310.01801","metadata_source":"pith","pith_arxiv_id":"2310.01801","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","venue":"cs.CL","work_id":"91379982-466d-4895-96f5-079b66259a73","year":2023},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2310.01801","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:7eace243b602481b162b446ab14fdae8e5244acfc1de12f597f8bd100e9cfe03","observation_id":"24af4d0f-5554-47e0-9a4a-c9e0bac341ac","resolution":{"observed_at":"2026-05-22T05:51:08.767367Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"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":"2103.03874","doi":"10.48550/arxiv.2103.03874","metadata_source":"pith","pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","venue":"cs.LG","work_id":"50652ac6-fb7c-4675-a2c2-159c241feb17","year":2021},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:91c4e29d99fb4236378798a68179d5776b0ba5a3dfa4076408e75bfd0559c285","observation_id":"0210d729-acee-4f4c-bb0a-c6bad8de5c28","resolution":{"observed_at":"2026-05-22T05:51:08.772303Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07-14T18:20:22.649941+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T18:20:22.649941+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.01290","last_updated":"2026-05-07T18:13:59Z","snapshot_observed_at":"2026-08-05T22:16:06.601324Z","submitted_at":"2025-10-01T04:09:02Z","title":"ThinKV: Thought-Adaptive KV Cache Compression for Efficient Reasoning Models","version":2},"cited_work":{"arxiv_id":"2510.01290","doi":"10.48550/arxiv.2510.01290","metadata_source":"pith","pith_arxiv_id":"2510.01290","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"ThinKV: Thought-Adaptive KV Cache Compression for Efficient Reasoning Models","venue":"cs.LG","work_id":"5ad7daa8-9125-4fb5-ba94-3517e19f89f7","year":2025},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2510.01290","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:707005ef343b04acfe9fa6488257b407710927a7177e70264ed452e0715df8ad","observation_id":"4d477e04-f924-4f1b-ae80-cf9ca9439246","resolution":{"observed_at":"2026-05-22T05:51:08.782953Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-05-25T13:53:32.799364+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:32.799364+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02150","last_updated":"2019-11-06T00:19:05Z","snapshot_observed_at":"2026-07-06T08:35:01.386074Z","submitted_at":"2019-11-06T00:19:05Z","title":"Fast Transformer Decoding: One Write-Head is All You Need","version":1},"cited_work":{"arxiv_id":"1911.02150","doi":"10.48550/arxiv.1911.02150","metadata_source":"pith","pith_arxiv_id":"1911.02150","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast Transformer Decoding: One Write-Head is All You Need","venue":"cs.NE","work_id":"160ea164-b1d4-4adb-8ccb-a4655d8a0bb4","year":2019},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/1911.02150","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:bb543c877b36b2abb8427375e76e7ad8428c6f73040954d4a58181492cbbc538","observation_id":"ffb3bde4-8803-4975-8a64-470b01731d6d","resolution":{"observed_at":"2026-05-22T05:51:08.751845Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2203.11171","last_updated":"2023-03-07T17:57:37Z","snapshot_observed_at":"2026-07-06T12:50:22.773056Z","submitted_at":"2022-03-21T17:48:52Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","version":4},"cited_work":{"arxiv_id":"2203.11171","doi":"10.1101/2025.04.03.646459","metadata_source":"pith","pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","venue":"cs.CL","work_id":"8c6d5a6b-b5cc-4105-9c84-9c34bb9375bb","year":2022},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:187ec35076134209904be30a0d85f94d0d39088fbd87374434cbdba04965ebb9","observation_id":"3a738808-cd33-43b1-89a9-3e2ec4f862cc","resolution":{"observed_at":"2026-05-22T05:51:08.746700Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-05-21T18:52:42.88633+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T18:52:42.88633+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17453","last_updated":"2024-04-07T00:56:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-29T17:59:56Z","title":"Efficient Streaming Language Models with Attention Sinks","version":4},"cited_work":{"arxiv_id":"2309.17453","doi":"10.48550/arxiv.2309.17453","metadata_source":"pith","pith_arxiv_id":"2309.17453","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Streaming Language Models with Attention Sinks","venue":"cs.CL","work_id":"a8d25452-c237-48c9-88a4-682717c3979a","year":2023},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2309.17453","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:08d00596335e6b174d9116c9478cebabfe4161669b1a214134cb648850eb87c5","observation_id":"99b694a7-d042-4ecf-88d3-021cbb2001f0","resolution":{"observed_at":"2026-05-22T05:51:08.756704Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2310.04406","last_updated":"2024-06-06T02:51:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-06T17:55:11Z","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","version":3},"cited_work":{"arxiv_id":"2310.04406","doi":"10.48550/arxiv.2310.04406","metadata_source":"pith","pith_arxiv_id":"2310.04406","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","venue":"cs.AI","work_id":"810dbb8b-e954-4797-bf0d-5d8cad94e524","year":2023},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2310.04406","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:eab002882ee2f99ebb1b790ed8ae9c83c0bddc82cb067c62660c59636567a1ec","observation_id":"6ed46c50-9189-46b6-ba47-e4e3633f19bd","resolution":{"observed_at":"2026-05-22T05:51:08.761831Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2605.22106","last_updated":"2026-05-21T07:40:57Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T23:32:30.578213Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":13,"verified_fuzzy":1},"total_outbound_references":14},"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 6 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 1 inbound Pith citation observation for arXiv:2605.22106."}