{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NE3ZJGAQOKCWKIVUWH65WSIQ53","short_pith_number":"pith:NE3ZJGAQ","schema_version":"1.0","canonical_sha256":"693794981072856522b4b1fddb4910eeeda3e34e0062feb6c52fb78192fbf131","source":{"kind":"arxiv","id":"1907.00544","version":1},"attestation_state":"computed","paper":{"title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Chaoqi Chen, Junzhou Huang, Tingyang Xu, Weiping Xie, Wenbing Huang, Xinghao Ding, Yue Huang, Yu Rong","submitted_at":"2019-07-01T04:48:48Z","abstract_excerpt":"Graph alignment, also known as network alignment, is a fundamental task in social network analysis. Many recent works have relied on partially labeled cross-graph node correspondences, i.e., anchor links. However, due to the privacy and security issue, the manual labeling of anchor links for diverse scenarios may be prohibitive. Aligning two graphs without any anchor links is a crucial and challenging task. In this paper, we propose an Unsupervised Adversarial Graph Alignment (UAGA) framework to learn a cross-graph alignment between two embedding spaces of different graphs in a fully unsupervi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.00544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-07-01T04:48:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2136cc4c89b360b74130005b26b53195c1d997c4710b3c50bbaafb19888caa90","abstract_canon_sha256":"d8ad02b7eca81677ba46333c763af362e63507625e4e89e4e04cb2528b79a363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:51.261922Z","signature_b64":"0vgkgOblxC00P7mq1OzTcWW0k0ONl69JZ7KNJpYah4xJr4iMlXK8S4k673SHEslN+4+UE0505DOBWBYDyznTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"693794981072856522b4b1fddb4910eeeda3e34e0062feb6c52fb78192fbf131","last_reissued_at":"2026-05-17T23:41:51.261139Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:51.261139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Chaoqi Chen, Junzhou Huang, Tingyang Xu, Weiping Xie, Wenbing Huang, Xinghao Ding, Yue Huang, Yu Rong","submitted_at":"2019-07-01T04:48:48Z","abstract_excerpt":"Graph alignment, also known as network alignment, is a fundamental task in social network analysis. Many recent works have relied on partially labeled cross-graph node correspondences, i.e., anchor links. However, due to the privacy and security issue, the manual labeling of anchor links for diverse scenarios may be prohibitive. Aligning two graphs without any anchor links is a crucial and challenging task. In this paper, we propose an Unsupervised Adversarial Graph Alignment (UAGA) framework to learn a cross-graph alignment between two embedding spaces of different graphs in a fully unsupervi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00544","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.00544","created_at":"2026-05-17T23:41:51.261261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00544v1","created_at":"2026-05-17T23:41:51.261261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00544","created_at":"2026-05-17T23:41:51.261261+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE3ZJGAQOKCW","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE3ZJGAQOKCWKIVU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE3ZJGAQ","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53","json":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53.json","graph_json":"https://pith.science/api/pith-number/NE3ZJGAQOKCWKIVUWH65WSIQ53/graph.json","events_json":"https://pith.science/api/pith-number/NE3ZJGAQOKCWKIVUWH65WSIQ53/events.json","paper":"https://pith.science/paper/NE3ZJGAQ"},"agent_actions":{"view_html":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53","download_json":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53.json","view_paper":"https://pith.science/paper/NE3ZJGAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00544&json=true","fetch_graph":"https://pith.science/api/pith-number/NE3ZJGAQOKCWKIVUWH65WSIQ53/graph.json","fetch_events":"https://pith.science/api/pith-number/NE3ZJGAQOKCWKIVUWH65WSIQ53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53/action/storage_attestation","attest_author":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53/action/author_attestation","sign_citation":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53/action/citation_signature","submit_replication":"https://pith.science/pith/NE3ZJGAQOKCWKIVUWH65WSIQ53/action/replication_record"}},"created_at":"2026-05-17T23:41:51.261261+00:00","updated_at":"2026-05-17T23:41:51.261261+00:00"}