{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3HAEOBT3TAWHD3LIXAWNHUTIQI","short_pith_number":"pith:3HAEOBT3","canonical_record":{"source":{"id":"1206.6438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"039f2bedf04dfac57611c54e85e559564e204006d63afa54fe716ec70193b5ca","abstract_canon_sha256":"a77bfae5d5429d4a6937d01a49f9323d1be0d8128e0f8eef08a4d8bb4745f589"},"schema_version":"1.0"},"canonical_sha256":"d9c047067b982c71ed68b82cd3d2688232a7e1d0fb7b8c4cf629963386f0c161","source":{"kind":"arxiv","id":"1206.6438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6438","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6438v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6438","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"3HAEOBT3TAWH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3HAEOBT3TAWHD3LI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3HAEOBT3","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3HAEOBT3TAWHD3LIXAWNHUTIQI","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"039f2bedf04dfac57611c54e85e559564e204006d63afa54fe716ec70193b5ca","abstract_canon_sha256":"a77bfae5d5429d4a6937d01a49f9323d1be0d8128e0f8eef08a4d8bb4745f589"},"schema_version":"1.0"},"canonical_sha256":"d9c047067b982c71ed68b82cd3d2688232a7e1d0fb7b8c4cf629963386f0c161","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.129613Z","signature_b64":"DHEd+w28jlkAoaJAmRSAHExHosz5bGmruOCqz+aWS5oHJKieoE2RAVyvJliDq9iq1q/KI/SAF2hVKr/vTinqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9c047067b982c71ed68b82cd3d2688232a7e1d0fb7b8c4cf629963386f0c161","last_reissued_at":"2026-05-18T03:52:14.128614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.128614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6438","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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYOHdSosIbIhcZqIo4lvTwgSPfZPNBivNc975567lkQTTFsvZQ3Nl3/PEvLDoWjyrT0nEBCiSOODKvoi5GP8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:47:56.080460Z"},"content_sha256":"a5fe7c9f840a5fbc07564c05eb0ebeb697018a21277f023a12142e90cfbe472a","schema_version":"1.0","event_id":"sha256:a5fe7c9f840a5fbc07564c05eb0ebeb697018a21277f023a12142e90cfbe472a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3HAEOBT3TAWHD3LIXAWNHUTIQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-Theoretical Learning of Discriminative Clusters for Unsupervised Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fei Sha (University of Southern California), Yuan Shi (University of Southern California)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"We study the problem of unsupervised domain adaptation, which aims to adapt classifiers trained on a labeled source domain to an unlabeled target domain. Many existing approaches first learn domain-invariant features and then construct classifiers with them. We propose a novel approach that jointly learn the both. Specifically, while the method identifies a feature space where data in the source and the target domains are similarly distributed, it also learns the feature space discriminatively, optimizing an information-theoretic metric as an proxy to the expected misclassification error on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6438","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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Md/qyQ3xKYE+DGVR+xWp3PFz+YalxStqgmGzUQocT5UBEVAD4FvXaIZ/4rg/Hrn/EkewVn5dBbHckuq4p532Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:47:56.081208Z"},"content_sha256":"c0c280231bc48af647b06561b4a8c07a70ac44281109bf5dc007f8947cb070c9","schema_version":"1.0","event_id":"sha256:c0c280231bc48af647b06561b4a8c07a70ac44281109bf5dc007f8947cb070c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HAEOBT3TAWHD3LIXAWNHUTIQI/bundle.json","state_url":"https://pith.science/pith/3HAEOBT3TAWHD3LIXAWNHUTIQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HAEOBT3TAWHD3LIXAWNHUTIQI/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-06-05T04:47:56Z","links":{"resolver":"https://pith.science/pith/3HAEOBT3TAWHD3LIXAWNHUTIQI","bundle":"https://pith.science/pith/3HAEOBT3TAWHD3LIXAWNHUTIQI/bundle.json","state":"https://pith.science/pith/3HAEOBT3TAWHD3LIXAWNHUTIQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HAEOBT3TAWHD3LIXAWNHUTIQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3HAEOBT3TAWHD3LIXAWNHUTIQI","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":"a77bfae5d5429d4a6937d01a49f9323d1be0d8128e0f8eef08a4d8bb4745f589","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"039f2bedf04dfac57611c54e85e559564e204006d63afa54fe716ec70193b5ca"},"schema_version":"1.0","source":{"id":"1206.6438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6438","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6438v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6438","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"3HAEOBT3TAWH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3HAEOBT3TAWHD3LI","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3HAEOBT3","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:c0c280231bc48af647b06561b4a8c07a70ac44281109bf5dc007f8947cb070c9","target":"graph","created_at":"2026-05-18T03:52:14Z","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":"We study the problem of unsupervised domain adaptation, which aims to adapt classifiers trained on a labeled source domain to an unlabeled target domain. Many existing approaches first learn domain-invariant features and then construct classifiers with them. We propose a novel approach that jointly learn the both. Specifically, while the method identifies a feature space where data in the source and the target domains are similarly distributed, it also learns the feature space discriminatively, optimizing an information-theoretic metric as an proxy to the expected misclassification error on th","authors_text":"Fei Sha (University of Southern California), Yuan Shi (University of Southern California)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"Information-Theoretical Learning of Discriminative Clusters for Unsupervised Domain Adaptation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6438","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:a5fe7c9f840a5fbc07564c05eb0ebeb697018a21277f023a12142e90cfbe472a","target":"record","created_at":"2026-05-18T03:52:14Z","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":"a77bfae5d5429d4a6937d01a49f9323d1be0d8128e0f8eef08a4d8bb4745f589","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"039f2bedf04dfac57611c54e85e559564e204006d63afa54fe716ec70193b5ca"},"schema_version":"1.0","source":{"id":"1206.6438","kind":"arxiv","version":1}},"canonical_sha256":"d9c047067b982c71ed68b82cd3d2688232a7e1d0fb7b8c4cf629963386f0c161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9c047067b982c71ed68b82cd3d2688232a7e1d0fb7b8c4cf629963386f0c161","first_computed_at":"2026-05-18T03:52:14.128614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:14.128614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DHEd+w28jlkAoaJAmRSAHExHosz5bGmruOCqz+aWS5oHJKieoE2RAVyvJliDq9iq1q/KI/SAF2hVKr/vTinqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:14.129613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5fe7c9f840a5fbc07564c05eb0ebeb697018a21277f023a12142e90cfbe472a","sha256:c0c280231bc48af647b06561b4a8c07a70ac44281109bf5dc007f8947cb070c9"],"state_sha256":"d859900012d8a7df6716f7ab37170a8479bd9a842d8ac9a7b3b25e243ccc04b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3Z1wFwJL1jLyeOKYoQbKt218cQrZPCBHmIGHLgs0UHjmhyRju4hawR5HoUWP4FHH6LtuIC59xtYmAhGO6fsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:47:56.084998Z","bundle_sha256":"3426abd717eb10f1c041eb29a6c083e974a813741412f3150d1f677f50a50b78"}}