{"as_of":"2026-08-08T21:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a86902618dfa1aa7201a25f75cefe65cd32766689a4f37f0abd893f54fe534bc","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-08T06:32:00.761636+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-07T15:10:57.183708Z","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:36:04.771630Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-07T15:44:24.823336Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11892","snapshot_observed_at":"2026-08-07T15:10:57.183708Z","title":"Fast rope attention: Combin ing the polynomial method and fast fourier transform","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16284","last_updated":"2025-05-22T06:26:28Z","snapshot_observed_at":"2026-08-07T22:03:10.571335Z","submitted_at":"2025-05-22T06:26:28Z","title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:57.183708Z"},"links":{"cited_paper":"/paper/2505.11892","citing_paper":"/paper/2505.16284"},"observation_digest":"sha256:e3a2a8778cf0ead38cecb5881936f85180e37d715cd3842c259a2d9b9e469a2b","observation_id":"621ca083-c8d5-43ac-958c-942fd50c1dbb","resolution":{"observed_at":"2026-08-07T15:10:57.183708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-07T15:44:24.823336Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11892","snapshot_observed_at":"2026-08-07T14:21:00.129826Z","title":"Fast rope attention: Combining the polynomial method and fast fourier transform.arXiv preprint arXiv:2505.11892,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19531","last_updated":"2025-05-26T05:33:26Z","snapshot_observed_at":"2026-08-08T07:05:10.715675Z","submitted_at":"2025-05-26T05:33:26Z","title":"Minimalist Softmax Attention Provably Learns Constrained Boolean Functions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:21:00.129826Z"},"links":{"cited_paper":"/paper/2505.11892","citing_paper":"/paper/2505.19531"},"observation_digest":"sha256:23715e66757cdefbda556d81643c4531c81a459c8f4c6ad0cac1541a031a01fb","observation_id":"dfeadc09-5c90-4514-a781-34d65330052a","resolution":{"observed_at":"2026-08-07T14:21:00.129826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","snapshot_observed_at":"2026-08-07T15:44:24.823336Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform","version":1},"cited_work":{"arxiv_id":"2505.11892","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.11892","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast rope attention: Combining the polynomial method and fast fourier transform","venue":null,"work_id":"5b44d542-6d11-4af6-aebe-513e4959baf3","year":2025},"citing_paper":{"arxiv_id":"2604.10980","last_updated":"2026-04-13T04:39:49Z","snapshot_observed_at":"2026-07-06T22:59:27.499664Z","submitted_at":"2026-04-13T04:39:49Z","title":"Tracking High-order Evolutions via Cascading Low-rank Fitting","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-10T15:55:27.722919Z"},"links":{"cited_paper":"/paper/2505.11892","citing_paper":"/paper/2604.10980"},"observation_digest":"sha256:d7b17d7ca08ec1c0416d85d2b880357d9c705669129a7d9570217292e97832fa","observation_id":"0cf7b32a-984c-4712-ab44-5f26aab50e0f","resolution":{"observed_at":"2026-05-11T09:36:04.777834Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2505.11892/citation-record","integrity":"/paper/2505.11892/integrity","json":"/paper/2505.11892/citation-record.json","paper":"/paper/2505.11892"},"outbound":[],"paper":{"arxiv_id":"2505.11892","last_updated":"2025-05-17T08:03:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T15:44:24.823336Z","submitted_at":"2025-05-17T08:03:50Z","title":"Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2505.11892."}