{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BAQBWDT5PE3UZVOYZRM7PCU5G4","short_pith_number":"pith:BAQBWDT5","schema_version":"1.0","canonical_sha256":"08201b0e7d79374cd5d8cc59f78a9d371fb4d57faa00821886083fb9847bd3b4","source":{"kind":"arxiv","id":"2503.03259","version":2},"attestation_state":"computed","paper":{"title":"BANet: Bilateral Aggregation Network for Mobile Stereo Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gangwei Xu, Jiaxin Liu, Jinliang Zang, Junda Cheng, Xianqi Wang, Xin Yang, Yong Deng, Yurui Chen","submitted_at":"2025-03-05T08:33:08Z","abstract_excerpt":"State-of-the-art stereo matching methods typically use costly 3D convolutions to aggregate a full cost volume, but their computational demands make mobile deployment challenging. Directly applying 2D convolutions for cost aggregation often results in edge blurring, detail loss, and mismatches in textureless regions. Some complex operations, like deformable convolutions and iterative warping, can partially alleviate this issue; however, they are not mobile-friendly, limiting their deployment on mobile devices. In this paper, we present a novel bilateral aggregation network (BANet) for mobile st"},"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":"2503.03259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-03-05T08:33:08Z","cross_cats_sorted":[],"title_canon_sha256":"ec4866a003cbed3f11a2936d69b5beeb2f6d62971592adc4ed1c7e4e9cff2d24","abstract_canon_sha256":"761be9dfeb7047f06ca300427726eff297b181d1fdce9806b581c036ee33adf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:26.890805Z","signature_b64":"X+2uMpQpASMhCThLXx+ZOgn9IUgs83ICpFHthrRFOI0BwY5IvFmwHdVFUGaY1EA5ckOb6fOFqANGkR9XefAKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08201b0e7d79374cd5d8cc59f78a9d371fb4d57faa00821886083fb9847bd3b4","last_reissued_at":"2026-07-05T11:31:26.890311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:26.890311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BANet: Bilateral Aggregation Network for Mobile Stereo Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gangwei Xu, Jiaxin Liu, Jinliang Zang, Junda Cheng, Xianqi Wang, Xin Yang, Yong Deng, Yurui Chen","submitted_at":"2025-03-05T08:33:08Z","abstract_excerpt":"State-of-the-art stereo matching methods typically use costly 3D convolutions to aggregate a full cost volume, but their computational demands make mobile deployment challenging. Directly applying 2D convolutions for cost aggregation often results in edge blurring, detail loss, and mismatches in textureless regions. Some complex operations, like deformable convolutions and iterative warping, can partially alleviate this issue; however, they are not mobile-friendly, limiting their deployment on mobile devices. In this paper, we present a novel bilateral aggregation network (BANet) for mobile st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03259","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/2503.03259/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":"2503.03259","created_at":"2026-07-05T11:31:26.890386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.03259v2","created_at":"2026-07-05T11:31:26.890386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03259","created_at":"2026-07-05T11:31:26.890386+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAQBWDT5PE3U","created_at":"2026-07-05T11:31:26.890386+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAQBWDT5PE3UZVOY","created_at":"2026-07-05T11:31:26.890386+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAQBWDT5","created_at":"2026-07-05T11:31:26.890386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24457","citing_title":"Lite Any Stereo V2: Faster and Stronger Efficient Zero-Shot Stereo Matching","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2511.16555","citing_title":"Lite Any Stereo: Efficient Zero-Shot Stereo Matching","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4","json":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4.json","graph_json":"https://pith.science/api/pith-number/BAQBWDT5PE3UZVOYZRM7PCU5G4/graph.json","events_json":"https://pith.science/api/pith-number/BAQBWDT5PE3UZVOYZRM7PCU5G4/events.json","paper":"https://pith.science/paper/BAQBWDT5"},"agent_actions":{"view_html":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4","download_json":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4.json","view_paper":"https://pith.science/paper/BAQBWDT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.03259&json=true","fetch_graph":"https://pith.science/api/pith-number/BAQBWDT5PE3UZVOYZRM7PCU5G4/graph.json","fetch_events":"https://pith.science/api/pith-number/BAQBWDT5PE3UZVOYZRM7PCU5G4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4/action/storage_attestation","attest_author":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4/action/author_attestation","sign_citation":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4/action/citation_signature","submit_replication":"https://pith.science/pith/BAQBWDT5PE3UZVOYZRM7PCU5G4/action/replication_record"}},"created_at":"2026-07-05T11:31:26.890386+00:00","updated_at":"2026-07-05T11:31:26.890386+00:00"}