{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PPOALR7QAFWSE5NGHRJBYOPG2R","short_pith_number":"pith:PPOALR7Q","schema_version":"1.0","canonical_sha256":"7bdc05c7f0016d2275a63c521c39e6d4708b47bb00acf4b89cbd6464fc92c2a2","source":{"kind":"arxiv","id":"1811.12833","version":2},"attestation_state":"computed","paper":{"title":"ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Himalaya Jain, Matthieu Cord, Maxime Bucher, Patrick P\\'erez, Tuan-Hung Vu","submitted_at":"2018-11-30T15:00:29Z","abstract_excerpt":"Semantic segmentation is a key problem for many computer vision tasks. While approaches based on convolutional neural networks constantly break new records on different benchmarks, generalizing well to diverse testing environments remains a major challenge. In numerous real world applications, there is indeed a large gap between data distributions in train and test domains, which results in severe performance loss at run-time. In this work, we address the task of unsupervised domain adaptation in semantic segmentation with losses based on the entropy of the pixel-wise predictions. To this end,"},"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":"1811.12833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-30T15:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"c190cc6ac6c2d5fd624f8c70e7a443e4f02e8896617235261bf3571dacb352a8","abstract_canon_sha256":"5ba1f26ff6d61d0ad5142eb89fce58d5d55e93c780a5aae22ab4d363deeaceff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:16.901840Z","signature_b64":"bxhLaJ/ZnnQyLR9INtI0fsJykt0omKs8KM9tdeDqCd9zbO7daG++KPd/z+MMUTZ0RDupTPNYNVtCZKEE2uZFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bdc05c7f0016d2275a63c521c39e6d4708b47bb00acf4b89cbd6464fc92c2a2","last_reissued_at":"2026-05-17T23:48:16.901339Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:16.901339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Himalaya Jain, Matthieu Cord, Maxime Bucher, Patrick P\\'erez, Tuan-Hung Vu","submitted_at":"2018-11-30T15:00:29Z","abstract_excerpt":"Semantic segmentation is a key problem for many computer vision tasks. While approaches based on convolutional neural networks constantly break new records on different benchmarks, generalizing well to diverse testing environments remains a major challenge. In numerous real world applications, there is indeed a large gap between data distributions in train and test domains, which results in severe performance loss at run-time. In this work, we address the task of unsupervised domain adaptation in semantic segmentation with losses based on the entropy of the pixel-wise predictions. To this end,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12833","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":""},"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":"1811.12833","created_at":"2026-05-17T23:48:16.901417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12833v2","created_at":"2026-05-17T23:48:16.901417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12833","created_at":"2026-05-17T23:48:16.901417+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPOALR7QAFWS","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPOALR7QAFWSE5NG","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPOALR7Q","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11202","citing_title":"Unsupervised Domain Adaptation via Calibrating Uncertainties","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R","json":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R.json","graph_json":"https://pith.science/api/pith-number/PPOALR7QAFWSE5NGHRJBYOPG2R/graph.json","events_json":"https://pith.science/api/pith-number/PPOALR7QAFWSE5NGHRJBYOPG2R/events.json","paper":"https://pith.science/paper/PPOALR7Q"},"agent_actions":{"view_html":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R","download_json":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R.json","view_paper":"https://pith.science/paper/PPOALR7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12833&json=true","fetch_graph":"https://pith.science/api/pith-number/PPOALR7QAFWSE5NGHRJBYOPG2R/graph.json","fetch_events":"https://pith.science/api/pith-number/PPOALR7QAFWSE5NGHRJBYOPG2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R/action/storage_attestation","attest_author":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R/action/author_attestation","sign_citation":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R/action/citation_signature","submit_replication":"https://pith.science/pith/PPOALR7QAFWSE5NGHRJBYOPG2R/action/replication_record"}},"created_at":"2026-05-17T23:48:16.901417+00:00","updated_at":"2026-05-17T23:48:16.901417+00:00"}