{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y","short_pith_number":"pith:LJ6SB4XT","canonical_record":{"source":{"id":"1802.04407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:29:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dd722a1b070b98e5ecadb3641443f11754a00f93617d9766a09ac3eaf563079f","abstract_canon_sha256":"191d70fc229af37f992780265afb324833bdc85699a384747a82bd8442521060"},"schema_version":"1.0"},"canonical_sha256":"5a7d20f2f3c37ef20280d4c07cef37fe395fc4fbe0463fe1b1d90ac60d8773d3","source":{"kind":"arxiv","id":"1802.04407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04407","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04407v2","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04407","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"pith_short_12","alias_value":"LJ6SB4XTYN7P","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LJ6SB4XTYN7PEAUA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LJ6SB4XT","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:29:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dd722a1b070b98e5ecadb3641443f11754a00f93617d9766a09ac3eaf563079f","abstract_canon_sha256":"191d70fc229af37f992780265afb324833bdc85699a384747a82bd8442521060"},"schema_version":"1.0"},"canonical_sha256":"5a7d20f2f3c37ef20280d4c07cef37fe395fc4fbe0463fe1b1d90ac60d8773d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:48.380912Z","signature_b64":"slrBPouGEidNRKLtqdmyRiACdOBD8XbYUGoY1FEXU41VlmoiXPSaYpSvNZDYv/gBU3pZvj5kLn6Sttnudh+SBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7d20f2f3c37ef20280d4c07cef37fe395fc4fbe0463fe1b1d90ac60d8773d3","last_reissued_at":"2026-05-17T23:56:48.380440Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:48.380440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04407","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-17T23:56:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3p8TzOlS64pXukho5vhFsAwjn0UESfwVs/gePZD+uBnJ9MvFeCUK6Q0urBLHA9GaE/UAzYTMVH+bRjymKmruCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:01.472704Z"},"content_sha256":"e7855863d820dd1f4c9dbd1a2e18beb5d5d44f4c445bd2771a7f1fdf4c0b6c29","schema_version":"1.0","event_id":"sha256:e7855863d820dd1f4c9dbd1a2e18beb5d5d44f4c445bd2771a7f1fdf4c0b6c29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chengqi Zhang, Guodong Long, Jing Jiang, Lina Yao, Ruiqi Hu, Shirui Pan","submitted_at":"2018-02-13T00:29:11Z","abstract_excerpt":"Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the latent codes from the graphs, which often results in inferior embedding in real-world graph data. In this paper, we propose a novel adversarial graph embedding framework for graph data. The framework encodes the topological structure and node content in a graph to a compact representa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04407","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-17T23:56:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VEkSJx/7umiTY2/CoboG5nRNB3m6ZCh9b9TFEJQDqTgBNcmAEqvwqx2H0kcc/o/7G+PSTxAvhu4oRX5vws2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:16:01.473443Z"},"content_sha256":"53829ae3a62a3689f59aa2fd7f6ec189ff894d835f6901854658c45a25a41633","schema_version":"1.0","event_id":"sha256:53829ae3a62a3689f59aa2fd7f6ec189ff894d835f6901854658c45a25a41633"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y/bundle.json","state_url":"https://pith.science/pith/LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y/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-25T20:16:01Z","links":{"resolver":"https://pith.science/pith/LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y","bundle":"https://pith.science/pith/LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y/bundle.json","state":"https://pith.science/pith/LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LJ6SB4XTYN7PEAUA2TAHZ3ZX7Y","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":"191d70fc229af37f992780265afb324833bdc85699a384747a82bd8442521060","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:29:11Z","title_canon_sha256":"dd722a1b070b98e5ecadb3641443f11754a00f93617d9766a09ac3eaf563079f"},"schema_version":"1.0","source":{"id":"1802.04407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04407","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04407v2","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04407","created_at":"2026-05-17T23:56:48Z"},{"alias_kind":"pith_short_12","alias_value":"LJ6SB4XTYN7P","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LJ6SB4XTYN7PEAUA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LJ6SB4XT","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:53829ae3a62a3689f59aa2fd7f6ec189ff894d835f6901854658c45a25a41633","target":"graph","created_at":"2026-05-17T23:56:48Z","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":"Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the latent codes from the graphs, which often results in inferior embedding in real-world graph data. In this paper, we propose a novel adversarial graph embedding framework for graph data. The framework encodes the topological structure and node content in a graph to a compact representa","authors_text":"Chengqi Zhang, Guodong Long, Jing Jiang, Lina Yao, Ruiqi Hu, Shirui Pan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:29:11Z","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04407","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:e7855863d820dd1f4c9dbd1a2e18beb5d5d44f4c445bd2771a7f1fdf4c0b6c29","target":"record","created_at":"2026-05-17T23:56:48Z","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":"191d70fc229af37f992780265afb324833bdc85699a384747a82bd8442521060","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T00:29:11Z","title_canon_sha256":"dd722a1b070b98e5ecadb3641443f11754a00f93617d9766a09ac3eaf563079f"},"schema_version":"1.0","source":{"id":"1802.04407","kind":"arxiv","version":2}},"canonical_sha256":"5a7d20f2f3c37ef20280d4c07cef37fe395fc4fbe0463fe1b1d90ac60d8773d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a7d20f2f3c37ef20280d4c07cef37fe395fc4fbe0463fe1b1d90ac60d8773d3","first_computed_at":"2026-05-17T23:56:48.380440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:48.380440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"slrBPouGEidNRKLtqdmyRiACdOBD8XbYUGoY1FEXU41VlmoiXPSaYpSvNZDYv/gBU3pZvj5kLn6Sttnudh+SBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:48.380912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7855863d820dd1f4c9dbd1a2e18beb5d5d44f4c445bd2771a7f1fdf4c0b6c29","sha256:53829ae3a62a3689f59aa2fd7f6ec189ff894d835f6901854658c45a25a41633"],"state_sha256":"157d7e50b31fd59785471b0dc661f6032b6d2444c5e390ab17b44e0bb50e0044"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIRSyX6eHhVbfJNkYcgEYZnkXZ4Rn3QxbXJ7dqy6FH1B+yMKMgFBtszaREkLe4/uQGWstm6XhGwNJ5MCfhEHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:16:01.477202Z","bundle_sha256":"3a4b60f60c7ecf4cc96c1a1884b16fb23cfbb1c28ba91a0a0c535fe64c45ad04"}}