{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LAX5KF6BDUXKGT7LGN55B3FW3T","short_pith_number":"pith:LAX5KF6B","schema_version":"1.0","canonical_sha256":"582fd517c11d2ea34feb337bd0ecb6dce12d06478525d5d6159c2c4d663f10c7","source":{"kind":"arxiv","id":"1911.04129","version":2},"attestation_state":"computed","paper":{"title":"Higher-order Weighted Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dinghao Wu, HanZe Dong, Lingwei Chen, Songtao Liu, Zengfeng Huang, Zihao Wang","submitted_at":"2019-11-11T08:20:56Z","abstract_excerpt":"Graph Convolution Network (GCN) has been recognized as one of the most effective graph models for semi-supervised learning, but it extracts merely the first-order or few-order neighborhood information through information propagation, which suffers performance drop-off for deeper structure. Existing approaches that deal with the higher-order neighbors tend to take advantage of adjacency matrix power. In this paper, we assume a seemly trivial condition that the higher-order neighborhood information may be similar to that of the first-order neighbors. Accordingly, we present an unsupervised appro"},"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":"1911.04129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-11T08:20:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"827cecf5aebe323863b196c841b94d01fadece0555d58564c4bfc5286860b0c9","abstract_canon_sha256":"719f8318b1afc662f8b0b5d8272dfc34e545fc7632c0bae36ef90db1bdf02403"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:42.418109Z","signature_b64":"qEcqo1HVsHmhB2gMQir4GQiUmr6xq6XRYKiyDisDcJ54BLmW5Jh6QCZF6vur1n51bIacYU1arMli6b3OaoCSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"582fd517c11d2ea34feb337bd0ecb6dce12d06478525d5d6159c2c4d663f10c7","last_reissued_at":"2026-07-05T00:18:42.417773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:42.417773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order Weighted Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dinghao Wu, HanZe Dong, Lingwei Chen, Songtao Liu, Zengfeng Huang, Zihao Wang","submitted_at":"2019-11-11T08:20:56Z","abstract_excerpt":"Graph Convolution Network (GCN) has been recognized as one of the most effective graph models for semi-supervised learning, but it extracts merely the first-order or few-order neighborhood information through information propagation, which suffers performance drop-off for deeper structure. Existing approaches that deal with the higher-order neighbors tend to take advantage of adjacency matrix power. In this paper, we assume a seemly trivial condition that the higher-order neighborhood information may be similar to that of the first-order neighbors. Accordingly, we present an unsupervised appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04129","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.04129/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.04129","created_at":"2026-07-05T00:18:42.417829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.04129v2","created_at":"2026-07-05T00:18:42.417829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04129","created_at":"2026-07-05T00:18:42.417829+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAX5KF6BDUXK","created_at":"2026-07-05T00:18:42.417829+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAX5KF6BDUXKGT7L","created_at":"2026-07-05T00:18:42.417829+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAX5KF6B","created_at":"2026-07-05T00:18:42.417829+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/LAX5KF6BDUXKGT7LGN55B3FW3T","json":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T.json","graph_json":"https://pith.science/api/pith-number/LAX5KF6BDUXKGT7LGN55B3FW3T/graph.json","events_json":"https://pith.science/api/pith-number/LAX5KF6BDUXKGT7LGN55B3FW3T/events.json","paper":"https://pith.science/paper/LAX5KF6B"},"agent_actions":{"view_html":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T","download_json":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T.json","view_paper":"https://pith.science/paper/LAX5KF6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.04129&json=true","fetch_graph":"https://pith.science/api/pith-number/LAX5KF6BDUXKGT7LGN55B3FW3T/graph.json","fetch_events":"https://pith.science/api/pith-number/LAX5KF6BDUXKGT7LGN55B3FW3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T/action/storage_attestation","attest_author":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T/action/author_attestation","sign_citation":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T/action/citation_signature","submit_replication":"https://pith.science/pith/LAX5KF6BDUXKGT7LGN55B3FW3T/action/replication_record"}},"created_at":"2026-07-05T00:18:42.417829+00:00","updated_at":"2026-07-05T00:18:42.417829+00:00"}