{"as_of":"2026-08-20T19:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:33b850cfdd4e4d1604987d1335ab3e07714a39ca849258a8570b85b80bb90172","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:14:56.217903Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2607.15516/citation-record","integrity":"/paper/2607.15516/integrity","json":"/paper/2607.15516/citation-record.json","paper":"/paper/2607.15516"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:14:54.266217Z","title":"ACM ICAIF ’25 Workshop on LLMs and Generative AI for Finance","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.266217Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:7ebe8e42c7ecd2609fffd534fd883a3839dc02797f5d5416fcba5790c990b6ae","observation_id":"a0809f22-7d37-49db-bcae-391ce1b28604","resolution":{"observed_at":"2026-08-01T23:14:54.266217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-08-16T13:09:41.096467Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-01T23:14:54.415492Z","title":"25 Chenchen Gu, Xiang Lisa Li, Rohith Kuditipudi, Percy Liang, and Tatsunori Hashimoto","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.415492Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:ed12431a3e64e1fd6c35e20750a017eed865663bb3d130169b48587d9bb0d047","observation_id":"19eeaa77-46ec-4283-8dda-3a9df4e977ba","resolution":{"observed_at":"2026-08-01T23:14:54.415492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07776","last_updated":"2025-07-13T04:42:28Z","snapshot_observed_at":"2026-08-17T16:59:40.779977Z","submitted_at":"2025-02-11T18:58:04Z","title":"Auditing Prompt Caching in Language Model APIs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07776","snapshot_observed_at":"2026-08-01T23:14:54.505885Z","title":"Accepted ICML","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.505885Z"},"links":{"cited_paper":"/paper/2502.07776","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:deafea359a0c66815673cf9b90f716d3f45db6d7ebb3371be17a5b575e666f0a","observation_id":"e02edf72-1abe-4718-9950-6e60fbc097ef","resolution":{"observed_at":"2026-08-01T23:14:54.505885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05736","last_updated":"2023-12-06T17:02:25Z","snapshot_observed_at":"2026-08-16T14:53:48.767514Z","submitted_at":"2023-10-09T14:10:21Z","title":"LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05736","snapshot_observed_at":"2026-08-01T23:14:54.635607Z","title":"Llmlingua: Compressing prompts for accelerated inference of large language models, 2023a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.635607Z"},"links":{"cited_paper":"/paper/2310.05736","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:207d9c9069e1878c8c77b7c6a0adf2e1f004916f17b46aff5e3f0824ffc2754a","observation_id":"fd748da0-4d6e-40ff-9f9d-b36300ca1cc9","resolution":{"observed_at":"2026-08-01T23:14:54.635607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06839","last_updated":"2024-08-12T03:53:35Z","snapshot_observed_at":"2026-08-16T14:53:21.033889Z","submitted_at":"2023-10-10T17:59:58Z","title":"LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06839","snapshot_observed_at":"2026-08-01T23:14:54.779144Z","title":"Longllmlingua: Accelerating and enhancing llms in long context scenarios via prompt compression, 2023b","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.779144Z"},"links":{"cited_paper":"/paper/2310.06839","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:f3b9c7cd64bfe9221a7faf6f426a7742b37ed76e471ac7a501e44a5feb0e9c11","observation_id":"46dea7f4-22b0-4d06-a52d-df2dee069eef","resolution":{"observed_at":"2026-08-01T23:14:54.779144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03094","last_updated":"2024-08-06T10:51:47Z","snapshot_observed_at":"2026-08-18T11:15:02.779200Z","submitted_at":"2024-08-06T10:51:47Z","title":"500xCompressor: Generalized Prompt Compression for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03094","snapshot_observed_at":"2026-08-01T23:14:55.032941Z","title":"Accepted ACL 2025 Main; University of Cambridge","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.032941Z"},"links":{"cited_paper":"/paper/2408.03094","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:1adbb6b0607561bfbda3df5c9577249864b6ba2ed2f8850757a00b21bec03e99","observation_id":"0a4b7d72-aae2-46c4-93b9-407f4c3e6bdf","resolution":{"observed_at":"2026-08-01T23:14:55.032941Z","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-01T23:14:55.091512Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.091512Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:6cd183942597d3991ddc9f5a9cf072927c7d4a34369cd8e4ff4cbd79676d877d","observation_id":"5dbfb937-72ed-4373-8c73-3dc72786679e","resolution":{"observed_at":"2026-08-01T23:14:55.091512Z","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-01T23:14:55.190278Z","title":"Google; 15 authors","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.190278Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:70194fc8961d0a814b266aea73ac4151cea2815b7e374ecdcc11da07d237afb6","observation_id":"5c176990-f89c-46d2-a762-9301e750ae2d","resolution":{"observed_at":"2026-08-01T23:14:55.190278Z","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-01T23:14:55.353824Z","title":"Evaluation across OpenAI, Anthropic, Google on DeepResearch Bench","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.353824Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:b71bbc2cf55953518a81493cc962231353ca237fda9669ce876c006e80bbbb78","observation_id":"3a274ccf-32db-45c9-8427-627e218378d6","resolution":{"observed_at":"2026-08-01T23:14:55.353824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15504","last_updated":"2024-12-11T01:59:36Z","snapshot_observed_at":"2026-08-16T13:32:12.351412Z","submitted_at":"2024-07-22T09:40:13Z","title":"Fundamental Limits of Prompt Compression: A Rate-Distortion Framework for Black-Box Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.15504","snapshot_observed_at":"2026-08-01T23:14:55.449411Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.449411Z"},"links":{"cited_paper":"/paper/2407.15504","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:00eabe50e965cfab3cb2d92de9b4dc4f974d49a8d4c3d84429dd9a60d260f2a6","observation_id":"4d43ba17-ac2f-4da1-bcc0-d9bfa014d235","resolution":{"observed_at":"2026-08-01T23:14:55.449411Z","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-08-16T00:08:23.767909Z","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-01T23:14:55.597409Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.597409Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:9526e1c7f7cdc15c5050c78c27c1299b15401616279453610d09e62aded3899c","observation_id":"e9066041-dd6e-4d9b-b383-804dfec0f00f","resolution":{"observed_at":"2026-08-01T23:14:55.597409Z","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-01T23:14:55.772582Z","title":"Salesforce AI Research + UIUC","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.772582Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:a208cf288602cd9c05427693fa4d4b65e257222f89d4185edbc7c9f8f2b6b1dc","observation_id":"0601da62-3a69-4f86-925e-e54011795ef7","resolution":{"observed_at":"2026-08-01T23:14:55.772582Z","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-01T23:14:55.841987Z","title":"Accepted ICLR","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.841987Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:60270f951799c0dfd078f0dbd257bfcbe6ad461ae7859c2c5763869bae694496","observation_id":"a733540b-2c0a-402e-9374-f26b32b22f98","resolution":{"observed_at":"2026-08-01T23:14:55.841987Z","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-01T23:14:55.923546Z","title":"Converts code, documentation, PDFs, and images into a NetworkX knowledge graph with Leiden community detection and LLM-extracted concept edges","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.923546Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:9dc9b6b3382bcca71ebd892d82f6995f2d5090f897988da7cf9c6691eca3e643","observation_id":"b7a8842c-8dd5-4631-8fcf-d1e7c6c76164","resolution":{"observed_at":"2026-08-01T23:14:55.923546Z","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-01T23:14:55.980635Z","title":"Shunyu Yao, Noah Shinn, Pedram Razavi, and Karthik Narasimhan.τ-bench: A benchmark for tool-agent-user interaction in real-world domains","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:55.980635Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:9ddc97c09a26fee80e2ecfe5a6f35dab61c6687280dc33ab61b108bafce78523","observation_id":"bf0e75c4-ceb1-4ce9-aa4e-8197b8d7d40c","resolution":{"observed_at":"2026-08-01T23:14:55.980635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12045","last_updated":"2024-06-17T19:33:08Z","snapshot_observed_at":"2026-08-17T20:31:29.818313Z","submitted_at":"2024-06-17T19:33:08Z","title":"$\\tau$-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domains","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12045","snapshot_observed_at":"2026-08-01T23:14:56.055295Z","title":"Sierra Research","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:56.055295Z"},"links":{"cited_paper":"/paper/2406.12045","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:6b4239f4c6a243530b744f562a8cb381cb1a9c891ccb5d8f9459c5824b53fc18","observation_id":"619f889d-f4dc-42ee-af05-cc6a2eb03f25","resolution":{"observed_at":"2026-08-01T23:14:56.055295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.02130","last_updated":"2026-07-24T02:10:35Z","snapshot_observed_at":"2026-08-13T03:06:58.402631Z","submitted_at":"2025-11-03T23:47:49Z","title":"Re-FORC: Adaptive Reward Prediction for Efficient Chain-of-Thought Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.02130","snapshot_observed_at":"2026-08-01T23:14:56.115834Z","title":"Ivan Zakazov, Berke Argin, Oussama Gabouj, Kamel Charaf, Alexander Sharipov, Alexi Semiz, Lorenzo Drudi, Nicolas Baldwin, and Robert West","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:56.115834Z"},"links":{"cited_paper":"/paper/2511.02130","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:d5f52717aa23534a45a4ed0f808f35b4adff17af897c41a745eb1c7c327263c7","observation_id":"bb75c710-b8c2-4b17-a3fb-8b8755367b24","resolution":{"observed_at":"2026-08-01T23:14:56.115834Z","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-01T23:14:56.217903Z","title":"\"\" Feed one observed document version","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:56.217903Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:19b6d4ab7c7ee809aeb6414d7ba437d6fdc55acd4d44f172d3069b6078afc87c","observation_id":"2801332b-4c07-439b-bc95-e961a678a4d8","resolution":{"observed_at":"2026-08-01T23:14:56.217903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-08-10T11:59:11.481480Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-01T23:14:54.054486Z","title":"Joong Ho Choi, Jiayang Zhao, Jeel Shah, Ritvika Sonawane, Vedant Singh, Avani Appalla, Will Flanagan, and Filipe Condessa","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.054486Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:0e0d1c68e927588da50939aa08daf59227af11cda118312ec2318cea418d100b","observation_id":"540d357a-8690-43e4-ac86-9461ff7113a7","resolution":{"observed_at":"2026-08-01T23:14:54.054486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15204","last_updated":"2025-01-03T11:44:51Z","snapshot_observed_at":"2026-08-12T12:34:50.226758Z","submitted_at":"2024-12-19T18:59:17Z","title":"LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15204","snapshot_observed_at":"2026-08-01T23:14:53.715023Z","title":"THUDM; 503 multiple-choice questions, 8k-2M tokens","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:53.715023Z"},"links":{"cited_paper":"/paper/2412.15204","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:03bacd71cb0adad16b8d283ac284fa680b32d0f341533d608d07d1936ce4a109","observation_id":"a7f1a10d-9790-47e9-a803-8c988cda7288","resolution":{"observed_at":"2026-08-01T23:14:53.715023Z","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-01T23:14:53.875090Z","title":"NeurIPS 2025 Poster; 83% hit rate on production prompts","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:53.875090Z"},"links":{"citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:1e6cf80679987e90e51a0805241f335d7fa94b76a06cd067f5e7a009760f54f8","observation_id":"ffe15007-a4c7-4182-82c4-3865fb982245","resolution":{"observed_at":"2026-08-01T23:14:53.875090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.02985","last_updated":"2026-04-03T11:41:53Z","snapshot_observed_at":"2026-08-15T15:06:50.181497Z","submitted_at":"2026-04-03T11:41:53Z","title":"Prompt Compression in the Wild: Measuring Latency, Rate Adherence, and Quality for Faster LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.02985","snapshot_observed_at":"2026-08-01T23:14:54.909730Z","title":"Zongqian Li, Yixuan Su, and Nigel Collier","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.909730Z"},"links":{"cited_paper":"/paper/2604.02985","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:13cf0c2edf5eacdbeb82c18cf02b704341440afb7022f247216e90a35c6e8a71","observation_id":"f79c36e8-5ca0-49ed-ae22-5db0b9c5880d","resolution":{"observed_at":"2026-08-01T23:14:54.909730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T14:06:30.468615Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":22},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2607.15516."}