{"as_of":"2026-08-13T23:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3be6f2b87fc3a3c74b56ef330b11c263de06c6a1ae3f4e0fdcc282e6219cd3d6","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:52:48.987113Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:06:32.693476Z","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-07-02T13:46:58.816966Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.04108","snapshot_observed_at":"2026-08-07T05:06:32.693476Z","title":"Rectified sparse attention.arXiv preprint arXiv:2506.04108, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08889","last_updated":"2025-06-10T15:17:26Z","snapshot_observed_at":"2026-08-13T09:28:54.701420Z","submitted_at":"2025-06-10T15:17:26Z","title":"SeerAttention-R: Sparse Attention Adaptation for Long Reasoning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T05:06:32.693476Z"},"links":{"cited_paper":"/paper/2506.04108","citing_paper":"/paper/2506.08889"},"observation_digest":"sha256:d594daacb81956a12df723c2e8f02d20cf25d67e77b7bf51f7e8c90d53a5620b","observation_id":"973f0b67-f390-49b2-b41c-433cfb715649","resolution":{"observed_at":"2026-08-07T05:06:32.693476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"cited_work":{"arxiv_id":"2506.04108","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.04108","snapshot_observed_at":"2026-07-02T13:46:58.816966Z","title":"Rectified sparse attention","venue":null,"work_id":"aa22dbb5-75b6-4873-be14-90ee8a85e41a","year":2025},"citing_paper":{"arxiv_id":"2511.02043","last_updated":"2026-05-20T23:03:49Z","snapshot_observed_at":"2026-07-06T22:34:48.431368Z","submitted_at":"2025-11-03T20:25:19Z","title":"Flashlight: PyTorch Compiler Extensions to Accelerate Attention Variants","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-22T11:40:41.762364Z"},"links":{"cited_paper":"/paper/2506.04108","citing_paper":"/paper/2511.02043"},"observation_digest":"sha256:d4acc28e00cc84b53b0dd6d74ed84d57a5a03a683bb92bc7f6264c4a610bdc5e","observation_id":"3fd29474-9a0f-4b7a-89b8-11bf887c5093","resolution":{"observed_at":"2026-05-22T11:41:30.042725Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"cited_work":{"arxiv_id":"2506.04108","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.04108","snapshot_observed_at":"2026-07-02T13:46:58.816966Z","title":"Rectified sparse attention","venue":null,"work_id":"aa22dbb5-75b6-4873-be14-90ee8a85e41a","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2506.04108","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:5ae7b95f5c30ab6c78734f5db8b1d9da779a7b91eb7feec2f3fa837ea34c2008","observation_id":"cf2a2230-520c-4f33-b5b1-5d835d2570f9","resolution":{"observed_at":"2026-05-16T22:21:18.626267Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"cited_work":{"arxiv_id":"2506.04108","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.04108","snapshot_observed_at":"2026-07-02T13:46:58.816966Z","title":"Rectified sparse attention","venue":null,"work_id":"aa22dbb5-75b6-4873-be14-90ee8a85e41a","year":2025},"citing_paper":{"arxiv_id":"2606.06467","last_updated":"2026-06-04T17:54:04Z","snapshot_observed_at":"2026-08-08T09:09:14.963315Z","submitted_at":"2026-06-04T17:54:04Z","title":"You Only Index Once: Cross-Layer Sparse Attention with Shared Routing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T01:06:04.896501Z"},"links":{"cited_paper":"/paper/2506.04108","citing_paper":"/paper/2606.06467"},"observation_digest":"sha256:b06f825489bf0cc3f2daeeb5063f3f80ce5c01b4c28f753adfae03a922acbf66","observation_id":"5361cd55-4d42-455c-8d9c-b0a2d1a68d7f","resolution":{"observed_at":"2026-07-02T13:46:58.818402Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.04108/citation-record","integrity":"/paper/2506.04108/integrity","json":"/paper/2506.04108/citation-record.json","paper":"/paper/2506.04108"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.16369","last_updated":"2023-08-31T00:03:02Z","snapshot_observed_at":"2026-08-06T15:43:00.292272Z","submitted_at":"2023-08-31T00:03:02Z","title":"SARATHI: Efficient LLM Inference by Piggybacking Decodes with Chunked Prefills","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.16369","snapshot_observed_at":"2026-08-07T10:52:48.200672Z","title":"Sarathi: Efficient llm inference by piggybacking decodes with chunked prefills.arXiv preprint arXiv:2308.16369, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.200672Z"},"links":{"cited_paper":"/paper/2308.16369","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:445a50e8001f7eaa6de14b120a11d26d905a368cd1abc918f6991d210b19195a","observation_id":"195f9a5b-f13b-4520-a5d3-b22ff14f473a","resolution":{"observed_at":"2026-08-07T10:52:48.200672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13245","last_updated":"2023-12-23T17:55:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-22T17:16:38Z","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13245","snapshot_observed_at":"2026-08-07T10:52:48.285123Z","title":"Training generalized multi-query transformer models from multi-head checkpoints.arXiv preprint arXiv:2305.13245, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.285123Z"},"links":{"cited_paper":"/paper/2305.13245","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:59975a7541f32927a5d021c55fd06b538cbe07cbc58d13fe7f98187a22e16f27","observation_id":"bbacd52a-ac00-421f-b26f-472ea2bbf55b","resolution":{"observed_at":"2026-08-07T10:52:48.285123Z","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-07T10:52:48.349290Z","title":"Medusa: Simple llm inference acceleration framework with multiple decoding heads","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.349290Z"},"links":{"cited_paper":"/paper/2401.10774","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:74d770944a1378b1828c2e26549cd7d4d5643a2f73e6aa8ae7c33457dfd76f6d","observation_id":"16245e3d-3417-44ff-8c73-564e3e612f0b","resolution":{"observed_at":"2026-08-07T10:52:48.349290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16179","last_updated":"2024-12-18T17:36:36Z","snapshot_observed_at":"2026-08-12T22:18:22.162802Z","submitted_at":"2024-10-21T16:44:51Z","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16179","snapshot_observed_at":"2026-08-07T10:52:48.465707Z","title":"Magicpig: Lsh sampling for efficient llm generation.arXiv preprint arXiv:2410.16179, 2024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.465707Z"},"links":{"cited_paper":"/paper/2410.16179","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:c548fe02cc8059a7dcbd6927d0998a9690393c0f36bd0886c046f01323668f08","observation_id":"6d71bcdd-d3e0-46c7-98e1-921e2eea93a6","resolution":{"observed_at":"2026-08-07T10:52:48.465707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T10:52:48.527304Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.527304Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:30ebbff7cad3a6502731f4ee57b2390f2f8be77ed7c79373bbc1ac6d66e3e488","observation_id":"6ca1098b-5ddc-474f-a14e-ce7f8b4b2dfa","resolution":{"observed_at":"2026-08-07T10:52:48.527304Z","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-07T10:52:49.265932Z","title":"Flash-Decoding for long-context inference.https://crfm.stanford.edu/2023/10/12/flashdecoding.html, 2023","venue":null,"work_id":"1deb46c3-e74f-4b74-88dd-e76ef0109fc2","year":2023},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.550761Z"},"links":{"citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:fd782e8fbf8c9d82c0d90252d79831fdf314fd6720a51e85f3f7a8ad719b351c","observation_id":"ed759aec-6814-40db-a56d-41151166bdf9","resolution":{"observed_at":"2026-08-07T10:52:49.268981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11743","last_updated":"2024-08-21T16:10:41Z","snapshot_observed_at":"2026-08-12T22:59:51.613612Z","submitted_at":"2024-08-21T16:10:41Z","title":"MARLIN: Mixed-Precision Auto-Regressive Parallel Inference on Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11743","snapshot_observed_at":"2026-08-07T10:52:48.650576Z","title":"Marlin: Mixed-precision auto-regressive parallel inference on large language models.arXiv preprint arXiv:2408.11743, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.650576Z"},"links":{"cited_paper":"/paper/2408.11743","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:4a2df48ddbcc734fe894f524da447f6b24b6a10122b1597198744f67adfe187d","observation_id":"22abf7b4-91e0-48e1-b5b4-8b0ae3a4152c","resolution":{"observed_at":"2026-08-07T10:52:48.650576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13276","last_updated":"2025-02-17T02:24:47Z","snapshot_observed_at":"2026-08-12T22:21:14.844495Z","submitted_at":"2024-10-17T07:07:09Z","title":"SeerAttention: Learning Intrinsic Sparse Attention in Your LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13276","snapshot_observed_at":"2026-08-07T10:52:48.764869Z","title":"Seerattention: Learning intrinsic sparse attention in your llms.arXiv preprint arXiv:2410.13276, 2024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.764869Z"},"links":{"cited_paper":"/paper/2410.13276","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:8d95a26fc6ac9b5f80bbb150d3f6907df5919a54a496af5a9b58650afa1cc6db","observation_id":"e892edf0-045c-41f9-81e0-73dd74f82b7f","resolution":{"observed_at":"2026-08-07T10:52:48.764869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-13T15:58:13.809876Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T10:52:48.868706Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.868706Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:73e290b75859df2bf751014fc243b2bbba93b94453ff3b869d415123dc668a98","observation_id":"99217db7-9ac4-4fd3-91b0-9f5e57ab2e5c","resolution":{"observed_at":"2026-08-07T10:52:48.868706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14008","last_updated":"2024-06-06T13:19:44Z","snapshot_observed_at":"2026-08-03T03:39:09.398343Z","submitted_at":"2024-02-21T18:49:26Z","title":"OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14008","snapshot_observed_at":"2026-08-07T10:52:48.901428Z","title":"Olympiadbench: A challenging benchmark for promoting agi with olympiad-level bilingual multimodal scientific problems.arXiv preprint arXiv:2402.14008, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.901428Z"},"links":{"cited_paper":"/paper/2402.14008","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:de1ab00748c53f1edf67514e3c80eeeb098ff814a944743f28c942d24bce3087","observation_id":"ee8639a1-dc19-4f1b-8861-83e1711016ae","resolution":{"observed_at":"2026-08-07T10:52:48.901428Z","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-07T10:52:48.935265Z","title":"Measuring mathematical problem solving with the math dataset","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.935265Z"},"links":{"citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:b2f423ffe48f734814f5d3a098c4d47b65d67fd5cfe1465ca19af431c1966552","observation_id":"b8c5d9b4-69ab-498a-9051-24b27898a446","resolution":{"observed_at":"2026-08-07T10:52:48.935265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08671","last_updated":"2024-01-09T06:49:40Z","snapshot_observed_at":"2026-08-13T10:02:11.727756Z","submitted_at":"2024-01-09T06:49:40Z","title":"DeepSpeed-FastGen: High-throughput Text Generation for LLMs via MII and DeepSpeed-Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08671","snapshot_observed_at":"2026-08-07T10:52:48.938385Z","title":"Deepspeed-fastgen: High-throughput text generation for llms via mii and deepspeed-inference","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.938385Z"},"links":{"cited_paper":"/paper/2401.08671","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:070d8460408f07751c7eed902581c226b6c68fa8fbd59975fb291854a47dc0f0","observation_id":"17c4b2d3-7d80-4f7e-a321-478c29739989","resolution":{"observed_at":"2026-08-07T10:52:48.938385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-07T10:52:48.941415Z","title":"Openai o1 system card.arXiv preprint arXiv:2412.16720, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.941415Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:831a84a26e963d132176aba042bb98e47f970e2967aedfec94dc8d1329e19e4e","observation_id":"12ea0f1f-3189-47b6-864f-d1ea47ef7f87","resolution":{"observed_at":"2026-08-07T10:52:48.941415Z","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-07T10:52:48.944325Z","title":"Fast inference from transformers via speculative decoding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.944325Z"},"links":{"citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:dfcc58a853b7b8c33a80328c681709239d4e1ef8ef3ceb704209ec4200ee3cc5","observation_id":"35a5dac5-0e4d-46d9-b136-1aecd9c73860","resolution":{"observed_at":"2026-08-07T10:52:48.944325Z","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-07T10:52:48.947196Z","title":"Solving quantitative reasoning problems with language models.Advances in Neural Information Processing Systems, 35:3843–3857, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.947196Z"},"links":{"citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:8057caa155bed40139cbebfd4fbcdaa8bbcacb29039be8fb4442308fe723f256","observation_id":"be024e36-8e0f-44cc-909d-dd3b550312c7","resolution":{"observed_at":"2026-08-07T10:52:48.947196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15077","last_updated":"2025-03-04T13:58:39Z","snapshot_observed_at":"2026-08-03T09:40:31.365295Z","submitted_at":"2024-01-26T18:59:01Z","title":"EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15077","snapshot_observed_at":"2026-08-07T10:52:48.949963Z","title":"Eagle: Speculative sampling requires rethinking feature uncertainty.arXiv preprint arXiv:2401.15077, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.949963Z"},"links":{"cited_paper":"/paper/2401.15077","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:6065137e99cf6f9c846d282ee898080c699d90ce7c9347dbf2e46ab52cbf01cb","observation_id":"11fa7331-4345-4ad5-ac3d-8fe859d827c4","resolution":{"observed_at":"2026-08-07T10:52:48.949963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08190","last_updated":"2024-02-21T20:28:13Z","snapshot_observed_at":"2026-08-13T04:42:13.982761Z","submitted_at":"2024-01-16T08:08:01Z","title":"MARIO: MAth Reasoning with code Interpreter Output -- A Reproducible Pipeline","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08190","snapshot_observed_at":"2026-08-07T10:52:48.952928Z","title":"Mario: Math reasoning with code interpreter output–a reproducible pipeline.arXiv preprint arXiv:2401.08190, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.952928Z"},"links":{"cited_paper":"/paper/2401.08190","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:250f5ba8d429ef38ee334dab4c67897040b944ae71ae48c48eb7c6c178d29de5","observation_id":"6ec6e455-732c-44d0-b336-17cb5fc7c4e6","resolution":{"observed_at":"2026-08-07T10:52:48.952928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03213","last_updated":"2025-06-14T06:17:33Z","snapshot_observed_at":"2026-08-11T22:37:07.114776Z","submitted_at":"2024-12-04T10:58:27Z","title":"ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03213","snapshot_observed_at":"2026-08-07T10:52:48.956989Z","title":"Clusterkv: Manipulating llm kv cache in semantic space for recallable compression.arXiv preprint arXiv:2412.03213, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.956989Z"},"links":{"cited_paper":"/paper/2412.03213","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:746fa5a4e26120ecdca12f397a7b52ce0d4860b2369137ca53e26339549342f8","observation_id":"89b1cfc7-6b65-4532-a222-6d99636ed20f","resolution":{"observed_at":"2026-08-07T10:52:48.956989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13189","last_updated":"2025-02-18T14:06:05Z","snapshot_observed_at":"2026-08-12T19:30:23.025771Z","submitted_at":"2025-02-18T14:06:05Z","title":"MoBA: Mixture of Block Attention for Long-Context LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13189","snapshot_observed_at":"2026-08-07T10:52:48.960314Z","title":"Moba: Mixture of block attention for long-context llms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.960314Z"},"links":{"cited_paper":"/paper/2502.13189","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:57df9bf4788d206c226ba21839b6b3cc5c85bdd01c66f1cfe683b3f2507f047c","observation_id":"131d3691-37ae-43d6-81b2-a7d6ccfa2d99","resolution":{"observed_at":"2026-08-07T10:52:48.960314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05530","last_updated":"2024-12-16T17:39:39Z","snapshot_observed_at":"2026-07-06T17:41:42.995949Z","submitted_at":"2024-03-08T18:54:20Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05530","snapshot_observed_at":"2026-08-07T10:52:48.963403Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context.arXiv preprint arXiv:2403.05530, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.963403Z"},"links":{"cited_paper":"/paper/2403.05530","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:694d50e10560ffeabd9bc8bf08d72d1fe428baf3a76f1ff258e4314194545726","observation_id":"ff56fa26-426a-4638-807d-425e491602f4","resolution":{"observed_at":"2026-08-07T10:52:48.963403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11049","last_updated":"2025-04-02T01:58:38Z","snapshot_observed_at":"2026-08-12T23:00:30.530780Z","submitted_at":"2024-08-20T17:57:31Z","title":"MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11049","snapshot_observed_at":"2026-08-07T10:52:48.966152Z","title":"Magicdec: Breaking the latency- throughput tradeoff for long context generation with speculative decoding.arXiv preprint arXiv:2408.11049, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.966152Z"},"links":{"cited_paper":"/paper/2408.11049","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:2bbd4122d019ea1e80c3ffaad6ef66064a7703a69c3a91ad1cdc696b9e8c6e61","observation_id":"e9161153-b987-4d15-aee1-1ea702c8f66c","resolution":{"observed_at":"2026-08-07T10:52:48.966152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.11912","last_updated":"2024-08-04T00:58:04Z","snapshot_observed_at":"2026-08-13T00:27:40.768040Z","submitted_at":"2024-04-18T05:25:54Z","title":"TriForce: Lossless Acceleration of Long Sequence Generation with Hierarchical Speculative Decoding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.11912","snapshot_observed_at":"2026-08-07T10:52:48.969030Z","title":"Triforce: Lossless acceleration of long sequence generation with hierarchical speculative decoding.arXiv preprint arXiv:2404.11912, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.969030Z"},"links":{"cited_paper":"/paper/2404.11912","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:ed3a30635995657e98a80d5b8a4c08b13ab56dcf9991745231c85932a414b186","observation_id":"ee44efbc-ac4b-45df-b458-0d636cf0ee21","resolution":{"observed_at":"2026-08-07T10:52:48.969030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10774","last_updated":"2024-08-26T21:01:02Z","snapshot_observed_at":"2026-07-06T18:31:36.504766Z","submitted_at":"2024-06-16T01:33:02Z","title":"Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10774","snapshot_observed_at":"2026-08-07T10:52:48.972268Z","title":"Quest: Query-aware sparsity for efficient long-context llm inference.arXiv preprint arXiv:2406.10774, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.972268Z"},"links":{"cited_paper":"/paper/2406.10774","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:2e30ea08178273fee7008b868fe12cf1d8ebb8bc28ddcec4a2f7ab7d6cf5ebc0","observation_id":"4e5d68fd-4e9c-4eae-8d71-39bf16189b3d","resolution":{"observed_at":"2026-08-07T10:52:48.972268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04617","last_updated":"2024-05-28T12:05:12Z","snapshot_observed_at":"2026-08-13T04:24:33.010862Z","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-07T10:52:48.975137Z","title":"Infllm: Training-free long-context extrapolation for llms with an efficient context memory.arXiv preprint arXiv:2402.04617, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.975137Z"},"links":{"cited_paper":"/paper/2402.04617","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:8589af3c7ddc5f34fd5831402b929ab4a5d8d2e1e68798ec633763921a0089b5","observation_id":"1a8181b3-5ed7-4a97-975b-447725659275","resolution":{"observed_at":"2026-08-07T10:52:48.975137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T10:52:48.978094Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.978094Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:667ee635b5ed54e2e1f4ddde8e21f2c43e39027ba3b2a5d5528b7d7c930f8af7","observation_id":"524b4230-df1a-4c66-a691-39c2f3aa839b","resolution":{"observed_at":"2026-08-07T10:52:48.978094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15383","last_updated":"2025-01-26T03:47:25Z","snapshot_observed_at":"2026-08-11T19:42:36.266059Z","submitted_at":"2025-01-26T03:47:25Z","title":"Qwen2.5-1M Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15383","snapshot_observed_at":"2026-08-07T10:52:48.981099Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.981099Z"},"links":{"cited_paper":"/paper/2501.15383","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:e9d7bdc75e2887f17acb1012b942f3436eb74d485d383c463e5fe7cc3d20e3b9","observation_id":"afb1e160-cf1b-40f4-8c89-1d923ac34cf3","resolution":{"observed_at":"2026-08-07T10:52:48.981099Z","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-07T10:52:49.234617Z","title":"Orca: A distributed serving system for Transformer-based generative models","venue":null,"work_id":"fa27bd2e-7f7e-4aa7-a646-d4bdc6d319fb","year":2022},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.984029Z"},"links":{"citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:ce0e667e2a506117dc04fe175daeafb0e6ee719bc9087d83b398633de34ab33a","observation_id":"e9a5af27-b368-4d42-817a-6675be5981b5","resolution":{"observed_at":"2026-08-07T10:52:49.239761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11089","last_updated":"2025-02-27T09:01:21Z","snapshot_observed_at":"2026-08-07T14:17:15.942844Z","submitted_at":"2025-02-16T11:53:44Z","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11089","snapshot_observed_at":"2026-08-07T10:52:48.987113Z","title":"Native sparse attention: Hardware-aligned and natively trainable sparse attention.arXiv preprint arXiv:2502.11089, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:48.987113Z"},"links":{"cited_paper":"/paper/2502.11089","citing_paper":"/paper/2506.04108"},"observation_digest":"sha256:1170111a2d7fd205832b934837215874a818141cd0c9cecfe0d8a876fc661543","observation_id":"cb718aeb-3183-4d09-8cca-503448e3a0ba","resolution":{"observed_at":"2026-08-07T10:52:48.987113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T03:34:21.096360Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":28},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 4 inbound Pith citation observations for arXiv:2506.04108."}