{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:LDPOPVRRJIEVHATNC3KO4U5PY2","short_pith_number":"pith:LDPOPVRR","canonical_record":{"source":{"id":"math/0411102","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2004-11-04T21:01:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1a12dcfa8ff86d09fe4063a21fedb11e55b45db6c8c1fa66a21efbf51b505409","abstract_canon_sha256":"bc7d34673ee0e8833021bece2827363218c4efb9ea9f42b0ed6454b18393deee"},"schema_version":"1.0"},"canonical_sha256":"58dee7d6314a0953826d16d4ee53afc690360ff7e82bba02dcdd7ab0b029e8d2","source":{"kind":"arxiv","id":"math/0411102","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0411102","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"math/0411102v2","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0411102","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"LDPOPVRRJIEV","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"pith_short_16","alias_value":"LDPOPVRRJIEVHATN","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"pith_short_8","alias_value":"LDPOPVRR","created_at":"2026-06-03T22:06:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:LDPOPVRRJIEVHATNC3KO4U5PY2","target":"record","payload":{"canonical_record":{"source":{"id":"math/0411102","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2004-11-04T21:01:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1a12dcfa8ff86d09fe4063a21fedb11e55b45db6c8c1fa66a21efbf51b505409","abstract_canon_sha256":"bc7d34673ee0e8833021bece2827363218c4efb9ea9f42b0ed6454b18393deee"},"schema_version":"1.0"},"canonical_sha256":"58dee7d6314a0953826d16d4ee53afc690360ff7e82bba02dcdd7ab0b029e8d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:15.959339Z","signature_b64":"KLh8yW74YCtNQuyY7dekzFYSrr8ly1Q1kDFTZ3tHIkdmu8gHD6FvCReyZmirPxDq7ZJAIzKApxV5qqIk9fvtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58dee7d6314a0953826d16d4ee53afc690360ff7e82bba02dcdd7ab0b029e8d2","last_reissued_at":"2026-06-03T22:06:15.958930Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:15.958930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0411102","source_version":2,"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-06-03T22:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hss36uwFmtgqZ8xIbG6PMZCCVgep16RYGVYhXaPNeGYYfcpCbtlYv4I3afpO+xrKcKHhcrvSaQUFERovocn/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:53:32.354198Z"},"content_sha256":"4c69316f4c400c1af464b9418872b71128581425cf668a57e9da479999a1c32a","schema_version":"1.0","event_id":"sha256:4c69316f4c400c1af464b9418872b71128581425cf668a57e9da479999a1c32a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:LDPOPVRRJIEVHATNC3KO4U5PY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Theoretical and Experimental Analysis of a Randomized Algorithm for Sparse Fourier Transform Analysis","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"(2) Department of Mathematics, (3) Department of Mathematics, Anna Gilbert (2), Computational Mathematics, Computer Science, Electrical Engineering, Ingrid Daubechies (1) ((1) Program of Applied, Jing Zou (1), Martin Strauss (3), Princeton University, University of Michigan, University of Michigan)","submitted_at":"2004-11-04T21:01:41Z","abstract_excerpt":"We analyze a sublinear RAlSFA (Randomized Algorithm for Sparse Fourier Analysis) that finds a near-optimal B-term Sparse Representation R for a given discrete signal S of length N, in time and space poly(B,log(N)), following the approach given in \\cite{GGIMS}. Its time cost poly(log(N)) should be compared with the superlinear O(N log N) time requirement of the Fast Fourier Transform (FFT). A straightforward implementation of the RAlSFA, as presented in the theoretical paper \\cite{GGIMS}, turns out to be very slow in practice. Our main result is a greatly improved and practical RAlSFA. We intro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0411102","kind":"arxiv","version":2},"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/math/0411102/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-06-03T22:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71r8W7XGFy122CXzDuH0h7UfgGM4hZ/8iTlE2dV9PKiUCZR54HivztX1zJ/tAK8EdS25ITSGvYlZS3hdPLL6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:53:32.354602Z"},"content_sha256":"220e25e96f14a4ca1d177d0c7a8d4aeae18f998896b77148b199975c2b126d0c","schema_version":"1.0","event_id":"sha256:220e25e96f14a4ca1d177d0c7a8d4aeae18f998896b77148b199975c2b126d0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDPOPVRRJIEVHATNC3KO4U5PY2/bundle.json","state_url":"https://pith.science/pith/LDPOPVRRJIEVHATNC3KO4U5PY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDPOPVRRJIEVHATNC3KO4U5PY2/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-06-25T12:53:32Z","links":{"resolver":"https://pith.science/pith/LDPOPVRRJIEVHATNC3KO4U5PY2","bundle":"https://pith.science/pith/LDPOPVRRJIEVHATNC3KO4U5PY2/bundle.json","state":"https://pith.science/pith/LDPOPVRRJIEVHATNC3KO4U5PY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDPOPVRRJIEVHATNC3KO4U5PY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:LDPOPVRRJIEVHATNC3KO4U5PY2","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":"bc7d34673ee0e8833021bece2827363218c4efb9ea9f42b0ed6454b18393deee","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2004-11-04T21:01:41Z","title_canon_sha256":"1a12dcfa8ff86d09fe4063a21fedb11e55b45db6c8c1fa66a21efbf51b505409"},"schema_version":"1.0","source":{"id":"math/0411102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0411102","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"math/0411102v2","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0411102","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"LDPOPVRRJIEV","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"pith_short_16","alias_value":"LDPOPVRRJIEVHATN","created_at":"2026-06-03T22:06:15Z"},{"alias_kind":"pith_short_8","alias_value":"LDPOPVRR","created_at":"2026-06-03T22:06:15Z"}],"graph_snapshots":[{"event_id":"sha256:220e25e96f14a4ca1d177d0c7a8d4aeae18f998896b77148b199975c2b126d0c","target":"graph","created_at":"2026-06-03T22:06:15Z","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/math/0411102/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We analyze a sublinear RAlSFA (Randomized Algorithm for Sparse Fourier Analysis) that finds a near-optimal B-term Sparse Representation R for a given discrete signal S of length N, in time and space poly(B,log(N)), following the approach given in \\cite{GGIMS}. Its time cost poly(log(N)) should be compared with the superlinear O(N log N) time requirement of the Fast Fourier Transform (FFT). A straightforward implementation of the RAlSFA, as presented in the theoretical paper \\cite{GGIMS}, turns out to be very slow in practice. Our main result is a greatly improved and practical RAlSFA. We intro","authors_text":"(2) Department of Mathematics, (3) Department of Mathematics, Anna Gilbert (2), Computational Mathematics, Computer Science, Electrical Engineering, Ingrid Daubechies (1) ((1) Program of Applied, Jing Zou (1), Martin Strauss (3), Princeton University, University of Michigan, University of Michigan)","cross_cats":["cs.NA"],"headline":"","license":"","primary_cat":"math.NA","submitted_at":"2004-11-04T21:01:41Z","title":"Theoretical and Experimental Analysis of a Randomized Algorithm for Sparse Fourier Transform Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0411102","kind":"arxiv","version":2},"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:4c69316f4c400c1af464b9418872b71128581425cf668a57e9da479999a1c32a","target":"record","created_at":"2026-06-03T22:06:15Z","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":"bc7d34673ee0e8833021bece2827363218c4efb9ea9f42b0ed6454b18393deee","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2004-11-04T21:01:41Z","title_canon_sha256":"1a12dcfa8ff86d09fe4063a21fedb11e55b45db6c8c1fa66a21efbf51b505409"},"schema_version":"1.0","source":{"id":"math/0411102","kind":"arxiv","version":2}},"canonical_sha256":"58dee7d6314a0953826d16d4ee53afc690360ff7e82bba02dcdd7ab0b029e8d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58dee7d6314a0953826d16d4ee53afc690360ff7e82bba02dcdd7ab0b029e8d2","first_computed_at":"2026-06-03T22:06:15.958930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:15.958930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KLh8yW74YCtNQuyY7dekzFYSrr8ly1Q1kDFTZ3tHIkdmu8gHD6FvCReyZmirPxDq7ZJAIzKApxV5qqIk9fvtCw==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:15.959339Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0411102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c69316f4c400c1af464b9418872b71128581425cf668a57e9da479999a1c32a","sha256:220e25e96f14a4ca1d177d0c7a8d4aeae18f998896b77148b199975c2b126d0c"],"state_sha256":"baa3cb9bbd038114e0a476634d29274573aa9b2f6c7c1b866c9a2407e84b0e5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHsKL13U/LLVzChaC+bM/s6fC9hw8zzw38oNp6DaDjjurgJQCYwspiI0B1cAHJ6PjEtWr3Pk3mrT+gZgsyqSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:53:32.356726Z","bundle_sha256":"42b512507107e0796d2cf95fb1261c1cc1f84b194ca32de5f222ed1478500c07"}}