{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2TLXCBZPDU5DKZPXP4PGMYX4MW","short_pith_number":"pith:2TLXCBZP","schema_version":"1.0","canonical_sha256":"d4d771072f1d3a3565f77f1e6662fc6596c2ec846ada808461accd26da70b6de","source":{"kind":"arxiv","id":"2407.21311","version":1},"attestation_state":"computed","paper":{"title":"EUDA: An Efficient Unsupervised Domain Adaptation via Self-Supervised Vision Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Ali Abedi, Farhad Pourpanah, Ning Zhang, Q. M. Jonathan Wu","submitted_at":"2024-07-31T03:29:28Z","abstract_excerpt":"Unsupervised domain adaptation (UDA) aims to mitigate the domain shift issue, where the distribution of training (source) data differs from that of testing (target) data. Many models have been developed to tackle this problem, and recently vision transformers (ViTs) have shown promising results. However, the complexity and large number of trainable parameters of ViTs restrict their deployment in practical applications. This underscores the need for an efficient model that not only reduces trainable parameters but also allows for adjustable complexity based on specific needs while delivering co"},"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.21311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-07-31T03:29:28Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1fd5d6fb94f88b97f15a47909d20d248e5182578d1580ddd2f0b84c0bab6fd7e","abstract_canon_sha256":"293435aa0443d44ab5cf2f29cb520b0a7ec6658b90807fbdf502a5263be6845c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:37.478909Z","signature_b64":"bhivfGmhyXnRmUUX04GYuPt6BI8glZfQyZbZARUnYvZ6VrUbt9DWQ8mIWAU/2WBqvgeOyOt5qF/q3W7u8KyKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4d771072f1d3a3565f77f1e6662fc6596c2ec846ada808461accd26da70b6de","last_reissued_at":"2026-07-05T08:50:37.478440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:37.478440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EUDA: An Efficient Unsupervised Domain Adaptation via Self-Supervised Vision Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Ali Abedi, Farhad Pourpanah, Ning Zhang, Q. M. Jonathan Wu","submitted_at":"2024-07-31T03:29:28Z","abstract_excerpt":"Unsupervised domain adaptation (UDA) aims to mitigate the domain shift issue, where the distribution of training (source) data differs from that of testing (target) data. Many models have been developed to tackle this problem, and recently vision transformers (ViTs) have shown promising results. However, the complexity and large number of trainable parameters of ViTs restrict their deployment in practical applications. This underscores the need for an efficient model that not only reduces trainable parameters but also allows for adjustable complexity based on specific needs while delivering co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.21311","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.21311/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.21311","created_at":"2026-07-05T08:50:37.478495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.21311v1","created_at":"2026-07-05T08:50:37.478495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.21311","created_at":"2026-07-05T08:50:37.478495+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TLXCBZPDU5D","created_at":"2026-07-05T08:50:37.478495+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TLXCBZPDU5DKZPX","created_at":"2026-07-05T08:50:37.478495+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TLXCBZP","created_at":"2026-07-05T08:50:37.478495+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.03365","citing_title":"Dual-Foundation Models for Unsupervised Domain Adaptation","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW","json":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW.json","graph_json":"https://pith.science/api/pith-number/2TLXCBZPDU5DKZPXP4PGMYX4MW/graph.json","events_json":"https://pith.science/api/pith-number/2TLXCBZPDU5DKZPXP4PGMYX4MW/events.json","paper":"https://pith.science/paper/2TLXCBZP"},"agent_actions":{"view_html":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW","download_json":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW.json","view_paper":"https://pith.science/paper/2TLXCBZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.21311&json=true","fetch_graph":"https://pith.science/api/pith-number/2TLXCBZPDU5DKZPXP4PGMYX4MW/graph.json","fetch_events":"https://pith.science/api/pith-number/2TLXCBZPDU5DKZPXP4PGMYX4MW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW/action/storage_attestation","attest_author":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW/action/author_attestation","sign_citation":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW/action/citation_signature","submit_replication":"https://pith.science/pith/2TLXCBZPDU5DKZPXP4PGMYX4MW/action/replication_record"}},"created_at":"2026-07-05T08:50:37.478495+00:00","updated_at":"2026-07-05T08:50:37.478495+00:00"}