{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TD4CHFSNQN2LS3NQK6ZXJZQV2N","short_pith_number":"pith:TD4CHFSN","canonical_record":{"source":{"id":"2012.15732","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-28T08:00:56Z","cross_cats_sorted":[],"title_canon_sha256":"287bedc8e0a503368b17e0501e82487b634e47cb82c9aa01c3bbc3e5d0c0acf5","abstract_canon_sha256":"067fadbfe3d2cb1ffd1c8ce348a96ed382b0f5b01d3d2d102b0fd590a29ff269"},"schema_version":"1.0"},"canonical_sha256":"98f823964d8374b96db057b374e615d35fef2e19bd45be07f004728ca5d50eb2","source":{"kind":"arxiv","id":"2012.15732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15732","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15732v1","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15732","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"TD4CHFSNQN2L","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"pith_short_16","alias_value":"TD4CHFSNQN2LS3NQ","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"pith_short_8","alias_value":"TD4CHFSN","created_at":"2026-07-05T02:03:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TD4CHFSNQN2LS3NQK6ZXJZQV2N","target":"record","payload":{"canonical_record":{"source":{"id":"2012.15732","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-28T08:00:56Z","cross_cats_sorted":[],"title_canon_sha256":"287bedc8e0a503368b17e0501e82487b634e47cb82c9aa01c3bbc3e5d0c0acf5","abstract_canon_sha256":"067fadbfe3d2cb1ffd1c8ce348a96ed382b0f5b01d3d2d102b0fd590a29ff269"},"schema_version":"1.0"},"canonical_sha256":"98f823964d8374b96db057b374e615d35fef2e19bd45be07f004728ca5d50eb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:21.039566Z","signature_b64":"SGav967pPAVuNPMB7k8h2TSl/HEktiG4EYFHsBt50ZNhGM+DJnYq9ObMDOOfHO0jW6nAKFKh4Zme+3Vb7Y+xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98f823964d8374b96db057b374e615d35fef2e19bd45be07f004728ca5d50eb2","last_reissued_at":"2026-07-05T02:03:21.039179Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:21.039179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.15732","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-07-05T02:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UzlkNVv29cu9Zm20rdXYVWFiE3T1wwiRrgNmUIte+nV+wlofmAHzk90ubmGyJXEgWusyq46AYvFmKkT1J37BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:40:32.308852Z"},"content_sha256":"46fe3f45b1db3f1f00e66b9990499e44c527ba1518d01432acbe3add9ab41494","schema_version":"1.0","event_id":"sha256:46fe3f45b1db3f1f00e66b9990499e44c527ba1518d01432acbe3add9ab41494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TD4CHFSNQN2LS3NQK6ZXJZQV2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Unsupervised Domain Adaptation by Reducing Bi-level Feature Redundancy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Huibin Tan, Long Lan, Mengzhu Wang, Wei Wang, Xiang Zhang, Zhigang Luo","submitted_at":"2020-12-28T08:00:56Z","abstract_excerpt":"Reducing feature redundancy has shown beneficial effects for improving the accuracy of deep learning models, thus it is also indispensable for the models of unsupervised domain adaptation (UDA). Nevertheless, most recent efforts in the field of UDA ignores this point. Moreover, main schemes realizing this in general independent of UDA purely involve a single domain, thus might not be effective for cross-domain tasks. In this paper, we emphasize the significance of reducing feature redundancy for improving UDA in a bi-level way. For the first level, we try to ensure compact domain-specific feat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15732","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/2012.15732/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"},"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-07-05T02:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yexixjio67wAq3QG+Yw++J7c7izzIorMUgJ+OO4+yEP/cYD5ELlSBtdaO2RF80wr3a6ZOBMb/fcK6Sw9rGMwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:40:32.309508Z"},"content_sha256":"37be2476277f21e85bdc5c9d611819ba3bed77e46617f4a722e411ff65f8e094","schema_version":"1.0","event_id":"sha256:37be2476277f21e85bdc5c9d611819ba3bed77e46617f4a722e411ff65f8e094"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TD4CHFSNQN2LS3NQK6ZXJZQV2N/bundle.json","state_url":"https://pith.science/pith/TD4CHFSNQN2LS3NQK6ZXJZQV2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TD4CHFSNQN2LS3NQK6ZXJZQV2N/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-08-04T13:40:32Z","links":{"resolver":"https://pith.science/pith/TD4CHFSNQN2LS3NQK6ZXJZQV2N","bundle":"https://pith.science/pith/TD4CHFSNQN2LS3NQK6ZXJZQV2N/bundle.json","state":"https://pith.science/pith/TD4CHFSNQN2LS3NQK6ZXJZQV2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TD4CHFSNQN2LS3NQK6ZXJZQV2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TD4CHFSNQN2LS3NQK6ZXJZQV2N","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":"067fadbfe3d2cb1ffd1c8ce348a96ed382b0f5b01d3d2d102b0fd590a29ff269","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-28T08:00:56Z","title_canon_sha256":"287bedc8e0a503368b17e0501e82487b634e47cb82c9aa01c3bbc3e5d0c0acf5"},"schema_version":"1.0","source":{"id":"2012.15732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15732","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15732v1","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15732","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"TD4CHFSNQN2L","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"pith_short_16","alias_value":"TD4CHFSNQN2LS3NQ","created_at":"2026-07-05T02:03:21Z"},{"alias_kind":"pith_short_8","alias_value":"TD4CHFSN","created_at":"2026-07-05T02:03:21Z"}],"graph_snapshots":[{"event_id":"sha256:37be2476277f21e85bdc5c9d611819ba3bed77e46617f4a722e411ff65f8e094","target":"graph","created_at":"2026-07-05T02:03:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.15732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reducing feature redundancy has shown beneficial effects for improving the accuracy of deep learning models, thus it is also indispensable for the models of unsupervised domain adaptation (UDA). Nevertheless, most recent efforts in the field of UDA ignores this point. Moreover, main schemes realizing this in general independent of UDA purely involve a single domain, thus might not be effective for cross-domain tasks. In this paper, we emphasize the significance of reducing feature redundancy for improving UDA in a bi-level way. For the first level, we try to ensure compact domain-specific feat","authors_text":"Huibin Tan, Long Lan, Mengzhu Wang, Wei Wang, Xiang Zhang, Zhigang Luo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-28T08:00:56Z","title":"Improving Unsupervised Domain Adaptation by Reducing Bi-level Feature Redundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15732","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:46fe3f45b1db3f1f00e66b9990499e44c527ba1518d01432acbe3add9ab41494","target":"record","created_at":"2026-07-05T02:03:21Z","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":"067fadbfe3d2cb1ffd1c8ce348a96ed382b0f5b01d3d2d102b0fd590a29ff269","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-28T08:00:56Z","title_canon_sha256":"287bedc8e0a503368b17e0501e82487b634e47cb82c9aa01c3bbc3e5d0c0acf5"},"schema_version":"1.0","source":{"id":"2012.15732","kind":"arxiv","version":1}},"canonical_sha256":"98f823964d8374b96db057b374e615d35fef2e19bd45be07f004728ca5d50eb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98f823964d8374b96db057b374e615d35fef2e19bd45be07f004728ca5d50eb2","first_computed_at":"2026-07-05T02:03:21.039179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:03:21.039179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SGav967pPAVuNPMB7k8h2TSl/HEktiG4EYFHsBt50ZNhGM+DJnYq9ObMDOOfHO0jW6nAKFKh4Zme+3Vb7Y+xDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:03:21.039566Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.15732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46fe3f45b1db3f1f00e66b9990499e44c527ba1518d01432acbe3add9ab41494","sha256:37be2476277f21e85bdc5c9d611819ba3bed77e46617f4a722e411ff65f8e094"],"state_sha256":"9db0cb028ddd384ed715b7926ac1406efbac577fb6c0261264293973df7c8c8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvL5kEvwt7pbWsJ/G+6XJ/s9JeeMAfqfvG62h8IQJrGn6VC5Uxb4wOjJr7ZVRgerppZ3J/Zc6zAYNg74ZbIWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:40:32.314921Z","bundle_sha256":"0455b332491f6fb1231654bc5a6a8edd22642abd5c531154d75ba252c2879420"}}