{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5D3MP4VD4BW2WS3NUO5ROCXP5U","short_pith_number":"pith:5D3MP4VD","canonical_record":{"source":{"id":"1904.02654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-25T07:32:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2cd7b00c18aef1c3063e89bae5e9ad1dee438ca8b562e958f0dcdabe69e7cd4d","abstract_canon_sha256":"8d3c81de8ce7eac3600c1274c592f864a96a5570c7405054c30e7735401e681c"},"schema_version":"1.0"},"canonical_sha256":"e8f6c7f2a3e06dab4b6da3bb170aefed0d30f5ac67a231ae0069285a544b5da6","source":{"kind":"arxiv","id":"1904.02654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02654","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02654v1","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02654","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"5D3MP4VD4BW2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5D3MP4VD4BW2WS3N","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5D3MP4VD","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5D3MP4VD4BW2WS3NUO5ROCXP5U","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-25T07:32:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"2cd7b00c18aef1c3063e89bae5e9ad1dee438ca8b562e958f0dcdabe69e7cd4d","abstract_canon_sha256":"8d3c81de8ce7eac3600c1274c592f864a96a5570c7405054c30e7735401e681c"},"schema_version":"1.0"},"canonical_sha256":"e8f6c7f2a3e06dab4b6da3bb170aefed0d30f5ac67a231ae0069285a544b5da6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:23.099246Z","signature_b64":"hhjSLRNuKohKk9Sv52sgS768S0+O0ysEv86MwF7bOVIjhpzy7QQDLNy7lXjbVAtXiZJznqYIZwJ/XvrYnIIaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8f6c7f2a3e06dab4b6da3bb170aefed0d30f5ac67a231ae0069285a544b5da6","last_reissued_at":"2026-05-17T23:49:23.098731Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:23.098731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02654","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:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfbuQ+bRE9LWmoHdFBQHI4RK8OnFwlWV+g8oa2DYdwXc8pmVPwgFnXR5onxlSHb7CAppoadnku6W6WNMEfihCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:08:32.548142Z"},"content_sha256":"c67f19e6ce1be913eba00bce22291d772eb39d1c262b5e2cf8ed54468adb1b7c","schema_version":"1.0","event_id":"sha256:c67f19e6ce1be913eba00bce22291d772eb39d1c262b5e2cf8ed54468adb1b7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5D3MP4VD4BW2WS3NUO5ROCXP5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Deep Unsupervised Domain Adaptation with Transfer Channel Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chaohui Yu, Jindong Wang, Yiqiang Chen, Zijing Wu","submitted_at":"2019-03-25T07:32:30Z","abstract_excerpt":"Deep unsupervised domain adaptation (UDA) has recently received increasing attention from researchers. However, existing methods are computationally intensive due to the computation cost of Convolutional Neural Networks (CNN) adopted by most work. To date, there is no effective network compression method for accelerating these models. In this paper, we propose a unified Transfer Channel Pruning (TCP) approach for accelerating UDA models. TCP is capable of compressing the deep UDA model by pruning less important channels while simultaneously learning transferable features by reducing the cross-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02654","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:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDAS510UuOOjWZIQWoYBZ1XdZJnn9uRRFPQoYR2O+IDNHrF1j1zh2lnXlZDzY61ZRWLC8a9z34rZSnxw06vxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T09:08:32.548504Z"},"content_sha256":"866006e9e621d186cdf5d5846ba47d5bd9f6f0acf256732a46fff422b1ec9f71","schema_version":"1.0","event_id":"sha256:866006e9e621d186cdf5d5846ba47d5bd9f6f0acf256732a46fff422b1ec9f71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5D3MP4VD4BW2WS3NUO5ROCXP5U/bundle.json","state_url":"https://pith.science/pith/5D3MP4VD4BW2WS3NUO5ROCXP5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5D3MP4VD4BW2WS3NUO5ROCXP5U/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-06T09:08:32Z","links":{"resolver":"https://pith.science/pith/5D3MP4VD4BW2WS3NUO5ROCXP5U","bundle":"https://pith.science/pith/5D3MP4VD4BW2WS3NUO5ROCXP5U/bundle.json","state":"https://pith.science/pith/5D3MP4VD4BW2WS3NUO5ROCXP5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5D3MP4VD4BW2WS3NUO5ROCXP5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5D3MP4VD4BW2WS3NUO5ROCXP5U","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":"8d3c81de8ce7eac3600c1274c592f864a96a5570c7405054c30e7735401e681c","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-25T07:32:30Z","title_canon_sha256":"2cd7b00c18aef1c3063e89bae5e9ad1dee438ca8b562e958f0dcdabe69e7cd4d"},"schema_version":"1.0","source":{"id":"1904.02654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02654","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02654v1","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02654","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"5D3MP4VD4BW2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5D3MP4VD4BW2WS3N","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5D3MP4VD","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:866006e9e621d186cdf5d5846ba47d5bd9f6f0acf256732a46fff422b1ec9f71","target":"graph","created_at":"2026-05-17T23:49:23Z","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":"Deep unsupervised domain adaptation (UDA) has recently received increasing attention from researchers. However, existing methods are computationally intensive due to the computation cost of Convolutional Neural Networks (CNN) adopted by most work. To date, there is no effective network compression method for accelerating these models. In this paper, we propose a unified Transfer Channel Pruning (TCP) approach for accelerating UDA models. TCP is capable of compressing the deep UDA model by pruning less important channels while simultaneously learning transferable features by reducing the cross-","authors_text":"Chaohui Yu, Jindong Wang, Yiqiang Chen, Zijing Wu","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-25T07:32:30Z","title":"Accelerating Deep Unsupervised Domain Adaptation with Transfer Channel Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02654","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:c67f19e6ce1be913eba00bce22291d772eb39d1c262b5e2cf8ed54468adb1b7c","target":"record","created_at":"2026-05-17T23:49:23Z","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":"8d3c81de8ce7eac3600c1274c592f864a96a5570c7405054c30e7735401e681c","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-25T07:32:30Z","title_canon_sha256":"2cd7b00c18aef1c3063e89bae5e9ad1dee438ca8b562e958f0dcdabe69e7cd4d"},"schema_version":"1.0","source":{"id":"1904.02654","kind":"arxiv","version":1}},"canonical_sha256":"e8f6c7f2a3e06dab4b6da3bb170aefed0d30f5ac67a231ae0069285a544b5da6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8f6c7f2a3e06dab4b6da3bb170aefed0d30f5ac67a231ae0069285a544b5da6","first_computed_at":"2026-05-17T23:49:23.098731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:23.098731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hhjSLRNuKohKk9Sv52sgS768S0+O0ysEv86MwF7bOVIjhpzy7QQDLNy7lXjbVAtXiZJznqYIZwJ/XvrYnIIaBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:23.099246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c67f19e6ce1be913eba00bce22291d772eb39d1c262b5e2cf8ed54468adb1b7c","sha256:866006e9e621d186cdf5d5846ba47d5bd9f6f0acf256732a46fff422b1ec9f71"],"state_sha256":"bec8b61957e41e3a509c61f6a7ee1fe2ef1f5ad51467f29ab7be405ca6e7e2f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xL3wLqEEVdEk5dHJK1kovUTjr0t5dgZ7/8I+58AyIW2QzvsEE8mkhfMrx/H4CO4abK3nO2aPTtUAXDXSCukOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T09:08:32.550526Z","bundle_sha256":"15165b1fd8d65836890d37dab1da00373ba07af80d8635d90dd5cb4e1494b248"}}