{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2YJU62AKNEFYFCSNAVPBX2SBIA","short_pith_number":"pith:2YJU62AK","canonical_record":{"source":{"id":"2311.05908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T07:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"9b7ee75b48354c1b88352a45c95ba163fbddbd211fbe394ba1601ef759ba95e8","abstract_canon_sha256":"27d039d5eda81377e81585ac4136f0a018a162cc3f9a38b4df2e1d1dbe9d884e"},"schema_version":"1.0"},"canonical_sha256":"d6134f680a690b828a4d055e1bea414034fddcfd77447eb94951ae98131968b4","source":{"kind":"arxiv","id":"2311.05908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.05908","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2311.05908v1","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05908","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"2YJU62AKNEFY","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"2YJU62AKNEFYFCSN","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"2YJU62AK","created_at":"2026-07-05T07:11:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2YJU62AKNEFYFCSNAVPBX2SBIA","target":"record","payload":{"canonical_record":{"source":{"id":"2311.05908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T07:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"9b7ee75b48354c1b88352a45c95ba163fbddbd211fbe394ba1601ef759ba95e8","abstract_canon_sha256":"27d039d5eda81377e81585ac4136f0a018a162cc3f9a38b4df2e1d1dbe9d884e"},"schema_version":"1.0"},"canonical_sha256":"d6134f680a690b828a4d055e1bea414034fddcfd77447eb94951ae98131968b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:25.123811Z","signature_b64":"yCUkEqz3HFScwfUh5rNPBWRP4DCqTmhJA/Tzdpo7s2oXnZndKY92PCmC8MgPt5kYcDNzhwTQwyAmyaMAxrQnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6134f680a690b828a4d055e1bea414034fddcfd77447eb94951ae98131968b4","last_reissued_at":"2026-07-05T07:11:25.122665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:25.122665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.05908","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzAK3asL0//zHxnzOlLuArpWWh0OXtBn3JJNOSYV0eLioieK5aGnpOAD9B8b8Jg7Il46bgt+iZ116vjCUUz7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:01:56.859579Z"},"content_sha256":"658c0696b1cdd8180f0595e52a974e2eb195fe327c4b8b4fa98c14e12362acde","schema_version":"1.0","event_id":"sha256:658c0696b1cdd8180f0595e52a974e2eb195fe327c4b8b4fa98c14e12362acde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2YJU62AKNEFYFCSNAVPBX2SBIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FlashFFTConv: Efficient Convolutions for Long Sequences with Tensor Cores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christopher R\\'e, Daniel Y. Fu, Eric Nguyen, Hermann Kumbong","submitted_at":"2023-11-10T07:33:35Z","abstract_excerpt":"Convolution models with long filters have demonstrated state-of-the-art reasoning abilities in many long-sequence tasks but lag behind the most optimized Transformers in wall-clock time. A major bottleneck is the Fast Fourier Transform (FFT)--which allows long convolutions to run in $O(N logN)$ time in sequence length $N$ but has poor hardware utilization. In this paper, we study how to optimize the FFT convolution. We find two key bottlenecks: the FFT does not effectively use specialized matrix multiply units, and it incurs expensive I/O between layers of the memory hierarchy. In response, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05908","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.05908/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gj+0u+eBYLMIe6+ISQQqoI4XglEHF6OqtHwrrh0xUcHGeSOT9/HDQhM/slawA/IKBsPt+tTAtOUr81cDyLBiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:01:56.860131Z"},"content_sha256":"e550fcceae4d92a30dc846075bd55deafd5dffc8aaaa60b426e4b7d934ba142e","schema_version":"1.0","event_id":"sha256:e550fcceae4d92a30dc846075bd55deafd5dffc8aaaa60b426e4b7d934ba142e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YJU62AKNEFYFCSNAVPBX2SBIA/bundle.json","state_url":"https://pith.science/pith/2YJU62AKNEFYFCSNAVPBX2SBIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YJU62AKNEFYFCSNAVPBX2SBIA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T00:01:56Z","links":{"resolver":"https://pith.science/pith/2YJU62AKNEFYFCSNAVPBX2SBIA","bundle":"https://pith.science/pith/2YJU62AKNEFYFCSNAVPBX2SBIA/bundle.json","state":"https://pith.science/pith/2YJU62AKNEFYFCSNAVPBX2SBIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YJU62AKNEFYFCSNAVPBX2SBIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2YJU62AKNEFYFCSNAVPBX2SBIA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"27d039d5eda81377e81585ac4136f0a018a162cc3f9a38b4df2e1d1dbe9d884e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T07:33:35Z","title_canon_sha256":"9b7ee75b48354c1b88352a45c95ba163fbddbd211fbe394ba1601ef759ba95e8"},"schema_version":"1.0","source":{"id":"2311.05908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.05908","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2311.05908v1","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05908","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"2YJU62AKNEFY","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"2YJU62AKNEFYFCSN","created_at":"2026-07-05T07:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"2YJU62AK","created_at":"2026-07-05T07:11:25Z"}],"graph_snapshots":[{"event_id":"sha256:e550fcceae4d92a30dc846075bd55deafd5dffc8aaaa60b426e4b7d934ba142e","target":"graph","created_at":"2026-07-05T07:11:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.05908/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Convolution models with long filters have demonstrated state-of-the-art reasoning abilities in many long-sequence tasks but lag behind the most optimized Transformers in wall-clock time. A major bottleneck is the Fast Fourier Transform (FFT)--which allows long convolutions to run in $O(N logN)$ time in sequence length $N$ but has poor hardware utilization. In this paper, we study how to optimize the FFT convolution. We find two key bottlenecks: the FFT does not effectively use specialized matrix multiply units, and it incurs expensive I/O between layers of the memory hierarchy. In response, we","authors_text":"Christopher R\\'e, Daniel Y. Fu, Eric Nguyen, Hermann Kumbong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T07:33:35Z","title":"FlashFFTConv: Efficient Convolutions for Long Sequences with Tensor Cores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05908","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:658c0696b1cdd8180f0595e52a974e2eb195fe327c4b8b4fa98c14e12362acde","target":"record","created_at":"2026-07-05T07:11:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"27d039d5eda81377e81585ac4136f0a018a162cc3f9a38b4df2e1d1dbe9d884e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-10T07:33:35Z","title_canon_sha256":"9b7ee75b48354c1b88352a45c95ba163fbddbd211fbe394ba1601ef759ba95e8"},"schema_version":"1.0","source":{"id":"2311.05908","kind":"arxiv","version":1}},"canonical_sha256":"d6134f680a690b828a4d055e1bea414034fddcfd77447eb94951ae98131968b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6134f680a690b828a4d055e1bea414034fddcfd77447eb94951ae98131968b4","first_computed_at":"2026-07-05T07:11:25.122665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:11:25.122665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yCUkEqz3HFScwfUh5rNPBWRP4DCqTmhJA/Tzdpo7s2oXnZndKY92PCmC8MgPt5kYcDNzhwTQwyAmyaMAxrQnDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:11:25.123811Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.05908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:658c0696b1cdd8180f0595e52a974e2eb195fe327c4b8b4fa98c14e12362acde","sha256:e550fcceae4d92a30dc846075bd55deafd5dffc8aaaa60b426e4b7d934ba142e"],"state_sha256":"7b92c0cc160fc33cf3bf1158c568f92997626829cf06480ce3c2dc47f5821248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0JsKbZcS6dawUg/Scn6ORGxmqKyB6eB/IbSDMCFmU2DNxAcixSOKIet8GpUkb27RXKN0VzFOuWwxTpodaTyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T00:01:56.867083Z","bundle_sha256":"45bec10af59bc9f61df686cf72275381410127c78796f92c8c424dadecbdb8bc"}}