{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NUQC2V5RFQJB3VWLEX6DVQKAF6","short_pith_number":"pith:NUQC2V5R","schema_version":"1.0","canonical_sha256":"6d202d57b12c121dd6cb25fc3ac1402fa6b3e0dfe7e59e700f38c2467202f5df","source":{"kind":"arxiv","id":"1508.06336","version":1},"attestation_state":"computed","paper":{"title":"SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Joseph K. Bradley, Kannan Ramchandran, Sameer Pawar, Xiao Li","submitted_at":"2015-08-26T00:34:30Z","abstract_excerpt":"We consider the problem of computing the Walsh-Hadamard Transform (WHT) of some $N$-length input vector in the presence of noise, where the $N$-point Walsh spectrum is $K$-sparse with $K = {O}(N^{\\delta})$ scaling sub-linearly in the input dimension $N$ for some $0<\\delta<1$. Over the past decade, there has been a resurgence in research related to the computation of Discrete Fourier Transform (DFT) for some length-$N$ input signal that has a $K$-sparse Fourier spectrum. In particular, through a sparse-graph code design, our earlier work on the Fast Fourier Aliasing-based Sparse Transform (FFAS"},"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":"1508.06336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-26T00:34:30Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"be8a5cd7098bb8026779e50a4f51b99d0ee346ec2d8932d5ab352b677a587053","abstract_canon_sha256":"77034472d3a73bfe6fec9e5b4e8543beea5cbb95344111180834e3c32ec979cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:43.271645Z","signature_b64":"c/pWwVpW1fmdCVxcIc7IyX8Pdl0xzgL8lBalX5MkEdTgoXdqp8w7MfZvwU9U5ZbyUfRUDUAwaMVw1GOx8YsdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d202d57b12c121dd6cb25fc3ac1402fa6b3e0dfe7e59e700f38c2467202f5df","last_reissued_at":"2026-05-18T01:34:43.270959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:43.270959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Joseph K. Bradley, Kannan Ramchandran, Sameer Pawar, Xiao Li","submitted_at":"2015-08-26T00:34:30Z","abstract_excerpt":"We consider the problem of computing the Walsh-Hadamard Transform (WHT) of some $N$-length input vector in the presence of noise, where the $N$-point Walsh spectrum is $K$-sparse with $K = {O}(N^{\\delta})$ scaling sub-linearly in the input dimension $N$ for some $0<\\delta<1$. Over the past decade, there has been a resurgence in research related to the computation of Discrete Fourier Transform (DFT) for some length-$N$ input signal that has a $K$-sparse Fourier spectrum. In particular, through a sparse-graph code design, our earlier work on the Fast Fourier Aliasing-based Sparse Transform (FFAS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06336","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":"1508.06336","created_at":"2026-05-18T01:34:43.271065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06336v1","created_at":"2026-05-18T01:34:43.271065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06336","created_at":"2026-05-18T01:34:43.271065+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUQC2V5RFQJB","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUQC2V5RFQJB3VWL","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUQC2V5R","created_at":"2026-05-18T12:29:34.919912+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/NUQC2V5RFQJB3VWLEX6DVQKAF6","json":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6.json","graph_json":"https://pith.science/api/pith-number/NUQC2V5RFQJB3VWLEX6DVQKAF6/graph.json","events_json":"https://pith.science/api/pith-number/NUQC2V5RFQJB3VWLEX6DVQKAF6/events.json","paper":"https://pith.science/paper/NUQC2V5R"},"agent_actions":{"view_html":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6","download_json":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6.json","view_paper":"https://pith.science/paper/NUQC2V5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06336&json=true","fetch_graph":"https://pith.science/api/pith-number/NUQC2V5RFQJB3VWLEX6DVQKAF6/graph.json","fetch_events":"https://pith.science/api/pith-number/NUQC2V5RFQJB3VWLEX6DVQKAF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/action/storage_attestation","attest_author":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/action/author_attestation","sign_citation":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/action/citation_signature","submit_replication":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/action/replication_record"}},"created_at":"2026-05-18T01:34:43.271065+00:00","updated_at":"2026-05-18T01:34:43.271065+00:00"}