{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:56ZOH3E4XZXVHX2A3NA36H447P","short_pith_number":"pith:56ZOH3E4","schema_version":"1.0","canonical_sha256":"efb2e3ec9cbe6f53df40db41bf1f9cfbd5d50f54fd179e71def94de637f290d1","source":{"kind":"arxiv","id":"1907.04707","version":2},"attestation_state":"computed","paper":{"title":"Label-Aware Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiran Huang, Hao Chen, Peng He, Senzhang Wang, Wenbing Huang, Yue Xu, Zengde Deng, Zhoujun Li","submitted_at":"2019-07-10T13:20:49Z","abstract_excerpt":"Recent advances in Graph Convolutional Networks (GCNs) have led to state-of-the-art performance on various graph-related tasks. However, most existing GCN models do not explicitly identify whether all the aggregated neighbors are valuable to the learning tasks, which may harm the learning performance. In this paper, we consider the problem of node classification and propose the Label-Aware Graph Convolutional Network (LAGCN) framework which can directly identify valuable neighbors to enhance the performance of existing GCN models. Our contribution is three-fold. First, we propose a label-aware"},"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":"1907.04707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T13:20:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f9fc58be7024628b5d1d12dbbce58155fd7fa02e4333fd25c5d04e10dd7ef628","abstract_canon_sha256":"bed26ba9f0a9c0d4bd35f82711a6a99e2793c43479941ae24b6514bff1d2b902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:05.961792Z","signature_b64":"SgXJZ3WSmsTB52v3vumXKhULUmfzXpzmdsP78oVGP8ttBIVRLsXo+rBoPH1BJRJyTsjA/iup3HvISFt1G0zzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efb2e3ec9cbe6f53df40db41bf1f9cfbd5d50f54fd179e71def94de637f290d1","last_reissued_at":"2026-07-05T01:33:05.961439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:05.961439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Label-Aware Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiran Huang, Hao Chen, Peng He, Senzhang Wang, Wenbing Huang, Yue Xu, Zengde Deng, Zhoujun Li","submitted_at":"2019-07-10T13:20:49Z","abstract_excerpt":"Recent advances in Graph Convolutional Networks (GCNs) have led to state-of-the-art performance on various graph-related tasks. However, most existing GCN models do not explicitly identify whether all the aggregated neighbors are valuable to the learning tasks, which may harm the learning performance. In this paper, we consider the problem of node classification and propose the Label-Aware Graph Convolutional Network (LAGCN) framework which can directly identify valuable neighbors to enhance the performance of existing GCN models. Our contribution is three-fold. First, we propose a label-aware"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04707","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/1907.04707/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":"1907.04707","created_at":"2026-07-05T01:33:05.961498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04707v2","created_at":"2026-07-05T01:33:05.961498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04707","created_at":"2026-07-05T01:33:05.961498+00:00"},{"alias_kind":"pith_short_12","alias_value":"56ZOH3E4XZXV","created_at":"2026-07-05T01:33:05.961498+00:00"},{"alias_kind":"pith_short_16","alias_value":"56ZOH3E4XZXVHX2A","created_at":"2026-07-05T01:33:05.961498+00:00"},{"alias_kind":"pith_short_8","alias_value":"56ZOH3E4","created_at":"2026-07-05T01:33:05.961498+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/56ZOH3E4XZXVHX2A3NA36H447P","json":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P.json","graph_json":"https://pith.science/api/pith-number/56ZOH3E4XZXVHX2A3NA36H447P/graph.json","events_json":"https://pith.science/api/pith-number/56ZOH3E4XZXVHX2A3NA36H447P/events.json","paper":"https://pith.science/paper/56ZOH3E4"},"agent_actions":{"view_html":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P","download_json":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P.json","view_paper":"https://pith.science/paper/56ZOH3E4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04707&json=true","fetch_graph":"https://pith.science/api/pith-number/56ZOH3E4XZXVHX2A3NA36H447P/graph.json","fetch_events":"https://pith.science/api/pith-number/56ZOH3E4XZXVHX2A3NA36H447P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/action/storage_attestation","attest_author":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/action/author_attestation","sign_citation":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/action/citation_signature","submit_replication":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/action/replication_record"}},"created_at":"2026-07-05T01:33:05.961498+00:00","updated_at":"2026-07-05T01:33:05.961498+00:00"}