{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AIL3U77NZAL2PISX7CPAUS2KRA","short_pith_number":"pith:AIL3U77N","canonical_record":{"source":{"id":"1803.09208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-25T06:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"820588c5922f078081f70b0ab3410a9b9a29073d458bc73dc4a002d32d840aec","abstract_canon_sha256":"64b1bd8af978ebea0f3eb9ad3a818e8494c710be6c1f306ab55315783d0f8bfa"},"schema_version":"1.0"},"canonical_sha256":"0217ba7fedc817a7a257f89e0a4b4a881c99aa0cbd3c4aceb8234795f31085c3","source":{"kind":"arxiv","id":"1803.09208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09208","created_at":"2026-05-18T00:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09208v1","created_at":"2026-05-18T00:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09208","created_at":"2026-05-18T00:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"AIL3U77NZAL2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIL3U77NZAL2PISX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIL3U77N","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AIL3U77NZAL2PISX7CPAUS2KRA","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-25T06:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"820588c5922f078081f70b0ab3410a9b9a29073d458bc73dc4a002d32d840aec","abstract_canon_sha256":"64b1bd8af978ebea0f3eb9ad3a818e8494c710be6c1f306ab55315783d0f8bfa"},"schema_version":"1.0"},"canonical_sha256":"0217ba7fedc817a7a257f89e0a4b4a881c99aa0cbd3c4aceb8234795f31085c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:12.277618Z","signature_b64":"3ewNo5uWMeUoZ89WUDRTHi32yGWxQqGxQ9J8STpYNwNPs7H++mDFBhQgWt+Ol5FRKK7wHPJfcEi1rxs/RGB+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0217ba7fedc817a7a257f89e0a4b4a881c99aa0cbd3c4aceb8234795f31085c3","last_reissued_at":"2026-05-18T00:20:12.277000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:12.277000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09208","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7W+GnP7Zi4anopsTiECxtpDzc2rYRC/N9omt3S50LRykch0uXXwYA/m94ynfy3k458lIioI7yAa1E0IbvN9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:17:25.599656Z"},"content_sha256":"079ac9ab67962dfec628a4f98aab8ac029a05d750c73cb8a8cc14a696829b076","schema_version":"1.0","event_id":"sha256:079ac9ab67962dfec628a4f98aab8ac029a05d750c73cb8a8cc14a696829b076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AIL3U77NZAL2PISX7CPAUS2KRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Domain Adaptation: A Multi-task Learning-based Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jing Zhang, Philip Ogunbona, Wanqing Li","submitted_at":"2018-03-25T06:20:00Z","abstract_excerpt":"This paper presents a novel multi-task learning-based method for unsupervised domain adaptation. Specifically, the source and target domain classifiers are jointly learned by considering the geometry of target domain and the divergence between the source and target domains based on the concept of multi-task learning. Two novel algorithms are proposed upon the method using Regularized Least Squares and Support Vector Machines respectively. Experiments on both synthetic and real world cross domain recognition tasks have shown that the proposed methods outperform several state-of-the-art domain a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09208","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZLaV2DN0ueaTmonf5fQJCI2iQx//Mc+j6Oqx7fA0RmYsBQiHlBep9+2XJWUnqtXsYChd1vu8XCuQu7VT07GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:17:25.600081Z"},"content_sha256":"860b83c9c59c1900542b46e3c62b6ce5a7b965d9723d0ca89de8d982262188f3","schema_version":"1.0","event_id":"sha256:860b83c9c59c1900542b46e3c62b6ce5a7b965d9723d0ca89de8d982262188f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIL3U77NZAL2PISX7CPAUS2KRA/bundle.json","state_url":"https://pith.science/pith/AIL3U77NZAL2PISX7CPAUS2KRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIL3U77NZAL2PISX7CPAUS2KRA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T23:17:25Z","links":{"resolver":"https://pith.science/pith/AIL3U77NZAL2PISX7CPAUS2KRA","bundle":"https://pith.science/pith/AIL3U77NZAL2PISX7CPAUS2KRA/bundle.json","state":"https://pith.science/pith/AIL3U77NZAL2PISX7CPAUS2KRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIL3U77NZAL2PISX7CPAUS2KRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AIL3U77NZAL2PISX7CPAUS2KRA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"64b1bd8af978ebea0f3eb9ad3a818e8494c710be6c1f306ab55315783d0f8bfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-25T06:20:00Z","title_canon_sha256":"820588c5922f078081f70b0ab3410a9b9a29073d458bc73dc4a002d32d840aec"},"schema_version":"1.0","source":{"id":"1803.09208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09208","created_at":"2026-05-18T00:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09208v1","created_at":"2026-05-18T00:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09208","created_at":"2026-05-18T00:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"AIL3U77NZAL2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AIL3U77NZAL2PISX","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AIL3U77N","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:860b83c9c59c1900542b46e3c62b6ce5a7b965d9723d0ca89de8d982262188f3","target":"graph","created_at":"2026-05-18T00:20:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper presents a novel multi-task learning-based method for unsupervised domain adaptation. Specifically, the source and target domain classifiers are jointly learned by considering the geometry of target domain and the divergence between the source and target domains based on the concept of multi-task learning. Two novel algorithms are proposed upon the method using Regularized Least Squares and Support Vector Machines respectively. Experiments on both synthetic and real world cross domain recognition tasks have shown that the proposed methods outperform several state-of-the-art domain a","authors_text":"Jing Zhang, Philip Ogunbona, Wanqing Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-25T06:20:00Z","title":"Unsupervised Domain Adaptation: A Multi-task Learning-based Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09208","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:079ac9ab67962dfec628a4f98aab8ac029a05d750c73cb8a8cc14a696829b076","target":"record","created_at":"2026-05-18T00:20:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"64b1bd8af978ebea0f3eb9ad3a818e8494c710be6c1f306ab55315783d0f8bfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-25T06:20:00Z","title_canon_sha256":"820588c5922f078081f70b0ab3410a9b9a29073d458bc73dc4a002d32d840aec"},"schema_version":"1.0","source":{"id":"1803.09208","kind":"arxiv","version":1}},"canonical_sha256":"0217ba7fedc817a7a257f89e0a4b4a881c99aa0cbd3c4aceb8234795f31085c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0217ba7fedc817a7a257f89e0a4b4a881c99aa0cbd3c4aceb8234795f31085c3","first_computed_at":"2026-05-18T00:20:12.277000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:12.277000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ewNo5uWMeUoZ89WUDRTHi32yGWxQqGxQ9J8STpYNwNPs7H++mDFBhQgWt+Ol5FRKK7wHPJfcEi1rxs/RGB+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:12.277618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:079ac9ab67962dfec628a4f98aab8ac029a05d750c73cb8a8cc14a696829b076","sha256:860b83c9c59c1900542b46e3c62b6ce5a7b965d9723d0ca89de8d982262188f3"],"state_sha256":"4635b7753cae409121f8e916df5d8f6ee1a5dd07b35c0cd8b5eb235eb9c842b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBtgA/fy7TQw/oKCy1Vi7GbWv5qFSM0QtKQHDzemCHtC1qzlbcBJ5CAEVl9rS9yrDays2W/bkP428Cc5jzpICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:17:25.603555Z","bundle_sha256":"3a624412127c81ee6a467d9d9887667e9014fac949047591bb4bb10f516882f3"}}