{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QP456BS6765RYV4MUNXZYQGE5S","short_pith_number":"pith:QP456BS6","canonical_record":{"source":{"id":"1902.10307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-27T02:14:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a0ee493c0b23269cc57dce1a164643d74cb5bfcac1554fdb62ba57a316e015d7","abstract_canon_sha256":"d7d31b8e7f395a68c11a3644fa2dbf58571d17d9477ad79e2f5f4204a6e4ef39"},"schema_version":"1.0"},"canonical_sha256":"83f9df065effbb1c578ca36f9c40c4eca63c493af0ffaf135a6c863d635652fb","source":{"kind":"arxiv","id":"1902.10307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10307","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10307v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10307","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"QP456BS6765R","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QP456BS6765RYV4M","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QP456BS6","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QP456BS6765RYV4MUNXZYQGE5S","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-27T02:14:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a0ee493c0b23269cc57dce1a164643d74cb5bfcac1554fdb62ba57a316e015d7","abstract_canon_sha256":"d7d31b8e7f395a68c11a3644fa2dbf58571d17d9477ad79e2f5f4204a6e4ef39"},"schema_version":"1.0"},"canonical_sha256":"83f9df065effbb1c578ca36f9c40c4eca63c493af0ffaf135a6c863d635652fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.255704Z","signature_b64":"Y9F9n+JIiYL9dd1eZ1XkCt9/g9t4Ol7ShoqNApB6PDdzRhK7aleyIYatB2/UOYD4SRozc4gWFlRitakaSyTlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83f9df065effbb1c578ca36f9c40c4eca63c493af0ffaf135a6c863d635652fb","last_reissued_at":"2026-05-17T23:52:31.255179Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.255179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10307","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:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaSv/JcZZniehA4M0S/3lJ1/FMpA8+TCFjowWet+y45gsNefZyJI0Nh1YxYXvNy/IPTQop4BOhnGqnfI3bLYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:16:35.427718Z"},"content_sha256":"26d5134fb0d49d5bdacf40a6b58e8029278b6d65db0f9fa810d25561272e90c2","schema_version":"1.0","event_id":"sha256:26d5134fb0d49d5bdacf40a6b58e8029278b6d65db0f9fa810d25561272e90c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QP456BS6765RYV4MUNXZYQGE5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Adversarial Network Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Hamid Karimi, Jiejun Xu, Jiliang Tang, Tyler Derr, Xiaorui Liu","submitted_at":"2019-02-27T02:14:42Z","abstract_excerpt":"Network alignment, in general, seeks to discover the hidden underlying correspondence between nodes across two (or more) networks when given their network structure. However, most existing network alignment methods have added assumptions of additional constraints to guide the alignment, such as having a set of seed node-node correspondences across the networks or the existence of side-information. Instead, we seek to develop a general network alignment algorithm that makes no additional assumptions. Recently, network embedding has proven effective in many network analysis tasks, but embeddings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10307","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:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j62dsfE/lLsFxBh4moHbzZqcWKdo+ruPJzqxS0MpRR5fm3dXjHTND7Z88PkPH52mlsvyYv8aDQzu6+l3IxdFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:16:35.428133Z"},"content_sha256":"b8fafd69eb6ef50ff637b1a841d4435565fb0dd43f01d7836d93e803cad7c777","schema_version":"1.0","event_id":"sha256:b8fafd69eb6ef50ff637b1a841d4435565fb0dd43f01d7836d93e803cad7c777"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP456BS6765RYV4MUNXZYQGE5S/bundle.json","state_url":"https://pith.science/pith/QP456BS6765RYV4MUNXZYQGE5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP456BS6765RYV4MUNXZYQGE5S/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-27T20:16:35Z","links":{"resolver":"https://pith.science/pith/QP456BS6765RYV4MUNXZYQGE5S","bundle":"https://pith.science/pith/QP456BS6765RYV4MUNXZYQGE5S/bundle.json","state":"https://pith.science/pith/QP456BS6765RYV4MUNXZYQGE5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP456BS6765RYV4MUNXZYQGE5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QP456BS6765RYV4MUNXZYQGE5S","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":"d7d31b8e7f395a68c11a3644fa2dbf58571d17d9477ad79e2f5f4204a6e4ef39","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-27T02:14:42Z","title_canon_sha256":"a0ee493c0b23269cc57dce1a164643d74cb5bfcac1554fdb62ba57a316e015d7"},"schema_version":"1.0","source":{"id":"1902.10307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10307","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10307v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10307","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"QP456BS6765R","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QP456BS6765RYV4M","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QP456BS6","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:b8fafd69eb6ef50ff637b1a841d4435565fb0dd43f01d7836d93e803cad7c777","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"Network alignment, in general, seeks to discover the hidden underlying correspondence between nodes across two (or more) networks when given their network structure. However, most existing network alignment methods have added assumptions of additional constraints to guide the alignment, such as having a set of seed node-node correspondences across the networks or the existence of side-information. Instead, we seek to develop a general network alignment algorithm that makes no additional assumptions. Recently, network embedding has proven effective in many network analysis tasks, but embeddings","authors_text":"Hamid Karimi, Jiejun Xu, Jiliang Tang, Tyler Derr, Xiaorui Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-27T02:14:42Z","title":"Deep Adversarial Network Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10307","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:26d5134fb0d49d5bdacf40a6b58e8029278b6d65db0f9fa810d25561272e90c2","target":"record","created_at":"2026-05-17T23:52:31Z","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":"d7d31b8e7f395a68c11a3644fa2dbf58571d17d9477ad79e2f5f4204a6e4ef39","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-27T02:14:42Z","title_canon_sha256":"a0ee493c0b23269cc57dce1a164643d74cb5bfcac1554fdb62ba57a316e015d7"},"schema_version":"1.0","source":{"id":"1902.10307","kind":"arxiv","version":1}},"canonical_sha256":"83f9df065effbb1c578ca36f9c40c4eca63c493af0ffaf135a6c863d635652fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83f9df065effbb1c578ca36f9c40c4eca63c493af0ffaf135a6c863d635652fb","first_computed_at":"2026-05-17T23:52:31.255179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.255179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y9F9n+JIiYL9dd1eZ1XkCt9/g9t4Ol7ShoqNApB6PDdzRhK7aleyIYatB2/UOYD4SRozc4gWFlRitakaSyTlBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.255704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26d5134fb0d49d5bdacf40a6b58e8029278b6d65db0f9fa810d25561272e90c2","sha256:b8fafd69eb6ef50ff637b1a841d4435565fb0dd43f01d7836d93e803cad7c777"],"state_sha256":"f2b29f93890069c3f337332360b3e7b6a254042f0f9e6ad4f8f0533275077d93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sagNb6cTMa6naaRC7L7HcWHouU6ZVK5pC8gQo4wED2GobwnvLVJ8ypJQeVlFa3UGVPwfSTCvNbyn5pBMPnNYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:16:35.430713Z","bundle_sha256":"fed664b7268c1aa48be6b9c38bcc0468eca8fdc1a8946b4ef365d6a93d938e75"}}