{"as_of":"2026-08-10T19:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8794d04ba57bb5a7dc55cdeb71daba4be7d77ee96b77cd8830e6fbdaad2d695","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":23,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T04:30:14.503529Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":7,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2404.14294","last_updated":"2024-07-19T04:47:36Z","snapshot_observed_at":"2026-07-06T18:03:47.096406Z","submitted_at":"2024-04-22T15:53:08Z","title":"A Survey on Efficient Inference for Large Language Models","version":3},"reference_index":111,"source":"pdf_text","source_observed_at":"2026-05-15T02:39:33.007894Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2404.14294"},"observation_digest":"sha256:223b22e503423c4f196c5c8211b3b39380e15debc25961ae3cc917dc6782ecb6","observation_id":"5df63f8b-9d33-44e0-94ca-b8818c6cd662","resolution":{"observed_at":"2026-05-15T02:39:33.379404Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2408.12935","last_updated":"2026-05-13T07:56:42Z","snapshot_observed_at":"2026-08-02T12:48:59.218457Z","submitted_at":"2024-08-23T09:33:48Z","title":"AI Safety Landscape for Large Language Models: Taxonomy, State-of-the-art, and Future Directions","version":4},"reference_index":150,"source":"pdf_text","source_observed_at":"2026-05-23T21:54:26.670284Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2408.12935"},"observation_digest":"sha256:08b0c71bd65f38447b3fe3281030db2409cad0854fa3231d3e9b47b98f5df613","observation_id":"a11ad5dc-7073-471b-a5e2-d670ee99f0ba","resolution":{"observed_at":"2026-05-23T21:55:49.952631Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-09T13:40:56.434433Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02040","last_updated":"2025-02-04T06:13:52Z","snapshot_observed_at":"2026-08-09T14:19:20.730533Z","submitted_at":"2025-02-04T06:13:52Z","title":"M2R2: Mixture of Multi-Rate Residuals for Efficient Transformer Inference","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T13:40:56.434433Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2502.02040"},"observation_digest":"sha256:7a7eaf2834e062e8da449606f82c154725af391b35f34b3292bad9ac4d3c8368","observation_id":"e26b19c1-73ca-4a02-901d-1d9b158496c8","resolution":{"observed_at":"2026-08-09T13:40:56.434433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-08T15:24:46.308313Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06474","last_updated":"2025-02-10T13:52:52Z","snapshot_observed_at":"2026-08-10T10:35:02.905372Z","submitted_at":"2025-02-10T13:52:52Z","title":"UniMoD: Efficient Unified Multimodal Transformers with Mixture-of-Depths","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:46.308313Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2502.06474"},"observation_digest":"sha256:73dd83e4ab5be75564ff77911488004084dfa68638b8176c398e45da58966cf2","observation_id":"9ab3af2b-2f8d-4b4c-bcae-ff369ea093b4","resolution":{"observed_at":"2026-08-08T15:24:46.308313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-07T14:51:51.501090Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.17420","last_updated":"2025-05-23T03:10:11Z","snapshot_observed_at":"2026-08-09T16:45:40.294440Z","submitted_at":"2025-05-23T03:10:11Z","title":"DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policies","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T14:51:51.501090Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2505.17420"},"observation_digest":"sha256:c52a0dadb1f17e31d315b4b5130e3831ae67c8289a9bbe854c53078c8f5028b7","observation_id":"76a8c7e2-caa3-4204-8c28-77bb60f2d59f","resolution":{"observed_at":"2026-08-07T14:51:51.501090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-07T14:27:37.871305Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18962","last_updated":"2025-05-31T15:08:41Z","snapshot_observed_at":"2026-08-09T13:11:14.871776Z","submitted_at":"2025-05-25T03:35:49Z","title":"System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcuts","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:37.871305Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2505.18962"},"observation_digest":"sha256:e8330a22710b6676a304c539c6a2347bcb8716e600a2eccbd1050a4082778d9b","observation_id":"ac8afd31-eb27-4983-b3d3-4b83630c0fbf","resolution":{"observed_at":"2026-08-07T14:27:37.871305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-07T12:35:10.411437Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24196","last_updated":"2025-05-30T04:15:06Z","snapshot_observed_at":"2026-08-08T01:17:54.225702Z","submitted_at":"2025-05-30T04:15:06Z","title":"CLaSp: In-Context Layer Skip for Self-Speculative Decoding","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:10.411437Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2505.24196"},"observation_digest":"sha256:2abed0e56b695ea66fffdaf2b65b0b48632c186a0a081335acaa36940884d8a7","observation_id":"a28ec175-a345-4258-aa1f-c00f2cc48c57","resolution":{"observed_at":"2026-08-07T12:35:10.411437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-07T11:02:39.187286Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient LLM inference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03700","last_updated":"2025-06-04T08:32:30Z","snapshot_observed_at":"2026-08-08T01:16:24.422333Z","submitted_at":"2025-06-04T08:32:30Z","title":"AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T11:02:39.187286Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2506.03700"},"observation_digest":"sha256:a657cfbbd45ec995d036f1fa0e635772d98b1effa228c2f2a97f87afba85230a","observation_id":"8387e030-7012-406e-b94c-0a712bcafefc","resolution":{"observed_at":"2026-08-07T11:02:39.187286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-07T10:51:51.465417Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04179","last_updated":"2025-06-04T17:26:31Z","snapshot_observed_at":"2026-08-08T19:35:37.122227Z","submitted_at":"2025-06-04T17:26:31Z","title":"SkipGPT: Dynamic Layer Pruning Reinvented with Token Awareness and Module Decoupling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:51:51.465417Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2506.04179"},"observation_digest":"sha256:d15ccf64d1b55997815cb63d1f86a107cf94595cba4b4f4841c7ecd802e0de1f","observation_id":"1e81d5a2-1bf9-4671-b9ad-37fb719fdde5","resolution":{"observed_at":"2026-08-07T10:51:51.465417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-07T04:59:14.591057Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09351","last_updated":"2025-06-11T03:05:24Z","snapshot_observed_at":"2026-08-09T05:26:14.069417Z","submitted_at":"2025-06-11T03:05:24Z","title":"DIVE into MoE: Diversity-Enhanced Reconstruction of Large Language Models from Dense into Mixture-of-Experts","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:59:14.591057Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2506.09351"},"observation_digest":"sha256:225fd6cda57757ac5636c1f11fd5e11d58f3a152996ad50dd8cf05cd0946d425","observation_id":"f4905ae9-ab05-421f-bcd0-23469d277d8a","resolution":{"observed_at":"2026-08-07T04:59:14.591057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-06T20:08:06.884228Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03865","last_updated":"2025-08-16T11:42:58Z","snapshot_observed_at":"2026-08-08T01:22:26.944755Z","submitted_at":"2025-07-05T02:29:23Z","title":"OrthoRank: Token Selection via Sink Token Orthogonality for Efficient LLM inference","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T20:08:06.884228Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2507.03865"},"observation_digest":"sha256:713fd2aa3d9da4d7056427fdb1979558dff90868683e8ecd309a694dba5313d7","observation_id":"8fe2c9d0-f948-465b-942a-3381ee8bc030","resolution":{"observed_at":"2026-08-06T20:08:06.884228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T14:42:32.599010Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference.arXiv preprint arXiv:2307.02628, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21046","last_updated":"2026-05-27T08:39:30Z","snapshot_observed_at":"2026-08-05T14:42:31.889948Z","submitted_at":"2025-08-28T17:50:58Z","title":"CogVLA: Cognition-Aligned Vision-Language-Action Model via Instruction-Driven Routing & Sparsification","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:42:32.599010Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2508.21046"},"observation_digest":"sha256:a1c5ed3f953d0a50b765f767d13626cc4dbf44832adee33794d36226ccb25507","observation_id":"67315da6-4d1b-44f4-ab48-8590e629b0a2","resolution":{"observed_at":"2026-08-05T14:42:32.599010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2511.13587","last_updated":"2026-05-06T17:25:23Z","snapshot_observed_at":"2026-08-02T09:31:56.345280Z","submitted_at":"2025-11-17T16:50:58Z","title":"VVS: Accelerating Speculative Decoding for Visual Autoregressive Generation via Partial Verification Skipping","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-17T21:34:14.371914Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2511.13587"},"observation_digest":"sha256:bab4920e5a7555f03c55d1fc8eb3dda65a1c2418d95af12f2a51fb727e7b94f4","observation_id":"fa2da869-017f-4f5f-8bc1-2d4616a095ca","resolution":{"observed_at":"2026-05-17T21:35:17.569538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-03T01:09:59.784748Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference.arXiv preprint arXiv:2307.02628,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.10431","last_updated":"2026-07-02T02:57:57Z","snapshot_observed_at":"2026-08-10T10:35:02.362305Z","submitted_at":"2026-02-11T02:19:11Z","title":"QTALE: Quantization-Robust Token-Adaptive Layer Execution for LLMs","version":4},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T01:09:59.784748Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2602.10431"},"observation_digest":"sha256:655e5e6ab4abd64c52640b0085eaddc4920d2fe32f6fe4acd1bf46126ee4875c","observation_id":"f9d686ef-61f8-41bd-9c6d-53bf6b1067af","resolution":{"observed_at":"2026-08-03T01:09:59.784748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2604.07857","last_updated":"2026-04-09T06:13:59Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T06:13:59Z","title":"Networking-Aware Energy Efficiency in Agentic AI Inference: A Survey","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T17:39:02.634334Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2604.07857"},"observation_digest":"sha256:bbe0b64ebe27bf92b18fefd7a18f55aa90007d522b80403e08082b8b442f702c","observation_id":"1dfb2969-6b3f-41d5-bc01-e6d110b2d784","resolution":{"observed_at":"2026-05-11T06:25:58.530651Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2604.15764","last_updated":"2026-04-17T07:08:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-17T07:08:33Z","title":"When Do Early-Exit Networks Generalize? A PAC-Bayesian Theory of Adaptive Depth","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T09:28:29.238615Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2604.15764"},"observation_digest":"sha256:c2037c2b358a691dd267ebef30485de4518ac32164a45e090fca8863c8871130","observation_id":"346aa319-838f-44e8-b307-fa6bad1c7577","resolution":{"observed_at":"2026-05-10T09:28:38.637794Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2604.17286","last_updated":"2026-04-19T06:59:34Z","snapshot_observed_at":"2026-08-03T04:25:48.631257Z","submitted_at":"2026-04-19T06:59:34Z","title":"Depth Adaptive Efficient Visual Autoregressive Modeling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T06:22:55.035749Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2604.17286"},"observation_digest":"sha256:36cd604334a4eae3752e9c6ab223b4343141551dd7579d24750a340dc44276c2","observation_id":"c95ffadd-1837-459b-af2e-d5db23303a91","resolution":{"observed_at":"2026-05-10T06:26:27.627925Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2604.18396","last_updated":"2026-05-25T07:23:06Z","snapshot_observed_at":"2026-08-05T00:27:40.165419Z","submitted_at":"2026-04-20T15:20:17Z","title":"River-LLM: Large Language Model Seamless Exit Based on KV Share","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-10T04:36:46.851450Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2604.18396"},"observation_digest":"sha256:891651512e009f9a11f961347242608d918c7fada61be6241e3a0a77b0eb4b81","observation_id":"7267a922-ce82-484f-b1ea-449b60807c5a","resolution":{"observed_at":"2026-05-10T12:10:23.273492Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2604.22906","last_updated":"2026-04-24T16:56:53Z","snapshot_observed_at":"2026-08-07T20:25:38.013655Z","submitted_at":"2026-04-24T16:56:53Z","title":"Network Edge Inference for Large Language Models: Principles, Techniques, and Opportunities","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-08T09:45:57.201837Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2604.22906"},"observation_digest":"sha256:4fce618a9162a542c8c15965c5d8dbc7ddb3e93c9ad41aa45627073741642b36","observation_id":"de247a6c-11ba-4492-ac32-750217c5860b","resolution":{"observed_at":"2026-05-11T20:16:10.393173Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":"2307.02628","doi":"10.48550/arxiv.2307.02628","metadata_source":"arxiv_reference","pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":"arXiv (Cornell University)","work_id":"8ddc464a-e657-4c40-8188-95683c73c2d0","year":2023},"citing_paper":{"arxiv_id":"2605.13190","last_updated":"2026-05-13T08:46:17Z","snapshot_observed_at":"2026-08-02T07:44:21.707711Z","submitted_at":"2026-05-13T08:46:17Z","title":"N-vium: Mixture-of-Exits Transformer for Accelerated Exact Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-14T20:46:16.391521Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2605.13190"},"observation_digest":"sha256:67d31efb88fe2df60b77df02f89d5593fa9f8f2619824caef85b4ac948a8931a","observation_id":"765d1458-1b04-4ec3-bec6-1fb1f8c05cd9","resolution":{"observed_at":"2026-05-14T20:47:58.243965Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-02T03:55:40.168571Z","title":"Skipdecode: Autoregressive skip decoding with batching and caching for efficient llm inference","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13735","last_updated":"2026-07-17T08:40:24Z","snapshot_observed_at":"2026-08-10T16:19:24.791384Z","submitted_at":"2026-07-15T11:47:24Z","title":"Constraint-Driven Model Optimization: An Industry Framework for Selecting Compression and Acceleration Techniques in Modern Machine Learning Systems","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T03:55:40.168571Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2607.13735"},"observation_digest":"sha256:e1bf920e4ae6204a87aefda2a8b0b5a10d790c4b8ee965374b3ec3691259f74a","observation_id":"28dd328d-0752-4925-a4a8-742b323b8eca","resolution":{"observed_at":"2026-08-02T03:55:40.168571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-02T02:11:14.454774Z","title":"SkipDecode: Autoregressive skip decoding with batching and caching for efficient llm inference.arXiv preprint arXiv:2307.02628, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14427","last_updated":"2026-07-15T23:38:44Z","snapshot_observed_at":"2026-08-06T08:11:54.028155Z","submitted_at":"2026-07-15T23:38:44Z","title":"Per-Token Fixed-Point Convergence in Depth-Recurrent Transformers","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T02:11:14.454774Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2607.14427"},"observation_digest":"sha256:800c929a45d9af0fe8b0198c02ca42626843af5659cba75ccffb6a3f7e9a7f04","observation_id":"bf4ba506-0967-4a2d-ac28-8682fd074c09","resolution":{"observed_at":"2026-08-02T02:11:14.454774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02628","snapshot_observed_at":"2026-08-10T04:30:14.503529Z","title":"arXiv preprint arXiv:2307.02628 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06411","last_updated":"2026-08-04T05:44:07Z","snapshot_observed_at":"2026-08-10T18:09:54.670522Z","submitted_at":"2026-08-04T05:44:07Z","title":"Learning to Predict Middle-Layer Attention in MLLMs for Visual Token Prunin","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-10T04:30:14.503529Z"},"links":{"cited_paper":"/paper/2307.02628","citing_paper":"/paper/2608.06411"},"observation_digest":"sha256:7a0794aae0b223b9d8ad049e138dc7578bc00b904ace7bd37b96131305ee4f81","observation_id":"c403b17c-df75-49e6-a8f4-2bb4ad3f6767","resolution":{"observed_at":"2026-08-10T04:30:14.503529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2307.02628/citation-record","integrity":"/paper/2307.02628/integrity","json":"/paper/2307.02628/citation-record.json","paper":"/paper/2307.02628"},"outbound":[],"paper":{"arxiv_id":"2307.02628","last_updated":"2023-07-05T19:59:09Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T10:34:53.296935Z","submitted_at":"2023-07-05T19:59:09Z","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 23 inbound Pith citation observations for arXiv:2307.02628."}