{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VG4JGICTDJPQKEO6CY72GRAJZ6","short_pith_number":"pith:VG4JGICT","schema_version":"1.0","canonical_sha256":"a9b89320531a5f0511de163fa34409cfbd97aa52afede730e461b54489878940","source":{"kind":"arxiv","id":"1701.04492","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.04492","created_at":"2026-05-18T00:52:43.555999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04492v1","created_at":"2026-05-18T00:52:43.555999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04492","created_at":"2026-05-18T00:52:43.555999+00:00"},{"alias_kind":"pith_short_12","alias_value":"VG4JGICTDJPQ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VG4JGICTDJPQKEO6","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VG4JGICT","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6","json":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6.json","graph_json":"https://pith.science/api/pith-number/VG4JGICTDJPQKEO6CY72GRAJZ6/graph.json","events_json":"https://pith.science/api/pith-number/VG4JGICTDJPQKEO6CY72GRAJZ6/events.json","paper":"https://pith.science/paper/VG4JGICT"},"agent_actions":{"view_html":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6","download_json":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6.json","view_paper":"https://pith.science/paper/VG4JGICT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04492&json=true","fetch_graph":"https://pith.science/api/pith-number/VG4JGICTDJPQKEO6CY72GRAJZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/VG4JGICTDJPQKEO6CY72GRAJZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/action/storage_attestation","attest_author":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/action/author_attestation","sign_citation":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/action/citation_signature","submit_replication":"https://pith.science/pith/VG4JGICTDJPQKEO6CY72GRAJZ6/action/replication_record"}},"created_at":"2026-05-18T00:52:43.555999+00:00","updated_at":"2026-05-18T00:52:43.555999+00:00"}