{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XR7LPVNC42TEH7NGN736H2S2E3","short_pith_number":"pith:XR7LPVNC","schema_version":"1.0","canonical_sha256":"bc7eb7d5a2e6a643fda66ff7e3ea5a26ed4c2f53b8431f3d64419263370a1488","source":{"kind":"arxiv","id":"1505.00077","version":2},"attestation_state":"computed","paper":{"title":"Fast and Accurate Bilateral Filtering using Gauss-Polynomial Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kunal N. Chaudhury","submitted_at":"2015-05-01T03:01:09Z","abstract_excerpt":"The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A widely-used form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires $O(\\sigma^2)$ operations per pixel, where $\\sigma$ is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to $O(1)$ per pixel for any arbitrary $"},"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":"1505.00077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-01T03:01:09Z","cross_cats_sorted":[],"title_canon_sha256":"5b157132f38bcae8557bab6642c46dfe7eece2c0b84f60592cf1ab3e7e3ee824","abstract_canon_sha256":"06645db26c9291d44b6e2133d37bd8a0d8bf246921c85971ca09ad51153be01b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:01.939579Z","signature_b64":"kZYDVZoBCN1tIIKYI6R+Atj92JFwLsHHhwq1d45ii+NjYRXUmV9eY5qEWo9zVArTseTxD4qDe1UeWaDVYpGYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7eb7d5a2e6a643fda66ff7e3ea5a26ed4c2f53b8431f3d64419263370a1488","last_reissued_at":"2026-05-18T00:59:01.939171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:01.939171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Accurate Bilateral Filtering using Gauss-Polynomial Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kunal N. Chaudhury","submitted_at":"2015-05-01T03:01:09Z","abstract_excerpt":"The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A widely-used form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires $O(\\sigma^2)$ operations per pixel, where $\\sigma$ is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to $O(1)$ per pixel for any arbitrary $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00077","kind":"arxiv","version":2},"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":"1505.00077","created_at":"2026-05-18T00:59:01.939227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00077v2","created_at":"2026-05-18T00:59:01.939227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00077","created_at":"2026-05-18T00:59:01.939227+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR7LPVNC42TE","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR7LPVNC42TEH7NG","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR7LPVNC","created_at":"2026-05-18T12:29:50.041715+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/XR7LPVNC42TEH7NGN736H2S2E3","json":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3.json","graph_json":"https://pith.science/api/pith-number/XR7LPVNC42TEH7NGN736H2S2E3/graph.json","events_json":"https://pith.science/api/pith-number/XR7LPVNC42TEH7NGN736H2S2E3/events.json","paper":"https://pith.science/paper/XR7LPVNC"},"agent_actions":{"view_html":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3","download_json":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3.json","view_paper":"https://pith.science/paper/XR7LPVNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00077&json=true","fetch_graph":"https://pith.science/api/pith-number/XR7LPVNC42TEH7NGN736H2S2E3/graph.json","fetch_events":"https://pith.science/api/pith-number/XR7LPVNC42TEH7NGN736H2S2E3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3/action/storage_attestation","attest_author":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3/action/author_attestation","sign_citation":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3/action/citation_signature","submit_replication":"https://pith.science/pith/XR7LPVNC42TEH7NGN736H2S2E3/action/replication_record"}},"created_at":"2026-05-18T00:59:01.939227+00:00","updated_at":"2026-05-18T00:59:01.939227+00:00"}