{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PSHAE4SZVRC23OZXH7HMP3IAOG","short_pith_number":"pith:PSHAE4SZ","canonical_record":{"source":{"id":"1707.04046","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-13T09:50:14Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"8a269e906da297affc3d9d09a9e7043890e2033a6c4680b5b474ac11edee20bb","abstract_canon_sha256":"606e066aaf2c02f9e56c4345b3575126d89298bb300ac307b819e53c1525bf63"},"schema_version":"1.0"},"canonical_sha256":"7c8e027259ac45adbb373fcec7ed0071b045602366ce909dee86582ce850869e","source":{"kind":"arxiv","id":"1707.04046","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04046","created_at":"2026-05-18T00:24:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04046v4","created_at":"2026-05-18T00:24:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04046","created_at":"2026-05-18T00:24:42Z"},{"alias_kind":"pith_short_12","alias_value":"PSHAE4SZVRC2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSHAE4SZVRC23OZX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSHAE4SZ","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PSHAE4SZVRC23OZXH7HMP3IAOG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04046","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-13T09:50:14Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"8a269e906da297affc3d9d09a9e7043890e2033a6c4680b5b474ac11edee20bb","abstract_canon_sha256":"606e066aaf2c02f9e56c4345b3575126d89298bb300ac307b819e53c1525bf63"},"schema_version":"1.0"},"canonical_sha256":"7c8e027259ac45adbb373fcec7ed0071b045602366ce909dee86582ce850869e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:42.624758Z","signature_b64":"YSpTgZUN13kPN/ktLdMFEDniRD1Ob1fRqUx+kAOCd1H5bFl7FSw8+KnqyB3mCBLRoJeuNDEZWycWnwigkT/OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c8e027259ac45adbb373fcec7ed0071b045602366ce909dee86582ce850869e","last_reissued_at":"2026-05-18T00:24:42.624185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:42.624185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04046","source_version":4,"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:24:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVTd4C3tpYVWlIUCyDowUD7HGiVLrt6oDw075aRcTppv46b80lRwocKfiy8KnjFsm5PbSEG/133+dBeqghXzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:48:33.192630Z"},"content_sha256":"c3feb557129b62dbb776abbf82850229055090e6016a49e693a609f995262ac6","schema_version":"1.0","event_id":"sha256:c3feb557129b62dbb776abbf82850229055090e6016a49e693a609f995262ac6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PSHAE4SZVRC23OZXH7HMP3IAOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable Distribution Alignment Using the Dual of the Adversarial Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Ben Usman, Brian Kulis, Kate Saenko","submitted_at":"2017-07-13T09:50:14Z","abstract_excerpt":"Methods that align distributions by minimizing an adversarial distance between them have recently achieved impressive results. However, these approaches are difficult to optimize with gradient descent and they often do not converge well without careful hyperparameter tuning and proper initialization. We investigate whether turning the adversarial min-max problem into an optimization problem by replacing the maximization part with its dual improves the quality of the resulting alignment and explore its connections to Maximum Mean Discrepancy. Our empirical results suggest that using the dual fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04046","kind":"arxiv","version":4},"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:24:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Stvhd/sny4TYvRVXNwKrH4vOunYJJcpfUDveFwqee+rPt93435qV8N9JDLZnMKqlyxFwreOuveO+DzBq3JdxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:48:33.193178Z"},"content_sha256":"29f5a2f0fbf3fad559cbe4688e2cce592a992ff826178768ac5c23ecf4b7bea8","schema_version":"1.0","event_id":"sha256:29f5a2f0fbf3fad559cbe4688e2cce592a992ff826178768ac5c23ecf4b7bea8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSHAE4SZVRC23OZXH7HMP3IAOG/bundle.json","state_url":"https://pith.science/pith/PSHAE4SZVRC23OZXH7HMP3IAOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSHAE4SZVRC23OZXH7HMP3IAOG/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-25T15:48:33Z","links":{"resolver":"https://pith.science/pith/PSHAE4SZVRC23OZXH7HMP3IAOG","bundle":"https://pith.science/pith/PSHAE4SZVRC23OZXH7HMP3IAOG/bundle.json","state":"https://pith.science/pith/PSHAE4SZVRC23OZXH7HMP3IAOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSHAE4SZVRC23OZXH7HMP3IAOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PSHAE4SZVRC23OZXH7HMP3IAOG","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":"606e066aaf2c02f9e56c4345b3575126d89298bb300ac307b819e53c1525bf63","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-13T09:50:14Z","title_canon_sha256":"8a269e906da297affc3d9d09a9e7043890e2033a6c4680b5b474ac11edee20bb"},"schema_version":"1.0","source":{"id":"1707.04046","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04046","created_at":"2026-05-18T00:24:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04046v4","created_at":"2026-05-18T00:24:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04046","created_at":"2026-05-18T00:24:42Z"},{"alias_kind":"pith_short_12","alias_value":"PSHAE4SZVRC2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSHAE4SZVRC23OZX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSHAE4SZ","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:29f5a2f0fbf3fad559cbe4688e2cce592a992ff826178768ac5c23ecf4b7bea8","target":"graph","created_at":"2026-05-18T00:24:42Z","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":"Methods that align distributions by minimizing an adversarial distance between them have recently achieved impressive results. However, these approaches are difficult to optimize with gradient descent and they often do not converge well without careful hyperparameter tuning and proper initialization. We investigate whether turning the adversarial min-max problem into an optimization problem by replacing the maximization part with its dual improves the quality of the resulting alignment and explore its connections to Maximum Mean Discrepancy. Our empirical results suggest that using the dual fo","authors_text":"Ben Usman, Brian Kulis, Kate Saenko","cross_cats":["cs.AI","cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-13T09:50:14Z","title":"Stable Distribution Alignment Using the Dual of the Adversarial Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04046","kind":"arxiv","version":4},"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:c3feb557129b62dbb776abbf82850229055090e6016a49e693a609f995262ac6","target":"record","created_at":"2026-05-18T00:24:42Z","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":"606e066aaf2c02f9e56c4345b3575126d89298bb300ac307b819e53c1525bf63","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-13T09:50:14Z","title_canon_sha256":"8a269e906da297affc3d9d09a9e7043890e2033a6c4680b5b474ac11edee20bb"},"schema_version":"1.0","source":{"id":"1707.04046","kind":"arxiv","version":4}},"canonical_sha256":"7c8e027259ac45adbb373fcec7ed0071b045602366ce909dee86582ce850869e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c8e027259ac45adbb373fcec7ed0071b045602366ce909dee86582ce850869e","first_computed_at":"2026-05-18T00:24:42.624185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:42.624185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YSpTgZUN13kPN/ktLdMFEDniRD1Ob1fRqUx+kAOCd1H5bFl7FSw8+KnqyB3mCBLRoJeuNDEZWycWnwigkT/OAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:42.624758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04046","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3feb557129b62dbb776abbf82850229055090e6016a49e693a609f995262ac6","sha256:29f5a2f0fbf3fad559cbe4688e2cce592a992ff826178768ac5c23ecf4b7bea8"],"state_sha256":"695c2a05912af8ebf5934aba16a8ddf97cdc2cd9e4dbb0c32fc4629854ffd4b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybMtfN6lUMnBoOEZk2PpXF15Sc2HS3T7tsvxmrjxx2IGeTm44IBqX9LBzDpdGpoHj/4v8aEvO9ciGbOgE2ZLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:48:33.196448Z","bundle_sha256":"dae5f16c211ad4a24f7f7bfda9ba861bda6428ff7e56c53e4de52924b25889f2"}}