{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EJ3KJS3FTCUPSPEY3ZPLPDLE3H","short_pith_number":"pith:EJ3KJS3F","schema_version":"1.0","canonical_sha256":"2276a4cb6598a8f93c98de5eb78d64d9da43cbd1021049d6e9d84549695a1bf6","source":{"kind":"arxiv","id":"2505.13316","version":1},"attestation_state":"computed","paper":{"title":"Denoising Diffusion Probabilistic Model for Point Cloud Compression at Low Bit-Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Alberto Presta, Attilio Fiandrotti, Enzo Tartaglione, Gabriele Spadaro, Giuseppe Valenzise, Jhony H. Giraldo, Marco Grangetto, Wei Hu","submitted_at":"2025-05-19T16:29:12Z","abstract_excerpt":"Efficient compression of low-bit-rate point clouds is critical for bandwidth-constrained applications. However, existing techniques mainly focus on high-fidelity reconstruction, requiring many bits for compression. This paper proposes a \"Denoising Diffusion Probabilistic Model\" (DDPM) architecture for point cloud compression (DDPM-PCC) at low bit-rates. A PointNet encoder produces the condition vector for the generation, which is then quantized via a learnable vector quantizer. This configuration allows to achieve a low bitrates while preserving quality. Experiments on ShapeNet and ModelNet40 "},"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":"2505.13316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-05-19T16:29:12Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ef85839b36574961876cd8686d8c93b499042ae47542253576ae9b3b9688a6ca","abstract_canon_sha256":"0030a4dcafe5f22ea8823790ca7f9edb815b27c9c66666beda8969690fab27b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:28.427571Z","signature_b64":"ITv+Eao8TFwGMywG0aIOLLFSvwnob2rf/mWVqC8qC4l7zZ2Vwsd8fhmTReRhyXcd3Kth4gi1woIFElmnnmzZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2276a4cb6598a8f93c98de5eb78d64d9da43cbd1021049d6e9d84549695a1bf6","last_reissued_at":"2026-07-05T11:05:28.427095Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:28.427095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Denoising Diffusion Probabilistic Model for Point Cloud Compression at Low Bit-Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Alberto Presta, Attilio Fiandrotti, Enzo Tartaglione, Gabriele Spadaro, Giuseppe Valenzise, Jhony H. Giraldo, Marco Grangetto, Wei Hu","submitted_at":"2025-05-19T16:29:12Z","abstract_excerpt":"Efficient compression of low-bit-rate point clouds is critical for bandwidth-constrained applications. However, existing techniques mainly focus on high-fidelity reconstruction, requiring many bits for compression. This paper proposes a \"Denoising Diffusion Probabilistic Model\" (DDPM) architecture for point cloud compression (DDPM-PCC) at low bit-rates. A PointNet encoder produces the condition vector for the generation, which is then quantized via a learnable vector quantizer. This configuration allows to achieve a low bitrates while preserving quality. Experiments on ShapeNet and ModelNet40 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13316","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/2505.13316/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":"2505.13316","created_at":"2026-07-05T11:05:28.427151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13316v1","created_at":"2026-07-05T11:05:28.427151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13316","created_at":"2026-07-05T11:05:28.427151+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJ3KJS3FTCUP","created_at":"2026-07-05T11:05:28.427151+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJ3KJS3FTCUPSPEY","created_at":"2026-07-05T11:05:28.427151+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJ3KJS3F","created_at":"2026-07-05T11:05:28.427151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03623","citing_title":"A Few-Step Generative Model on Cumulative Flow Maps","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H","json":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H.json","graph_json":"https://pith.science/api/pith-number/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/graph.json","events_json":"https://pith.science/api/pith-number/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/events.json","paper":"https://pith.science/paper/EJ3KJS3F"},"agent_actions":{"view_html":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H","download_json":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H.json","view_paper":"https://pith.science/paper/EJ3KJS3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13316&json=true","fetch_graph":"https://pith.science/api/pith-number/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/graph.json","fetch_events":"https://pith.science/api/pith-number/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/action/storage_attestation","attest_author":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/action/author_attestation","sign_citation":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/action/citation_signature","submit_replication":"https://pith.science/pith/EJ3KJS3FTCUPSPEY3ZPLPDLE3H/action/replication_record"}},"created_at":"2026-07-05T11:05:28.427151+00:00","updated_at":"2026-07-05T11:05:28.427151+00:00"}