{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HZTGHFG45THFSYEUQPKN7A6HNZ","short_pith_number":"pith:HZTGHFG4","schema_version":"1.0","canonical_sha256":"3e666394dcecce59609483d4df83c76e5b5c1cdfc06817fbb70c68938b6947d3","source":{"kind":"arxiv","id":"2601.15582","version":1},"attestation_state":"computed","paper":{"title":"An Iterated Hybrid Fast Parallel FIR Filter","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Keshab K. Parhi","submitted_at":"2026-01-22T02:03:36Z","abstract_excerpt":"This paper revisits the design and optimization of parallel fast finite impulse response (FIR) filters using polyphase decomposition and iterated fast FIR algorithms (FFAs). Parallel FIR filtering enhances computational efficiency and throughput in digital signal processing (DSP) applications by enabling the simultaneous processing of multiple input samples. We revisit a prior approach to design of fast parallel filter architectures by using the iterated FFA approach where the same primitive filter, such as 2-parallel, is iterated to design the fast parallel filter. In this paper, we present y"},"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":"2601.15582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SP","submitted_at":"2026-01-22T02:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"6de755366d1dbcb39fb3d0209e91b93f6984429eaddd1c43a6005771e382a80c","abstract_canon_sha256":"f6514b102017dee02058e4099c1c0230d097fc2272f51a715f11389268531211"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:18:06.516587Z","signature_b64":"KMLXFyKGz93SOfX72dcQcZtNAJ49UCjxFumcGkapPICLJOWM+C6fgkQ83XRELkwVk7SwN5/OhHDiuefF2o8VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e666394dcecce59609483d4df83c76e5b5c1cdfc06817fbb70c68938b6947d3","last_reissued_at":"2026-06-30T02:18:06.516003Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:18:06.516003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Iterated Hybrid Fast Parallel FIR Filter","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Keshab K. Parhi","submitted_at":"2026-01-22T02:03:36Z","abstract_excerpt":"This paper revisits the design and optimization of parallel fast finite impulse response (FIR) filters using polyphase decomposition and iterated fast FIR algorithms (FFAs). Parallel FIR filtering enhances computational efficiency and throughput in digital signal processing (DSP) applications by enabling the simultaneous processing of multiple input samples. We revisit a prior approach to design of fast parallel filter architectures by using the iterated FFA approach where the same primitive filter, such as 2-parallel, is iterated to design the fast parallel filter. In this paper, we present y"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.15582","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.15582/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2601.15582","created_at":"2026-06-30T02:18:06.516073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.15582v1","created_at":"2026-06-30T02:18:06.516073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.15582","created_at":"2026-06-30T02:18:06.516073+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZTGHFG45THF","created_at":"2026-06-30T02:18:06.516073+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZTGHFG45THFSYEU","created_at":"2026-06-30T02:18:06.516073+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZTGHFG4","created_at":"2026-06-30T02:18:06.516073+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/HZTGHFG45THFSYEUQPKN7A6HNZ","json":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ.json","graph_json":"https://pith.science/api/pith-number/HZTGHFG45THFSYEUQPKN7A6HNZ/graph.json","events_json":"https://pith.science/api/pith-number/HZTGHFG45THFSYEUQPKN7A6HNZ/events.json","paper":"https://pith.science/paper/HZTGHFG4"},"agent_actions":{"view_html":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ","download_json":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ.json","view_paper":"https://pith.science/paper/HZTGHFG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.15582&json=true","fetch_graph":"https://pith.science/api/pith-number/HZTGHFG45THFSYEUQPKN7A6HNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HZTGHFG45THFSYEUQPKN7A6HNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ/action/storage_attestation","attest_author":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ/action/author_attestation","sign_citation":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ/action/citation_signature","submit_replication":"https://pith.science/pith/HZTGHFG45THFSYEUQPKN7A6HNZ/action/replication_record"}},"created_at":"2026-06-30T02:18:06.516073+00:00","updated_at":"2026-06-30T02:18:06.516073+00:00"}