{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4POC5U6DW2Z5EZKPMIFOHA6LZO","short_pith_number":"pith:4POC5U6D","schema_version":"1.0","canonical_sha256":"e3dc2ed3c3b6b3d2654f620ae383cbcb8fc5df3bd7cc2cbda85ba0c7217c2a29","source":{"kind":"arxiv","id":"1803.08949","version":1},"attestation_state":"computed","paper":{"title":"Deep Convolutional Compressed Sensing for LiDAR Depth Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chaoyang Wang, Nathaniel Chodosh, Simon Lucey","submitted_at":"2018-03-23T19:18:01Z","abstract_excerpt":"In this paper we consider the problem of estimating a dense depth map from a set of sparse LiDAR points. We use techniques from compressed sensing and the recently developed Alternating Direction Neural Networks (ADNNs) to create a deep recurrent auto-encoder for this task. Our architecture internally performs an algorithm for extracting multi-level convolutional sparse codes from the input which are then used to make a prediction. Our results demonstrate that with only two layers and 1800 parameters we are able to out perform all previously published results, including deep networks with orde"},"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":"1803.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-23T19:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"320bd1d01835c5dc20e92b06990eeb5b4e4f863f1472b6017ab8a570894bc179","abstract_canon_sha256":"2e8a4467eee580e7846f5c077fbdd1f61aeb4a2977a19d5e789470e6b5240448"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:13.163346Z","signature_b64":"aQNCTsO96/q9n0QOoNJvIdtO4GfVUc3UzrwU8uQiS1MlatFCntbVhCWFh5UYPLSAZ95XAYIVAV3dAa8ne+d3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3dc2ed3c3b6b3d2654f620ae383cbcb8fc5df3bd7cc2cbda85ba0c7217c2a29","last_reissued_at":"2026-05-18T00:20:13.162835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:13.162835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Convolutional Compressed Sensing for LiDAR Depth Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chaoyang Wang, Nathaniel Chodosh, Simon Lucey","submitted_at":"2018-03-23T19:18:01Z","abstract_excerpt":"In this paper we consider the problem of estimating a dense depth map from a set of sparse LiDAR points. We use techniques from compressed sensing and the recently developed Alternating Direction Neural Networks (ADNNs) to create a deep recurrent auto-encoder for this task. Our architecture internally performs an algorithm for extracting multi-level convolutional sparse codes from the input which are then used to make a prediction. Our results demonstrate that with only two layers and 1800 parameters we are able to out perform all previously published results, including deep networks with orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08949","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":"1803.08949","created_at":"2026-05-18T00:20:13.162909+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08949v1","created_at":"2026-05-18T00:20:13.162909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08949","created_at":"2026-05-18T00:20:13.162909+00:00"},{"alias_kind":"pith_short_12","alias_value":"4POC5U6DW2Z5","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4POC5U6DW2Z5EZKP","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4POC5U6D","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05540","citing_title":"To complete or to estimate, that is the question: A Multi-Task Approach to Depth Completion and Monocular Depth Estimation","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO","json":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO.json","graph_json":"https://pith.science/api/pith-number/4POC5U6DW2Z5EZKPMIFOHA6LZO/graph.json","events_json":"https://pith.science/api/pith-number/4POC5U6DW2Z5EZKPMIFOHA6LZO/events.json","paper":"https://pith.science/paper/4POC5U6D"},"agent_actions":{"view_html":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO","download_json":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO.json","view_paper":"https://pith.science/paper/4POC5U6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08949&json=true","fetch_graph":"https://pith.science/api/pith-number/4POC5U6DW2Z5EZKPMIFOHA6LZO/graph.json","fetch_events":"https://pith.science/api/pith-number/4POC5U6DW2Z5EZKPMIFOHA6LZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO/action/storage_attestation","attest_author":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO/action/author_attestation","sign_citation":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO/action/citation_signature","submit_replication":"https://pith.science/pith/4POC5U6DW2Z5EZKPMIFOHA6LZO/action/replication_record"}},"created_at":"2026-05-18T00:20:13.162909+00:00","updated_at":"2026-05-18T00:20:13.162909+00:00"}