{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YPDA6ROIHARK25D5YF6VLQSUXW","short_pith_number":"pith:YPDA6ROI","schema_version":"1.0","canonical_sha256":"c3c60f45c83822ad747dc17d55c254bda98ece607b7c01cdd255d1d0b81adfb4","source":{"kind":"arxiv","id":"1310.1803","version":2},"attestation_state":"computed","paper":{"title":"A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar","submitted_at":"2013-10-07T14:46:51Z","abstract_excerpt":"A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an $N$ dimensional signal with a $K$-sparse WHT, where $N$ is a power of two and $K = O(N^\\alpha)$, scales sub-linearly in $N$ for some $0 < \\alpha < 1$. Assuming a random support model for the non-zero transform domain components, the algorithm reconstructs the WHT of the signal with a sample complexity $O(K \\log_2(\\frac{N}{K}))$, a computational complexity $O(K\\log_2(K)\\log_2(\\frac{N}{K}))$ and with a very high probability asymptotically tending to 1.\n  The approach is based on the"},"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":"1310.1803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T14:46:51Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"19a95dc016977e70ca5aa40f231b48f4058d65247d786c3f68717bfa174b176a","abstract_canon_sha256":"67c3ef0dbe3be16a323af175f39256bb7bd2a7530b8351f207d7639fea89581d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:56.055983Z","signature_b64":"SgJTK0/Ye7i45CnNcB0BoWkDIRauXuqOSNl/pOegpShaOnx6ZEPAtCQ5wxRa1rlNPK0u6Xeo+2D/O/sBO/w4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3c60f45c83822ad747dc17d55c254bda98ece607b7c01cdd255d1d0b81adfb4","last_reissued_at":"2026-05-17T23:46:56.055380Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:56.055380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar","submitted_at":"2013-10-07T14:46:51Z","abstract_excerpt":"A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an $N$ dimensional signal with a $K$-sparse WHT, where $N$ is a power of two and $K = O(N^\\alpha)$, scales sub-linearly in $N$ for some $0 < \\alpha < 1$. Assuming a random support model for the non-zero transform domain components, the algorithm reconstructs the WHT of the signal with a sample complexity $O(K \\log_2(\\frac{N}{K}))$, a computational complexity $O(K\\log_2(K)\\log_2(\\frac{N}{K}))$ and with a very high probability asymptotically tending to 1.\n  The approach is based on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1803","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":""},"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":"1310.1803","created_at":"2026-05-17T23:46:56.055503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1803v2","created_at":"2026-05-17T23:46:56.055503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1803","created_at":"2026-05-17T23:46:56.055503+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPDA6ROIHARK","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPDA6ROIHARK25D5","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPDA6ROI","created_at":"2026-05-18T12:28:09.283467+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/YPDA6ROIHARK25D5YF6VLQSUXW","json":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW.json","graph_json":"https://pith.science/api/pith-number/YPDA6ROIHARK25D5YF6VLQSUXW/graph.json","events_json":"https://pith.science/api/pith-number/YPDA6ROIHARK25D5YF6VLQSUXW/events.json","paper":"https://pith.science/paper/YPDA6ROI"},"agent_actions":{"view_html":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW","download_json":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW.json","view_paper":"https://pith.science/paper/YPDA6ROI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1803&json=true","fetch_graph":"https://pith.science/api/pith-number/YPDA6ROIHARK25D5YF6VLQSUXW/graph.json","fetch_events":"https://pith.science/api/pith-number/YPDA6ROIHARK25D5YF6VLQSUXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/action/storage_attestation","attest_author":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/action/author_attestation","sign_citation":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/action/citation_signature","submit_replication":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/action/replication_record"}},"created_at":"2026-05-17T23:46:56.055503+00:00","updated_at":"2026-05-17T23:46:56.055503+00:00"}