{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4Q3CC5QOICG6UXPTR2ML4FLNUZ","short_pith_number":"pith:4Q3CC5QO","schema_version":"1.0","canonical_sha256":"e43621760e408dea5df38e98be156da641bc54bb05cd89d29637539d143dbc77","source":{"kind":"arxiv","id":"1909.11825","version":2},"attestation_state":"computed","paper":{"title":"Unsupervised Domain Adaptation through Self-Supervision","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexei A. Efros, Eric Tzeng, Trevor Darrell, Yu Sun","submitted_at":"2019-09-26T00:21:16Z","abstract_excerpt":"This paper addresses unsupervised domain adaptation, the setting where labeled training data is available on a source domain, but the goal is to have good performance on a target domain with only unlabeled data. Like much of previous work, we seek to align the learned representations of the source and target domains while preserving discriminability. The way we accomplish alignment is by learning to perform auxiliary self-supervised task(s) on both domains simultaneously. Each self-supervised task brings the two domains closer together along the direction relevant to that task. Training this j"},"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":"1909.11825","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-26T00:21:16Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"24f19ab18ec33aacda33ce8755e4336d0c6966a296be81f7162f72aa6e642cb7","abstract_canon_sha256":"353e1d6453f96918b7c99550e2b1e9c9441cd62e947ce682b6e262570b4d725a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:53.341773Z","signature_b64":"SsEog/T0FxzZgd6m+0J34PuauEdCyfUfC8GLRr14m9/v07jOTvUjUmxYn+G10fYOsCzzhOuXJDFyYEA68lluDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e43621760e408dea5df38e98be156da641bc54bb05cd89d29637539d143dbc77","last_reissued_at":"2026-07-05T00:07:53.341344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:53.341344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Domain Adaptation through Self-Supervision","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexei A. Efros, Eric Tzeng, Trevor Darrell, Yu Sun","submitted_at":"2019-09-26T00:21:16Z","abstract_excerpt":"This paper addresses unsupervised domain adaptation, the setting where labeled training data is available on a source domain, but the goal is to have good performance on a target domain with only unlabeled data. Like much of previous work, we seek to align the learned representations of the source and target domains while preserving discriminability. The way we accomplish alignment is by learning to perform auxiliary self-supervised task(s) on both domains simultaneously. Each self-supervised task brings the two domains closer together along the direction relevant to that task. Training this j"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.11825","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.11825/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":"1909.11825","created_at":"2026-07-05T00:07:53.341402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.11825v2","created_at":"2026-07-05T00:07:53.341402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11825","created_at":"2026-07-05T00:07:53.341402+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Q3CC5QOICG6","created_at":"2026-07-05T00:07:53.341402+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Q3CC5QOICG6UXPT","created_at":"2026-07-05T00:07:53.341402+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Q3CC5QO","created_at":"2026-07-05T00:07:53.341402+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2006.10726","citing_title":"Tent: Fully Test-time Adaptation by Entropy Minimization","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ","json":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ.json","graph_json":"https://pith.science/api/pith-number/4Q3CC5QOICG6UXPTR2ML4FLNUZ/graph.json","events_json":"https://pith.science/api/pith-number/4Q3CC5QOICG6UXPTR2ML4FLNUZ/events.json","paper":"https://pith.science/paper/4Q3CC5QO"},"agent_actions":{"view_html":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ","download_json":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ.json","view_paper":"https://pith.science/paper/4Q3CC5QO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.11825&json=true","fetch_graph":"https://pith.science/api/pith-number/4Q3CC5QOICG6UXPTR2ML4FLNUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4Q3CC5QOICG6UXPTR2ML4FLNUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ/action/storage_attestation","attest_author":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ/action/author_attestation","sign_citation":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ/action/citation_signature","submit_replication":"https://pith.science/pith/4Q3CC5QOICG6UXPTR2ML4FLNUZ/action/replication_record"}},"created_at":"2026-07-05T00:07:53.341402+00:00","updated_at":"2026-07-05T00:07:53.341402+00:00"}