{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AEX7RYFFNZD53ATBIFN3SIW4DT","short_pith_number":"pith:AEX7RYFF","canonical_record":{"source":{"id":"1804.10831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-28T16:39:47Z","cross_cats_sorted":[],"title_canon_sha256":"af040e064f03685302ea980fb6c4ed8eed88a6ea97726aa806ef579acb207b44","abstract_canon_sha256":"5f1acfee7fd941562a2658abad6f9e2207a94cc32d02be7d6bfa6f88d14ea1e8"},"schema_version":"1.0"},"canonical_sha256":"012ff8e0a56e47dd8261415bb922dc1cd34ba96460d534d82a625b8163721857","source":{"kind":"arxiv","id":"1804.10831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10831","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10831v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10831","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"AEX7RYFFNZD5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AEX7RYFFNZD53ATB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AEX7RYFF","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AEX7RYFFNZD53ATBIFN3SIW4DT","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-28T16:39:47Z","cross_cats_sorted":[],"title_canon_sha256":"af040e064f03685302ea980fb6c4ed8eed88a6ea97726aa806ef579acb207b44","abstract_canon_sha256":"5f1acfee7fd941562a2658abad6f9e2207a94cc32d02be7d6bfa6f88d14ea1e8"},"schema_version":"1.0"},"canonical_sha256":"012ff8e0a56e47dd8261415bb922dc1cd34ba96460d534d82a625b8163721857","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.401326Z","signature_b64":"DGWfWxlcDht7KLVk6Ru4PaefeHXOzR6IEi8reG6LYnq7W47/Jakf9WroZfC+TSoWW7kkZz8b37aQxpdOqcomAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"012ff8e0a56e47dd8261415bb922dc1cd34ba96460d534d82a625b8163721857","last_reissued_at":"2026-05-18T00:17:15.400781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.400781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10831","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-18T00:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7vDkOLhDFEp8obNJmWDPYnCC9Vw8hvfGj5UaoMRkweWOr2BCQxH012aEBAgkjbVNtuNvkXnAGEve64dDaiSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:00:50.708234Z"},"content_sha256":"671119c26c5757105fb857825aa9198bfac65d79edb953a7ed2fee31a48f322b","schema_version":"1.0","event_id":"sha256:671119c26c5757105fb857825aa9198bfac65d79edb953a7ed2fee31a48f322b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AEX7RYFFNZD53ATBIFN3SIW4DT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast 3D Point Cloud Denoising via Bipartite Graph Approximation & Total Variation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Cheng Yang, Chinthaka Dinesh, Gene Cheung, Ivan V. Bajic","submitted_at":"2018-04-28T16:39:47Z","abstract_excerpt":"Acquired 3D point cloud data, whether from active sensors directly or from stereo-matching algorithms indirectly, typically contain non-negligible noise. To address the point cloud denoising problem, we propose a fast graph-based local algorithm. Specifically, given a k-nearest-neighbor graph of the 3D points, we first approximate it with a bipartite graph(independent sets of red and blue nodes) using a KL divergence criterion. For each partite of nodes (say red), we first define surface normal of each red node using 3D coordinates of neighboring blue nodes, so that red node normals n can be w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10831","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-18T00:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqc54k0dAJ/gSEG6IOs9i+GYK5Vw6hEVoa9XIgDaBbFedDduiS7eM5Da6WKeB2uJEQmiOZfVEZjLVUhhLsMtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:00:50.708608Z"},"content_sha256":"edde910957406596c5d916493c2e3995d0dbe565ab5f1e0581bc285cbd6ba83e","schema_version":"1.0","event_id":"sha256:edde910957406596c5d916493c2e3995d0dbe565ab5f1e0581bc285cbd6ba83e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEX7RYFFNZD53ATBIFN3SIW4DT/bundle.json","state_url":"https://pith.science/pith/AEX7RYFFNZD53ATBIFN3SIW4DT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEX7RYFFNZD53ATBIFN3SIW4DT/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-05-28T03:00:50Z","links":{"resolver":"https://pith.science/pith/AEX7RYFFNZD53ATBIFN3SIW4DT","bundle":"https://pith.science/pith/AEX7RYFFNZD53ATBIFN3SIW4DT/bundle.json","state":"https://pith.science/pith/AEX7RYFFNZD53ATBIFN3SIW4DT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEX7RYFFNZD53ATBIFN3SIW4DT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AEX7RYFFNZD53ATBIFN3SIW4DT","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":"5f1acfee7fd941562a2658abad6f9e2207a94cc32d02be7d6bfa6f88d14ea1e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-28T16:39:47Z","title_canon_sha256":"af040e064f03685302ea980fb6c4ed8eed88a6ea97726aa806ef579acb207b44"},"schema_version":"1.0","source":{"id":"1804.10831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10831","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10831v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10831","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"AEX7RYFFNZD5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AEX7RYFFNZD53ATB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AEX7RYFF","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:edde910957406596c5d916493c2e3995d0dbe565ab5f1e0581bc285cbd6ba83e","target":"graph","created_at":"2026-05-18T00:17:15Z","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":"Acquired 3D point cloud data, whether from active sensors directly or from stereo-matching algorithms indirectly, typically contain non-negligible noise. To address the point cloud denoising problem, we propose a fast graph-based local algorithm. Specifically, given a k-nearest-neighbor graph of the 3D points, we first approximate it with a bipartite graph(independent sets of red and blue nodes) using a KL divergence criterion. For each partite of nodes (say red), we first define surface normal of each red node using 3D coordinates of neighboring blue nodes, so that red node normals n can be w","authors_text":"Cheng Yang, Chinthaka Dinesh, Gene Cheung, Ivan V. Bajic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-28T16:39:47Z","title":"Fast 3D Point Cloud Denoising via Bipartite Graph Approximation & Total Variation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10831","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:671119c26c5757105fb857825aa9198bfac65d79edb953a7ed2fee31a48f322b","target":"record","created_at":"2026-05-18T00:17:15Z","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":"5f1acfee7fd941562a2658abad6f9e2207a94cc32d02be7d6bfa6f88d14ea1e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-04-28T16:39:47Z","title_canon_sha256":"af040e064f03685302ea980fb6c4ed8eed88a6ea97726aa806ef579acb207b44"},"schema_version":"1.0","source":{"id":"1804.10831","kind":"arxiv","version":1}},"canonical_sha256":"012ff8e0a56e47dd8261415bb922dc1cd34ba96460d534d82a625b8163721857","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"012ff8e0a56e47dd8261415bb922dc1cd34ba96460d534d82a625b8163721857","first_computed_at":"2026-05-18T00:17:15.400781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:15.400781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DGWfWxlcDht7KLVk6Ru4PaefeHXOzR6IEi8reG6LYnq7W47/Jakf9WroZfC+TSoWW7kkZz8b37aQxpdOqcomAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:15.401326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:671119c26c5757105fb857825aa9198bfac65d79edb953a7ed2fee31a48f322b","sha256:edde910957406596c5d916493c2e3995d0dbe565ab5f1e0581bc285cbd6ba83e"],"state_sha256":"a7cf64415207799b7b5f156da6a332745f52ba2c56c36221f080d500032b98aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGHqvN/nudh2gfRiXD0Z3rLZKjujT+MSXws+c2vGFy7pCnOynpJylJkhaDvBAzR5daF81hgV84YyDOoe1THDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:00:50.710645Z","bundle_sha256":"106517e5961900ffabeca41b9248dd85d4a0ddb6cbb65c81339f0af3026fb8fd"}}