{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MH5RHMTXUCUM7L4RTPFU27MIWB","short_pith_number":"pith:MH5RHMTX","schema_version":"1.0","canonical_sha256":"61fb13b277a0a8cfaf919bcb4d7d88b07187db88188c4a0e58dc0380614333c8","source":{"kind":"arxiv","id":"2205.01135","version":1},"attestation_state":"computed","paper":{"title":"D-DPCC: Deep Dynamic Point Cloud Compression via 3D Motion Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.IV"],"primary_cat":"cs.CV","authors_text":"Dong Wang, Linyao Gao, Tingyu Fan, Yiling Xu, Zhu Li","submitted_at":"2022-05-02T18:10:45Z","abstract_excerpt":"The non-uniformly distributed nature of the 3D dynamic point cloud (DPC) brings significant challenges to its high-efficient inter-frame compression. This paper proposes a novel 3D sparse convolution-based Deep Dynamic Point Cloud Compression (D-DPCC) network to compensate and compress the DPC geometry with 3D motion estimation and motion compensation in the feature space. In the proposed D-DPCC network, we design a {\\it Multi-scale Motion Fusion} (MMF) module to accurately estimate the 3D optical flow between the feature representations of adjacent point cloud frames. Specifically, we utilize"},"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":"2205.01135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-05-02T18:10:45Z","cross_cats_sorted":["cs.LG","eess.IV"],"title_canon_sha256":"5dec88a84b80b5a43f262e05598eb3abc63ac6e9081fdf9b5f18acfcacb31584","abstract_canon_sha256":"58f98ddf4645f34c9c064bd7bbe492dd2c7f8c234dff6911b439b1d2a8e728bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:20:01.302351Z","signature_b64":"+AZwpke3v5GHUxhlE0lkhfuuNgdIoicVwqXGmZOydRyubLzbQEtUvKr+xxOeXd3pkeePL/yZSUuN0o0QOQpNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61fb13b277a0a8cfaf919bcb4d7d88b07187db88188c4a0e58dc0380614333c8","last_reissued_at":"2026-07-05T04:20:01.301936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:20:01.301936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"D-DPCC: Deep Dynamic Point Cloud Compression via 3D Motion Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.IV"],"primary_cat":"cs.CV","authors_text":"Dong Wang, Linyao Gao, Tingyu Fan, Yiling Xu, Zhu Li","submitted_at":"2022-05-02T18:10:45Z","abstract_excerpt":"The non-uniformly distributed nature of the 3D dynamic point cloud (DPC) brings significant challenges to its high-efficient inter-frame compression. This paper proposes a novel 3D sparse convolution-based Deep Dynamic Point Cloud Compression (D-DPCC) network to compensate and compress the DPC geometry with 3D motion estimation and motion compensation in the feature space. In the proposed D-DPCC network, we design a {\\it Multi-scale Motion Fusion} (MMF) module to accurately estimate the 3D optical flow between the feature representations of adjacent point cloud frames. Specifically, we utilize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.01135","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/2205.01135/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":"2205.01135","created_at":"2026-07-05T04:20:01.301995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.01135v1","created_at":"2026-07-05T04:20:01.301995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.01135","created_at":"2026-07-05T04:20:01.301995+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH5RHMTXUCUM","created_at":"2026-07-05T04:20:01.301995+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH5RHMTXUCUM7L4R","created_at":"2026-07-05T04:20:01.301995+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH5RHMTX","created_at":"2026-07-05T04:20:01.301995+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00687","citing_title":"Proteus: A Truncation-Robust Entropy Model for Progressive LiDAR Compression","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB","json":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB.json","graph_json":"https://pith.science/api/pith-number/MH5RHMTXUCUM7L4RTPFU27MIWB/graph.json","events_json":"https://pith.science/api/pith-number/MH5RHMTXUCUM7L4RTPFU27MIWB/events.json","paper":"https://pith.science/paper/MH5RHMTX"},"agent_actions":{"view_html":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB","download_json":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB.json","view_paper":"https://pith.science/paper/MH5RHMTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.01135&json=true","fetch_graph":"https://pith.science/api/pith-number/MH5RHMTXUCUM7L4RTPFU27MIWB/graph.json","fetch_events":"https://pith.science/api/pith-number/MH5RHMTXUCUM7L4RTPFU27MIWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB/action/storage_attestation","attest_author":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB/action/author_attestation","sign_citation":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB/action/citation_signature","submit_replication":"https://pith.science/pith/MH5RHMTXUCUM7L4RTPFU27MIWB/action/replication_record"}},"created_at":"2026-07-05T04:20:01.301995+00:00","updated_at":"2026-07-05T04:20:01.301995+00:00"}