{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S5MW65ESUWYPN4PTAZR6ESDQED","short_pith_number":"pith:S5MW65ES","canonical_record":{"source":{"id":"1908.05429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-15T05:56:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1e8d1051bdb0d980eab2676b124bb6bbddfb2de43604f307138cd8425bb35c8e","abstract_canon_sha256":"c4474ce37e02328fe627cc8bd078e7407ce7452f9ec631fd7960fe41b7702bd5"},"schema_version":"1.0"},"canonical_sha256":"97596f7492a5b0f6f1f30663e2487020f10db14b139bb99d722987cc36a729f4","source":{"kind":"arxiv","id":"1908.05429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05429","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05429v1","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05429","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"S5MW65ESUWYP","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"pith_short_16","alias_value":"S5MW65ESUWYPN4PT","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"pith_short_8","alias_value":"S5MW65ES","created_at":"2026-07-04T23:56:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S5MW65ESUWYPN4PTAZR6ESDQED","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-15T05:56:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1e8d1051bdb0d980eab2676b124bb6bbddfb2de43604f307138cd8425bb35c8e","abstract_canon_sha256":"c4474ce37e02328fe627cc8bd078e7407ce7452f9ec631fd7960fe41b7702bd5"},"schema_version":"1.0"},"canonical_sha256":"97596f7492a5b0f6f1f30663e2487020f10db14b139bb99d722987cc36a729f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:51.620951Z","signature_b64":"N+4x9SP2sXiUUMwTVlKSfgx3PzGYwv1fBJPRboQncmqYfCuoCOa64X5mAAlE8jdJiqCyutEJVTw7680RCDbPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97596f7492a5b0f6f1f30663e2487020f10db14b139bb99d722987cc36a729f4","last_reissued_at":"2026-07-04T23:56:51.620499Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:51.620499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05429","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-04T23:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3e48RHATQkejZkfTsgdvf7UkVwKLKRKGfHC2bMBCx+7Gf18ElvI5jlL8qV4KiC/jhZV7Ea5LrvIDAKES/owAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:15:00.548136Z"},"content_sha256":"bd5120746071793575435c1cde219ef795ab03a43a34f53b10ba5dff076c421b","schema_version":"1.0","event_id":"sha256:bd5120746071793575435c1cde219ef795ab03a43a34f53b10ba5dff076c421b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S5MW65ESUWYPN4PTAZR6ESDQED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Domain-adversarial Network Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Huiting Hong, Ivor Tsang, Xin Li, Yuangang Pan","submitted_at":"2019-08-15T05:56:25Z","abstract_excerpt":"Network alignment is a critical task to a wide variety of fields. Many existing works leverage on representation learning to accomplish this task without eliminating domain representation bias induced by domain-dependent features, which yield inferior alignment performance. This paper proposes a unified deep architecture (DANA) to obtain a domain-invariant representation for network alignment via an adversarial domain classifier. Specifically, we employ the graph convolutional networks to perform network embedding under the domain adversarial principle, given a small set of observed anchors. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05429","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/1908.05429/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-04T23:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oONyIpRnvIknxYUF6ND1hoRpMD3oiw60zTVdhDYkoSdB1TOzGtWpIVTC/YX4v1HjhOr8ba2J5gKo8+e2FBIxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:15:00.548638Z"},"content_sha256":"5dcf9c800f74a41b88352907dddb8ab581a45c973ecc41419bcc51bca5f40a80","schema_version":"1.0","event_id":"sha256:5dcf9c800f74a41b88352907dddb8ab581a45c973ecc41419bcc51bca5f40a80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5MW65ESUWYPN4PTAZR6ESDQED/bundle.json","state_url":"https://pith.science/pith/S5MW65ESUWYPN4PTAZR6ESDQED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5MW65ESUWYPN4PTAZR6ESDQED/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-16T10:15:00Z","links":{"resolver":"https://pith.science/pith/S5MW65ESUWYPN4PTAZR6ESDQED","bundle":"https://pith.science/pith/S5MW65ESUWYPN4PTAZR6ESDQED/bundle.json","state":"https://pith.science/pith/S5MW65ESUWYPN4PTAZR6ESDQED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5MW65ESUWYPN4PTAZR6ESDQED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S5MW65ESUWYPN4PTAZR6ESDQED","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":"c4474ce37e02328fe627cc8bd078e7407ce7452f9ec631fd7960fe41b7702bd5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-15T05:56:25Z","title_canon_sha256":"1e8d1051bdb0d980eab2676b124bb6bbddfb2de43604f307138cd8425bb35c8e"},"schema_version":"1.0","source":{"id":"1908.05429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05429","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05429v1","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05429","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"S5MW65ESUWYP","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"pith_short_16","alias_value":"S5MW65ESUWYPN4PT","created_at":"2026-07-04T23:56:51Z"},{"alias_kind":"pith_short_8","alias_value":"S5MW65ES","created_at":"2026-07-04T23:56:51Z"}],"graph_snapshots":[{"event_id":"sha256:5dcf9c800f74a41b88352907dddb8ab581a45c973ecc41419bcc51bca5f40a80","target":"graph","created_at":"2026-07-04T23:56: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05429/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network alignment is a critical task to a wide variety of fields. Many existing works leverage on representation learning to accomplish this task without eliminating domain representation bias induced by domain-dependent features, which yield inferior alignment performance. This paper proposes a unified deep architecture (DANA) to obtain a domain-invariant representation for network alignment via an adversarial domain classifier. Specifically, we employ the graph convolutional networks to perform network embedding under the domain adversarial principle, given a small set of observed anchors. T","authors_text":"Huiting Hong, Ivor Tsang, Xin Li, Yuangang Pan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-15T05:56:25Z","title":"Domain-adversarial Network Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05429","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:bd5120746071793575435c1cde219ef795ab03a43a34f53b10ba5dff076c421b","target":"record","created_at":"2026-07-04T23:56: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":"c4474ce37e02328fe627cc8bd078e7407ce7452f9ec631fd7960fe41b7702bd5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-15T05:56:25Z","title_canon_sha256":"1e8d1051bdb0d980eab2676b124bb6bbddfb2de43604f307138cd8425bb35c8e"},"schema_version":"1.0","source":{"id":"1908.05429","kind":"arxiv","version":1}},"canonical_sha256":"97596f7492a5b0f6f1f30663e2487020f10db14b139bb99d722987cc36a729f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97596f7492a5b0f6f1f30663e2487020f10db14b139bb99d722987cc36a729f4","first_computed_at":"2026-07-04T23:56:51.620499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:56:51.620499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N+4x9SP2sXiUUMwTVlKSfgx3PzGYwv1fBJPRboQncmqYfCuoCOa64X5mAAlE8jdJiqCyutEJVTw7680RCDbPAw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:56:51.620951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd5120746071793575435c1cde219ef795ab03a43a34f53b10ba5dff076c421b","sha256:5dcf9c800f74a41b88352907dddb8ab581a45c973ecc41419bcc51bca5f40a80"],"state_sha256":"e86fd335d958d272c9aafc3a68483307cb31e0f1d95a86496a9867c19258949c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rx6y0izhtkKB+zC/p+K5UsLq8AbGX6GBTSMKEvIU/IO8U0k1sQlAEMKaCTvfMq8gNp1L14Cgyz/9G2JGx7PECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:15:00.554390Z","bundle_sha256":"f8fb420ff30811ac26922905cad7a1abfcd29c4fd4fb7cc8583fdde3045e6aeb"}}