{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7F2M32VKSTSKBSUWZBAL2NJFKI","short_pith_number":"pith:7F2M32VK","schema_version":"1.0","canonical_sha256":"f974cdeaaa94e4a0ca96c840bd35255201e07fe259111eefd3252b2a6999d499","source":{"kind":"arxiv","id":"2501.15286","version":1},"attestation_state":"computed","paper":{"title":"Efficient Point Clouds Upsampling via Flow Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.CV","authors_text":"Chenhang He, Lei Li, Zhi-Song Liu","submitted_at":"2025-01-25T17:50:53Z","abstract_excerpt":"Diffusion models are a powerful framework for tackling ill-posed problems, with recent advancements extending their use to point cloud upsampling. Despite their potential, existing diffusion models struggle with inefficiencies as they map Gaussian noise to real point clouds, overlooking the geometric information inherent in sparse point clouds. To address these inefficiencies, we propose PUFM, a flow matching approach to directly map sparse point clouds to their high-fidelity dense counterparts. Our method first employs midpoint interpolation to sparse point clouds, resolving the density misma"},"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":"2501.15286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-01-25T17:50:53Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"25a8da0693fc03db6b630f208118d74b759de4d2e4ce3f475dabe125bad5f739","abstract_canon_sha256":"ba643f96bb01a35bb9e835a9778fe1dba91f855050ae96ef4da4f1cace2b97f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:26.849714Z","signature_b64":"Lirul6VYsD+fgtC24UInlubI3TsB7w9BnUuMmk+7R1uaSM2GCOfYpSld71MzWOzBidrjT+bds1nsWQkt7HJ9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f974cdeaaa94e4a0ca96c840bd35255201e07fe259111eefd3252b2a6999d499","last_reissued_at":"2026-07-05T10:05:26.849250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:26.849250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Point Clouds Upsampling via Flow Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.CV","authors_text":"Chenhang He, Lei Li, Zhi-Song Liu","submitted_at":"2025-01-25T17:50:53Z","abstract_excerpt":"Diffusion models are a powerful framework for tackling ill-posed problems, with recent advancements extending their use to point cloud upsampling. Despite their potential, existing diffusion models struggle with inefficiencies as they map Gaussian noise to real point clouds, overlooking the geometric information inherent in sparse point clouds. To address these inefficiencies, we propose PUFM, a flow matching approach to directly map sparse point clouds to their high-fidelity dense counterparts. Our method first employs midpoint interpolation to sparse point clouds, resolving the density misma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15286","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/2501.15286/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":"2501.15286","created_at":"2026-07-05T10:05:26.849307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15286v1","created_at":"2026-07-05T10:05:26.849307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15286","created_at":"2026-07-05T10:05:26.849307+00:00"},{"alias_kind":"pith_short_12","alias_value":"7F2M32VKSTSK","created_at":"2026-07-05T10:05:26.849307+00:00"},{"alias_kind":"pith_short_16","alias_value":"7F2M32VKSTSKBSUW","created_at":"2026-07-05T10:05:26.849307+00:00"},{"alias_kind":"pith_short_8","alias_value":"7F2M32VK","created_at":"2026-07-05T10:05:26.849307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02201","citing_title":"Super-Resolution of Airborne Laser Scanning Point Clouds for Forest Inventory","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02201","citing_title":"Super-Resolution of Airborne Laser Scanning Point Clouds for Forest Inventory","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI","json":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI.json","graph_json":"https://pith.science/api/pith-number/7F2M32VKSTSKBSUWZBAL2NJFKI/graph.json","events_json":"https://pith.science/api/pith-number/7F2M32VKSTSKBSUWZBAL2NJFKI/events.json","paper":"https://pith.science/paper/7F2M32VK"},"agent_actions":{"view_html":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI","download_json":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI.json","view_paper":"https://pith.science/paper/7F2M32VK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15286&json=true","fetch_graph":"https://pith.science/api/pith-number/7F2M32VKSTSKBSUWZBAL2NJFKI/graph.json","fetch_events":"https://pith.science/api/pith-number/7F2M32VKSTSKBSUWZBAL2NJFKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI/action/storage_attestation","attest_author":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI/action/author_attestation","sign_citation":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI/action/citation_signature","submit_replication":"https://pith.science/pith/7F2M32VKSTSKBSUWZBAL2NJFKI/action/replication_record"}},"created_at":"2026-07-05T10:05:26.849307+00:00","updated_at":"2026-07-05T10:05:26.849307+00:00"}