{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NUQC2V5RFQJB3VWLEX6DVQKAF6","short_pith_number":"pith:NUQC2V5R","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"},"canonical_sha256":"6d202d57b12c121dd6cb25fc3ac1402fa6b3e0dfe7e59e700f38c2467202f5df","source":{"kind":"arxiv","id":"1508.06336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06336","created_at":"2026-05-18T01:34:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06336v1","created_at":"2026-05-18T01:34:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06336","created_at":"2026-05-18T01:34:43Z"},{"alias_kind":"pith_short_12","alias_value":"NUQC2V5RFQJB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NUQC2V5RFQJB3VWL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NUQC2V5R","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NUQC2V5RFQJB3VWLEX6DVQKAF6","target":"record","payload":{"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"},"canonical_sha256":"6d202d57b12c121dd6cb25fc3ac1402fa6b3e0dfe7e59e700f38c2467202f5df","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"},"source_kind":"arxiv","source_id":"1508.06336","source_version":1,"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-18T01:34:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqa60OQu3svAHkBSDfIqLtDa8S5fCZ1UrflZ2vvAh0K3Qvk//1c7aLxCY1fHXNG5FVOyQqqjFd+XBp+CJ7OYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:02:27.798782Z"},"content_sha256":"8a0f3603920ce6a58771fa9402c70e62c30ba21ba3d4481f0e4de7d4d5d05b8c","schema_version":"1.0","event_id":"sha256:8a0f3603920ce6a58771fa9402c70e62c30ba21ba3d4481f0e4de7d4d5d05b8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NUQC2V5RFQJB3VWLEX6DVQKAF6","target":"graph","payload":{"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"},"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-18T01:34:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihXZnFkfXMG+ykChB+Xts5fxhLzcthiwGVEVmmKAopUmC7ODdzNE+jSAq+wV17WNrDsDXXFaam/KU35xamJbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:02:27.799140Z"},"content_sha256":"6eca9287893d1de10ee1e99c90ff0c8a1ed019a51f5377e7056118207655cb8b","schema_version":"1.0","event_id":"sha256:6eca9287893d1de10ee1e99c90ff0c8a1ed019a51f5377e7056118207655cb8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/bundle.json","state_url":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/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-28T04:02:27Z","links":{"resolver":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6","bundle":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/bundle.json","state":"https://pith.science/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUQC2V5RFQJB3VWLEX6DVQKAF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NUQC2V5RFQJB3VWLEX6DVQKAF6","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":"77034472d3a73bfe6fec9e5b4e8543beea5cbb95344111180834e3c32ec979cd","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-26T00:34:30Z","title_canon_sha256":"be8a5cd7098bb8026779e50a4f51b99d0ee346ec2d8932d5ab352b677a587053"},"schema_version":"1.0","source":{"id":"1508.06336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06336","created_at":"2026-05-18T01:34:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06336v1","created_at":"2026-05-18T01:34:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06336","created_at":"2026-05-18T01:34:43Z"},{"alias_kind":"pith_short_12","alias_value":"NUQC2V5RFQJB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NUQC2V5RFQJB3VWL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NUQC2V5R","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:6eca9287893d1de10ee1e99c90ff0c8a1ed019a51f5377e7056118207655cb8b","target":"graph","created_at":"2026-05-18T01:34:43Z","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":"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","authors_text":"Joseph K. Bradley, Kannan Ramchandran, Sameer Pawar, Xiao Li","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-26T00:34:30Z","title":"SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06336","kind":"arxiv","version":1},"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:8a0f3603920ce6a58771fa9402c70e62c30ba21ba3d4481f0e4de7d4d5d05b8c","target":"record","created_at":"2026-05-18T01:34:43Z","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":"77034472d3a73bfe6fec9e5b4e8543beea5cbb95344111180834e3c32ec979cd","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-26T00:34:30Z","title_canon_sha256":"be8a5cd7098bb8026779e50a4f51b99d0ee346ec2d8932d5ab352b677a587053"},"schema_version":"1.0","source":{"id":"1508.06336","kind":"arxiv","version":1}},"canonical_sha256":"6d202d57b12c121dd6cb25fc3ac1402fa6b3e0dfe7e59e700f38c2467202f5df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d202d57b12c121dd6cb25fc3ac1402fa6b3e0dfe7e59e700f38c2467202f5df","first_computed_at":"2026-05-18T01:34:43.270959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:43.270959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c/pWwVpW1fmdCVxcIc7IyX8Pdl0xzgL8lBalX5MkEdTgoXdqp8w7MfZvwU9U5ZbyUfRUDUAwaMVw1GOx8YsdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:43.271645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a0f3603920ce6a58771fa9402c70e62c30ba21ba3d4481f0e4de7d4d5d05b8c","sha256:6eca9287893d1de10ee1e99c90ff0c8a1ed019a51f5377e7056118207655cb8b"],"state_sha256":"18bbf51cce7f2b112562fbe5d9630bf8b8e647285167371a1a6504a294b12921"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GC7cHscj2D7R7FgSRvPhbwj9D36JeOJwilA6ySX3PO5haiqRmtM7gXnnAIxmAy44Mt0oLGs3aLTbkIXBSosDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:02:27.801434Z","bundle_sha256":"c111d791806fa02cc3b14dcea041d53717cece5666d8b44a5baf5b74087a8232"}}