{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:465WTWLGUD2TOYFHZPTHIJ4ZTD","short_pith_number":"pith:465WTWLG","schema_version":"1.0","canonical_sha256":"e7bb69d966a0f53760a7cbe674279998efbe27443d4702e691838958e1a1111d","source":{"kind":"arxiv","id":"1804.10783","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Point Cloud Attribute Compression Using Slice-based Layered Structure and Block-based Intra Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Ge Li, Qi Zhang, Yiting Shao, Zhu Li","submitted_at":"2018-04-28T10:27:39Z","abstract_excerpt":"Point cloud compression is a key enabler for the emerging applications of immersive visual communication, autonomous driving and smart cities, etc. In this paper, we propose a hybrid point cloud attribute compression scheme built on an original layered data structure. First, a slice-partition scheme and geometry-adaptive k dimensional-tree (kd-tree) method are devised to generate the four-layer structure. Second, we introduce an efficient block-based intra prediction scheme containing a DC prediction mode and several angular modes, in order to exploit the spatial correlation between adjacent p"},"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":"1804.10783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2018-04-28T10:27:39Z","cross_cats_sorted":[],"title_canon_sha256":"9832a2c981a5f0115581960b7f7fba8ef9fb75c71ad070b382498d6ba57edc4e","abstract_canon_sha256":"e10cffcff588edfc8dbdb087aa3fbe1207493bc0023ac17460074557a1c66309"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.575668Z","signature_b64":"Ktz0QHPDQSu6Qlz72dQRKTBgCG+hMx2N5HDBmkO9ooAQJ4R7+SS7wZ+8cniOFtr3hMrOcPXQ82sECWVY6DBmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7bb69d966a0f53760a7cbe674279998efbe27443d4702e691838958e1a1111d","last_reissued_at":"2026-05-18T00:17:15.575079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.575079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Point Cloud Attribute Compression Using Slice-based Layered Structure and Block-based Intra Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Ge Li, Qi Zhang, Yiting Shao, Zhu Li","submitted_at":"2018-04-28T10:27:39Z","abstract_excerpt":"Point cloud compression is a key enabler for the emerging applications of immersive visual communication, autonomous driving and smart cities, etc. In this paper, we propose a hybrid point cloud attribute compression scheme built on an original layered data structure. First, a slice-partition scheme and geometry-adaptive k dimensional-tree (kd-tree) method are devised to generate the four-layer structure. Second, we introduce an efficient block-based intra prediction scheme containing a DC prediction mode and several angular modes, in order to exploit the spatial correlation between adjacent p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10783","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.10783","created_at":"2026-05-18T00:17:15.575162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10783v1","created_at":"2026-05-18T00:17:15.575162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10783","created_at":"2026-05-18T00:17:15.575162+00:00"},{"alias_kind":"pith_short_12","alias_value":"465WTWLGUD2T","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"465WTWLGUD2TOYFH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"465WTWLG","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD","json":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD.json","graph_json":"https://pith.science/api/pith-number/465WTWLGUD2TOYFHZPTHIJ4ZTD/graph.json","events_json":"https://pith.science/api/pith-number/465WTWLGUD2TOYFHZPTHIJ4ZTD/events.json","paper":"https://pith.science/paper/465WTWLG"},"agent_actions":{"view_html":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD","download_json":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD.json","view_paper":"https://pith.science/paper/465WTWLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10783&json=true","fetch_graph":"https://pith.science/api/pith-number/465WTWLGUD2TOYFHZPTHIJ4ZTD/graph.json","fetch_events":"https://pith.science/api/pith-number/465WTWLGUD2TOYFHZPTHIJ4ZTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD/action/storage_attestation","attest_author":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD/action/author_attestation","sign_citation":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD/action/citation_signature","submit_replication":"https://pith.science/pith/465WTWLGUD2TOYFHZPTHIJ4ZTD/action/replication_record"}},"created_at":"2026-05-18T00:17:15.575162+00:00","updated_at":"2026-05-18T00:17:15.575162+00:00"}