{"as_of":"2026-08-08T15:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff62876ed181d32cd4e87b1eae4ffdbde44d4ec02fd9fba08c23b26deb3092d9","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:17:45.932407Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T21:39:23.683913Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T09:05:57.878259Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"cited_work":{"arxiv_id":"2507.19608","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19608","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deltallm: A training-free framework exploiting temporal sparsity for efficient edge llm inference","venue":null,"work_id":"d906e8ec-ce84-4b12-a9db-3ed4daed8740","year":2025},"citing_paper":{"arxiv_id":"2604.10098","last_updated":"2026-04-11T08:41:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-11T08:41:33Z","title":"Attention Sink in Transformers: A Survey on Utilization, Interpretation, and Mitigation","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-10T16:17:09.834609Z"},"links":{"cited_paper":"/paper/2507.19608","citing_paper":"/paper/2604.10098"},"observation_digest":"sha256:74bae21d7b07e8f715b7a72be2545f1fa61736dd58766ffa79328d7118b2447b","observation_id":"b9c372f8-f66e-4582-b2d8-0b483a5920f6","resolution":{"observed_at":"2026-05-11T09:05:57.881229Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19608","snapshot_observed_at":"2026-07-12T21:39:23.683913Z","title":"Deltallm: A training-free framework exploiting temporal sparsity for efficient edge llm inference.arXiv preprint arXiv:2507.19608,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.00016","last_updated":"2026-04-13T19:30:40Z","snapshot_observed_at":"2026-08-03T00:59:58.175780Z","submitted_at":"2026-04-13T19:30:40Z","title":"AEyeDE: An Attention-Based Attribution Framework for AI-Generated Text Detection","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-12T21:39:23.683913Z"},"links":{"cited_paper":"/paper/2507.19608","citing_paper":"/paper/2606.00016"},"observation_digest":"sha256:f0ec03d2e7ec614d308105345e7a904da95d34027a8e360ad60dadb284e8dcfc","observation_id":"e90559e1-f94b-41f0-b376-5abd55d0a4de","resolution":{"observed_at":"2026-07-12T21:39:23.683913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.19608/citation-record","integrity":"/paper/2507.19608/integrity","json":"/paper/2507.19608/citation-record.json","paper":"/paper/2507.19608"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:43.731989Z","title":"Sparks of artificial general intelligence: Early experiments with gpt-4,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:43.731989Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:a4a7867fb81bcee1ede8c9f0a1f4e41111b379454c596662f972a5454aa03a1a","observation_id":"1bb866c0-c2ee-4039-aba0-55db7ac9af4f","resolution":{"observed_at":"2026-08-06T14:17:43.731989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-06T14:17:43.810078Z","title":"Llama: Open and efficient foundation language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:43.810078Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:10327df3498b70555e2c120ae95a71079103d524cd161a7768135ce52a169272","observation_id":"8cc926ef-9008-46d7-addb-30cbee7a21b6","resolution":{"observed_at":"2026-08-06T14:17:43.810078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14690","last_updated":"2025-02-25T21:00:50Z","snapshot_observed_at":"2026-07-06T19:06:19.400102Z","submitted_at":"2024-08-26T23:30:15Z","title":"Training-Free Activation Sparsity in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14690","snapshot_observed_at":"2026-08-06T14:17:43.859667Z","title":"Training-free activation sparsity in large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:43.859667Z"},"links":{"cited_paper":"/paper/2408.14690","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:fca7339acde431a69de8d0130ce689c5be2b20754623f2095b3abfd2ce4e6b46","observation_id":"d75ec5c4-fa9e-4bc1-91ee-a62d1efc605f","resolution":{"observed_at":"2026-08-06T14:17:43.859667Z","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-06T14:17:43.943050Z","title":"Awq: Activation-aware weight quanti- zation for on-device llm compression and acceleration,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:43.943050Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:fc51104925c37f678cb99b481d759a29638092c9f73d882ff1dfbe01e8ff25a4","observation_id":"c32676cb-7c12-4fdf-bee0-b0dcaa3a82c8","resolution":{"observed_at":"2026-08-06T14:17:43.943050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10774","last_updated":"2024-06-14T23:32:32Z","snapshot_observed_at":"2026-07-06T17:17:56.276857Z","submitted_at":"2024-01-19T15:48:40Z","title":"Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10774","snapshot_observed_at":"2026-08-06T14:17:44.003867Z","title":"Medusa: Simple llm inference acceleration framework with multiple decoding heads,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.003867Z"},"links":{"cited_paper":"/paper/2401.10774","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:ebe7afb739cb9ef7c279344172c878593887f781eb537e25942a14c930d0bc6c","observation_id":"813f3b92-36c4-4764-957c-7f8f3e84f12e","resolution":{"observed_at":"2026-08-06T14:17:44.003867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.07851","last_updated":"2024-06-04T17:08:37Z","snapshot_observed_at":"2026-07-06T17:15:46.395218Z","submitted_at":"2024-01-15T17:26:50Z","title":"Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.07851","snapshot_observed_at":"2026-08-06T14:17:44.088718Z","title":"Unlocking efficiency in large language model infer- ence: A comprehensive survey of speculative decoding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.088718Z"},"links":{"cited_paper":"/paper/2401.07851","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:f2899a02275643bcc89080c44387cf1dc35a4b820ae9767917ff3b8965854291","observation_id":"98267ba7-8eeb-4aeb-9e78-24ce97bd8e69","resolution":{"observed_at":"2026-08-06T14:17:44.088718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11695","last_updated":"2024-05-06T17:47:01Z","snapshot_observed_at":"2026-07-06T15:44:42.776459Z","submitted_at":"2023-06-20T17:18:20Z","title":"A Simple and Effective Pruning Approach for Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11695","snapshot_observed_at":"2026-08-06T14:17:44.141906Z","title":"A simple and effective pruning approach for large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.141906Z"},"links":{"cited_paper":"/paper/2306.11695","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:1fa15494afeb5da43dba82326483df639628fbc61212c52d7b771f7e6bef2a99","observation_id":"c439604b-53ee-472f-a14c-54ce0aaf32a7","resolution":{"observed_at":"2026-08-06T14:17:44.141906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02690","last_updated":"2025-02-12T14:32:46Z","snapshot_observed_at":"2026-07-06T17:55:03.561275Z","submitted_at":"2024-04-03T12:37:34Z","title":"How Sparse Attention Approximates Exact Attention? Your Attention is Naturally $n^C$-Sparse","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02690","snapshot_observed_at":"2026-08-06T14:17:44.221622Z","title":"Attention is naturally sparse with gaussian distributed input,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.221622Z"},"links":{"cited_paper":"/paper/2404.02690","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:2e6e4681585bda9c84ccf7a48c02a9dc4491c06ad8e7fea92f4389d9ce1fc00d","observation_id":"eff45d7b-c6ee-48fb-9095-99acb06129ed","resolution":{"observed_at":"2026-08-06T14:17:44.221622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17453","snapshot_observed_at":"2026-08-06T14:17:44.287910Z","title":"Efficient streaming language models with attention sinks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.287910Z"},"links":{"cited_paper":"/paper/2309.17453","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:d4452942cb3b13f8781363ef8c6609ce336d87fea18a2f3c5465140762120ab5","observation_id":"14b49207-9130-4dc1-aea8-f1372c7c2330","resolution":{"observed_at":"2026-08-06T14:17:44.287910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02490","last_updated":"2024-10-30T14:53:22Z","snapshot_observed_at":"2026-08-07T20:59:29.819833Z","submitted_at":"2024-07-02T17:59:56Z","title":"MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02490","snapshot_observed_at":"2026-08-06T14:17:44.377690Z","title":"Minference 1.0: Accelerating pre-filling for long-context llms via dynamic sparse attention,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.377690Z"},"links":{"cited_paper":"/paper/2407.02490","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:3388a32145c02feaae8438445e14d1043c937915e5e9255ff5037746e07b3b86","observation_id":"ada1c4d4-38ac-4c43-a5f7-507ee13b7a3d","resolution":{"observed_at":"2026-08-06T14:17:44.377690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:48.387678Z","title":"Snapkv: Llm knows what you are looking for before generation,","venue":null,"work_id":"f79640eb-30b1-4c35-8b8b-4df56e905d54","year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.446490Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:72943c6895d923dee8f5946195f36c18132c86fa4ec46a149bbf468353ce620f","observation_id":"9bc145ef-2ed5-4754-a6dd-b45804deb286","resolution":{"observed_at":"2026-08-06T14:17:48.483105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04617","last_updated":"2024-05-28T12:05:12Z","snapshot_observed_at":"2026-07-06T17:26:39.109878Z","submitted_at":"2024-02-07T06:50:42Z","title":"InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04617","snapshot_observed_at":"2026-08-06T14:17:44.508093Z","title":"Infllm: Training-free long-context extrapolation for llms with an efficient context memory,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.508093Z"},"links":{"cited_paper":"/paper/2402.04617","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:bba3450aed117bca184a0238aaaab7143be08ffc7b01557c154db415446835e8","observation_id":"30b4013c-6b1c-455b-af57-49cd22ef554b","resolution":{"observed_at":"2026-08-06T14:17:44.508093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20766","last_updated":"2025-02-28T06:34:53Z","snapshot_observed_at":"2026-08-07T17:40:46.337382Z","submitted_at":"2025-02-28T06:34:53Z","title":"FlexPrefill: A Context-Aware Sparse Attention Mechanism for Efficient Long-Sequence Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20766","snapshot_observed_at":"2026-08-06T14:17:44.573805Z","title":"Flexprefill: A context-aware sparse attention mechanism for efficient long-sequence inference,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.573805Z"},"links":{"cited_paper":"/paper/2502.20766","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:af81838940b2268c96b83c0b2ac59faccc39ce7161f83052a70fadcfa7889828","observation_id":"d4be6df4-9618-4fd4-9dac-81eac982d980","resolution":{"observed_at":"2026-08-06T14:17:44.573805Z","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-06T14:17:44.642377Z","title":"Spargeattn: Accurate sparse attention accelerating any model infer- ence,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.642377Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:31766a4de1c5af01644ae8688593e01ef9f5540c23dd3c52478a80bf29e0cecd","observation_id":"367c8ba8-133a-4555-a6d7-cfb04a05d4c5","resolution":{"observed_at":"2026-08-06T14:17:44.642377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:48.144642Z","title":"Delta networks for optimized recurrent network computation,","venue":null,"work_id":"a2c93f06-70ca-4873-aa87-cd388aa68faf","year":2017},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.689821Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:e5ad5467d906b77955ee4cce4b5546eaf95b686f9466dfad4d5d6c3578820dcc","observation_id":"d5b057b0-42ae-4ab4-a1d3-1dac12a19455","resolution":{"observed_at":"2026-08-06T14:17:48.278871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:47.860467Z","title":"Spartus: A 9.4 top/s fpga-based lstm accelerator exploiting spatio-temporal sparsity,","venue":null,"work_id":"b33abcce-f351-4034-af50-67c3bec5d6a4","year":2022},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.773733Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:b91d3fa26a4be91b087c30a3cf8cc175fc5f7b8ae3b9afb5b2d304181e0bbeb7","observation_id":"55a03858-4c28-423b-a521-4320bec3ba52","resolution":{"observed_at":"2026-08-06T14:17:47.977207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:47.673631Z","title":"Skip- convolutions for efficient video processing,","venue":null,"work_id":"751d778b-9448-4318-a339-eb51be34fe79","year":2021},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.812448Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:9495ce9aff4443ab124682f066465b8ddf25a3cf6b8b1a707fe5b0c1f2c36215","observation_id":"f62d9bf5-0fa3-410c-be2a-fd0556b92eda","resolution":{"observed_at":"2026-08-06T14:17:47.747998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:47.461340Z","title":"Deltacnn: End-to-end cnn inference of sparse frame differences in videos,","venue":null,"work_id":"db805e0d-3a1e-4c57-be26-bc4b020effe5","year":2022},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.866120Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:0ffef4f2b8bef71e97e17f3f6874826ed1670c0a4bac49988c81eaab852e5350","observation_id":"eca9242f-b1d8-412e-9d67-789dd30e7bb5","resolution":{"observed_at":"2026-08-06T14:17:47.556073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:44.949752Z","title":"Motiondeltacnn: Sparse cnn inference of frame differences in moving camera videos with spherical buffers and padded convolutions,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:44.949752Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:aae7755f741a578c9ed0a1e3ca042c07832d9ddabe09d2dd178e7305a6146fe7","observation_id":"c49cfb21-5b50-42b1-9c25-cc8284a9e67d","resolution":{"observed_at":"2026-08-06T14:17:44.949752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:47.227180Z","title":"Deltarnn: A power-efficient recurrent neural network accelerator,","venue":null,"work_id":"3657212b-0eb4-49b6-9d8e-366b2ab72d6b","year":2018},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.008129Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:67c710b3fe27c7ad28416da37f6d626892ef19818272ccae614ec5f874416641","observation_id":"c51d8b60-de41-47f5-9805-68571e4c02b0","resolution":{"observed_at":"2026-08-06T14:17:47.341427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:45.081409Z","title":"Edge- drnn: Recurrent neural network accelerator for edge inference,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.081409Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:272c2d165acfdf8537164331418eb0b0b82b39c8b888889606b12b62edec81f2","observation_id":"b7172d2b-2e33-45b2-8b26-2f3a2c9275ec","resolution":{"observed_at":"2026-08-06T14:17:45.081409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:46.988660Z","title":"Deltakws: A 65nm 36nj/decision bio-inspired temporal-sparsity- aware digital keyword spotting ic with 0.6v near-threshold sram,","venue":null,"work_id":"9bd42679-052d-41bc-a144-056f43754f9a","year":2025},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.148551Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:19d261f6acd8ca65327299ce57d17d377ad40442a87616c8116bd6881f8df17c","observation_id":"40844b20-70c8-4430-a691-c182b1758ff7","resolution":{"observed_at":"2026-08-06T14:17:47.068334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.03479","last_updated":"2022-03-20T20:59:13Z","snapshot_observed_at":"2026-07-06T12:57:54.902287Z","submitted_at":"2022-03-20T20:59:13Z","title":"Delta Keyword Transformer: Bringing Transformers to the Edge through Dynamically Pruned Multi-Head Self-Attention","version":1},"cited_work":{"arxiv_id":"2204.03479","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.03479","snapshot_observed_at":"2026-08-06T14:17:46.183524Z","title":"Delta Keyword Transformer: Bringing Transformers to the Edge through Dynamically Pruned Multi-Head Self-Attention","venue":"cs.CL","work_id":"71a2f88e-9095-4638-b8ba-70b3d3216d39","year":2022},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.253004Z"},"links":{"cited_paper":"/paper/2204.03479","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:90418b60611b255f5b0377ed7d0eb88ac119119a04a66d2c31a9f00f1ed784f7","observation_id":"cc23c3dc-0b9d-4de2-ad22-66d07e847c86","resolution":{"observed_at":"2026-08-06T14:17:46.233450Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-06T14:17:45.325736Z","title":"The llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.325736Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:8f3ef3fd655980bbcb98b2a33e823f6e9d000aee9ca87856ee93d1a755dad37e","observation_id":"5e4ed24d-5b81-4f0e-acd8-ba66a82025a3","resolution":{"observed_at":"2026-08-06T14:17:45.325736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11453","last_updated":"2023-10-17T17:59:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-17T17:59:15Z","title":"BitNet: Scaling 1-bit Transformers for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11453","snapshot_observed_at":"2026-08-06T14:17:45.429662Z","title":"Bitnet: Scaling 1-bit transformers for large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.429662Z"},"links":{"cited_paper":"/paper/2310.11453","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:152e024419286854b8ebc927fb1b2b34629bd546d9aa396decbc4315d50c0ac6","observation_id":"ae4f796b-ec81-45e0-93e2-938f5161f25c","resolution":{"observed_at":"2026-08-06T14:17:45.429662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-06T14:17:45.474224Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.474224Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:a4ff5ab26b4f4cadb34cbc71889416d0a15f68c1b4197bc38d7b65a2af7548ae","observation_id":"28fd27a4-956e-4cff-a18c-1fa7239c453d","resolution":{"observed_at":"2026-08-06T14:17:45.474224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-06T14:17:45.546320Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.546320Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:10c4ffa354725777a747068608b1f5dbbb3341e939cd4d3b494a068a1ca933df","observation_id":"3581d286-bce0-44e9-8ed7-2d2ae873e068","resolution":{"observed_at":"2026-08-06T14:17:45.546320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-06T14:17:45.627275Z","title":"Hellaswag: Can a machine really finish your sentence?","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.627275Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:25a63777838ecebe6547670ed692f4fe729b01eb9d1d452f46c9c6c1cc2f9471","observation_id":"49cb55d8-bda6-40f6-a0b1-c32ffd090bb9","resolution":{"observed_at":"2026-08-06T14:17:45.627275Z","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-06T14:17:45.719990Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.719990Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:d2cac17a3ce144ea109bce6c2629ff0161f01628a8ae4babdef73785c0113676","observation_id":"0f64321e-0319-4ede-a144-45813236f438","resolution":{"observed_at":"2026-08-06T14:17:45.719990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.11641","last_updated":"2019-11-26T15:31:46Z","snapshot_observed_at":"2026-08-08T00:48:01.603669Z","submitted_at":"2019-11-26T15:31:46Z","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.11641","snapshot_observed_at":"2026-08-06T14:17:45.725322Z","title":"Piqa: Reasoning about physical commonsense in natural language,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.725322Z"},"links":{"cited_paper":"/paper/1911.11641","citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:b0f8f86e21f1ff7aea88ef1f4f67d0c33c2d3302f4f1fca9006c6be5946b0e5c","observation_id":"278362cf-abed-460a-9bd9-e00c8c3a358e","resolution":{"observed_at":"2026-08-06T14:17:45.725322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:46.785065Z","title":"Winogrande: An adversarial winograd schema challenge at scale,","venue":null,"work_id":"ef213fa0-32e5-4318-8850-c8a1d64b1fc2","year":2019},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.754920Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:b194e878a11c1e08cdfcef0546e0bc7bab7b94845aafa819137c368b5b1407e9","observation_id":"ab7519b4-282c-47de-be97-862d5cb3dbc2","resolution":{"observed_at":"2026-08-06T14:17:46.916485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:46.570422Z","title":"Know what you don’t know: Unanswerable questions for squad,","venue":null,"work_id":"db490929-b020-4290-8d8d-7732ab610cd0","year":2018},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.834302Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:80d0f30e0456364b77d8ae7d14a0a1b9c6538cc68cb743e80523df4b939aae5c","observation_id":"303632bb-10d2-4d3e-8cae-a53c5d0e6e73","resolution":{"observed_at":"2026-08-06T14:17:46.666514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:17:45.932407Z","title":"The language model evaluation harness,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T14:17:45.932407Z"},"links":{"citing_paper":"/paper/2507.19608"},"observation_digest":"sha256:2a71412da3b57c649402e3d6c6f5b14b6f74eac1f28cae024c7d6c3202545d49","observation_id":"53a69183-1a9b-475f-9758-b172a54593b4","resolution":{"observed_at":"2026-08-06T14:17:45.932407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.19608","last_updated":"2025-07-25T18:23:18Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T14:17:43.357204Z","submitted_at":"2025-07-25T18:23:18Z","title":"DeltaLLM: A Training-Free Framework Exploiting Temporal Sparsity for Efficient Edge LLM Inference"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":33},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 2 inbound Pith citation observations for arXiv:2507.19608."}