{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FIQDLCT6TKCWSHPECXCRSZJYFU","short_pith_number":"pith:FIQDLCT6","schema_version":"1.0","canonical_sha256":"2a20358a7e9a85691de415c51965382d31451286e8e61f2f4045f1845317d7e6","source":{"kind":"arxiv","id":"1710.08029","version":1},"attestation_state":"computed","paper":{"title":"Characterizing and Enumerating Walsh-Hadamard Transform Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fran\\c{c}ois Serre, Markus P\\\"uschel","submitted_at":"2017-10-22T22:13:27Z","abstract_excerpt":"We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies ($I_{2^{n-1}}\\otimes \\text{DFT}_2$) interleaved by linear permutations. Linear permutations are those that map linearly the binary representation of its element indices. We also propose a method to enumerate these algorithms."},"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":"1710.08029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-22T22:13:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3b47c1fae77a94c99d9f4960cf8f8e0912ab595894fd3cf2cfd1aaab96eefad9","abstract_canon_sha256":"4e7bc45cb6a4930072d5bc2f88bf1bea94584bd99f01f89f348694af16c51224"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:55.496120Z","signature_b64":"HFyJyYL3YBqkOOs/2IrRFiHNlQiS47oi+UxoZNhTj8qp6udwC5P1JsjS1+66OYd2xqVUsN0ZABOWP0mmw3FVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a20358a7e9a85691de415c51965382d31451286e8e61f2f4045f1845317d7e6","last_reissued_at":"2026-05-18T00:31:55.495709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:55.495709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing and Enumerating Walsh-Hadamard Transform Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fran\\c{c}ois Serre, Markus P\\\"uschel","submitted_at":"2017-10-22T22:13:27Z","abstract_excerpt":"We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies ($I_{2^{n-1}}\\otimes \\text{DFT}_2$) interleaved by linear permutations. Linear permutations are those that map linearly the binary representation of its element indices. We also propose a method to enumerate these algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08029","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":"1710.08029","created_at":"2026-05-18T00:31:55.495777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08029v1","created_at":"2026-05-18T00:31:55.495777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08029","created_at":"2026-05-18T00:31:55.495777+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIQDLCT6TKCW","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIQDLCT6TKCWSHPE","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIQDLCT6","created_at":"2026-05-18T12:31:15.632608+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/FIQDLCT6TKCWSHPECXCRSZJYFU","json":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU.json","graph_json":"https://pith.science/api/pith-number/FIQDLCT6TKCWSHPECXCRSZJYFU/graph.json","events_json":"https://pith.science/api/pith-number/FIQDLCT6TKCWSHPECXCRSZJYFU/events.json","paper":"https://pith.science/paper/FIQDLCT6"},"agent_actions":{"view_html":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU","download_json":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU.json","view_paper":"https://pith.science/paper/FIQDLCT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08029&json=true","fetch_graph":"https://pith.science/api/pith-number/FIQDLCT6TKCWSHPECXCRSZJYFU/graph.json","fetch_events":"https://pith.science/api/pith-number/FIQDLCT6TKCWSHPECXCRSZJYFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU/action/storage_attestation","attest_author":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU/action/author_attestation","sign_citation":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU/action/citation_signature","submit_replication":"https://pith.science/pith/FIQDLCT6TKCWSHPECXCRSZJYFU/action/replication_record"}},"created_at":"2026-05-18T00:31:55.495777+00:00","updated_at":"2026-05-18T00:31:55.495777+00:00"}