{"as_of":"2026-08-14T11:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ea5ab51ec601885b01f9e33cdd117f317e8e8fc99d118ece98a434a8887a51c","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:22:12.725910Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T12:25:42.945747Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.02882","last_updated":"2025-05-16T03:34:33Z","snapshot_observed_at":"2026-08-13T19:48:34.891192Z","submitted_at":"2024-04-03T17:33:21Z","title":"Linear Attention Sequence Parallelism","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02882","snapshot_observed_at":"2026-08-12T04:22:12.725910Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01572","last_updated":"2025-01-01T08:52:20Z","snapshot_observed_at":"2026-08-13T17:48:25.514749Z","submitted_at":"2024-12-02T14:55:02Z","title":"MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T04:22:12.725910Z"},"links":{"cited_paper":"/paper/2404.02882","citing_paper":"/paper/2412.01572"},"observation_digest":"sha256:9e15bd8f1a772f97c0ca54c0335738c97b67a9fa43f91002a665f76cdd58d602","observation_id":"5b039312-b4a7-43e4-ad0d-c1292dc27c81","resolution":{"observed_at":"2026-08-12T04:22:12.725910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02882","last_updated":"2025-05-16T03:34:33Z","snapshot_observed_at":"2026-08-13T19:48:34.891192Z","submitted_at":"2024-04-03T17:33:21Z","title":"Linear Attention Sequence Parallelism","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02882","snapshot_observed_at":"2026-08-11T18:44:08.964082Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07618","last_updated":"2024-12-20T03:12:49Z","snapshot_observed_at":"2026-08-14T10:43:49.690063Z","submitted_at":"2024-12-10T15:56:03Z","title":"Adapting to Non-Stationary Environments: Multi-Armed Bandit Enhanced Retrieval-Augmented Generation on Knowledge Graphs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T18:44:08.964082Z"},"links":{"cited_paper":"/paper/2404.02882","citing_paper":"/paper/2412.07618"},"observation_digest":"sha256:447c2d2e90e8f2f55dd059437ecb4c2cc47ef8c7d846b4d5810d53d8fc67fe1e","observation_id":"e42cd1da-8e06-4808-a07a-4cfeb6cf959f","resolution":{"observed_at":"2026-08-11T18:44:08.964082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02882","last_updated":"2025-05-16T03:34:33Z","snapshot_observed_at":"2026-08-13T19:48:34.891192Z","submitted_at":"2024-04-03T17:33:21Z","title":"Linear Attention Sequence Parallelism","version":3},"cited_work":{"arxiv_id":"2404.02882","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.02882","snapshot_observed_at":"2026-08-08T12:25:42.945747Z","title":"Linear Attention Sequence Parallelism","venue":"cs.LG","work_id":"5d251d89-a9bf-44fb-98d4-d5de06249a3a","year":2024},"citing_paper":{"arxiv_id":"2502.07563","last_updated":"2025-02-11T14:01:39Z","snapshot_observed_at":"2026-08-08T12:15:35.512720Z","submitted_at":"2025-02-11T14:01:39Z","title":"LASP-2: Rethinking Sequence Parallelism for Linear Attention and Its Hybrid","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T12:25:42.730995Z"},"links":{"cited_paper":"/paper/2404.02882","citing_paper":"/paper/2502.07563"},"observation_digest":"sha256:ba9eb1d1c56d1b5fafc9f6355f0e07d9916139382a06a369681b2df8d810a5af","observation_id":"7ec65b29-6216-4b59-9f1b-0d3a79743ac3","resolution":{"observed_at":"2026-08-08T12:25:42.952657Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.02882/citation-record","integrity":"/paper/2404.02882/integrity","json":"/paper/2404.02882/citation-record.json","paper":"/paper/2404.02882"},"outbound":[],"paper":{"arxiv_id":"2404.02882","last_updated":"2025-05-16T03:34:33Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T19:48:34.891192Z","submitted_at":"2024-04-03T17:33:21Z","title":"Linear Attention Sequence Parallelism"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.02882."}