{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QFJ32DA6ZE6DOVZWQ3O2KFUWHP","short_pith_number":"pith:QFJ32DA6","schema_version":"1.0","canonical_sha256":"8153bd0c1ec93c37573686dda516963bf5f5ffb65185bd2833e4e9b897410b17","source":{"kind":"arxiv","id":"2212.06193","version":1},"attestation_state":"computed","paper":{"title":"ROAD: Learning an Implicit Recursive Octree Auto-Decoder to Efficiently Encode 3D Shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.RO"],"primary_cat":"cs.CV","authors_text":"Adrien Gaidon, Katherine Liu, Rares Ambrus, Sergey Zakharov","submitted_at":"2022-12-12T19:09:47Z","abstract_excerpt":"Compact and accurate representations of 3D shapes are central to many perception and robotics tasks. State-of-the-art learning-based methods can reconstruct single objects but scale poorly to large datasets. We present a novel recursive implicit representation to efficiently and accurately encode large datasets of complex 3D shapes by recursively traversing an implicit octree in latent space. Our implicit Recursive Octree Auto-Decoder (ROAD) learns a hierarchically structured latent space enabling state-of-the-art reconstruction results at a compression ratio above 99%. We also propose an effi"},"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":"2212.06193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-12-12T19:09:47Z","cross_cats_sorted":["cs.GR","cs.RO"],"title_canon_sha256":"866c5abec3e206be89bdab3a04a08d2e5b2014e841253b2ee57c5caafc07f617","abstract_canon_sha256":"98cb17aa7829692c9ecc416b7fbe5a05fe4b16f31ad181d785db92b3e87302c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:24:47.595147Z","signature_b64":"D7TboQmXKB4CkGxOe3mWliiyu46QK+h2A5OBiUB/Q4BzUGij4+GUPZi6GoRUb1fH3C0rKpxZsXwLdhEI2UNlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8153bd0c1ec93c37573686dda516963bf5f5ffb65185bd2833e4e9b897410b17","last_reissued_at":"2026-07-05T05:24:47.594738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:24:47.594738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ROAD: Learning an Implicit Recursive Octree Auto-Decoder to Efficiently Encode 3D Shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.RO"],"primary_cat":"cs.CV","authors_text":"Adrien Gaidon, Katherine Liu, Rares Ambrus, Sergey Zakharov","submitted_at":"2022-12-12T19:09:47Z","abstract_excerpt":"Compact and accurate representations of 3D shapes are central to many perception and robotics tasks. State-of-the-art learning-based methods can reconstruct single objects but scale poorly to large datasets. We present a novel recursive implicit representation to efficiently and accurately encode large datasets of complex 3D shapes by recursively traversing an implicit octree in latent space. Our implicit Recursive Octree Auto-Decoder (ROAD) learns a hierarchically structured latent space enabling state-of-the-art reconstruction results at a compression ratio above 99%. We also propose an effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06193","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/2212.06193/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":"2212.06193","created_at":"2026-07-05T05:24:47.594795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.06193v1","created_at":"2026-07-05T05:24:47.594795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06193","created_at":"2026-07-05T05:24:47.594795+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFJ32DA6ZE6D","created_at":"2026-07-05T05:24:47.594795+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFJ32DA6ZE6DOVZW","created_at":"2026-07-05T05:24:47.594795+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFJ32DA6","created_at":"2026-07-05T05:24:47.594795+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/QFJ32DA6ZE6DOVZWQ3O2KFUWHP","json":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP.json","graph_json":"https://pith.science/api/pith-number/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/graph.json","events_json":"https://pith.science/api/pith-number/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/events.json","paper":"https://pith.science/paper/QFJ32DA6"},"agent_actions":{"view_html":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP","download_json":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP.json","view_paper":"https://pith.science/paper/QFJ32DA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.06193&json=true","fetch_graph":"https://pith.science/api/pith-number/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/graph.json","fetch_events":"https://pith.science/api/pith-number/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/action/storage_attestation","attest_author":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/action/author_attestation","sign_citation":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/action/citation_signature","submit_replication":"https://pith.science/pith/QFJ32DA6ZE6DOVZWQ3O2KFUWHP/action/replication_record"}},"created_at":"2026-07-05T05:24:47.594795+00:00","updated_at":"2026-07-05T05:24:47.594795+00:00"}