{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MVZR2QRT2SLWEU5MZVHIBN4FST","short_pith_number":"pith:MVZR2QRT","schema_version":"1.0","canonical_sha256":"65731d4233d4976253accd4e80b78594e87a5975ed3b852f8ad26a35fb3f83c1","source":{"kind":"arxiv","id":"1303.1752","version":1},"attestation_state":"computed","paper":{"title":"Convolution products for hypercomplex Fourier transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Gerik Scheuermann, Hendrik De Bie, Nele De Schepper, Roxana Bujack","submitted_at":"2013-03-07T17:12:03Z","abstract_excerpt":"Hypercomplex Fourier transforms are increasingly used in signal processing for the analysis of higher-dimensional signals such as color images. A main stumbling block for further applications, in particular concerning filter design in the Fourier domain, is the lack of a proper convolution theorem. The present paper develops and studies two conceptually new ways to define convolution products for such transforms. As a by-product, convolution theorems are obtained that will enable the development and fast implementation of new filters for quaternionic signals and systems, as well as for their h"},"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":"1303.1752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2013-03-07T17:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"c48ded51ec9b713cca587ac8e72e84e00152829f826ad7e598fea4fb4d4e12b9","abstract_canon_sha256":"98b8375fa0b4ec5c5699d38944071dcdbc4f0e31baa3693e02825c2fe0b8746b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:33.192901Z","signature_b64":"Yohykqtq0dPrne8b3vhQPPESZJs/1Y+iXOT520a/nkugRpOqM4DFvoh7OuiH0HhTXJKU3Ke+kwljI1WrZcoKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65731d4233d4976253accd4e80b78594e87a5975ed3b852f8ad26a35fb3f83c1","last_reissued_at":"2026-05-18T03:31:33.192423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:33.192423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolution products for hypercomplex Fourier transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Gerik Scheuermann, Hendrik De Bie, Nele De Schepper, Roxana Bujack","submitted_at":"2013-03-07T17:12:03Z","abstract_excerpt":"Hypercomplex Fourier transforms are increasingly used in signal processing for the analysis of higher-dimensional signals such as color images. A main stumbling block for further applications, in particular concerning filter design in the Fourier domain, is the lack of a proper convolution theorem. The present paper develops and studies two conceptually new ways to define convolution products for such transforms. As a by-product, convolution theorems are obtained that will enable the development and fast implementation of new filters for quaternionic signals and systems, as well as for their h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1752","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":"1303.1752","created_at":"2026-05-18T03:31:33.192492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1752v1","created_at":"2026-05-18T03:31:33.192492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1752","created_at":"2026-05-18T03:31:33.192492+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVZR2QRT2SLW","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVZR2QRT2SLWEU5M","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVZR2QRT","created_at":"2026-05-18T12:27:52.871228+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/MVZR2QRT2SLWEU5MZVHIBN4FST","json":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST.json","graph_json":"https://pith.science/api/pith-number/MVZR2QRT2SLWEU5MZVHIBN4FST/graph.json","events_json":"https://pith.science/api/pith-number/MVZR2QRT2SLWEU5MZVHIBN4FST/events.json","paper":"https://pith.science/paper/MVZR2QRT"},"agent_actions":{"view_html":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST","download_json":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST.json","view_paper":"https://pith.science/paper/MVZR2QRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1752&json=true","fetch_graph":"https://pith.science/api/pith-number/MVZR2QRT2SLWEU5MZVHIBN4FST/graph.json","fetch_events":"https://pith.science/api/pith-number/MVZR2QRT2SLWEU5MZVHIBN4FST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST/action/storage_attestation","attest_author":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST/action/author_attestation","sign_citation":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST/action/citation_signature","submit_replication":"https://pith.science/pith/MVZR2QRT2SLWEU5MZVHIBN4FST/action/replication_record"}},"created_at":"2026-05-18T03:31:33.192492+00:00","updated_at":"2026-05-18T03:31:33.192492+00:00"}