{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EBYPX6XUXTRGDI4Z7IQQYU4S34","short_pith_number":"pith:EBYPX6XU","schema_version":"1.0","canonical_sha256":"2070fbfaf4bce261a399fa210c5392df21eb511de5f2c346355db52e3af6547e","source":{"kind":"arxiv","id":"2407.01327","version":1},"attestation_state":"computed","paper":{"title":"Gradient-based Class Weighting for Unsupervised Domain Adaptation in Dense Prediction Visual Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jesus Besc\\'os, Juan C. SanMiguel, Marcos Escudero-Vi\\~nolo, Roberto Alcover-Couso","submitted_at":"2024-07-01T14:34:25Z","abstract_excerpt":"In unsupervised domain adaptation (UDA), where models are trained on source data (e.g., synthetic) and adapted to target data (e.g., real-world) without target annotations, addressing the challenge of significant class imbalance remains an open issue. Despite considerable progress in bridging the domain gap, existing methods often experience performance degradation when confronted with highly imbalanced dense prediction visual tasks like semantic and panoptic segmentation. This discrepancy becomes especially pronounced due to the lack of equivalent priors between the source and target domains,"},"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":"2407.01327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-07-01T14:34:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fa43cef0b3c8717623fd76dd7c82fa4d34e6eda0232a13312d4cfe6da49ccffe","abstract_canon_sha256":"3f6b2cf71f26003c882eea29012ff024ef5cc345adca9c7e2e51b1f2e28e8603"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:46.417818Z","signature_b64":"fu8Vm+MtsZwM8oimMJ4Kd/oJMdX95ovjN65UeSZ8Vo9PeyiZnbfpq8xLjlk9YivH2Ucp0NGiNo0HqwnqsMiRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2070fbfaf4bce261a399fa210c5392df21eb511de5f2c346355db52e3af6547e","last_reissued_at":"2026-07-05T08:38:46.417313Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:46.417313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-based Class Weighting for Unsupervised Domain Adaptation in Dense Prediction Visual Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jesus Besc\\'os, Juan C. SanMiguel, Marcos Escudero-Vi\\~nolo, Roberto Alcover-Couso","submitted_at":"2024-07-01T14:34:25Z","abstract_excerpt":"In unsupervised domain adaptation (UDA), where models are trained on source data (e.g., synthetic) and adapted to target data (e.g., real-world) without target annotations, addressing the challenge of significant class imbalance remains an open issue. Despite considerable progress in bridging the domain gap, existing methods often experience performance degradation when confronted with highly imbalanced dense prediction visual tasks like semantic and panoptic segmentation. This discrepancy becomes especially pronounced due to the lack of equivalent priors between the source and target domains,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01327","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/2407.01327/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":"2407.01327","created_at":"2026-07-05T08:38:46.417385+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.01327v1","created_at":"2026-07-05T08:38:46.417385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01327","created_at":"2026-07-05T08:38:46.417385+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBYPX6XUXTRG","created_at":"2026-07-05T08:38:46.417385+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBYPX6XUXTRGDI4Z","created_at":"2026-07-05T08:38:46.417385+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBYPX6XU","created_at":"2026-07-05T08:38:46.417385+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16592","citing_title":"Leveraging Contrastive Learning for Semantic Segmentation with Consistent Labels Across Varying Appearances","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34","json":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34.json","graph_json":"https://pith.science/api/pith-number/EBYPX6XUXTRGDI4Z7IQQYU4S34/graph.json","events_json":"https://pith.science/api/pith-number/EBYPX6XUXTRGDI4Z7IQQYU4S34/events.json","paper":"https://pith.science/paper/EBYPX6XU"},"agent_actions":{"view_html":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34","download_json":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34.json","view_paper":"https://pith.science/paper/EBYPX6XU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.01327&json=true","fetch_graph":"https://pith.science/api/pith-number/EBYPX6XUXTRGDI4Z7IQQYU4S34/graph.json","fetch_events":"https://pith.science/api/pith-number/EBYPX6XUXTRGDI4Z7IQQYU4S34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34/action/storage_attestation","attest_author":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34/action/author_attestation","sign_citation":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34/action/citation_signature","submit_replication":"https://pith.science/pith/EBYPX6XUXTRGDI4Z7IQQYU4S34/action/replication_record"}},"created_at":"2026-07-05T08:38:46.417385+00:00","updated_at":"2026-07-05T08:38:46.417385+00:00"}