{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CLZRAEO3GCEYPRYKLUOVULWYPW","short_pith_number":"pith:CLZRAEO3","schema_version":"1.0","canonical_sha256":"12f31011db308987c70a5d1d5a2ed87d96e47811de5279b3abf2223b0ff81a09","source":{"kind":"arxiv","id":"1804.09337","version":1},"attestation_state":"computed","paper":{"title":"Learning a Discriminative Feature Network for 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-04-25T03:49:30Z","abstract_excerpt":"Most existing methods of semantic segmentation still suffer from two aspects of challenges: intra-class inconsistency and inter-class indistinction. To tackle these two problems, we propose a Discriminative Feature Network (DFN), which contains two sub-networks: Smooth Network and Border Network. Specifically, to handle the intra-class inconsistency problem, we specially design a Smooth Network with Channel Attention Block and global average pooling to select the more discriminative features. Furthermore, we propose a Border Network to make the bilateral features of boundary distinguishable wi"},"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":"1804.09337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-25T03:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"f8d3e9b1c54c40a630ccdab7d61ad6c6b8979b462fd0ccfc998f4d90514addc9","abstract_canon_sha256":"de9c4eb344e19cbbd7411965a9baad9b3b31402ce9d3430bdba895a61bca9dc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:32.085972Z","signature_b64":"A1kNfAwf8w8jdcuHsus/qPgavOMtnI3E8Uy51stnq+v/wtBRRJ8R7JMboGj0Vk54A+ivLKrCnzBYVTXvPde4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12f31011db308987c70a5d1d5a2ed87d96e47811de5279b3abf2223b0ff81a09","last_reissued_at":"2026-05-18T00:17:32.085296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:32.085296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning a Discriminative Feature Network for 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-04-25T03:49:30Z","abstract_excerpt":"Most existing methods of semantic segmentation still suffer from two aspects of challenges: intra-class inconsistency and inter-class indistinction. To tackle these two problems, we propose a Discriminative Feature Network (DFN), which contains two sub-networks: Smooth Network and Border Network. Specifically, to handle the intra-class inconsistency problem, we specially design a Smooth Network with Channel Attention Block and global average pooling to select the more discriminative features. Furthermore, we propose a Border Network to make the bilateral features of boundary distinguishable wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09337","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":"1804.09337","created_at":"2026-05-18T00:17:32.085401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09337v1","created_at":"2026-05-18T00:17:32.085401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09337","created_at":"2026-05-18T00:17:32.085401+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLZRAEO3GCEY","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLZRAEO3GCEYPRYK","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLZRAEO3","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07449","citing_title":"OGNet: Salient Object Detection with Output-guided Attention Module","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW","json":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW.json","graph_json":"https://pith.science/api/pith-number/CLZRAEO3GCEYPRYKLUOVULWYPW/graph.json","events_json":"https://pith.science/api/pith-number/CLZRAEO3GCEYPRYKLUOVULWYPW/events.json","paper":"https://pith.science/paper/CLZRAEO3"},"agent_actions":{"view_html":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW","download_json":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW.json","view_paper":"https://pith.science/paper/CLZRAEO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09337&json=true","fetch_graph":"https://pith.science/api/pith-number/CLZRAEO3GCEYPRYKLUOVULWYPW/graph.json","fetch_events":"https://pith.science/api/pith-number/CLZRAEO3GCEYPRYKLUOVULWYPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW/action/storage_attestation","attest_author":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW/action/author_attestation","sign_citation":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW/action/citation_signature","submit_replication":"https://pith.science/pith/CLZRAEO3GCEYPRYKLUOVULWYPW/action/replication_record"}},"created_at":"2026-05-18T00:17:32.085401+00:00","updated_at":"2026-05-18T00:17:32.085401+00:00"}