{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3QLP4KT3WB6HP6Q5PSFJDL6N4E","short_pith_number":"pith:3QLP4KT3","canonical_record":{"source":{"id":"1905.13331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T21:56:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"19ec1910148b465338eecebb9e0a6d25bb56e271e71fb56d74e0abb842bbc37e","abstract_canon_sha256":"28dba686a54457f98129ca6d77cd9b0086834908c54b5e151270a2ac5cfd1617"},"schema_version":"1.0"},"canonical_sha256":"dc16fe2a7bb07c77fa1d7c8a91afcde13f373a6727ec4e4ad780e25b31dbd8af","source":{"kind":"arxiv","id":"1905.13331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13331","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13331v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13331","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"3QLP4KT3WB6H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3QLP4KT3WB6HP6Q5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3QLP4KT3","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3QLP4KT3WB6HP6Q5PSFJDL6N4E","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T21:56:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"19ec1910148b465338eecebb9e0a6d25bb56e271e71fb56d74e0abb842bbc37e","abstract_canon_sha256":"28dba686a54457f98129ca6d77cd9b0086834908c54b5e151270a2ac5cfd1617"},"schema_version":"1.0"},"canonical_sha256":"dc16fe2a7bb07c77fa1d7c8a91afcde13f373a6727ec4e4ad780e25b31dbd8af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.273335Z","signature_b64":"+vRCmAnc7xsZsbIQ/+VWM4Q+YhL2PbVtN0ebMB0JECE3SUqgJqHlEboRiT8NAJ9PWo+95wAqoXU4SvWfPa/QCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc16fe2a7bb07c77fa1d7c8a91afcde13f373a6727ec4e4ad780e25b31dbd8af","last_reissued_at":"2026-05-17T23:44:35.272832Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.272832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13331","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVf10x5+drBO+kYkZ1c2qRSIr0NYFR6eeQQhcuY0P0omyzeipmTd3NkpCLsEJ9Y3GKobt/JAfyU2N2IxH/xFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:10:34.823898Z"},"content_sha256":"06488bb32bf7d8db12a7330329f4c658d0ed271fda4c93982b2151d865e25118","schema_version":"1.0","event_id":"sha256:06488bb32bf7d8db12a7330329f4c658d0ed271fda4c93982b2151d865e25118"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3QLP4KT3WB6HP6Q5PSFJDL6N4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminative Clustering for Robust Unsupervised Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guoyin Wang, Ricardo Henao, Rui Wang","submitted_at":"2019-05-30T21:56:06Z","abstract_excerpt":"Unsupervised domain adaptation seeks to learn an invariant and discriminative representation for an unlabeled target domain by leveraging the information of a labeled source dataset. We propose to improve the discriminative ability of the target domain representation by simultaneously learning tightly clustered target representations while encouraging that each cluster is assigned to a unique and different class from the source. This strategy alleviates the effects of negative transfer when combined with adversarial domain matching between source and target representations. Our approach is rob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13331","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4l8HwzjQmkBw/DkCuekiQD+7/ES3jU/F9wLQRmcs5t+8V9JrsDMdxn7JiOt1gm7V6VsxmK+cqKHZG7ZG3rEpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:10:34.824509Z"},"content_sha256":"e05045cf30dbccd9a902e0283c0aeb42af798d2c8cda8a95346025790acd0388","schema_version":"1.0","event_id":"sha256:e05045cf30dbccd9a902e0283c0aeb42af798d2c8cda8a95346025790acd0388"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QLP4KT3WB6HP6Q5PSFJDL6N4E/bundle.json","state_url":"https://pith.science/pith/3QLP4KT3WB6HP6Q5PSFJDL6N4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QLP4KT3WB6HP6Q5PSFJDL6N4E/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-31T15:10:34Z","links":{"resolver":"https://pith.science/pith/3QLP4KT3WB6HP6Q5PSFJDL6N4E","bundle":"https://pith.science/pith/3QLP4KT3WB6HP6Q5PSFJDL6N4E/bundle.json","state":"https://pith.science/pith/3QLP4KT3WB6HP6Q5PSFJDL6N4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QLP4KT3WB6HP6Q5PSFJDL6N4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3QLP4KT3WB6HP6Q5PSFJDL6N4E","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":"28dba686a54457f98129ca6d77cd9b0086834908c54b5e151270a2ac5cfd1617","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T21:56:06Z","title_canon_sha256":"19ec1910148b465338eecebb9e0a6d25bb56e271e71fb56d74e0abb842bbc37e"},"schema_version":"1.0","source":{"id":"1905.13331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13331","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13331v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13331","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"3QLP4KT3WB6H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3QLP4KT3WB6HP6Q5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3QLP4KT3","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e05045cf30dbccd9a902e0283c0aeb42af798d2c8cda8a95346025790acd0388","target":"graph","created_at":"2026-05-17T23:44:35Z","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":"Unsupervised domain adaptation seeks to learn an invariant and discriminative representation for an unlabeled target domain by leveraging the information of a labeled source dataset. We propose to improve the discriminative ability of the target domain representation by simultaneously learning tightly clustered target representations while encouraging that each cluster is assigned to a unique and different class from the source. This strategy alleviates the effects of negative transfer when combined with adversarial domain matching between source and target representations. Our approach is rob","authors_text":"Guoyin Wang, Ricardo Henao, Rui Wang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T21:56:06Z","title":"Discriminative Clustering for Robust Unsupervised Domain Adaptation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13331","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:06488bb32bf7d8db12a7330329f4c658d0ed271fda4c93982b2151d865e25118","target":"record","created_at":"2026-05-17T23:44:35Z","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":"28dba686a54457f98129ca6d77cd9b0086834908c54b5e151270a2ac5cfd1617","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T21:56:06Z","title_canon_sha256":"19ec1910148b465338eecebb9e0a6d25bb56e271e71fb56d74e0abb842bbc37e"},"schema_version":"1.0","source":{"id":"1905.13331","kind":"arxiv","version":1}},"canonical_sha256":"dc16fe2a7bb07c77fa1d7c8a91afcde13f373a6727ec4e4ad780e25b31dbd8af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc16fe2a7bb07c77fa1d7c8a91afcde13f373a6727ec4e4ad780e25b31dbd8af","first_computed_at":"2026-05-17T23:44:35.272832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.272832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+vRCmAnc7xsZsbIQ/+VWM4Q+YhL2PbVtN0ebMB0JECE3SUqgJqHlEboRiT8NAJ9PWo+95wAqoXU4SvWfPa/QCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.273335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06488bb32bf7d8db12a7330329f4c658d0ed271fda4c93982b2151d865e25118","sha256:e05045cf30dbccd9a902e0283c0aeb42af798d2c8cda8a95346025790acd0388"],"state_sha256":"e93684a3e06bc4c4372025555f8988af491a6a00897949d5663d4afd7bd88137"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGMIXa+a0O+a5UehqmtuD+hgklNZD24D4I4kbmXMXVi7LdHK13Znwp7jBjOWJf0Y6Cb4nJHzabWGs7fLztVaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:10:34.829505Z","bundle_sha256":"6528851f85fe0f9a374583823cc3c7071d557183e3632a84d2f686b3165beccc"}}