{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RTKFHPMJ7UOAP4ZT4DD2REHKNG","short_pith_number":"pith:RTKFHPMJ","schema_version":"1.0","canonical_sha256":"8cd453bd89fd1c07f333e0c7a890ea699cfeba0b1b5d557541ae7b6ed4a78684","source":{"kind":"arxiv","id":"1603.08109","version":1},"attestation_state":"computed","paper":{"title":"Fast and Provably Accurate Bilateral Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kunal N. Chaudhury, Swapnil D. Dabhade","submitted_at":"2016-03-26T14:05:34Z","abstract_excerpt":"The bilateral filter is a non-linear filter that uses a range filter along with a spatial filter to perform edge-preserving smoothing of images. A direct computation of the bilateral filter requires $O(S)$ operations per pixel, where $S$ is the size of the support of the spatial filter. In this paper, we present a fast and provably accurate algorithm for approximating the bilateral filter when the range kernel is Gaussian. In particular, for box and Gaussian spatial filters, the proposed algorithm can cut down the complexity to $O(1)$ per pixel for any arbitrary $S$. The algorithm has a simple"},"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":"1603.08109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-26T14:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"707394b6c292ff2062d3d8fc432ff2e72b49e429122eb3fcfb1e593ca7408e36","abstract_canon_sha256":"edf5926bad7e96e783888d65ada2848a644320ee1b5dab669b822dd8acfccf09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:49.017148Z","signature_b64":"bQ7KETGeof3fbWJmvdCu48jAsxn5ESvrcGbKvi3i9jHMuE/idUz5efcQKyKFyCTEcxMT3MbFue3utzRus2O6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd453bd89fd1c07f333e0c7a890ea699cfeba0b1b5d557541ae7b6ed4a78684","last_reissued_at":"2026-05-18T01:15:49.016649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:49.016649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Provably Accurate Bilateral Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kunal N. Chaudhury, Swapnil D. Dabhade","submitted_at":"2016-03-26T14:05:34Z","abstract_excerpt":"The bilateral filter is a non-linear filter that uses a range filter along with a spatial filter to perform edge-preserving smoothing of images. A direct computation of the bilateral filter requires $O(S)$ operations per pixel, where $S$ is the size of the support of the spatial filter. In this paper, we present a fast and provably accurate algorithm for approximating the bilateral filter when the range kernel is Gaussian. In particular, for box and Gaussian spatial filters, the proposed algorithm can cut down the complexity to $O(1)$ per pixel for any arbitrary $S$. The algorithm has a simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08109","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":"1603.08109","created_at":"2026-05-18T01:15:49.016726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08109v1","created_at":"2026-05-18T01:15:49.016726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08109","created_at":"2026-05-18T01:15:49.016726+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTKFHPMJ7UOA","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTKFHPMJ7UOAP4ZT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTKFHPMJ","created_at":"2026-05-18T12:30:41.710351+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/RTKFHPMJ7UOAP4ZT4DD2REHKNG","json":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG.json","graph_json":"https://pith.science/api/pith-number/RTKFHPMJ7UOAP4ZT4DD2REHKNG/graph.json","events_json":"https://pith.science/api/pith-number/RTKFHPMJ7UOAP4ZT4DD2REHKNG/events.json","paper":"https://pith.science/paper/RTKFHPMJ"},"agent_actions":{"view_html":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG","download_json":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG.json","view_paper":"https://pith.science/paper/RTKFHPMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08109&json=true","fetch_graph":"https://pith.science/api/pith-number/RTKFHPMJ7UOAP4ZT4DD2REHKNG/graph.json","fetch_events":"https://pith.science/api/pith-number/RTKFHPMJ7UOAP4ZT4DD2REHKNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/action/storage_attestation","attest_author":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/action/author_attestation","sign_citation":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/action/citation_signature","submit_replication":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/action/replication_record"}},"created_at":"2026-05-18T01:15:49.016726+00:00","updated_at":"2026-05-18T01:15:49.016726+00:00"}