{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:56ZOH3E4XZXVHX2A3NA36H447P","short_pith_number":"pith:56ZOH3E4","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"},"canonical_sha256":"efb2e3ec9cbe6f53df40db41bf1f9cfbd5d50f54fd179e71def94de637f290d1","source":{"kind":"arxiv","id":"1907.04707","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04707","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04707v2","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04707","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"56ZOH3E4XZXV","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"pith_short_16","alias_value":"56ZOH3E4XZXVHX2A","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"pith_short_8","alias_value":"56ZOH3E4","created_at":"2026-07-05T01:33:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:56ZOH3E4XZXVHX2A3NA36H447P","target":"record","payload":{"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"},"canonical_sha256":"efb2e3ec9cbe6f53df40db41bf1f9cfbd5d50f54fd179e71def94de637f290d1","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"},"source_kind":"arxiv","source_id":"1907.04707","source_version":2,"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-07-05T01:33:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIWoVupcGlK5XyglZsroC7YqMCyjfmaa2o8m0EaHf73AsR+kgZL9Md3xrxrcz38FL4+j+PsTuNVic7czjOWlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:20:21.097139Z"},"content_sha256":"ab3d27de032d484e9fee9caddceb40b80e0852e773f67c2ad6cab963c1ba0bc2","schema_version":"1.0","event_id":"sha256:ab3d27de032d484e9fee9caddceb40b80e0852e773f67c2ad6cab963c1ba0bc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:56ZOH3E4XZXVHX2A3NA36H447P","target":"graph","payload":{"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"},"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-07-05T01:33:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oj/xfZbufltFDGK4V0ulon5JDDL90dhOej2I7yqd2/GdLe7eyXd9uRjNqLZf2Z5uXULhQoxaOvqkNPUE6tdzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:20:21.098135Z"},"content_sha256":"79399d27be16af394be053cb035c12788ee617556481ff4f723f0e83e1167fec","schema_version":"1.0","event_id":"sha256:79399d27be16af394be053cb035c12788ee617556481ff4f723f0e83e1167fec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/bundle.json","state_url":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56ZOH3E4XZXVHX2A3NA36H447P/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-08-14T19:20:21Z","links":{"resolver":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P","bundle":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/bundle.json","state":"https://pith.science/pith/56ZOH3E4XZXVHX2A3NA36H447P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56ZOH3E4XZXVHX2A3NA36H447P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:56ZOH3E4XZXVHX2A3NA36H447P","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":"bed26ba9f0a9c0d4bd35f82711a6a99e2793c43479941ae24b6514bff1d2b902","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T13:20:49Z","title_canon_sha256":"f9fc58be7024628b5d1d12dbbce58155fd7fa02e4333fd25c5d04e10dd7ef628"},"schema_version":"1.0","source":{"id":"1907.04707","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04707","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04707v2","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04707","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"56ZOH3E4XZXV","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"pith_short_16","alias_value":"56ZOH3E4XZXVHX2A","created_at":"2026-07-05T01:33:05Z"},{"alias_kind":"pith_short_8","alias_value":"56ZOH3E4","created_at":"2026-07-05T01:33:05Z"}],"graph_snapshots":[{"event_id":"sha256:79399d27be16af394be053cb035c12788ee617556481ff4f723f0e83e1167fec","target":"graph","created_at":"2026-07-05T01:33:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.04707/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Feiran Huang, Hao Chen, Peng He, Senzhang Wang, Wenbing Huang, Yue Xu, Zengde Deng, Zhoujun Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T13:20:49Z","title":"Label-Aware Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04707","kind":"arxiv","version":2},"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:ab3d27de032d484e9fee9caddceb40b80e0852e773f67c2ad6cab963c1ba0bc2","target":"record","created_at":"2026-07-05T01:33:05Z","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":"bed26ba9f0a9c0d4bd35f82711a6a99e2793c43479941ae24b6514bff1d2b902","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T13:20:49Z","title_canon_sha256":"f9fc58be7024628b5d1d12dbbce58155fd7fa02e4333fd25c5d04e10dd7ef628"},"schema_version":"1.0","source":{"id":"1907.04707","kind":"arxiv","version":2}},"canonical_sha256":"efb2e3ec9cbe6f53df40db41bf1f9cfbd5d50f54fd179e71def94de637f290d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efb2e3ec9cbe6f53df40db41bf1f9cfbd5d50f54fd179e71def94de637f290d1","first_computed_at":"2026-07-05T01:33:05.961439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:33:05.961439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgXJZ3WSmsTB52v3vumXKhULUmfzXpzmdsP78oVGP8ttBIVRLsXo+rBoPH1BJRJyTsjA/iup3HvISFt1G0zzBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:33:05.961792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04707","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab3d27de032d484e9fee9caddceb40b80e0852e773f67c2ad6cab963c1ba0bc2","sha256:79399d27be16af394be053cb035c12788ee617556481ff4f723f0e83e1167fec"],"state_sha256":"4417b5bbcef559035082adb8f0b0616391ab578864752b48f974271fcb735737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gdS9rE3G+qnoQpTQVS2phHZXUxszVmnkXPYcjB9vOyzJk1frfCgvOpqqGUk2R0CIGid5TKa+GBnjNC9SeVOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T19:20:21.106132Z","bundle_sha256":"4261b6523ef1ba4d44b351292d19e9a197f23f4201f8e2d63d7e551f7ad8a9cc"}}