{"as_of":"2026-08-10T18:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:036801f2e0e686f5787e7b14f68f57c5615221531ce25e0202d1ec21b417b13c","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:22:18.874453Z","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":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-10T17:22:18.874453Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00026","last_updated":"2025-02-07T12:23:59Z","snapshot_observed_at":"2026-08-10T17:15:51.214094Z","submitted_at":"2025-01-21T17:10:52Z","title":"Pushing the Limits of BFP on Narrow Precision LLM Inference","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T17:22:18.874453Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2502.00026"},"observation_digest":"sha256:96759d1477ade74f1531ffe8cb337d737d919360c0e5ab06820b0d12580dd76a","observation_id":"147484d9-405c-4013-a6b5-272639a833cc","resolution":{"observed_at":"2026-08-10T17:22:18.874453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-08T13:44:00.672927Z","title":"Flash-llm: Enabling cost-effective and highly-efficient large generative model inference with unstructured sparsity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07832","last_updated":"2025-02-11T00:21:40Z","snapshot_observed_at":"2026-08-10T01:10:52.838340Z","submitted_at":"2025-02-11T00:21:40Z","title":"SHARP: Accelerating Language Model Inference by SHaring Adjacent layers with Recovery Parameters","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-08T13:44:00.672927Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2502.07832"},"observation_digest":"sha256:f5643aa7df529e75de950dc068611c6949b7fc47755ca9ed3c885e761fe61caa","observation_id":"72d3a5b1-ca63-4a16-bac2-3fb80da30ac2","resolution":{"observed_at":"2026-08-08T13:44:00.672927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":"2309.10285","doi":"10.48550/arxiv.2309.10285","metadata_source":"arxiv_reference","pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flash-llm: Enabling cost-effective and highly-efficient large generative model inference with unstructured sparsity","venue":"arXiv (Cornell University)","work_id":"7dad54d7-b04e-46f6-a691-73a220bcd3d9","year":2023},"citing_paper":{"arxiv_id":"2505.17138","last_updated":"2026-05-18T17:05:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-22T06:12:42Z","title":"RAP: Runtime Adaptive Pruning for LLM Inference","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-22T13:20:41.739571Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2505.17138"},"observation_digest":"sha256:31a76b3e21c0b1f0760199c5af43497138e1fcec36e33ff0c0881cf0f1282c39","observation_id":"0664cf4f-2f0f-4f70-805c-12afad15f361","resolution":{"observed_at":"2026-05-22T13:21:35.642487Z","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":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":"2309.10285","doi":"10.48550/arxiv.2309.10285","metadata_source":"arxiv_reference","pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flash-llm: Enabling cost-effective and highly-efficient large generative model inference with unstructured sparsity","venue":"arXiv (Cornell University)","work_id":"7dad54d7-b04e-46f6-a691-73a220bcd3d9","year":2023},"citing_paper":{"arxiv_id":"2506.12876","last_updated":"2026-05-13T04:56:46Z","snapshot_observed_at":"2026-08-01T16:23:25.586402Z","submitted_at":"2025-06-15T15:02:59Z","title":"MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T09:01:16.991413Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2506.12876"},"observation_digest":"sha256:54367a6f7e8ea200cb894eee6e6ca610900255ac1ecf63565181dc4ffe81b48b","observation_id":"a4826869-d6d3-49e4-adbe-945c7e9bd8b8","resolution":{"observed_at":"2026-05-19T09:02:14.552122Z","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":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-03T11:47:19.007455Z","title":"arXiv:2309.10285","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.16991","last_updated":"2026-07-20T07:18:25Z","snapshot_observed_at":"2026-08-09T19:36:24.077515Z","submitted_at":"2026-01-08T20:34:12Z","title":"Sparsity-Aware Low-Rank Representation for Efficient Fine-Tuning of Large Language Models","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T11:47:19.007455Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2601.16991"},"observation_digest":"sha256:1155189b13171391094f7f5a009535d2fa28f2f37f8ccc332e51a42b21a2213b","observation_id":"f690e976-331a-45ab-a40b-0650d905e719","resolution":{"observed_at":"2026-08-03T11:47:19.007455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":"2309.10285","doi":"10.48550/arxiv.2309.10285","metadata_source":"arxiv_reference","pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flash-llm: Enabling cost-effective and highly-efficient large generative model inference with unstructured sparsity","venue":"arXiv (Cornell University)","work_id":"7dad54d7-b04e-46f6-a691-73a220bcd3d9","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":170,"source":"pdf_text","source_observed_at":"2026-05-08T09:45:57.201837Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2604.22906"},"observation_digest":"sha256:5d40d503b19555ad560623b3c070dc68ac15dc055976ac2ad76f1d5453ad6d06","observation_id":"caea12ae-603b-4c34-a5ee-11c1223ddaf5","resolution":{"observed_at":"2026-05-11T20:16:10.309428Z","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":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":"2309.10285","doi":"10.48550/arxiv.2309.10285","metadata_source":"arxiv_reference","pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flash-llm: Enabling cost-effective and highly-efficient large generative model inference with unstructured sparsity","venue":"arXiv (Cornell University)","work_id":"7dad54d7-b04e-46f6-a691-73a220bcd3d9","year":2023},"citing_paper":{"arxiv_id":"2605.15695","last_updated":"2026-05-15T07:38:04Z","snapshot_observed_at":"2026-07-06T23:26:56.013191Z","submitted_at":"2026-05-15T07:38:04Z","title":"ParamSpMM: Adaptive and Efficient Sparse Matrix-Matrix Multiplication on GPUs for GNNs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T19:35:51.992891Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2605.15695"},"observation_digest":"sha256:ef6a78d826e25cc84a9dbcb424a65e0627147af09933c662c7ffa6236531cf06","observation_id":"c139bd58-344c-4240-af5e-218b7f1200cc","resolution":{"observed_at":"2026-05-19T19:37:43.766024Z","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":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":"2309.10285","doi":"10.48550/arxiv.2309.10285","metadata_source":"arxiv_reference","pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flash-llm: Enabling cost-effective and highly-efficient large generative model inference with unstructured sparsity","venue":"arXiv (Cornell University)","work_id":"7dad54d7-b04e-46f6-a691-73a220bcd3d9","year":2023},"citing_paper":{"arxiv_id":"2606.09080","last_updated":"2026-06-08T06:26:18Z","snapshot_observed_at":"2026-07-06T23:48:30.569726Z","submitted_at":"2026-06-08T06:26:18Z","title":"Beyond FLOPs: Benchmarking Real Inference Acceleration of LLM Pruning under a GEMM-Centric Taxonomy","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T17:02:30.894934Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2606.09080"},"observation_digest":"sha256:7cbd1980cf5a6f0cb03de27bc4b9deab4da0a410964feb1b8b7a01ab21dc1543","observation_id":"cdefe15b-5862-4af1-942a-d27eade948f5","resolution":{"observed_at":"2026-06-27T17:11:05.718176Z","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":"2309.10285","last_updated":"2023-09-19T03:20:02Z","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10285","snapshot_observed_at":"2026-08-06T00:09:28.755271Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01536","last_updated":"2026-08-02T23:10:04Z","snapshot_observed_at":"2026-08-09T11:50:23.411535Z","submitted_at":"2026-08-02T23:10:04Z","title":"Celty: SpMspV GPU Kernel and SIMT Co-Design for Efficient Dual-Sparse LLM Inference","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T00:09:28.755271Z"},"links":{"cited_paper":"/paper/2309.10285","citing_paper":"/paper/2608.01536"},"observation_digest":"sha256:2d3551995e49914b4403c06cdc8c61789d15f8cb4617a21c33ec2870a54cd178","observation_id":"3b184a85-9f3c-4509-a578-95e4ef8985b9","resolution":{"observed_at":"2026-08-06T00:09:28.755271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.10285/citation-record","integrity":"/paper/2309.10285/integrity","json":"/paper/2309.10285/citation-record.json","paper":"/paper/2309.10285"},"outbound":[],"paper":{"arxiv_id":"2309.10285","last_updated":"2023-09-19T03:20:02Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-01T16:15:23.171765Z","submitted_at":"2023-09-19T03:20:02Z","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity"},"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 9 inbound Pith citation observations for arXiv:2309.10285."}