{"as_of":"2026-08-21T10:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b32771a73d68a7ee4c8e763be513a134e1e8e18530bd2fa3be70079cad36c5e","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T20:03:11.488237Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-03T21:37:26.054535Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"cited_work":{"arxiv_id":"2509.09001","doi":"10.48550/arxiv.2509.09001","metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09001","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast attention mechanisms: a tale of parallelism , shorttitle =","venue":"arXiv (Cornell University)","work_id":"7ea2ed61-ffb4-43d0-8b5b-13ff6fd229bc","year":null},"citing_paper":{"arxiv_id":"2607.01283","last_updated":"2026-07-01T08:42:38Z","snapshot_observed_at":"2026-08-17T17:04:05.513775Z","submitted_at":"2026-07-01T08:42:38Z","title":"Scaling Laws for Grid-Based Approximate Nearest Neighbor Search in High Dimensions","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-03T21:37:26.054535Z"},"links":{"cited_paper":"/paper/2509.09001","citing_paper":"/paper/2607.01283"},"observation_digest":"sha256:cb61fcac36f6babe8eb208037674264b0c442a426db5acf23f7f38098f9b64f1","observation_id":"5be28c95-e3e0-49fe-9b5a-71d17c4da13e","resolution":{"observed_at":"2026-07-03T21:38:58.118680Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.09001/citation-record","integrity":"/paper/2509.09001/integrity","json":"/paper/2509.09001/citation-record.json","paper":"/paper/2509.09001"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:03:11.457065Z","title":"The input feeded into EMA-transformer is distributed in theN tokens, and we need to transfer than into the first⌈N s ⌉tokens/machines to matchMachineIn 1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.457065Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:06414f290d6597f34497f8fd684fbafd4fb2d9030b21e398ca123c602d6cbca5","observation_id":"0f1e8470-3ddd-4b86-9020-07c67d8d11d7","resolution":{"observed_at":"2026-08-04T20:03:11.457065Z","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-04T20:03:11.459652Z","title":"After the local computation in each roundr, we need to communicate the messages fromMachineOutr toMachineIn r+1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.459652Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:6f7d358002c1e4e3ab78dfd694dddabb5656f94d2c503c4db108f70125507d12","observation_id":"0e356e5d-edec-4f04-8539-2d6a7f0b5471","resolution":{"observed_at":"2026-08-04T20:03:11.459652Z","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-04T20:03:11.453864Z","title":"Consider the family G with Prg∈G[g(x) = g(y)] ≤ 0.1 N 3, if ∥x−y∥> cr","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.453864Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:6021385350567b0af9a72c7124199fe341b37d1912baa67512bdeb92b7e32274","observation_id":"9fd88597-255f-41eb-b97b-7233589b70cb","resolution":{"observed_at":"2026-08-04T20:03:11.453864Z","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-04T20:03:11.483375Z","title":"32 For step 1, each machine only needs to send message to its neighbor machine: machinei sends message to machinei− 1, and this only takes 1 round","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.483375Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:e47d44e0cb4f385b1386941335eea6794ce0d344d4a513ae524a0bd63c96d806","observation_id":"5331295e-0e5e-4759-a794-9da91b19272c","resolution":{"observed_at":"2026-08-04T20:03:11.483375Z","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-04T20:03:11.462237Z","title":"validity bit","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.462237Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:9291adfe8550ace1f9d7fca3eb5d45fe473a6d5d2265123fbc108ab1980b4f59","observation_id":"7fb2c500-9b9e-42d3-9899-557ec1594fc6","resolution":{"observed_at":"2026-08-04T20:03:11.462237Z","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-04T20:03:11.465447Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.465447Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:0946b31372684aeb2ed816bdeb764d7f331027797902316310760defd60eeedc","observation_id":"e5bc2661-6200-4c14-bead-106bda3b9d19","resolution":{"observed_at":"2026-08-04T20:03:11.465447Z","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-04T20:03:11.468061Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.468061Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:d62872c385d6f0586fc22c37bae109a70c01b05aff4fca9c642551d345c9932e","observation_id":"bfc8912e-40c7-4732-8f38-11f122ad3a89","resolution":{"observed_at":"2026-08-04T20:03:11.468061Z","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-04T20:03:11.470580Z","title":"The output embedding forqi is therefore X j:h′(kj )=h′(qi) exp(⟨qi, kj⟩)X j′:h′(kj′ )=h′(qi) exp(⟨qi, kj′⟩) ·v j","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.470580Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:8409ba10ce2f7252bb1ccfe7d91192f9a40b53c4a1fabce9d0915a772cd6ab2a","observation_id":"d50e70c8-059a-4455-8796-6594b51ea772","resolution":{"observed_at":"2026-08-04T20:03:11.470580Z","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-04T20:03:11.473101Z","title":"In theℓ-th layer attention computation for each queryqi, Reformer computes X j∈fℓ(i) exp(⟨qi, kj⟩)X j′∈fℓ(i) exp(⟨qi, kj′⟩) ·v j","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.473101Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:c6bab187e30a209d54c0c8b279797c4ef14fc4ae9f1ab131a133fcaa067e0964","observation_id":"35ff3201-f943-4e63-9b8a-ced7364f731e","resolution":{"observed_at":"2026-08-04T20:03:11.473101Z","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-04T20:03:11.475927Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.475927Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:7bed77efb78751223070e87688a23fdfa859f7697c71ae7637728d4333320d8b","observation_id":"674bc6e7-b76c-48c4-847d-9feab1c8c92c","resolution":{"observed_at":"2026-08-04T20:03:11.475927Z","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-04T20:03:11.478477Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.478477Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:50dc74b17037f26e504a2bc35e2b839073ba651b0c082ca84e937c0bea5a064d","observation_id":"9b462122-3abd-40e5-9c9a-f1f535e2ede4","resolution":{"observed_at":"2026-08-04T20:03:11.478477Z","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-04T20:03:11.480929Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.480929Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:409ced2ad30f2af9b10705e3dc43d354726c5ee7977ec28319315365cb90f97a","observation_id":"cfad6d26-2ffa-45f2-a9be-3cdadfbcc53b","resolution":{"observed_at":"2026-08-04T20:03:11.480929Z","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-04T20:03:11.485823Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.485823Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:8fd5a6333c47c2b0d1d2063c44793f7f8de7d4394b2dde153314144a11ae870a","observation_id":"9927f75c-26cd-4cbf-838e-98865b468985","resolution":{"observed_at":"2026-08-04T20:03:11.485823Z","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-04T20:03:11.488237Z","title":"Therefore, the total round isO( 1 ε ) + 2(ℓ + 1)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.488237Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:c88ebcc6335a704b70975c0a762bf9153c9af8dc032db5fbcf1809b8953d05e3","observation_id":"0b4b6cfe-9a7f-417b-a96b-eba2293780c8","resolution":{"observed_at":"2026-08-04T20:03:11.488237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14332","last_updated":"2024-08-26T15:01:04Z","snapshot_observed_at":"2026-08-16T13:23:47.304952Z","submitted_at":"2024-08-26T15:01:04Z","title":"One-layer transformers fail to solve the induction heads task","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14332","snapshot_observed_at":"2026-08-04T20:03:11.447661Z","title":"Andreas Loukas","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.447661Z"},"links":{"cited_paper":"/paper/2408.14332","citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:379a89b62e0b34a664e5870aec9c7ef65b1ab9f06f00caeeddde1598c8e71f10","observation_id":"81c44fe3-f049-4e39-9a8a-0134724c932a","resolution":{"observed_at":"2026-08-04T20:03:11.447661Z","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-04T20:03:11.444053Z","title":"Nathan Linial","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.444053Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:be1b23b46e74f5187ccff92721fe1e51c72f47b8b8a01316355042ae09e1ee39","observation_id":"96571bd3-f514-4cae-8968-c369a41e62e1","resolution":{"observed_at":"2026-08-04T20:03:11.444053Z","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-04T20:03:11.451157Z","title":"Kai Yang, Jan Ackermann, Zhenyu He, Guhao Feng, Bohang Zhang, Yunzhen Feng, Qiwei Ye, Di He, and Liwei Wang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T20:03:11.451157Z"},"links":{"citing_paper":"/paper/2509.09001"},"observation_digest":"sha256:4f525e4cf53bc2d8ef25e7fd44dda1faba556871bf964ddb808e0b01287d1849","observation_id":"8fed9af1-48f0-4674-aed1-f86b4c2dd317","resolution":{"observed_at":"2026-08-04T20:03:11.451157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09001","last_updated":"2025-09-10T20:59:44Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T10:35:34.442784Z","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 1 inbound Pith citation observation for arXiv:2509.09001."}