{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4EDFKP4QN5GJMPLVWCQJBP3D36","short_pith_number":"pith:4EDFKP4Q","canonical_record":{"source":{"id":"1502.02168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T17:44:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"09f679e3a7f681e30641d78694290761488ba30404483ec7f49f0db3b413e52b","abstract_canon_sha256":"3b561a4d7a3d6d67b6735a44477408f773dd6516027ab7c4265a373399ed8912"},"schema_version":"1.0"},"canonical_sha256":"e106553f906f4c963d75b0a090bf63df951e143851405d78346ce2c756c4d695","source":{"kind":"arxiv","id":"1502.02168","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02168","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02168v3","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02168","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"4EDFKP4QN5GJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4EDFKP4QN5GJMPLV","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4EDFKP4Q","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4EDFKP4QN5GJMPLVWCQJBP3D36","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T17:44:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"09f679e3a7f681e30641d78694290761488ba30404483ec7f49f0db3b413e52b","abstract_canon_sha256":"3b561a4d7a3d6d67b6735a44477408f773dd6516027ab7c4265a373399ed8912"},"schema_version":"1.0"},"canonical_sha256":"e106553f906f4c963d75b0a090bf63df951e143851405d78346ce2c756c4d695","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.316283Z","signature_b64":"/hLpPCh3cwICA51Qn3RL+DxdkmJ/NwuGHGPfYCyXwVXTMUFT2zWb6iIwAQip8dTUYYGX+tEqQ/7MP9x3DzIACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e106553f906f4c963d75b0a090bf63df951e143851405d78346ce2c756c4d695","last_reissued_at":"2026-05-18T01:34:45.315634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.315634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02168","source_version":3,"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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WdeOWqhT7x/Sqv19vC3CTM3/Sdjbzxk4eQXjAaohvplRYcYhzS/YBhJwqHmRYe/ND/TqUwtx3ga2OpgXej+NDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:17:38.884650Z"},"content_sha256":"723ad28c33550d64e3ff03ffa3a6a88ecb5e878183d97b0cb90f665a8689c9d2","schema_version":"1.0","event_id":"sha256:723ad28c33550d64e3ff03ffa3a6a88ecb5e878183d97b0cb90f665a8689c9d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4EDFKP4QN5GJMPLVWCQJBP3D36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilayer Hadamard Decomposition of Discrete Hartley Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"H. M. de Oliveira, R. J. Cintra, R. M. Campello de Souza","submitted_at":"2015-02-07T17:44:57Z","abstract_excerpt":"Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the so-called fast transforms. In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of the DFT/DHT. The approach is based on a decomposition of the DHT into layers of Walsh-Hadamard transforms. In particular, fast algorithms for short block lengths such as $N \\in \\{4, 8, 12, 24\\}$ are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02168","kind":"arxiv","version":3},"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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqZhWwqOYH6ZrOLPAnGP0kbQJxFSL9+i/ROiVONzgtvRFC2xsh0nnJvVKCgeS/K49LNyCu4czNRQuVASt0obDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:17:38.885003Z"},"content_sha256":"e6a518c7423a4b1b4ce9a24d1b9f80b3e152a103fde7a839c3a7703475fb234a","schema_version":"1.0","event_id":"sha256:e6a518c7423a4b1b4ce9a24d1b9f80b3e152a103fde7a839c3a7703475fb234a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EDFKP4QN5GJMPLVWCQJBP3D36/bundle.json","state_url":"https://pith.science/pith/4EDFKP4QN5GJMPLVWCQJBP3D36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EDFKP4QN5GJMPLVWCQJBP3D36/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-06-27T05:17:38Z","links":{"resolver":"https://pith.science/pith/4EDFKP4QN5GJMPLVWCQJBP3D36","bundle":"https://pith.science/pith/4EDFKP4QN5GJMPLVWCQJBP3D36/bundle.json","state":"https://pith.science/pith/4EDFKP4QN5GJMPLVWCQJBP3D36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EDFKP4QN5GJMPLVWCQJBP3D36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4EDFKP4QN5GJMPLVWCQJBP3D36","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":"3b561a4d7a3d6d67b6735a44477408f773dd6516027ab7c4265a373399ed8912","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T17:44:57Z","title_canon_sha256":"09f679e3a7f681e30641d78694290761488ba30404483ec7f49f0db3b413e52b"},"schema_version":"1.0","source":{"id":"1502.02168","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02168","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02168v3","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02168","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"4EDFKP4QN5GJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4EDFKP4QN5GJMPLV","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4EDFKP4Q","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:e6a518c7423a4b1b4ce9a24d1b9f80b3e152a103fde7a839c3a7703475fb234a","target":"graph","created_at":"2026-05-18T01:34:45Z","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":"Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the so-called fast transforms. In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of the DFT/DHT. The approach is based on a decomposition of the DHT into layers of Walsh-Hadamard transforms. In particular, fast algorithms for short block lengths such as $N \\in \\{4, 8, 12, 24\\}$ are presented.","authors_text":"H. M. de Oliveira, R. J. Cintra, R. M. Campello de Souza","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T17:44:57Z","title":"Multilayer Hadamard Decomposition of Discrete Hartley Transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02168","kind":"arxiv","version":3},"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:723ad28c33550d64e3ff03ffa3a6a88ecb5e878183d97b0cb90f665a8689c9d2","target":"record","created_at":"2026-05-18T01:34:45Z","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":"3b561a4d7a3d6d67b6735a44477408f773dd6516027ab7c4265a373399ed8912","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-07T17:44:57Z","title_canon_sha256":"09f679e3a7f681e30641d78694290761488ba30404483ec7f49f0db3b413e52b"},"schema_version":"1.0","source":{"id":"1502.02168","kind":"arxiv","version":3}},"canonical_sha256":"e106553f906f4c963d75b0a090bf63df951e143851405d78346ce2c756c4d695","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e106553f906f4c963d75b0a090bf63df951e143851405d78346ce2c756c4d695","first_computed_at":"2026-05-18T01:34:45.315634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:45.315634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/hLpPCh3cwICA51Qn3RL+DxdkmJ/NwuGHGPfYCyXwVXTMUFT2zWb6iIwAQip8dTUYYGX+tEqQ/7MP9x3DzIACw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:45.316283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02168","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:723ad28c33550d64e3ff03ffa3a6a88ecb5e878183d97b0cb90f665a8689c9d2","sha256:e6a518c7423a4b1b4ce9a24d1b9f80b3e152a103fde7a839c3a7703475fb234a"],"state_sha256":"990613034eb5f4b63f4aa1f095240b3b7c65935c61b7c1c2d6525b9aec5e7c1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AsTic644A8ZYDBk65/npfIwhr+qx7vhfHvrQdkJlEj8fJ5bcadFA6sp/9717v6H8v4wx99Ur46Ki/wctehDkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T05:17:38.886894Z","bundle_sha256":"c9fc88d665d175b6e36490cac8e06829d46deaa93b6df9ef865721baf5be2e81"}}