{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G24WHYIJVKAQ3TWFMMFUDZ4CLD","short_pith_number":"pith:G24WHYIJ","schema_version":"1.0","canonical_sha256":"36b963e109aa810dcec5630b41e78258e0e5885021ede54731e16cc757b9c0c1","source":{"kind":"arxiv","id":"1809.00130","version":1},"attestation_state":"computed","paper":{"title":"Semi-supervised Learning on Graphs with Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Jie Tang, Jie Zhang, Ming Ding","submitted_at":"2018-09-01T08:02:45Z","abstract_excerpt":"We investigate how generative adversarial nets (GANs) can help semi-supervised learning on graphs. We first provide insights on working principles of adversarial learning over graphs and then present GraphSGAN, a novel approach to semi-supervised learning on graphs. In GraphSGAN, generator and classifier networks play a novel competitive game. At equilibrium, generator generates fake samples in low-density areas between subgraphs. In order to discriminate fake samples from the real, classifier implicitly takes the density property of subgraph into consideration. An efficient adversarial learni"},"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":"1809.00130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-01T08:02:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a0459f7794a7fd0b46d399c30441d8473d896aa8736e7efabf1f417e680ea484","abstract_canon_sha256":"db1073d44ce398dcace470ed2926f8b6926904892e76f6bfbf24ba774f2bdad8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:36.011262Z","signature_b64":"iFnTtYPvUo02ay4Ya9RuspRPaYIsYmIhjfIGl38F5z8Hy3mTqCgyZiH8VgF2D3QjjdSUgxK8GGKavFDaRBi3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b963e109aa810dcec5630b41e78258e0e5885021ede54731e16cc757b9c0c1","last_reissued_at":"2026-05-18T00:06:36.010780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:36.010780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-supervised Learning on Graphs with Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Jie Tang, Jie Zhang, Ming Ding","submitted_at":"2018-09-01T08:02:45Z","abstract_excerpt":"We investigate how generative adversarial nets (GANs) can help semi-supervised learning on graphs. We first provide insights on working principles of adversarial learning over graphs and then present GraphSGAN, a novel approach to semi-supervised learning on graphs. In GraphSGAN, generator and classifier networks play a novel competitive game. At equilibrium, generator generates fake samples in low-density areas between subgraphs. In order to discriminate fake samples from the real, classifier implicitly takes the density property of subgraph into consideration. An efficient adversarial learni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00130","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":"1809.00130","created_at":"2026-05-18T00:06:36.010857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00130v1","created_at":"2026-05-18T00:06:36.010857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00130","created_at":"2026-05-18T00:06:36.010857+00:00"},{"alias_kind":"pith_short_12","alias_value":"G24WHYIJVKAQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G24WHYIJVKAQ3TWF","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G24WHYIJ","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05315","citing_title":"Graph Neural Based End-to-end Data Association Framework for Online Multiple-Object Tracking","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD","json":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD.json","graph_json":"https://pith.science/api/pith-number/G24WHYIJVKAQ3TWFMMFUDZ4CLD/graph.json","events_json":"https://pith.science/api/pith-number/G24WHYIJVKAQ3TWFMMFUDZ4CLD/events.json","paper":"https://pith.science/paper/G24WHYIJ"},"agent_actions":{"view_html":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD","download_json":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD.json","view_paper":"https://pith.science/paper/G24WHYIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00130&json=true","fetch_graph":"https://pith.science/api/pith-number/G24WHYIJVKAQ3TWFMMFUDZ4CLD/graph.json","fetch_events":"https://pith.science/api/pith-number/G24WHYIJVKAQ3TWFMMFUDZ4CLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/action/storage_attestation","attest_author":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/action/author_attestation","sign_citation":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/action/citation_signature","submit_replication":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/action/replication_record"}},"created_at":"2026-05-18T00:06:36.010857+00:00","updated_at":"2026-05-18T00:06:36.010857+00:00"}