{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ODGI4HQ6G6DXKATYHINQXOCXGH","short_pith_number":"pith:ODGI4HQ6","schema_version":"1.0","canonical_sha256":"70cc8e1e1e37877502783a1b0bb85731f8d1d27d71df4de1ed81d2f0d1240793","source":{"kind":"arxiv","id":"1808.00897","version":1},"attestation_state":"computed","paper":{"title":"BiSeNet: Bilateral Segmentation Network for Real-time Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Changqian Yu, Changxin Gao, Chao Peng, Gang Yu, Jingbo Wang, Nong Sang","submitted_at":"2018-08-02T16:34:01Z","abstract_excerpt":"Semantic segmentation requires both rich spatial information and sizeable receptive field. However, modern approaches usually compromise spatial resolution to achieve real-time inference speed, which leads to poor performance. In this paper, we address this dilemma with a novel Bilateral Segmentation Network (BiSeNet). We first design a Spatial Path with a small stride to preserve the spatial information and generate high-resolution features. Meanwhile, a Context Path with a fast downsampling strategy is employed to obtain sufficient receptive field. On top of the two paths, we introduce a new"},"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":"1808.00897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-08-02T16:34:01Z","cross_cats_sorted":[],"title_canon_sha256":"ce6d71cedc305228e811585314681a436833bf430e301c3da55b9a0ada688e8c","abstract_canon_sha256":"09d440fb3cdf543ff225aa803e680078cb32c696a6442fa35345d89c5bd26fe8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:01.080388Z","signature_b64":"i+MtEWQm5YfA8cYB+6QXp8SMjKFoQSf1t1RvtSlX71Jo5BSXx27UBtszGS2ewAs7ER8EKoVOFE+Td3hVE/ScDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70cc8e1e1e37877502783a1b0bb85731f8d1d27d71df4de1ed81d2f0d1240793","last_reissued_at":"2026-05-18T00:09:01.079854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:01.079854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BiSeNet: Bilateral Segmentation Network for Real-time Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Changqian Yu, Changxin Gao, Chao Peng, Gang Yu, Jingbo Wang, Nong Sang","submitted_at":"2018-08-02T16:34:01Z","abstract_excerpt":"Semantic segmentation requires both rich spatial information and sizeable receptive field. However, modern approaches usually compromise spatial resolution to achieve real-time inference speed, which leads to poor performance. In this paper, we address this dilemma with a novel Bilateral Segmentation Network (BiSeNet). We first design a Spatial Path with a small stride to preserve the spatial information and generate high-resolution features. Meanwhile, a Context Path with a fast downsampling strategy is employed to obtain sufficient receptive field. On top of the two paths, we introduce a new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00897","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":"1808.00897","created_at":"2026-05-18T00:09:01.079924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00897v1","created_at":"2026-05-18T00:09:01.079924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00897","created_at":"2026-05-18T00:09:01.079924+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODGI4HQ6G6DX","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODGI4HQ6G6DXKATY","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODGI4HQ6","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.09826","citing_title":"ESNet: An Efficient Symmetric Network for Real-time Semantic Segmentation","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20941","citing_title":"PaintCopilot: Modeling Painting as Autonomous Artistic Continuation","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH","json":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH.json","graph_json":"https://pith.science/api/pith-number/ODGI4HQ6G6DXKATYHINQXOCXGH/graph.json","events_json":"https://pith.science/api/pith-number/ODGI4HQ6G6DXKATYHINQXOCXGH/events.json","paper":"https://pith.science/paper/ODGI4HQ6"},"agent_actions":{"view_html":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH","download_json":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH.json","view_paper":"https://pith.science/paper/ODGI4HQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00897&json=true","fetch_graph":"https://pith.science/api/pith-number/ODGI4HQ6G6DXKATYHINQXOCXGH/graph.json","fetch_events":"https://pith.science/api/pith-number/ODGI4HQ6G6DXKATYHINQXOCXGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH/action/storage_attestation","attest_author":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH/action/author_attestation","sign_citation":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH/action/citation_signature","submit_replication":"https://pith.science/pith/ODGI4HQ6G6DXKATYHINQXOCXGH/action/replication_record"}},"created_at":"2026-05-18T00:09:01.079924+00:00","updated_at":"2026-05-18T00:09:01.079924+00:00"}