{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YPDA6ROIHARK25D5YF6VLQSUXW","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":"67c3ef0dbe3be16a323af175f39256bb7bd2a7530b8351f207d7639fea89581d","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T14:46:51Z","title_canon_sha256":"19a95dc016977e70ca5aa40f231b48f4058d65247d786c3f68717bfa174b176a"},"schema_version":"1.0","source":{"id":"1310.1803","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1803","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1803v2","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1803","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"YPDA6ROIHARK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YPDA6ROIHARK25D5","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YPDA6ROI","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:e445afa3b359d933ebd661ae5f3c7048f0e84b255cf49d3d643815ef45684e43","target":"graph","created_at":"2026-05-17T23:46:56Z","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"},"paper":{"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","authors_text":"Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T14:46:51Z","title":"A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1803","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:28af99d107c7d1fab308c6bc2cb962dfc41d618d7eccc23e553eb94dd424049b","target":"record","created_at":"2026-05-17T23:46:56Z","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":"67c3ef0dbe3be16a323af175f39256bb7bd2a7530b8351f207d7639fea89581d","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-07T14:46:51Z","title_canon_sha256":"19a95dc016977e70ca5aa40f231b48f4058d65247d786c3f68717bfa174b176a"},"schema_version":"1.0","source":{"id":"1310.1803","kind":"arxiv","version":2}},"canonical_sha256":"c3c60f45c83822ad747dc17d55c254bda98ece607b7c01cdd255d1d0b81adfb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3c60f45c83822ad747dc17d55c254bda98ece607b7c01cdd255d1d0b81adfb4","first_computed_at":"2026-05-17T23:46:56.055380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:56.055380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgJTK0/Ye7i45CnNcB0BoWkDIRauXuqOSNl/pOegpShaOnx6ZEPAtCQ5wxRa1rlNPK0u6Xeo+2D/O/sBO/w4DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:56.055983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1803","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28af99d107c7d1fab308c6bc2cb962dfc41d618d7eccc23e553eb94dd424049b","sha256:e445afa3b359d933ebd661ae5f3c7048f0e84b255cf49d3d643815ef45684e43"],"state_sha256":"37d01afccaf8f860c027d42822877e4f0154c5c91dd1d1246b362f26d74cfda6"}