{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:X424FK3JMGWE2FRLZAWXJYP4MU","short_pith_number":"pith:X424FK3J","schema_version":"1.0","canonical_sha256":"bf35c2ab6961ac4d162bc82d74e1fc652f38ed3e7f7643c35894488da87c8c3d","source":{"kind":"arxiv","id":"2112.11271","version":2},"attestation_state":"computed","paper":{"title":"High-Fidelity Point Cloud Completion with Low-Resolution Recovery and Noise-Aware Upsampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bo Wang, Chun-Peng Li, Lin Gao, Ling-Xiao Zhang, Ren-Wu Li","submitted_at":"2021-12-21T14:51:52Z","abstract_excerpt":"Completing an unordered partial point cloud is a challenging task. Existing approaches that rely on decoding a latent feature to recover the complete shape, often lead to the completed point cloud being over-smoothing, losing details, and noisy. Instead of decoding a whole shape, we propose to decode and refine a low-resolution (low-res) point cloud first, and then performs a patch-wise noise-aware upsampling rather than interpolating the whole sparse point cloud at once, which tends to lose details. Regarding the possibility of lacking details of the initially decoded low-res point cloud, we "},"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":"2112.11271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-21T14:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"9069728f592f82e819abf279623be876e09a82e27c75fcd13976ec819e29f960","abstract_canon_sha256":"f629c5046210218c970544cefb8d8ba23183355cbef5087950daa6b7a23956f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:07.148142Z","signature_b64":"rt8gAQZyLQZhh8r8rdoZH6Q+C7RSwxSc2ILBgg3gZS+EhNDK+8WJva5JWx4LutWr5Ad+vMW8FSvmdFTNkpURAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf35c2ab6961ac4d162bc82d74e1fc652f38ed3e7f7643c35894488da87c8c3d","last_reissued_at":"2026-07-05T03:43:07.147609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:07.147609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Fidelity Point Cloud Completion with Low-Resolution Recovery and Noise-Aware Upsampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bo Wang, Chun-Peng Li, Lin Gao, Ling-Xiao Zhang, Ren-Wu Li","submitted_at":"2021-12-21T14:51:52Z","abstract_excerpt":"Completing an unordered partial point cloud is a challenging task. Existing approaches that rely on decoding a latent feature to recover the complete shape, often lead to the completed point cloud being over-smoothing, losing details, and noisy. Instead of decoding a whole shape, we propose to decode and refine a low-resolution (low-res) point cloud first, and then performs a patch-wise noise-aware upsampling rather than interpolating the whole sparse point cloud at once, which tends to lose details. Regarding the possibility of lacking details of the initially decoded low-res point cloud, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.11271","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.11271/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":"2112.11271","created_at":"2026-07-05T03:43:07.147670+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.11271v2","created_at":"2026-07-05T03:43:07.147670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.11271","created_at":"2026-07-05T03:43:07.147670+00:00"},{"alias_kind":"pith_short_12","alias_value":"X424FK3JMGWE","created_at":"2026-07-05T03:43:07.147670+00:00"},{"alias_kind":"pith_short_16","alias_value":"X424FK3JMGWE2FRL","created_at":"2026-07-05T03:43:07.147670+00:00"},{"alias_kind":"pith_short_8","alias_value":"X424FK3J","created_at":"2026-07-05T03:43:07.147670+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16743","citing_title":"Denoising-While-Completing Network (DWCNet): Robust Point Cloud Completion Under Corruption","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU","json":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU.json","graph_json":"https://pith.science/api/pith-number/X424FK3JMGWE2FRLZAWXJYP4MU/graph.json","events_json":"https://pith.science/api/pith-number/X424FK3JMGWE2FRLZAWXJYP4MU/events.json","paper":"https://pith.science/paper/X424FK3J"},"agent_actions":{"view_html":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU","download_json":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU.json","view_paper":"https://pith.science/paper/X424FK3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.11271&json=true","fetch_graph":"https://pith.science/api/pith-number/X424FK3JMGWE2FRLZAWXJYP4MU/graph.json","fetch_events":"https://pith.science/api/pith-number/X424FK3JMGWE2FRLZAWXJYP4MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU/action/storage_attestation","attest_author":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU/action/author_attestation","sign_citation":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU/action/citation_signature","submit_replication":"https://pith.science/pith/X424FK3JMGWE2FRLZAWXJYP4MU/action/replication_record"}},"created_at":"2026-07-05T03:43:07.147670+00:00","updated_at":"2026-07-05T03:43:07.147670+00:00"}