{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G5RBRWFG477KPEXLFHTKDTHD2N","short_pith_number":"pith:G5RBRWFG","schema_version":"1.0","canonical_sha256":"376218d8a6e7fea792eb29e6a1cce3d3696abe0c3e845f28a90554a22f410b00","source":{"kind":"arxiv","id":"1710.06924","version":2},"attestation_state":"computed","paper":{"title":"VisDA: The Visual Domain Adaptation Challenge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ben Usman, Dequan Wang, Judy Hoffman, Kate Saenko, Neela Kaushik, Xingchao Peng","submitted_at":"2017-10-18T20:20:49Z","abstract_excerpt":"We present the 2017 Visual Domain Adaptation (VisDA) dataset and challenge, a large-scale testbed for unsupervised domain adaptation across visual domains. Unsupervised domain adaptation aims to solve the real-world problem of domain shift, where machine learning models trained on one domain must be transferred and adapted to a novel visual domain without additional supervision. The VisDA2017 challenge is focused on the simulation-to-reality shift and has two associated tasks: image classification and image segmentation. The goal in both tracks is to first train a model on simulated, synthetic"},"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":"1710.06924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-18T20:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"45049a5c7409902b1be414cc7980efdcfe6a44bf5d7fb2f1c667fa6304c2cfb9","abstract_canon_sha256":"2b2594d99cf1ec17a364ba802618de8f02b5db83a66c840a99b3f4d2a1389104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:18.117206Z","signature_b64":"2qegwn0Xnsd41Eqtz7+ofGCiEjvKkOLjHRY3WBaCso0UOa3bLE54H7lcEOX5cIFfK+eCDiG2lsBl6/tD8InNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"376218d8a6e7fea792eb29e6a1cce3d3696abe0c3e845f28a90554a22f410b00","last_reissued_at":"2026-05-18T00:29:18.116558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:18.116558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VisDA: The Visual Domain Adaptation Challenge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ben Usman, Dequan Wang, Judy Hoffman, Kate Saenko, Neela Kaushik, Xingchao Peng","submitted_at":"2017-10-18T20:20:49Z","abstract_excerpt":"We present the 2017 Visual Domain Adaptation (VisDA) dataset and challenge, a large-scale testbed for unsupervised domain adaptation across visual domains. Unsupervised domain adaptation aims to solve the real-world problem of domain shift, where machine learning models trained on one domain must be transferred and adapted to a novel visual domain without additional supervision. The VisDA2017 challenge is focused on the simulation-to-reality shift and has two associated tasks: image classification and image segmentation. The goal in both tracks is to first train a model on simulated, synthetic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06924","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":"1710.06924","created_at":"2026-05-18T00:29:18.116669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06924v2","created_at":"2026-05-18T00:29:18.116669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06924","created_at":"2026-05-18T00:29:18.116669+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5RBRWFG477K","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5RBRWFG477KPEXL","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5RBRWFG","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2402.14598","citing_title":"MemFlow: A Lightweight Forward Memorizing Framework for Quick Domain Adaptive Feature Mapping","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2006.10726","citing_title":"Tent: Fully Test-time Adaptation by Entropy Minimization","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2603.22908","citing_title":"Adaptive Dual-Teacher Distillation with Subnetwork Rectification for Bridging Semantic Gaps in Black-Box Domain Adaptation","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05567","citing_title":"Locality-aware Private Class Identification for Domain Adaptation with Extreme Label Shift","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12335","citing_title":"All in One: A Unified Synthetic Data Pipeline for Multimodal Video Understanding","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17748","citing_title":"Source-Free Domain Adaptation with Vision-Language Prior","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02604","citing_title":"Rethinking the Need for Source Models: Source-Free Domain Adaptation from Scratch Guided by a Vision-Language Model","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N","json":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N.json","graph_json":"https://pith.science/api/pith-number/G5RBRWFG477KPEXLFHTKDTHD2N/graph.json","events_json":"https://pith.science/api/pith-number/G5RBRWFG477KPEXLFHTKDTHD2N/events.json","paper":"https://pith.science/paper/G5RBRWFG"},"agent_actions":{"view_html":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N","download_json":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N.json","view_paper":"https://pith.science/paper/G5RBRWFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06924&json=true","fetch_graph":"https://pith.science/api/pith-number/G5RBRWFG477KPEXLFHTKDTHD2N/graph.json","fetch_events":"https://pith.science/api/pith-number/G5RBRWFG477KPEXLFHTKDTHD2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N/action/storage_attestation","attest_author":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N/action/author_attestation","sign_citation":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N/action/citation_signature","submit_replication":"https://pith.science/pith/G5RBRWFG477KPEXLFHTKDTHD2N/action/replication_record"}},"created_at":"2026-05-18T00:29:18.116669+00:00","updated_at":"2026-05-18T00:29:18.116669+00:00"}