{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6EW3LVLW2OBIA76OYYVKEGSSFI","short_pith_number":"pith:6EW3LVLW","canonical_record":{"source":{"id":"1902.06667","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-13T09:58:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b95086de90d67b5008e6f388adebcc809962ff9779d12ccf0a703519fc5de3b2","abstract_canon_sha256":"c20458681621c59b6c542d6c4b488aad374fdb5bbb11e3934292d9341198c9c2"},"schema_version":"1.0"},"canonical_sha256":"f12db5d576d382807fcec62aa21a522a12b9da8f245b75e1b6945233a4be4531","source":{"kind":"arxiv","id":"1902.06667","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06667","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06667v4","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06667","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"6EW3LVLW2OBI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6EW3LVLW2OBIA76O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6EW3LVLW","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6EW3LVLW2OBIA76OYYVKEGSSFI","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06667","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-13T09:58:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b95086de90d67b5008e6f388adebcc809962ff9779d12ccf0a703519fc5de3b2","abstract_canon_sha256":"c20458681621c59b6c542d6c4b488aad374fdb5bbb11e3934292d9341198c9c2"},"schema_version":"1.0"},"canonical_sha256":"f12db5d576d382807fcec62aa21a522a12b9da8f245b75e1b6945233a4be4531","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:49.851195Z","signature_b64":"M3Qn3yWwj/tOac892vPcZjjCLu9bzRu5K4XpUuPUlxaFdogBF1gMh3MFuGnwvloTqwNzZM2G6Nu2LF6JudPpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f12db5d576d382807fcec62aa21a522a12b9da8f245b75e1b6945233a4be4531","last_reissued_at":"2026-05-17T23:43:49.850513Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:49.850513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06667","source_version":4,"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:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlFJKAItkIh182FAYxc3CFOu9zvVGyfXVxe1URzNGdXuKHwev2RdcVVwYL0UoDE8ynITQAC406TyHI0+XKOiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:26:25.422826Z"},"content_sha256":"3dcec991fc50ecc851b5eda4eca066f201418be32fbaf2eb38d8c7e3a8691e9d","schema_version":"1.0","event_id":"sha256:3dcec991fc50ecc851b5eda4eca066f201418be32fbaf2eb38d8c7e3a8691e9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6EW3LVLW2OBIA76OYYVKEGSSFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Fenyu Hu, Liang Wang, Shu Wu, Tieniu Tan, Yanqiao Zhu","submitted_at":"2019-02-13T09:58:44Z","abstract_excerpt":"Graph convolutional networks (GCNs) have been successfully applied in node classification tasks of network mining. However, most of these models based on neighborhood aggregation are usually shallow and lack the \"graph pooling\" mechanism, which prevents the model from obtaining adequate global information. In order to increase the receptive field, we propose a novel deep Hierarchical Graph Convolutional Network (H-GCN) for semi-supervised node classification. H-GCN first repeatedly aggregates structurally similar nodes to hyper-nodes and then refines the coarsened graph to the original to rest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06667","kind":"arxiv","version":4},"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:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSPma/4O0JwbP/qRYLza+xovm0oWcJc5WEkuWMuxrkkBTdBMzzGzng+eYtbsWh6TrzgFBtTohbByPZwoHDSmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:26:25.423175Z"},"content_sha256":"065447208349a285c502318878ac0f5ccef84470b2240c3ec378fe5de38844cf","schema_version":"1.0","event_id":"sha256:065447208349a285c502318878ac0f5ccef84470b2240c3ec378fe5de38844cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EW3LVLW2OBIA76OYYVKEGSSFI/bundle.json","state_url":"https://pith.science/pith/6EW3LVLW2OBIA76OYYVKEGSSFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EW3LVLW2OBIA76OYYVKEGSSFI/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-06-03T20:26:25Z","links":{"resolver":"https://pith.science/pith/6EW3LVLW2OBIA76OYYVKEGSSFI","bundle":"https://pith.science/pith/6EW3LVLW2OBIA76OYYVKEGSSFI/bundle.json","state":"https://pith.science/pith/6EW3LVLW2OBIA76OYYVKEGSSFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EW3LVLW2OBIA76OYYVKEGSSFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6EW3LVLW2OBIA76OYYVKEGSSFI","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":"c20458681621c59b6c542d6c4b488aad374fdb5bbb11e3934292d9341198c9c2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-13T09:58:44Z","title_canon_sha256":"b95086de90d67b5008e6f388adebcc809962ff9779d12ccf0a703519fc5de3b2"},"schema_version":"1.0","source":{"id":"1902.06667","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06667","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06667v4","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06667","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"6EW3LVLW2OBI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6EW3LVLW2OBIA76O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6EW3LVLW","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:065447208349a285c502318878ac0f5ccef84470b2240c3ec378fe5de38844cf","target":"graph","created_at":"2026-05-17T23:43:49Z","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 been successfully applied in node classification tasks of network mining. However, most of these models based on neighborhood aggregation are usually shallow and lack the \"graph pooling\" mechanism, which prevents the model from obtaining adequate global information. In order to increase the receptive field, we propose a novel deep Hierarchical Graph Convolutional Network (H-GCN) for semi-supervised node classification. H-GCN first repeatedly aggregates structurally similar nodes to hyper-nodes and then refines the coarsened graph to the original to rest","authors_text":"Fenyu Hu, Liang Wang, Shu Wu, Tieniu Tan, Yanqiao Zhu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-13T09:58:44Z","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06667","kind":"arxiv","version":4},"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:3dcec991fc50ecc851b5eda4eca066f201418be32fbaf2eb38d8c7e3a8691e9d","target":"record","created_at":"2026-05-17T23:43:49Z","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":"c20458681621c59b6c542d6c4b488aad374fdb5bbb11e3934292d9341198c9c2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-13T09:58:44Z","title_canon_sha256":"b95086de90d67b5008e6f388adebcc809962ff9779d12ccf0a703519fc5de3b2"},"schema_version":"1.0","source":{"id":"1902.06667","kind":"arxiv","version":4}},"canonical_sha256":"f12db5d576d382807fcec62aa21a522a12b9da8f245b75e1b6945233a4be4531","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f12db5d576d382807fcec62aa21a522a12b9da8f245b75e1b6945233a4be4531","first_computed_at":"2026-05-17T23:43:49.850513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:49.850513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M3Qn3yWwj/tOac892vPcZjjCLu9bzRu5K4XpUuPUlxaFdogBF1gMh3MFuGnwvloTqwNzZM2G6Nu2LF6JudPpCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:49.851195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06667","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dcec991fc50ecc851b5eda4eca066f201418be32fbaf2eb38d8c7e3a8691e9d","sha256:065447208349a285c502318878ac0f5ccef84470b2240c3ec378fe5de38844cf"],"state_sha256":"4b0f5e994c7f4446827cad357a3c3fd0812baa30099b73a1498c18cc38be6916"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewTQIu02bN6ChaSEMHmKIR/0CarJ0ea45o3XUnBmt8M/Wo9c8A/u4JRBIxppC4QP07Q7Ftspo+dunpwtXpksAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:26:25.425083Z","bundle_sha256":"64baf489ea6d17d021809a55ef0382db121680ac44edb1809d20946a73b37de8"}}