{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RIMTE2DNQMJZ3PNLX5BY5C4BUJ","short_pith_number":"pith:RIMTE2DN","canonical_record":{"source":{"id":"1802.08888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T18:30:30Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"6a9d7604fb0765fe91a8c9a591f23d56c4fb9e7e9c66bc7e5d07de0726614cc3","abstract_canon_sha256":"a86dca9e08cddab6136f9b4775a5a8066dae9d40ac6171cb2705eb402e197fc4"},"schema_version":"1.0"},"canonical_sha256":"8a1932686d83139dbdabbf438e8b81a25a33df89b25b8f87d32603b49023c5da","source":{"kind":"arxiv","id":"1802.08888","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08888","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08888v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08888","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"RIMTE2DNQMJZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIMTE2DNQMJZ3PNL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIMTE2DN","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RIMTE2DNQMJZ3PNLX5BY5C4BUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T18:30:30Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"6a9d7604fb0765fe91a8c9a591f23d56c4fb9e7e9c66bc7e5d07de0726614cc3","abstract_canon_sha256":"a86dca9e08cddab6136f9b4775a5a8066dae9d40ac6171cb2705eb402e197fc4"},"schema_version":"1.0"},"canonical_sha256":"8a1932686d83139dbdabbf438e8b81a25a33df89b25b8f87d32603b49023c5da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.146948Z","signature_b64":"OGCHHXZtWjn4YTZEH7LGDDf61PgG0JT+nGVIQylRi8nBrvuh9tn3LIxPG4BOycxJlQ4G0jwGJ/Z9F6Qr5BNBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a1932686d83139dbdabbf438e8b81a25a33df89b25b8f87d32603b49023c5da","last_reissued_at":"2026-05-18T00:22:36.146266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.146266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08888","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:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LN/bP2rjC5VX03IETh2hLIZU7RSa09z88+eukplyNp7NKVu9hEw7PAbMVlhwO6j46IqFXZBFIJZ9YqPalpOhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:40:42.932579Z"},"content_sha256":"6ec220a69a234921cf2a865b003af7c07310d2ded79688da383e6e1449e87f63","schema_version":"1.0","event_id":"sha256:6ec220a69a234921cf2a865b003af7c07310d2ded79688da383e6e1449e87f63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RIMTE2DNQMJZ3PNLX5BY5C4BUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amol Kapoor, Bryan Perozzi, Joonseok Lee, Sami Abu-el-haija","submitted_at":"2018-02-24T18:30:30Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have shown significant improvements in semi-supervised learning on graph-structured data. Concurrently, unsupervised learning of graph embeddings has benefited from the information contained in random walks. In this paper, we propose a model: Network of GCNs (N-GCN), which marries these two lines of work. At its core, N-GCN trains multiple instances of GCNs over node pairs discovered at different distances in random walks, and learns a combination of the instance outputs which optimizes the classification objective. Our experiments show that our proposed N-G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08888","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:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/vbenENn65IbFnc8lTlPAPNaRjIedHlIO8R1at6KKOrJz9UgDsbLiRqm2woO379p4X53E+bITHMLiuXFKE+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:40:42.933285Z"},"content_sha256":"82a357d501e78bbc5993a34185d79519cd43b960cff21261f008b31bf4d36ff4","schema_version":"1.0","event_id":"sha256:82a357d501e78bbc5993a34185d79519cd43b960cff21261f008b31bf4d36ff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIMTE2DNQMJZ3PNLX5BY5C4BUJ/bundle.json","state_url":"https://pith.science/pith/RIMTE2DNQMJZ3PNLX5BY5C4BUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIMTE2DNQMJZ3PNLX5BY5C4BUJ/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-26T02:40:42Z","links":{"resolver":"https://pith.science/pith/RIMTE2DNQMJZ3PNLX5BY5C4BUJ","bundle":"https://pith.science/pith/RIMTE2DNQMJZ3PNLX5BY5C4BUJ/bundle.json","state":"https://pith.science/pith/RIMTE2DNQMJZ3PNLX5BY5C4BUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIMTE2DNQMJZ3PNLX5BY5C4BUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RIMTE2DNQMJZ3PNLX5BY5C4BUJ","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":"a86dca9e08cddab6136f9b4775a5a8066dae9d40ac6171cb2705eb402e197fc4","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T18:30:30Z","title_canon_sha256":"6a9d7604fb0765fe91a8c9a591f23d56c4fb9e7e9c66bc7e5d07de0726614cc3"},"schema_version":"1.0","source":{"id":"1802.08888","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08888","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08888v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08888","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"RIMTE2DNQMJZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIMTE2DNQMJZ3PNL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIMTE2DN","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:82a357d501e78bbc5993a34185d79519cd43b960cff21261f008b31bf4d36ff4","target":"graph","created_at":"2026-05-18T00:22: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":"Graph Convolutional Networks (GCNs) have shown significant improvements in semi-supervised learning on graph-structured data. Concurrently, unsupervised learning of graph embeddings has benefited from the information contained in random walks. In this paper, we propose a model: Network of GCNs (N-GCN), which marries these two lines of work. At its core, N-GCN trains multiple instances of GCNs over node pairs discovered at different distances in random walks, and learns a combination of the instance outputs which optimizes the classification objective. Our experiments show that our proposed N-G","authors_text":"Amol Kapoor, Bryan Perozzi, Joonseok Lee, Sami Abu-el-haija","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T18:30:30Z","title":"N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08888","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:6ec220a69a234921cf2a865b003af7c07310d2ded79688da383e6e1449e87f63","target":"record","created_at":"2026-05-18T00:22: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":"a86dca9e08cddab6136f9b4775a5a8066dae9d40ac6171cb2705eb402e197fc4","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-24T18:30:30Z","title_canon_sha256":"6a9d7604fb0765fe91a8c9a591f23d56c4fb9e7e9c66bc7e5d07de0726614cc3"},"schema_version":"1.0","source":{"id":"1802.08888","kind":"arxiv","version":1}},"canonical_sha256":"8a1932686d83139dbdabbf438e8b81a25a33df89b25b8f87d32603b49023c5da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a1932686d83139dbdabbf438e8b81a25a33df89b25b8f87d32603b49023c5da","first_computed_at":"2026-05-18T00:22:36.146266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:36.146266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OGCHHXZtWjn4YTZEH7LGDDf61PgG0JT+nGVIQylRi8nBrvuh9tn3LIxPG4BOycxJlQ4G0jwGJ/Z9F6Qr5BNBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:36.146948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08888","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ec220a69a234921cf2a865b003af7c07310d2ded79688da383e6e1449e87f63","sha256:82a357d501e78bbc5993a34185d79519cd43b960cff21261f008b31bf4d36ff4"],"state_sha256":"96cab61db0212be7a8947c13b7ffb9fc831b417135d036f9f1fe47836236d59c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K60L3mHVRlMeIuF4fenIzU74iIZlESIpzd4+2pW4ygnGU6QW4IAHAra8yl4lzP9vOhbrRTnQnRemhATYwBL7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:40:42.937184Z","bundle_sha256":"838541470492df0d4ea1a430dc6b971163adb4cfcc81a4348d4228c04846e1c9"}}