{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4YVNDZOKNQX7VT26UNUYCJ3LFH","short_pith_number":"pith:4YVNDZOK","schema_version":"1.0","canonical_sha256":"e62ad1e5ca6c2ffacf5ea36981276b29e9e8a3258fd9798fa0e46b836bc69030","source":{"kind":"arxiv","id":"2601.21291","version":2},"attestation_state":"computed","paper":{"title":"Gaussian Belief Propagation Network for Depth Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jian Li, Jie Tang, Pingping Xie, Ping Tan","submitted_at":"2026-01-29T05:44:41Z","abstract_excerpt":"Depth completion aims to predict a dense depth map from a color image with sparse depth measurements. Although deep learning methods have achieved state-of-the-art (SOTA), effectively handling the sparse and irregular nature of input depth data in deep networks remains a significant challenge, often limiting performance, especially under high sparsity. To overcome this limitation, we introduce the Gaussian Belief Propagation Network (GBPN), a novel hybrid framework synergistically integrating deep learning with probabilistic graphical models for end-to-end depth completion. Specifically, a sce"},"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":"2601.21291","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-01-29T05:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"918057ef29d4cfb6a8b5f3c873ccd42dad68cb6958c79ec8a3c5a8514281902b","abstract_canon_sha256":"9096987b568f94cd068a3eefcc66d64d460b32095eba89743744f8784ecb8f2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:17:13.070137Z","signature_b64":"5JMmJkUuSBpDaRVS6zv61rdHo6x/8vx608NE2Y7cAOde+dLjM7AubZlbSXZSb1Fu9v5mVa5kSF0qvaXOrrCVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e62ad1e5ca6c2ffacf5ea36981276b29e9e8a3258fd9798fa0e46b836bc69030","last_reissued_at":"2026-07-01T01:17:13.069579Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:17:13.069579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Belief Propagation Network for Depth Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jian Li, Jie Tang, Pingping Xie, Ping Tan","submitted_at":"2026-01-29T05:44:41Z","abstract_excerpt":"Depth completion aims to predict a dense depth map from a color image with sparse depth measurements. Although deep learning methods have achieved state-of-the-art (SOTA), effectively handling the sparse and irregular nature of input depth data in deep networks remains a significant challenge, often limiting performance, especially under high sparsity. To overcome this limitation, we introduce the Gaussian Belief Propagation Network (GBPN), a novel hybrid framework synergistically integrating deep learning with probabilistic graphical models for end-to-end depth completion. Specifically, a sce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.21291","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/2601.21291/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":"2601.21291","created_at":"2026-07-01T01:17:13.069648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.21291v2","created_at":"2026-07-01T01:17:13.069648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21291","created_at":"2026-07-01T01:17:13.069648+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YVNDZOKNQX7","created_at":"2026-07-01T01:17:13.069648+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YVNDZOKNQX7VT26","created_at":"2026-07-01T01:17:13.069648+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YVNDZOK","created_at":"2026-07-01T01:17:13.069648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.10584","citing_title":"Need for Speed: Zero-Shot Depth Completion with Single-Step Diffusion","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH","json":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH.json","graph_json":"https://pith.science/api/pith-number/4YVNDZOKNQX7VT26UNUYCJ3LFH/graph.json","events_json":"https://pith.science/api/pith-number/4YVNDZOKNQX7VT26UNUYCJ3LFH/events.json","paper":"https://pith.science/paper/4YVNDZOK"},"agent_actions":{"view_html":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH","download_json":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH.json","view_paper":"https://pith.science/paper/4YVNDZOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.21291&json=true","fetch_graph":"https://pith.science/api/pith-number/4YVNDZOKNQX7VT26UNUYCJ3LFH/graph.json","fetch_events":"https://pith.science/api/pith-number/4YVNDZOKNQX7VT26UNUYCJ3LFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH/action/storage_attestation","attest_author":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH/action/author_attestation","sign_citation":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH/action/citation_signature","submit_replication":"https://pith.science/pith/4YVNDZOKNQX7VT26UNUYCJ3LFH/action/replication_record"}},"created_at":"2026-07-01T01:17:13.069648+00:00","updated_at":"2026-07-01T01:17:13.069648+00:00"}