{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VG4JGICTDJPQKEO6CY72GRAJZ6","short_pith_number":"pith:VG4JGICT","canonical_record":{"source":{"id":"1701.04492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-01-17T00:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"3b78153f028d6df711ccc1d1cfdb001fc37258b7f62fc342fb6210ee85649e52","abstract_canon_sha256":"6b038d8722d75457d9f011cb1e41f627506dd353899e645f3d78ea983644e874"},"schema_version":"1.0"},"canonical_sha256":"a9b89320531a5f0511de163fa34409cfbd97aa52afede730e461b54489878940","source":{"kind":"arxiv","id":"1701.04492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04492","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04492v1","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04492","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"VG4JGICTDJPQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VG4JGICTDJPQKEO6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VG4JGICT","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VG4JGICTDJPQKEO6CY72GRAJZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-01-17T00:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"3b78153f028d6df711ccc1d1cfdb001fc37258b7f62fc342fb6210ee85649e52","abstract_canon_sha256":"6b038d8722d75457d9f011cb1e41f627506dd353899e645f3d78ea983644e874"},"schema_version":"1.0"},"canonical_sha256":"a9b89320531a5f0511de163fa34409cfbd97aa52afede730e461b54489878940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:43.556502Z","signature_b64":"Lwq3i+1f0/PGxbH+ud7IeBqCXKsiW0/gcVen3gTAmSN4pFzGAoCrOo0oF+GAKQJDOnMIsJG07NTwhSjIlobsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9b89320531a5f0511de163fa34409cfbd97aa52afede730e461b54489878940","last_reissued_at":"2026-05-18T00:52:43.555914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:43.555914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04492","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-05-18T00:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhEUyea6Kev+D1LU8PWtTkvXa/SvU1ZNugy5NnlHnIDw0D2y/kTIrVNBHZQdJH+w+tIPvHBhXhn/OWlLz/KZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:00:59.690854Z"},"content_sha256":"2642854575aaa64b2b11398fb73aafb051fa681029df7f01629b30639bdc594b","schema_version":"1.0","event_id":"sha256:2642854575aaa64b2b11398fb73aafb051fa681029df7f01629b30639bdc594b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VG4JGICTDJPQKEO6CY72GRAJZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A nonuniform fast Fourier transform based on low rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alex Townsend, Diego Ruiz-Antolin","submitted_at":"2017-01-17T00:34:15Z","abstract_excerpt":"By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\\mathcal{O}(N\\log N\\log(1/\\epsilon)/\\log\\!\\log(1/\\epsilon))$ operations based on the fast Fourier transform, where $N$ is the size of the transform and $0<\\epsilon <1$ is a working precision. Our key observation is that a NUDFT and DFT matrix divided entry-by-entry is often well-approximated by a low rank matrix, allowing us to express a NUDFT matrix as a sum of diagonally-scaled DFT matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04492","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":""},"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-05-18T00:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7ORTkOqxr0QKKfl+Ng3PKxw0oWGit523H7x3dPDlUt57QAjiTt85/FdtVf9LmzY9wT8UYfPxnDO7XgnIkPhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:00:59.691559Z"},"content_sha256":"84f1b21af4af99fe1eaf85d76c45dc0f1d186599b33c1779e987da308a2f703b","schema_version":"1.0","event_id":"sha256:84f1b21af4af99fe1eaf85d76c45dc0f1d186599b33c1779e987da308a2f703b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/bundle.json","state_url":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/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-05-27T19:00:59Z","links":{"resolver":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6","bundle":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/bundle.json","state":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VG4JGICTDJPQKEO6CY72GRAJZ6","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":"6b038d8722d75457d9f011cb1e41f627506dd353899e645f3d78ea983644e874","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-01-17T00:34:15Z","title_canon_sha256":"3b78153f028d6df711ccc1d1cfdb001fc37258b7f62fc342fb6210ee85649e52"},"schema_version":"1.0","source":{"id":"1701.04492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04492","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04492v1","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04492","created_at":"2026-05-18T00:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"VG4JGICTDJPQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VG4JGICTDJPQKEO6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VG4JGICT","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:84f1b21af4af99fe1eaf85d76c45dc0f1d186599b33c1779e987da308a2f703b","target":"graph","created_at":"2026-05-18T00:52:43Z","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"},"paper":{"abstract_excerpt":"By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\\mathcal{O}(N\\log N\\log(1/\\epsilon)/\\log\\!\\log(1/\\epsilon))$ operations based on the fast Fourier transform, where $N$ is the size of the transform and $0<\\epsilon <1$ is a working precision. Our key observation is that a NUDFT and DFT matrix divided entry-by-entry is often well-approximated by a low rank matrix, allowing us to express a NUDFT matrix as a sum of diagonally-scaled DFT matr","authors_text":"Alex Townsend, Diego Ruiz-Antolin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-01-17T00:34:15Z","title":"A nonuniform fast Fourier transform based on low rank approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04492","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:2642854575aaa64b2b11398fb73aafb051fa681029df7f01629b30639bdc594b","target":"record","created_at":"2026-05-18T00:52:43Z","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":"6b038d8722d75457d9f011cb1e41f627506dd353899e645f3d78ea983644e874","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-01-17T00:34:15Z","title_canon_sha256":"3b78153f028d6df711ccc1d1cfdb001fc37258b7f62fc342fb6210ee85649e52"},"schema_version":"1.0","source":{"id":"1701.04492","kind":"arxiv","version":1}},"canonical_sha256":"a9b89320531a5f0511de163fa34409cfbd97aa52afede730e461b54489878940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9b89320531a5f0511de163fa34409cfbd97aa52afede730e461b54489878940","first_computed_at":"2026-05-18T00:52:43.555914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:43.555914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lwq3i+1f0/PGxbH+ud7IeBqCXKsiW0/gcVen3gTAmSN4pFzGAoCrOo0oF+GAKQJDOnMIsJG07NTwhSjIlobsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:43.556502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2642854575aaa64b2b11398fb73aafb051fa681029df7f01629b30639bdc594b","sha256:84f1b21af4af99fe1eaf85d76c45dc0f1d186599b33c1779e987da308a2f703b"],"state_sha256":"824cfd4777a6bbb36161d523cdbb1e56dcb377231840c22b063786ed8d8ceb1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"by/7u8Rmv621cAlafKfZzHLJDS1KzVO+8p42kuiEN37ghgzfiDr2OPZYksAD8aivLNYRY1aybGIW3rm0gTZJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:00:59.695751Z","bundle_sha256":"091dfd0256896849edf613bdb7d531259a814b8df2419a0ec206b7af58702ce3"}}