{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q4A24SF7BUCBDADD3VUZIKFWY4","short_pith_number":"pith:Q4A24SF7","canonical_record":{"source":{"id":"1705.09684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-26T19:10:56Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"626c7effcc142879eb1c980d874203438d8115a7c503f3f370b7ea54a98db278","abstract_canon_sha256":"d9fa8aa8f54e314d82666752e661da97a707561b214f50cd07dcc3fec6232334"},"schema_version":"1.0"},"canonical_sha256":"8701ae48bf0d04118063dd699428b6c700e2c8a645146196b4b71e6d35544a63","source":{"kind":"arxiv","id":"1705.09684","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09684","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09684v2","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09684","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"Q4A24SF7BUCB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4A24SF7BUCBDADD","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4A24SF7","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q4A24SF7BUCBDADD3VUZIKFWY4","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-26T19:10:56Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"626c7effcc142879eb1c980d874203438d8115a7c503f3f370b7ea54a98db278","abstract_canon_sha256":"d9fa8aa8f54e314d82666752e661da97a707561b214f50cd07dcc3fec6232334"},"schema_version":"1.0"},"canonical_sha256":"8701ae48bf0d04118063dd699428b6c700e2c8a645146196b4b71e6d35544a63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.005966Z","signature_b64":"XSmzDwFxy1kU89/FIsY/WHUK1MuObpahLrqTuxK0o9yMHCFJAXVD5KsYeo+TTnEQu/wCMLxdU2N4Qpq9d1pxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8701ae48bf0d04118063dd699428b6c700e2c8a645146196b4b71e6d35544a63","last_reissued_at":"2026-05-18T00:31:51.005300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.005300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09684","source_version":2,"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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WffClhb4xbxzXf7UhDgVCax5zpcrTD0X0xLvr3GtQJ7rhmjaFpkjo0T0wI4JvHFzS0FGo1qN6l5lA+5suHi5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:56.628911Z"},"content_sha256":"e76448357639fb1e1129812a1bf2ada10458d1c6de5fe8158b8d1d5393e93f7c","schema_version":"1.0","event_id":"sha256:e76448357639fb1e1129812a1bf2ada10458d1c6de5fe8158b8d1d5393e93f7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q4A24SF7BUCBDADD3VUZIKFWY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Source Domain Adaptation with Adversarial Training of Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Geoffrey J. Gordon, Guanhang Wu, Han Zhao, Jo\\~ao P. Costeira, Jos\\'e M. F. Moura, Shanghang Zhang","submitted_at":"2017-05-26T19:10:56Z","abstract_excerpt":"While domain adaptation has been actively researched in recent years, most theoretical results and algorithms focus on the single-source-single-target adaptation setting. Naive application of such algorithms on multiple source domain adaptation problem may lead to suboptimal solutions. As a step toward bridging the gap, we propose a new generalization bound for domain adaptation when there are multiple source domains with labeled instances and one target domain with unlabeled instances. Compared with existing bounds, the new bound does not require expert knowledge about the target distribution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09684","kind":"arxiv","version":2},"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:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlLXKZxvFkosXV2Md+NTj4bJeFxc6r6ff/FLwhPBT3xxCzUQjeQnOFtW7gYJvzG8qdq9ilbVvWa/pH7c/CqtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:56.629267Z"},"content_sha256":"be7ee736c347a63dc176d09a3741c565723c167b169ebe7c8595db13c6d4918f","schema_version":"1.0","event_id":"sha256:be7ee736c347a63dc176d09a3741c565723c167b169ebe7c8595db13c6d4918f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4A24SF7BUCBDADD3VUZIKFWY4/bundle.json","state_url":"https://pith.science/pith/Q4A24SF7BUCBDADD3VUZIKFWY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4A24SF7BUCBDADD3VUZIKFWY4/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-03T06:35:56Z","links":{"resolver":"https://pith.science/pith/Q4A24SF7BUCBDADD3VUZIKFWY4","bundle":"https://pith.science/pith/Q4A24SF7BUCBDADD3VUZIKFWY4/bundle.json","state":"https://pith.science/pith/Q4A24SF7BUCBDADD3VUZIKFWY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4A24SF7BUCBDADD3VUZIKFWY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q4A24SF7BUCBDADD3VUZIKFWY4","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":"d9fa8aa8f54e314d82666752e661da97a707561b214f50cd07dcc3fec6232334","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-26T19:10:56Z","title_canon_sha256":"626c7effcc142879eb1c980d874203438d8115a7c503f3f370b7ea54a98db278"},"schema_version":"1.0","source":{"id":"1705.09684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09684","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09684v2","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09684","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"Q4A24SF7BUCB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4A24SF7BUCBDADD","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4A24SF7","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:be7ee736c347a63dc176d09a3741c565723c167b169ebe7c8595db13c6d4918f","target":"graph","created_at":"2026-05-18T00:31:51Z","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":"While domain adaptation has been actively researched in recent years, most theoretical results and algorithms focus on the single-source-single-target adaptation setting. Naive application of such algorithms on multiple source domain adaptation problem may lead to suboptimal solutions. As a step toward bridging the gap, we propose a new generalization bound for domain adaptation when there are multiple source domains with labeled instances and one target domain with unlabeled instances. Compared with existing bounds, the new bound does not require expert knowledge about the target distribution","authors_text":"Geoffrey J. Gordon, Guanhang Wu, Han Zhao, Jo\\~ao P. Costeira, Jos\\'e M. F. Moura, Shanghang Zhang","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-26T19:10:56Z","title":"Multiple Source Domain Adaptation with Adversarial Training of Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09684","kind":"arxiv","version":2},"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:e76448357639fb1e1129812a1bf2ada10458d1c6de5fe8158b8d1d5393e93f7c","target":"record","created_at":"2026-05-18T00:31:51Z","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":"d9fa8aa8f54e314d82666752e661da97a707561b214f50cd07dcc3fec6232334","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-26T19:10:56Z","title_canon_sha256":"626c7effcc142879eb1c980d874203438d8115a7c503f3f370b7ea54a98db278"},"schema_version":"1.0","source":{"id":"1705.09684","kind":"arxiv","version":2}},"canonical_sha256":"8701ae48bf0d04118063dd699428b6c700e2c8a645146196b4b71e6d35544a63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8701ae48bf0d04118063dd699428b6c700e2c8a645146196b4b71e6d35544a63","first_computed_at":"2026-05-18T00:31:51.005300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:51.005300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XSmzDwFxy1kU89/FIsY/WHUK1MuObpahLrqTuxK0o9yMHCFJAXVD5KsYeo+TTnEQu/wCMLxdU2N4Qpq9d1pxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:51.005966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e76448357639fb1e1129812a1bf2ada10458d1c6de5fe8158b8d1d5393e93f7c","sha256:be7ee736c347a63dc176d09a3741c565723c167b169ebe7c8595db13c6d4918f"],"state_sha256":"e0d3c22b281cfafbaf33206789803970e7584e8746d9868570170888883d9b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzKVuDGExtDd6tsF+OrOZLKnIR7RNNxWTD+Xq3cfjhrQ2D0JiJoovaXaKKV76d8bjJK7VD1xGwJEBIgSRs+mAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:35:56.631332Z","bundle_sha256":"6b83ec9e0939c1d0e4a4a26addfaebdb65e5ad23a47da1e5f0d6a5e36ae7f41b"}}