{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YFWL53FBXKYM7XMHL6FX3JX3N6","short_pith_number":"pith:YFWL53FB","schema_version":"1.0","canonical_sha256":"c16cbeeca1bab0cfdd875f8b7da6fb6fa634af26be67accf37d1f103fc54c289","source":{"kind":"arxiv","id":"2607.20634","version":1},"attestation_state":"computed","paper":{"title":"Finding Fast Filters","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Andrew Adams, Jonathan Ragan-Kelley, Karima Ma","submitted_at":"2026-07-22T18:04:20Z","abstract_excerpt":"Processing images, video, and audio often requires running large finite impulse response (FIR) filters with strict performance and latency requirements. Prior methods for fast filter approximations are special cases or combinations of a few key techniques: multi-rate and recurrent filtering, and decomposing filters into sums or cascades. We unify these techniques as primitives within a single design language for fast 1D and 2D filters. Given a target filter to approximate, we automatically search this program space, fitting continuous parameters with gradient descent, to generate a Pareto fron"},"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":"2607.20634","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-07-22T18:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"e05038e48fd004321618593ebf00b04341cb88c195720330883bb63aad4acdff","abstract_canon_sha256":"7ed962e089f69128709d4a00c69af3bd54ce4510bd1f3a37f0a87e7e01c51e23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T00:23:26.875367Z","signature_b64":"uJBWysGakkHYzboYiU6qEd9UjE2IOSts4tNk3Ft0Sm5/8yqIeq1XqsqZhun4ZpvM6eL3PvOFAaZg7dNKwPKaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c16cbeeca1bab0cfdd875f8b7da6fb6fa634af26be67accf37d1f103fc54c289","last_reissued_at":"2026-07-24T00:23:26.874476Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T00:23:26.874476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Fast Filters","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Andrew Adams, Jonathan Ragan-Kelley, Karima Ma","submitted_at":"2026-07-22T18:04:20Z","abstract_excerpt":"Processing images, video, and audio often requires running large finite impulse response (FIR) filters with strict performance and latency requirements. Prior methods for fast filter approximations are special cases or combinations of a few key techniques: multi-rate and recurrent filtering, and decomposing filters into sums or cascades. We unify these techniques as primitives within a single design language for fast 1D and 2D filters. Given a target filter to approximate, we automatically search this program space, fitting continuous parameters with gradient descent, to generate a Pareto fron"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20634","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/2607.20634/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":"2607.20634","created_at":"2026-07-24T00:23:26.874929+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.20634v1","created_at":"2026-07-24T00:23:26.874929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20634","created_at":"2026-07-24T00:23:26.874929+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFWL53FBXKYM","created_at":"2026-07-24T00:23:26.874929+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFWL53FBXKYM7XMH","created_at":"2026-07-24T00:23:26.874929+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFWL53FB","created_at":"2026-07-24T00:23:26.874929+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/YFWL53FBXKYM7XMHL6FX3JX3N6","json":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6.json","graph_json":"https://pith.science/api/pith-number/YFWL53FBXKYM7XMHL6FX3JX3N6/graph.json","events_json":"https://pith.science/api/pith-number/YFWL53FBXKYM7XMHL6FX3JX3N6/events.json","paper":"https://pith.science/paper/YFWL53FB"},"agent_actions":{"view_html":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6","download_json":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6.json","view_paper":"https://pith.science/paper/YFWL53FB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.20634&json=true","fetch_graph":"https://pith.science/api/pith-number/YFWL53FBXKYM7XMHL6FX3JX3N6/graph.json","fetch_events":"https://pith.science/api/pith-number/YFWL53FBXKYM7XMHL6FX3JX3N6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/action/storage_attestation","attest_author":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/action/author_attestation","sign_citation":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/action/citation_signature","submit_replication":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/action/replication_record"}},"created_at":"2026-07-24T00:23:26.874929+00:00","updated_at":"2026-07-24T00:23:26.874929+00:00"}