{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FULECMCAANQDWXZZF32PBXJLLI","short_pith_number":"pith:FULECMCA","schema_version":"1.0","canonical_sha256":"2d1641304003603b5f392ef4f0dd2b5a332eeb9c6a60593400bb9c05faf4a390","source":{"kind":"arxiv","id":"2312.09254","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Depth Completion from a Stereo Matching Perspective for Cross-domain Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrea Conti, Fabio Tosi, Luca Bartolomei, Matteo Poggi, Stefano Mattoccia","submitted_at":"2023-12-14T18:59:58Z","abstract_excerpt":"This paper proposes a new framework for depth completion robust against domain-shifting issues. It exploits the generalization capability of modern stereo networks to face depth completion, by processing fictitious stereo pairs obtained through a virtual pattern projection paradigm. Any stereo network or traditional stereo matcher can be seamlessly plugged into our framework, allowing for the deployment of a virtual stereo setup that is future-proof against advancement in the stereo field. Exhaustive experiments on cross-domain generalization support our claims. Hence, we argue that our framew"},"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":"2312.09254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-12-14T18:59:58Z","cross_cats_sorted":[],"title_canon_sha256":"fdc8151c31e4a5cadb1ca69d1a53b8d2b601002a771c9928018a61dfbe2d27c8","abstract_canon_sha256":"6c619c13f02b7666b7e4758dec468ecf6d5e887d7d68f8854ae63f287d54ea6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:24:16.623563Z","signature_b64":"dCHs9SPIk/FIKALS9Jr6cfQLAFdFx23L65NYKSU9WEs597d2yFq6z/197T4GB7lKHArIsXkV+B041HCXD8sXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d1641304003603b5f392ef4f0dd2b5a332eeb9c6a60593400bb9c05faf4a390","last_reissued_at":"2026-07-05T07:24:16.623024Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:24:16.623024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Depth Completion from a Stereo Matching Perspective for Cross-domain Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrea Conti, Fabio Tosi, Luca Bartolomei, Matteo Poggi, Stefano Mattoccia","submitted_at":"2023-12-14T18:59:58Z","abstract_excerpt":"This paper proposes a new framework for depth completion robust against domain-shifting issues. It exploits the generalization capability of modern stereo networks to face depth completion, by processing fictitious stereo pairs obtained through a virtual pattern projection paradigm. Any stereo network or traditional stereo matcher can be seamlessly plugged into our framework, allowing for the deployment of a virtual stereo setup that is future-proof against advancement in the stereo field. Exhaustive experiments on cross-domain generalization support our claims. Hence, we argue that our framew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.09254","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/2312.09254/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":"2312.09254","created_at":"2026-07-05T07:24:16.623112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.09254v1","created_at":"2026-07-05T07:24:16.623112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.09254","created_at":"2026-07-05T07:24:16.623112+00:00"},{"alias_kind":"pith_short_12","alias_value":"FULECMCAANQD","created_at":"2026-07-05T07:24:16.623112+00:00"},{"alias_kind":"pith_short_16","alias_value":"FULECMCAANQDWXZZ","created_at":"2026-07-05T07:24:16.623112+00:00"},{"alias_kind":"pith_short_8","alias_value":"FULECMCA","created_at":"2026-07-05T07:24:16.623112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.17878","citing_title":"Towards Robust Fact-Checking: A Multi-Agent System with Advanced Evidence Retrieval","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI","json":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI.json","graph_json":"https://pith.science/api/pith-number/FULECMCAANQDWXZZF32PBXJLLI/graph.json","events_json":"https://pith.science/api/pith-number/FULECMCAANQDWXZZF32PBXJLLI/events.json","paper":"https://pith.science/paper/FULECMCA"},"agent_actions":{"view_html":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI","download_json":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI.json","view_paper":"https://pith.science/paper/FULECMCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.09254&json=true","fetch_graph":"https://pith.science/api/pith-number/FULECMCAANQDWXZZF32PBXJLLI/graph.json","fetch_events":"https://pith.science/api/pith-number/FULECMCAANQDWXZZF32PBXJLLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI/action/storage_attestation","attest_author":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI/action/author_attestation","sign_citation":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI/action/citation_signature","submit_replication":"https://pith.science/pith/FULECMCAANQDWXZZF32PBXJLLI/action/replication_record"}},"created_at":"2026-07-05T07:24:16.623112+00:00","updated_at":"2026-07-05T07:24:16.623112+00:00"}