{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RTKFHPMJ7UOAP4ZT4DD2REHKNG","short_pith_number":"pith:RTKFHPMJ","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"},"canonical_sha256":"8cd453bd89fd1c07f333e0c7a890ea699cfeba0b1b5d557541ae7b6ed4a78684","source":{"kind":"arxiv","id":"1603.08109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08109","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08109v1","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08109","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"RTKFHPMJ7UOA","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTKFHPMJ7UOAP4ZT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTKFHPMJ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RTKFHPMJ7UOAP4ZT4DD2REHKNG","target":"record","payload":{"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"},"canonical_sha256":"8cd453bd89fd1c07f333e0c7a890ea699cfeba0b1b5d557541ae7b6ed4a78684","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"},"source_kind":"arxiv","source_id":"1603.08109","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-05-18T01:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"djklra5CNyTG7JEJ+405kWf2yR2/QexKEldi0g6xL6DkoXrqbjZLkXdHXO7RbnFnWax6VMCKGv//f/z6/xzVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:50:37.642257Z"},"content_sha256":"171fd1c0d318501dca703a3ac90f856ae5c603cfbc5ee26f3da21439bacf1f73","schema_version":"1.0","event_id":"sha256:171fd1c0d318501dca703a3ac90f856ae5c603cfbc5ee26f3da21439bacf1f73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RTKFHPMJ7UOAP4ZT4DD2REHKNG","target":"graph","payload":{"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"},"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-05-18T01:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/KwYgQlPfYNfS6njtWslnBJYJVmOYn/7a+GcvuEAJ64cbpIBX5mFEWHfkrPfqZzK+9xRsUJz15GQCer0l7KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:50:37.642629Z"},"content_sha256":"86a79bb66fb4a446123209cfcff2158c53e4009800ff6aa808a895a287f5ab7b","schema_version":"1.0","event_id":"sha256:86a79bb66fb4a446123209cfcff2158c53e4009800ff6aa808a895a287f5ab7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/bundle.json","state_url":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/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-06-28T17:50:37Z","links":{"resolver":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG","bundle":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/bundle.json","state":"https://pith.science/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTKFHPMJ7UOAP4ZT4DD2REHKNG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RTKFHPMJ7UOAP4ZT4DD2REHKNG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"edf5926bad7e96e783888d65ada2848a644320ee1b5dab669b822dd8acfccf09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-26T14:05:34Z","title_canon_sha256":"707394b6c292ff2062d3d8fc432ff2e72b49e429122eb3fcfb1e593ca7408e36"},"schema_version":"1.0","source":{"id":"1603.08109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08109","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08109v1","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08109","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"RTKFHPMJ7UOA","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTKFHPMJ7UOAP4ZT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTKFHPMJ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:86a79bb66fb4a446123209cfcff2158c53e4009800ff6aa808a895a287f5ab7b","target":"graph","created_at":"2026-05-18T01:15:49Z","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"},"paper":{"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","authors_text":"Kunal N. Chaudhury, Swapnil D. Dabhade","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-26T14:05:34Z","title":"Fast and Provably Accurate Bilateral Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08109","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:171fd1c0d318501dca703a3ac90f856ae5c603cfbc5ee26f3da21439bacf1f73","target":"record","created_at":"2026-05-18T01:15:49Z","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":"edf5926bad7e96e783888d65ada2848a644320ee1b5dab669b822dd8acfccf09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-26T14:05:34Z","title_canon_sha256":"707394b6c292ff2062d3d8fc432ff2e72b49e429122eb3fcfb1e593ca7408e36"},"schema_version":"1.0","source":{"id":"1603.08109","kind":"arxiv","version":1}},"canonical_sha256":"8cd453bd89fd1c07f333e0c7a890ea699cfeba0b1b5d557541ae7b6ed4a78684","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cd453bd89fd1c07f333e0c7a890ea699cfeba0b1b5d557541ae7b6ed4a78684","first_computed_at":"2026-05-18T01:15:49.016649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:49.016649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQ7KETGeof3fbWJmvdCu48jAsxn5ESvrcGbKvi3i9jHMuE/idUz5efcQKyKFyCTEcxMT3MbFue3utzRus2O6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:49.017148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:171fd1c0d318501dca703a3ac90f856ae5c603cfbc5ee26f3da21439bacf1f73","sha256:86a79bb66fb4a446123209cfcff2158c53e4009800ff6aa808a895a287f5ab7b"],"state_sha256":"72a059cd95cd27f557f65eb387cc9d68c7921354fabc214762753f90e325e991"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Gs+AeOKlHWpjd9dCbdRsTAxx56v1YcSVV1XRt8M5KjWvCvRtmobkIGsHL3nbxCPgCPNhV7SBxZbgjrvFtkrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:50:37.644488Z","bundle_sha256":"a95467fe3e9714b13a579e7fd8296a527e674a3c216e21a66c8ba046c9e1d5c0"}}