{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QQ4A5P4OKW6WSDKZY7TOHBSPOR","short_pith_number":"pith:QQ4A5P4O","schema_version":"1.0","canonical_sha256":"84380ebf8e55bd690d59c7e6e3864f744bef67c5c78acf7af1145c1d5c3d82a5","source":{"kind":"arxiv","id":"1504.07648","version":1},"attestation_state":"computed","paper":{"title":"Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.FA","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Cheraghchi, Piotr Indyk","submitted_at":"2015-04-28T20:22:27Z","abstract_excerpt":"For every fixed constant $\\alpha > 0$, we design an algorithm for computing the $k$-sparse Walsh-Hadamard transform of an $N$-dimensional vector $x \\in \\mathbb{R}^N$ in time $k^{1+\\alpha} (\\log N)^{O(1)}$. Specifically, the algorithm is given query access to $x$ and computes a $k$-sparse $\\tilde{x} \\in \\mathbb{R}^N$ satisfying $\\|\\tilde{x} - \\hat{x}\\|_1 \\leq c \\|\\hat{x} - H_k(\\hat{x})\\|_1$, for an absolute constant $c > 0$, where $\\hat{x}$ is the transform of $x$ and $H_k(\\hat{x})$ is its best $k$-sparse approximation. Our algorithm is fully deterministic and only uses non-adaptive queries to "},"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":"1504.07648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-28T20:22:27Z","cross_cats_sorted":["cs.CC","cs.LG","math.FA","math.IT"],"title_canon_sha256":"969c24c7478f457674d9c6912a03ce49ffd871821d0556dd17742442c2a13145","abstract_canon_sha256":"96846ac69d55ac92363f853b98f7c3789943e982c3d0ae161079a34db6377f70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:32.677333Z","signature_b64":"/ktulxAzWOrsRCi58M3EMnB0Vcc0jJyTPPqzg9m12WiDjP2BIsKAXCH0vkgqCxZPh7SzvGv+jJ7sdChR3oVfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84380ebf8e55bd690d59c7e6e3864f744bef67c5c78acf7af1145c1d5c3d82a5","last_reissued_at":"2026-05-18T02:17:32.676676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:32.676676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.FA","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Cheraghchi, Piotr Indyk","submitted_at":"2015-04-28T20:22:27Z","abstract_excerpt":"For every fixed constant $\\alpha > 0$, we design an algorithm for computing the $k$-sparse Walsh-Hadamard transform of an $N$-dimensional vector $x \\in \\mathbb{R}^N$ in time $k^{1+\\alpha} (\\log N)^{O(1)}$. Specifically, the algorithm is given query access to $x$ and computes a $k$-sparse $\\tilde{x} \\in \\mathbb{R}^N$ satisfying $\\|\\tilde{x} - \\hat{x}\\|_1 \\leq c \\|\\hat{x} - H_k(\\hat{x})\\|_1$, for an absolute constant $c > 0$, where $\\hat{x}$ is the transform of $x$ and $H_k(\\hat{x})$ is its best $k$-sparse approximation. Our algorithm is fully deterministic and only uses non-adaptive queries to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07648","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":"1504.07648","created_at":"2026-05-18T02:17:32.676772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07648v1","created_at":"2026-05-18T02:17:32.676772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07648","created_at":"2026-05-18T02:17:32.676772+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQ4A5P4OKW6W","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQ4A5P4OKW6WSDKZ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQ4A5P4O","created_at":"2026-05-18T12:29:37.295048+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/QQ4A5P4OKW6WSDKZY7TOHBSPOR","json":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR.json","graph_json":"https://pith.science/api/pith-number/QQ4A5P4OKW6WSDKZY7TOHBSPOR/graph.json","events_json":"https://pith.science/api/pith-number/QQ4A5P4OKW6WSDKZY7TOHBSPOR/events.json","paper":"https://pith.science/paper/QQ4A5P4O"},"agent_actions":{"view_html":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR","download_json":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR.json","view_paper":"https://pith.science/paper/QQ4A5P4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07648&json=true","fetch_graph":"https://pith.science/api/pith-number/QQ4A5P4OKW6WSDKZY7TOHBSPOR/graph.json","fetch_events":"https://pith.science/api/pith-number/QQ4A5P4OKW6WSDKZY7TOHBSPOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR/action/storage_attestation","attest_author":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR/action/author_attestation","sign_citation":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR/action/citation_signature","submit_replication":"https://pith.science/pith/QQ4A5P4OKW6WSDKZY7TOHBSPOR/action/replication_record"}},"created_at":"2026-05-18T02:17:32.676772+00:00","updated_at":"2026-05-18T02:17:32.676772+00:00"}