{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YFWL53FBXKYM7XMHL6FX3JX3N6","short_pith_number":"pith:YFWL53FB","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"},"canonical_sha256":"c16cbeeca1bab0cfdd875f8b7da6fb6fa634af26be67accf37d1f103fc54c289","source":{"kind":"arxiv","id":"2607.20634","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20634","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20634v1","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20634","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"YFWL53FBXKYM","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"pith_short_16","alias_value":"YFWL53FBXKYM7XMH","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"pith_short_8","alias_value":"YFWL53FB","created_at":"2026-07-24T00:23:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YFWL53FBXKYM7XMHL6FX3JX3N6","target":"record","payload":{"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"},"canonical_sha256":"c16cbeeca1bab0cfdd875f8b7da6fb6fa634af26be67accf37d1f103fc54c289","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"},"source_kind":"arxiv","source_id":"2607.20634","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-07-24T00:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuKSvxuxFsXT7V8xTynhFUiHmv4Hs7qejgtju0s6TyENanWuOUykfyQ8/5gzCfMKrBVsbo1tFwhCYd05pw47CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:22:52.549358Z"},"content_sha256":"ad4bd53976741a17a3247d5c3a5833a9aac4c110c9d927a3201fc2287d1cbd6c","schema_version":"1.0","event_id":"sha256:ad4bd53976741a17a3247d5c3a5833a9aac4c110c9d927a3201fc2287d1cbd6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YFWL53FBXKYM7XMHL6FX3JX3N6","target":"graph","payload":{"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"},"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-07-24T00:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Te6pHcSoOIBPmLfNA6uoiI42/tRUr2o1Sk+0ymKtkX0tMuYS9RkAMuatPoSz4phmHdjjxTyFq8zUVahFn92vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:22:52.549739Z"},"content_sha256":"3942e6136cce11b23d9cbb9319f001802c90112b2acebd7b28de30b81b7a3c90","schema_version":"1.0","event_id":"sha256:3942e6136cce11b23d9cbb9319f001802c90112b2acebd7b28de30b81b7a3c90"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:YFWL53FBXKYM7XMHL6FX3JX3N6","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/0165-1684(95)00020-E resolves to 'Recursive implementation of the Gaussian filter'. A reader following the printed text alone cannot reach it.","snippet":"Recursive implementation of the Gaussian filter. Signal Processing44, 2 (1995), 139–151. https://doi.org/10.1016/0165-1684(95)00020- E Ian T Young, Lucas J Van Vliet, and Michael Van Ginkel","arxiv_id":"2607.20634","detector":"doi_compliance","evidence":{"ref_index":1995,"verdict_class":"incontrovertible","resolved_title":"Recursive implementation of the Gaussian filter","printed_excerpt":"10.1016/0165-1684(95)00020-","reconstructed_doi":"10.1016/0165-1684(95)00020-E"},"severity":"advisory","ref_index":1995,"audited_at":"2026-08-01T09:58:34.493832Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0165-1684(95)00020-E","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"472a0b624b338c3705cc5253940ff29049794f7ab98a69fea4f1ae396f396733","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Recursive implementation of the Gaussian filter","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15573,"payload_sha256":"0e801b8249216d1c8665855b3eaa136b569adbb42ca200f0e6195c930b62140c","signature_b64":"Nss7E2fSKVbIGhRq9X+fTjMhUL4BZmy2c/2wSR0yQhNNx13dbkwk5s4bX3SdTMxigGa6T/U7K/YvQKx7NZ+7Dg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T09:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+zThOG1CgWne2diG/z281B2ZKTEaiSKsyM+b5x7tXzCG3XYZDjdqgrSkxAlhbqQ6l+dYDeL/rKxHxRgWaw1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:22:52.551745Z"},"content_sha256":"f445b17d0c0b6a9eef6668d965dc693cbf270210626a12b3b446cc28000b114b","schema_version":"1.0","event_id":"sha256:f445b17d0c0b6a9eef6668d965dc693cbf270210626a12b3b446cc28000b114b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:YFWL53FBXKYM7XMHL6FX3JX3N6","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/34.41386) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Fast algorithms for low-level vision.IEEE Transactions on Pattern Analysis and Machine Intelligence12, 1 (1990), 78–87. https://doi.org/10.1109/34. 41386 R. Deriche and J. Abramatic","arxiv_id":"2607.20634","detector":"doi_compliance","evidence":{"ref_index":1990,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/34","reconstructed_doi":"10.1109/34.41386"},"severity":"advisory","ref_index":1990,"audited_at":"2026-08-01T09:58:34.493832Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/34.41386","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d4b3d6ffeec38f75e88b6797249f073969684e33d7e0585e2771f9e67a75723b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15572,"payload_sha256":"0b245f53a4bf4a6b79d36b54bc9ee434bc7eabe4a41ba3f659f09fccd4e38cd8","signature_b64":"W7zITL/vu4AMCNG/qH8WOPYg8iBQOJDzlfq2NvbN6UZBmkGhcG5CiDKEkrqRmq0hvkJDeesjWBcIu7EBc0BRBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T09:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dt9YR1nAcQbVM7frDAvVZHhgjPPTc0oQ+iv6pTxPUuTN8DTYvhm+AsDhDZWA9orkUbnR22PWDSGT2Q7LMGngAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:22:52.552045Z"},"content_sha256":"06b818537ab7071d94d573c918e53e03c11f402fc9325bbbf52a3627e3233038","schema_version":"1.0","event_id":"sha256:06b818537ab7071d94d573c918e53e03c11f402fc9325bbbf52a3627e3233038"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/bundle.json","state_url":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/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-08-04T04:22:52Z","links":{"resolver":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6","bundle":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/bundle.json","state":"https://pith.science/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFWL53FBXKYM7XMHL6FX3JX3N6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YFWL53FBXKYM7XMHL6FX3JX3N6","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7ed962e089f69128709d4a00c69af3bd54ce4510bd1f3a37f0a87e7e01c51e23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-07-22T18:04:20Z","title_canon_sha256":"e05038e48fd004321618593ebf00b04341cb88c195720330883bb63aad4acdff"},"schema_version":"1.0","source":{"id":"2607.20634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20634","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20634v1","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20634","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"YFWL53FBXKYM","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"pith_short_16","alias_value":"YFWL53FBXKYM7XMH","created_at":"2026-07-24T00:23:26Z"},{"alias_kind":"pith_short_8","alias_value":"YFWL53FB","created_at":"2026-07-24T00:23:26Z"}],"graph_snapshots":[{"event_id":"sha256:3942e6136cce11b23d9cbb9319f001802c90112b2acebd7b28de30b81b7a3c90","target":"graph","created_at":"2026-07-24T00:23:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.20634/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrew Adams, Jonathan Ragan-Kelley, Karima Ma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-07-22T18:04:20Z","title":"Finding Fast Filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20634","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:ad4bd53976741a17a3247d5c3a5833a9aac4c110c9d927a3201fc2287d1cbd6c","target":"record","created_at":"2026-07-24T00:23:26Z","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":"7ed962e089f69128709d4a00c69af3bd54ce4510bd1f3a37f0a87e7e01c51e23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GR","submitted_at":"2026-07-22T18:04:20Z","title_canon_sha256":"e05038e48fd004321618593ebf00b04341cb88c195720330883bb63aad4acdff"},"schema_version":"1.0","source":{"id":"2607.20634","kind":"arxiv","version":1}},"canonical_sha256":"c16cbeeca1bab0cfdd875f8b7da6fb6fa634af26be67accf37d1f103fc54c289","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c16cbeeca1bab0cfdd875f8b7da6fb6fa634af26be67accf37d1f103fc54c289","first_computed_at":"2026-07-24T00:23:26.874476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T00:23:26.874476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uJBWysGakkHYzboYiU6qEd9UjE2IOSts4tNk3Ft0Sm5/8yqIeq1XqsqZhun4ZpvM6eL3PvOFAaZg7dNKwPKaDQ==","signature_status":"signed_v1","signed_at":"2026-07-24T00:23:26.875367Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.20634","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:06b818537ab7071d94d573c918e53e03c11f402fc9325bbbf52a3627e3233038","sha256:f445b17d0c0b6a9eef6668d965dc693cbf270210626a12b3b446cc28000b114b"]}],"invalid_events":[],"applied_event_ids":["sha256:ad4bd53976741a17a3247d5c3a5833a9aac4c110c9d927a3201fc2287d1cbd6c","sha256:3942e6136cce11b23d9cbb9319f001802c90112b2acebd7b28de30b81b7a3c90"],"state_sha256":"0a7912701e0aa45832128a26772f2b22f5a9fb61cbe1b60f2261cbfe35e1d5dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GBKxEYFOv9XvLUr7bWNLWNc7ofa4w5xFS1ocdLxVqEHN7YSNMwymAdcIZEP53tNZeHKbL9cPgYDJjshhADHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:22:52.553838Z","bundle_sha256":"2e223f89e2d292925bb10f6762dd96c21a0d4b82b196d951909ce59d39f0b505"}}