{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G24WHYIJVKAQ3TWFMMFUDZ4CLD","short_pith_number":"pith:G24WHYIJ","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"},"canonical_sha256":"36b963e109aa810dcec5630b41e78258e0e5885021ede54731e16cc757b9c0c1","source":{"kind":"arxiv","id":"1809.00130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00130","created_at":"2026-05-18T00:06:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00130v1","created_at":"2026-05-18T00:06:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00130","created_at":"2026-05-18T00:06:36Z"},{"alias_kind":"pith_short_12","alias_value":"G24WHYIJVKAQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G24WHYIJVKAQ3TWF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G24WHYIJ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G24WHYIJVKAQ3TWFMMFUDZ4CLD","target":"record","payload":{"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"},"canonical_sha256":"36b963e109aa810dcec5630b41e78258e0e5885021ede54731e16cc757b9c0c1","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"},"source_kind":"arxiv","source_id":"1809.00130","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-18T00:06:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdzaOnsVxPtBR0kj7yqQ9vKbM4GXt657DWTSdqkoDXXo5ygjjnaLIkbY39hhk+J6S1kb7wPGQVM4QB95C1LnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:28:52.962378Z"},"content_sha256":"c3173062158623cfd986b97c097466e63f167829541140e509a191efa5dcdb6b","schema_version":"1.0","event_id":"sha256:c3173062158623cfd986b97c097466e63f167829541140e509a191efa5dcdb6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G24WHYIJVKAQ3TWFMMFUDZ4CLD","target":"graph","payload":{"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"},"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-18T00:06:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HlODNg8JVqqg6sjBpXZdm53b1AjcX2ydHXUxuGlyRhkoH4/BNuxyaKDwromoWZMRS5N4U3IPPKlr9UEiKXmMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:28:52.963083Z"},"content_sha256":"4b85dc53c113877e73ed23cfab42b15cc1816ff45c7bc2f32994f0c10329bf55","schema_version":"1.0","event_id":"sha256:4b85dc53c113877e73ed23cfab42b15cc1816ff45c7bc2f32994f0c10329bf55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/bundle.json","state_url":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/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-25T19:28:52Z","links":{"resolver":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD","bundle":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/bundle.json","state":"https://pith.science/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G24WHYIJVKAQ3TWFMMFUDZ4CLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G24WHYIJVKAQ3TWFMMFUDZ4CLD","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":"db1073d44ce398dcace470ed2926f8b6926904892e76f6bfbf24ba774f2bdad8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-01T08:02:45Z","title_canon_sha256":"a0459f7794a7fd0b46d399c30441d8473d896aa8736e7efabf1f417e680ea484"},"schema_version":"1.0","source":{"id":"1809.00130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00130","created_at":"2026-05-18T00:06:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00130v1","created_at":"2026-05-18T00:06:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00130","created_at":"2026-05-18T00:06:36Z"},{"alias_kind":"pith_short_12","alias_value":"G24WHYIJVKAQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G24WHYIJVKAQ3TWF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G24WHYIJ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:4b85dc53c113877e73ed23cfab42b15cc1816ff45c7bc2f32994f0c10329bf55","target":"graph","created_at":"2026-05-18T00:06:36Z","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":"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","authors_text":"Jie Tang, Jie Zhang, Ming Ding","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-01T08:02:45Z","title":"Semi-supervised Learning on Graphs with Generative Adversarial Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00130","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:c3173062158623cfd986b97c097466e63f167829541140e509a191efa5dcdb6b","target":"record","created_at":"2026-05-18T00:06:36Z","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":"db1073d44ce398dcace470ed2926f8b6926904892e76f6bfbf24ba774f2bdad8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-01T08:02:45Z","title_canon_sha256":"a0459f7794a7fd0b46d399c30441d8473d896aa8736e7efabf1f417e680ea484"},"schema_version":"1.0","source":{"id":"1809.00130","kind":"arxiv","version":1}},"canonical_sha256":"36b963e109aa810dcec5630b41e78258e0e5885021ede54731e16cc757b9c0c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36b963e109aa810dcec5630b41e78258e0e5885021ede54731e16cc757b9c0c1","first_computed_at":"2026-05-18T00:06:36.010780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:36.010780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iFnTtYPvUo02ay4Ya9RuspRPaYIsYmIhjfIGl38F5z8Hy3mTqCgyZiH8VgF2D3QjjdSUgxK8GGKavFDaRBi3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:36.011262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3173062158623cfd986b97c097466e63f167829541140e509a191efa5dcdb6b","sha256:4b85dc53c113877e73ed23cfab42b15cc1816ff45c7bc2f32994f0c10329bf55"],"state_sha256":"715c1b78c10342c02442e865be62a6493883cce952509a6dcfacd5c4fed405ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Q8iXBJnS4rb7BTmbX8CYslz50T45J9nr2ffq/IwqWZ7bTAUWCe2whCbJKmJxVdqe30ms75CIa/U/MFiNc/HAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:28:52.966939Z","bundle_sha256":"8626e142697163526c592bf7433b569162dc40df54b011de8ddab2310b278496"}}