{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JDMSI5IACJEZF62TMSPZNEFGH2","short_pith_number":"pith:JDMSI5IA","canonical_record":{"source":{"id":"1502.01038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T16:06:29Z","cross_cats_sorted":["math.NA","stat.ME"],"title_canon_sha256":"91fd1391ee1863fea27b5cfe2ca50ff1a00a67f3a8f10901e9344ec7f0f56040","abstract_canon_sha256":"f020306e2b44f5959c8705c102d328a723f98dd9871d03b9655f02dae8cd051f"},"schema_version":"1.0"},"canonical_sha256":"48d9247500124992fb53649f9690a63ea1894ee3ca914ede2359d74cf654ce89","source":{"kind":"arxiv","id":"1502.01038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01038","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01038v1","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01038","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"JDMSI5IACJEZ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JDMSI5IACJEZF62T","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JDMSI5IA","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JDMSI5IACJEZF62TMSPZNEFGH2","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T16:06:29Z","cross_cats_sorted":["math.NA","stat.ME"],"title_canon_sha256":"91fd1391ee1863fea27b5cfe2ca50ff1a00a67f3a8f10901e9344ec7f0f56040","abstract_canon_sha256":"f020306e2b44f5959c8705c102d328a723f98dd9871d03b9655f02dae8cd051f"},"schema_version":"1.0"},"canonical_sha256":"48d9247500124992fb53649f9690a63ea1894ee3ca914ede2359d74cf654ce89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:56.698761Z","signature_b64":"d5sPkuFBqJ2dtx2uZROZXu2c0eWdG6iEx8tlnW6fjid5yWfNJaLXva3mOllQncTPEHrHP6yUFoKUfR1d6LP6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48d9247500124992fb53649f9690a63ea1894ee3ca914ede2359d74cf654ce89","last_reissued_at":"2026-05-18T02:27:56.698291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:56.698291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01038","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-18T02:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aRY0zdnfs2o/TE5pz6IKG91rPJAId3Ycb12mBI/pWWCAhSogiNmnSiBE3Vvfj2bSP+4sXKZw41PaleTthP4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:29:58.385312Z"},"content_sha256":"13b89a54bf473af67888388fb502bb7f86d4f8781b07bef10330c45b6d9f4f55","schema_version":"1.0","event_id":"sha256:13b89a54bf473af67888388fb502bb7f86d4f8781b07bef10330c45b6d9f4f55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JDMSI5IACJEZF62TMSPZNEFGH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Factorization Scheme for Some Discrete Hartley Transform Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ME"],"primary_cat":"cs.NA","authors_text":"H. M. de Oliveira, R. J. Cintra, R. M. Campello de Souza","submitted_at":"2015-02-01T16:06:29Z","abstract_excerpt":"Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient fast transforms. In this paper some fast algorithms are derived. The theoretical lower bound on the multiplicative complexity for the DFT/DHT are achieved. The approach is based on the factorization of DHT matrices. Algorithms for short blocklengths such as $N \\in \\{3, 5, 6, 12, 24 \\}$ are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01038","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-18T02:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqjjFDYGP1rU6tuQs+l735XX12j/uFjYR0nirGfVEZGKpCNxJu5CEgF70OjRrshjcAI4eBUKMKlJ6G/8YkL1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:29:58.385698Z"},"content_sha256":"5d8bec6caeb7ce5ffda0c92292256c6a3af2547ecdcc47e30717c230a18dab2e","schema_version":"1.0","event_id":"sha256:5d8bec6caeb7ce5ffda0c92292256c6a3af2547ecdcc47e30717c230a18dab2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDMSI5IACJEZF62TMSPZNEFGH2/bundle.json","state_url":"https://pith.science/pith/JDMSI5IACJEZF62TMSPZNEFGH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDMSI5IACJEZF62TMSPZNEFGH2/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-27T08:29:58Z","links":{"resolver":"https://pith.science/pith/JDMSI5IACJEZF62TMSPZNEFGH2","bundle":"https://pith.science/pith/JDMSI5IACJEZF62TMSPZNEFGH2/bundle.json","state":"https://pith.science/pith/JDMSI5IACJEZF62TMSPZNEFGH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDMSI5IACJEZF62TMSPZNEFGH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JDMSI5IACJEZF62TMSPZNEFGH2","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":"f020306e2b44f5959c8705c102d328a723f98dd9871d03b9655f02dae8cd051f","cross_cats_sorted":["math.NA","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T16:06:29Z","title_canon_sha256":"91fd1391ee1863fea27b5cfe2ca50ff1a00a67f3a8f10901e9344ec7f0f56040"},"schema_version":"1.0","source":{"id":"1502.01038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01038","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01038v1","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01038","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"JDMSI5IACJEZ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JDMSI5IACJEZF62T","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JDMSI5IA","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:5d8bec6caeb7ce5ffda0c92292256c6a3af2547ecdcc47e30717c230a18dab2e","target":"graph","created_at":"2026-05-18T02:27: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":"Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient fast transforms. In this paper some fast algorithms are derived. The theoretical lower bound on the multiplicative complexity for the DFT/DHT are achieved. The approach is based on the factorization of DHT matrices. Algorithms for short blocklengths such as $N \\in \\{3, 5, 6, 12, 24 \\}$ are presented.","authors_text":"H. M. de Oliveira, R. J. Cintra, R. M. Campello de Souza","cross_cats":["math.NA","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T16:06:29Z","title":"A Factorization Scheme for Some Discrete Hartley Transform Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01038","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:13b89a54bf473af67888388fb502bb7f86d4f8781b07bef10330c45b6d9f4f55","target":"record","created_at":"2026-05-18T02:27: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":"f020306e2b44f5959c8705c102d328a723f98dd9871d03b9655f02dae8cd051f","cross_cats_sorted":["math.NA","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T16:06:29Z","title_canon_sha256":"91fd1391ee1863fea27b5cfe2ca50ff1a00a67f3a8f10901e9344ec7f0f56040"},"schema_version":"1.0","source":{"id":"1502.01038","kind":"arxiv","version":1}},"canonical_sha256":"48d9247500124992fb53649f9690a63ea1894ee3ca914ede2359d74cf654ce89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48d9247500124992fb53649f9690a63ea1894ee3ca914ede2359d74cf654ce89","first_computed_at":"2026-05-18T02:27:56.698291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:56.698291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d5sPkuFBqJ2dtx2uZROZXu2c0eWdG6iEx8tlnW6fjid5yWfNJaLXva3mOllQncTPEHrHP6yUFoKUfR1d6LP6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:56.698761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13b89a54bf473af67888388fb502bb7f86d4f8781b07bef10330c45b6d9f4f55","sha256:5d8bec6caeb7ce5ffda0c92292256c6a3af2547ecdcc47e30717c230a18dab2e"],"state_sha256":"a8ad08c5a428d3def09f5b54196b9e14e3430cd6a039523ba83c8205a37093d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVKfPqBM4q0NEznU3Y7RMe+ECSvCBa6OPcohiSVzbrIHUk+7Ml0sueWEyZnEeYs5+lQhS0jKmN3nUGcoADSQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:29:58.387574Z","bundle_sha256":"465330046b596ee64864ed967f7042321569b51882162fcfbaa7e2da14fdb054"}}