{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WTZBHJ3O4Q44UNKSOQL5F2LIEZ","short_pith_number":"pith:WTZBHJ3O","schema_version":"1.0","canonical_sha256":"b4f213a76ee439ca35527417d2e968266d8e37a980b07e73115e28d0aede7fcc","source":{"kind":"arxiv","id":"2005.07178","version":2},"attestation_state":"computed","paper":{"title":"OctSqueeze: Octree-Structured Entropy Model for LiDAR Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Jerry Liu, Kelvin Wong, Lila Huang, Raquel Urtasun, Shenlong Wang","submitted_at":"2020-05-14T17:48:49Z","abstract_excerpt":"We present a novel deep compression algorithm to reduce the memory footprint of LiDAR point clouds. Our method exploits the sparsity and structural redundancy between points to reduce the bitrate. Towards this goal, we first encode the LiDAR points into an octree, a data-efficient structure suitable for sparse point clouds. We then design a tree-structured conditional entropy model that models the probabilities of the octree symbols to encode the octree into a compact bitstream. We validate the effectiveness of our method over two large-scale datasets. The results demonstrate that our approach"},"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":"2005.07178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2020-05-14T17:48:49Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"bf86b7b42531385ff66309a14fdd2cbbe53227aa926b197f9848aad0ed430728","abstract_canon_sha256":"648cf43fa574bbe6169ce6137ebd2a6d53650d348cd36024571ad7f96f69cfdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:40.285458Z","signature_b64":"/ryeT6SAgnGbJFyM7XdHchwrqxniwIUe1sFLDJJRFwoGpYZP6kNWL7k0OaagjqS7+0GzRHP32mrIsVZVmoh3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f213a76ee439ca35527417d2e968266d8e37a980b07e73115e28d0aede7fcc","last_reissued_at":"2026-07-05T02:05:40.285031Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:40.285031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OctSqueeze: Octree-Structured Entropy Model for LiDAR Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Jerry Liu, Kelvin Wong, Lila Huang, Raquel Urtasun, Shenlong Wang","submitted_at":"2020-05-14T17:48:49Z","abstract_excerpt":"We present a novel deep compression algorithm to reduce the memory footprint of LiDAR point clouds. Our method exploits the sparsity and structural redundancy between points to reduce the bitrate. Towards this goal, we first encode the LiDAR points into an octree, a data-efficient structure suitable for sparse point clouds. We then design a tree-structured conditional entropy model that models the probabilities of the octree symbols to encode the octree into a compact bitstream. We validate the effectiveness of our method over two large-scale datasets. The results demonstrate that our approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07178","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/2005.07178/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":"2005.07178","created_at":"2026-07-05T02:05:40.285089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07178v2","created_at":"2026-07-05T02:05:40.285089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07178","created_at":"2026-07-05T02:05:40.285089+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTZBHJ3O4Q44","created_at":"2026-07-05T02:05:40.285089+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTZBHJ3O4Q44UNKS","created_at":"2026-07-05T02:05:40.285089+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTZBHJ3O","created_at":"2026-07-05T02:05:40.285089+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":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ","json":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ.json","graph_json":"https://pith.science/api/pith-number/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/graph.json","events_json":"https://pith.science/api/pith-number/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/events.json","paper":"https://pith.science/paper/WTZBHJ3O"},"agent_actions":{"view_html":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ","download_json":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ.json","view_paper":"https://pith.science/paper/WTZBHJ3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07178&json=true","fetch_graph":"https://pith.science/api/pith-number/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/action/storage_attestation","attest_author":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/action/author_attestation","sign_citation":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/action/citation_signature","submit_replication":"https://pith.science/pith/WTZBHJ3O4Q44UNKSOQL5F2LIEZ/action/replication_record"}},"created_at":"2026-07-05T02:05:40.285089+00:00","updated_at":"2026-07-05T02:05:40.285089+00:00"}