{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DEJMS6RXRWJ4DIHIQ7NJDZZLWH","short_pith_number":"pith:DEJMS6RX","schema_version":"1.0","canonical_sha256":"1912c97a378d93c1a0e887da91e72bb1dfee3ca6f738b146ef6eb4a7ab1bf050","source":{"kind":"arxiv","id":"1711.08267","version":1},"attestation_state":"computed","paper":{"title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fuzheng Zhang, Hongwei Wang, Jialin Wang, Jia Wang, Miao Zhao, Minyi Guo, Weinan Zhang, Xing Xie","submitted_at":"2017-11-22T13:20:17Z","abstract_excerpt":"The goal of graph representation learning is to embed each vertex in a graph into a low-dimensional vector space. Existing graph representation learning methods can be classified into two categories: generative models that learn the underlying connectivity distribution in the graph, and discriminative models that predict the probability of edge existence between a pair of vertices. In this paper, we propose GraphGAN, an innovative graph representation learning framework unifying above two classes of methods, in which the generative model and discriminative model play a game-theoretical minimax"},"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":"1711.08267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-22T13:20:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c03c0a45dec276ac7986e28aadac707c02f430f7f862196d8bb02115b402ab3a","abstract_canon_sha256":"d58421cabbdfd28c89bccaebf43c7c53f52fc3d5107abba378bb2eca09baa90b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.259607Z","signature_b64":"MwFJ0hcrZWJQGqmmLjlhCtWq/t6nSs07esphJEmXSgF/0/GCXb+aAOAZ0Wh4fjMYZrXP7N6KL2GIbYQY2VxSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1912c97a378d93c1a0e887da91e72bb1dfee3ca6f738b146ef6eb4a7ab1bf050","last_reissued_at":"2026-05-18T00:29:50.259071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.259071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fuzheng Zhang, Hongwei Wang, Jialin Wang, Jia Wang, Miao Zhao, Minyi Guo, Weinan Zhang, Xing Xie","submitted_at":"2017-11-22T13:20:17Z","abstract_excerpt":"The goal of graph representation learning is to embed each vertex in a graph into a low-dimensional vector space. Existing graph representation learning methods can be classified into two categories: generative models that learn the underlying connectivity distribution in the graph, and discriminative models that predict the probability of edge existence between a pair of vertices. In this paper, we propose GraphGAN, an innovative graph representation learning framework unifying above two classes of methods, in which the generative model and discriminative model play a game-theoretical minimax"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08267","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":"1711.08267","created_at":"2026-05-18T00:29:50.259146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08267v1","created_at":"2026-05-18T00:29:50.259146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08267","created_at":"2026-05-18T00:29:50.259146+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEJMS6RXRWJ4","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEJMS6RXRWJ4DIHI","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEJMS6RX","created_at":"2026-05-18T12:31:10.602751+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/DEJMS6RXRWJ4DIHIQ7NJDZZLWH","json":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH.json","graph_json":"https://pith.science/api/pith-number/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/graph.json","events_json":"https://pith.science/api/pith-number/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/events.json","paper":"https://pith.science/paper/DEJMS6RX"},"agent_actions":{"view_html":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH","download_json":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH.json","view_paper":"https://pith.science/paper/DEJMS6RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08267&json=true","fetch_graph":"https://pith.science/api/pith-number/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/graph.json","fetch_events":"https://pith.science/api/pith-number/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/action/storage_attestation","attest_author":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/action/author_attestation","sign_citation":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/action/citation_signature","submit_replication":"https://pith.science/pith/DEJMS6RXRWJ4DIHIQ7NJDZZLWH/action/replication_record"}},"created_at":"2026-05-18T00:29:50.259146+00:00","updated_at":"2026-05-18T00:29:50.259146+00:00"}