{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C6A2P7WJRRFH75OT4WHC7HPFJF","short_pith_number":"pith:C6A2P7WJ","schema_version":"1.0","canonical_sha256":"1781a7fec98c4a7ff5d3e58e2f9de54959b33633ff3d57c233f8d4861d3ed95d","source":{"kind":"arxiv","id":"1604.06682","version":6},"attestation_state":"computed","paper":{"title":"A sparse multidimensional FFT for real positive vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benoit Meister, Harper Langston, Pierre-David Letourneau, Richard Lethin","submitted_at":"2016-04-22T14:39:33Z","abstract_excerpt":"We present a sparse multidimensional FFT (sMFFT) randomized algorithm for real positive vectors. The algorithm works in any fixed dimension, requires (O(R log(R) log(N)) ) samples and runs in O( R log^2(R) log(N)) complexity (where N is the total size of the vector in d dimensions and R is the number of nonzeros). It is stable to low-level noise and exhibits an exponentially small probability of failure."},"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":"1604.06682","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-22T14:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"b883ccc4d9ee5a42586cc37fc2a6e6bcdb1c647c58edf258a6152c2f65c71b7c","abstract_canon_sha256":"6b73db3ecbe4037f0c7c52695b0bf5da91e95ae6f1fd66221eca41dd681e7c58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:39.220525Z","signature_b64":"HPw3bpctGj2DX7nJWgfWkofhpa+4RrOr3KH8ObXtp4w+oXIn46b/vFL6p4r7nk7HP48sg7VZiq2LNmotYxgiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1781a7fec98c4a7ff5d3e58e2f9de54959b33633ff3d57c233f8d4861d3ed95d","last_reissued_at":"2026-05-18T00:55:39.219800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:39.219800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sparse multidimensional FFT for real positive vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benoit Meister, Harper Langston, Pierre-David Letourneau, Richard Lethin","submitted_at":"2016-04-22T14:39:33Z","abstract_excerpt":"We present a sparse multidimensional FFT (sMFFT) randomized algorithm for real positive vectors. The algorithm works in any fixed dimension, requires (O(R log(R) log(N)) ) samples and runs in O( R log^2(R) log(N)) complexity (where N is the total size of the vector in d dimensions and R is the number of nonzeros). It is stable to low-level noise and exhibits an exponentially small probability of failure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06682","kind":"arxiv","version":6},"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":"1604.06682","created_at":"2026-05-18T00:55:39.219916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06682v6","created_at":"2026-05-18T00:55:39.219916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06682","created_at":"2026-05-18T00:55:39.219916+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6A2P7WJRRFH","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6A2P7WJRRFH75OT","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6A2P7WJ","created_at":"2026-05-18T12:30:09.641336+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/C6A2P7WJRRFH75OT4WHC7HPFJF","json":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF.json","graph_json":"https://pith.science/api/pith-number/C6A2P7WJRRFH75OT4WHC7HPFJF/graph.json","events_json":"https://pith.science/api/pith-number/C6A2P7WJRRFH75OT4WHC7HPFJF/events.json","paper":"https://pith.science/paper/C6A2P7WJ"},"agent_actions":{"view_html":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF","download_json":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF.json","view_paper":"https://pith.science/paper/C6A2P7WJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06682&json=true","fetch_graph":"https://pith.science/api/pith-number/C6A2P7WJRRFH75OT4WHC7HPFJF/graph.json","fetch_events":"https://pith.science/api/pith-number/C6A2P7WJRRFH75OT4WHC7HPFJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF/action/storage_attestation","attest_author":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF/action/author_attestation","sign_citation":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF/action/citation_signature","submit_replication":"https://pith.science/pith/C6A2P7WJRRFH75OT4WHC7HPFJF/action/replication_record"}},"created_at":"2026-05-18T00:55:39.219916+00:00","updated_at":"2026-05-18T00:55:39.219916+00:00"}