{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DWF6UONXAEUCA3OMY47NMMKEPM","short_pith_number":"pith:DWF6UONX","schema_version":"1.0","canonical_sha256":"1d8bea39b70128206dccc73ed631447b12315c67926d0a829ee0fadea7526522","source":{"kind":"arxiv","id":"2507.19926","version":1},"attestation_state":"computed","paper":{"title":"A Fast Parallel Median Filtering Algorithm Using Hierarchical Tiling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DC","authors_text":"Louis Sugy (NVIDIA)","submitted_at":"2025-07-26T12:06:05Z","abstract_excerpt":"Median filtering is a non-linear smoothing technique widely used in digital image processing to remove noise while retaining sharp edges. It is particularly well suited to removing outliers (impulse noise) or granular artifacts (speckle noise). However, the high computational cost of median filtering can be prohibitive. Sorting-based algorithms excel with small kernels but scale poorly with increasing kernel diameter, in contrast to constant-time methods characterized by higher constant factors but better scalability, such as histogram-based approaches or the 2D wavelet matrix.\n  This paper in"},"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":"2507.19926","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-26T12:06:05Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"49e05c6064e71dda1cdb2e5971b04e3b9c80f32f3117e78996de419d37de6e78","abstract_canon_sha256":"4e7034ad8d1b01509bc76b12297763b7d25708ebab37937f0431934eb5f7a70f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:45.039387Z","signature_b64":"SbCE1J+gVPmfZqhNvh9tIBBcu8Yk11eVATDIczHH1GDXuqa0GNhgli2wpJ1OlAJ3NhK/EqX4icFzxZHmOHzcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d8bea39b70128206dccc73ed631447b12315c67926d0a829ee0fadea7526522","last_reissued_at":"2026-07-05T11:43:45.038947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:45.038947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Parallel Median Filtering Algorithm Using Hierarchical Tiling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DC","authors_text":"Louis Sugy (NVIDIA)","submitted_at":"2025-07-26T12:06:05Z","abstract_excerpt":"Median filtering is a non-linear smoothing technique widely used in digital image processing to remove noise while retaining sharp edges. It is particularly well suited to removing outliers (impulse noise) or granular artifacts (speckle noise). However, the high computational cost of median filtering can be prohibitive. Sorting-based algorithms excel with small kernels but scale poorly with increasing kernel diameter, in contrast to constant-time methods characterized by higher constant factors but better scalability, such as histogram-based approaches or the 2D wavelet matrix.\n  This paper in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19926","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/2507.19926/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":"2507.19926","created_at":"2026-07-05T11:43:45.039009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19926v1","created_at":"2026-07-05T11:43:45.039009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19926","created_at":"2026-07-05T11:43:45.039009+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWF6UONXAEUC","created_at":"2026-07-05T11:43:45.039009+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWF6UONXAEUCA3OM","created_at":"2026-07-05T11:43:45.039009+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWF6UONX","created_at":"2026-07-05T11:43:45.039009+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/DWF6UONXAEUCA3OMY47NMMKEPM","json":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM.json","graph_json":"https://pith.science/api/pith-number/DWF6UONXAEUCA3OMY47NMMKEPM/graph.json","events_json":"https://pith.science/api/pith-number/DWF6UONXAEUCA3OMY47NMMKEPM/events.json","paper":"https://pith.science/paper/DWF6UONX"},"agent_actions":{"view_html":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM","download_json":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM.json","view_paper":"https://pith.science/paper/DWF6UONX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19926&json=true","fetch_graph":"https://pith.science/api/pith-number/DWF6UONXAEUCA3OMY47NMMKEPM/graph.json","fetch_events":"https://pith.science/api/pith-number/DWF6UONXAEUCA3OMY47NMMKEPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM/action/storage_attestation","attest_author":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM/action/author_attestation","sign_citation":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM/action/citation_signature","submit_replication":"https://pith.science/pith/DWF6UONXAEUCA3OMY47NMMKEPM/action/replication_record"}},"created_at":"2026-07-05T11:43:45.039009+00:00","updated_at":"2026-07-05T11:43:45.039009+00:00"}