{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YPDA6ROIHARK25D5YF6VLQSUXW","short_pith_number":"pith:YPDA6ROI","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"},"canonical_sha256":"c3c60f45c83822ad747dc17d55c254bda98ece607b7c01cdd255d1d0b81adfb4","source":{"kind":"arxiv","id":"1310.1803","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YPDA6ROIHARK25D5YF6VLQSUXW","target":"record","payload":{"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"},"canonical_sha256":"c3c60f45c83822ad747dc17d55c254bda98ece607b7c01cdd255d1d0b81adfb4","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"},"source_kind":"arxiv","source_id":"1310.1803","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-05-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/noMUl5Abi+CaCx12ycn+n1bBTpxh1DSGFoRK0LlCuTUpgcrAXcVvqE0r4Y2rXSaqeSn97f8jM4qgfWIMQ8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:09:34.036091Z"},"content_sha256":"28af99d107c7d1fab308c6bc2cb962dfc41d618d7eccc23e553eb94dd424049b","schema_version":"1.0","event_id":"sha256:28af99d107c7d1fab308c6bc2cb962dfc41d618d7eccc23e553eb94dd424049b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YPDA6ROIHARK25D5YF6VLQSUXW","target":"graph","payload":{"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"},"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-05-17T23:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwsuAfU4TVJcggVc5KamwrU1YcbY2Oh6jZH39VyLE/IfmMrUJyz9o3EGGU+xFY+uUKMvGG6qkcwdAd6huu4qAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:09:34.036780Z"},"content_sha256":"e445afa3b359d933ebd661ae5f3c7048f0e84b255cf49d3d643815ef45684e43","schema_version":"1.0","event_id":"sha256:e445afa3b359d933ebd661ae5f3c7048f0e84b255cf49d3d643815ef45684e43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/bundle.json","state_url":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPDA6ROIHARK25D5YF6VLQSUXW/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-05-31T05:09:34Z","links":{"resolver":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW","bundle":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/bundle.json","state":"https://pith.science/pith/YPDA6ROIHARK25D5YF6VLQSUXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPDA6ROIHARK25D5YF6VLQSUXW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TUwkHlm/ju2fiPjJ74jFwNavFgCTr3tqQf76KNz/zDpbsER2ujQViVYgMJSUwRM2LhQGYJFmYHFrgn4+CJpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:09:34.040215Z","bundle_sha256":"d9d525260c36acb55898ba7cc8445354c18a07f544d2a57c9a77370cae62bcd5"}}