{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AIZ2HJPLJZ4JY5OLASZELUPVQA","short_pith_number":"pith:AIZ2HJPL","schema_version":"1.0","canonical_sha256":"0233a3a5eb4e789c75cb04b245d1f5802dd21b22f79dd391811164fecd861390","source":{"kind":"arxiv","id":"1809.02709","version":2},"attestation_state":"computed","paper":{"title":"Exploiting Edge Features in Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Liyu Gong, Qiang Cheng","submitted_at":"2018-09-07T23:18:59Z","abstract_excerpt":"Edge features contain important information about graphs. However, current state-of-the-art neural network models designed for graph learning, e.g. graph convolutional networks (GCN) and graph attention networks (GAT), adequately utilize edge features, especially multi-dimensional edge features. In this paper, we build a new framework for a family of new graph neural network models that can more sufficiently exploit edge features, including those of undirected or multi-dimensional edges. The proposed framework can consolidate current graph neural network models; e.g. graph convolutional networ"},"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":"1809.02709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-07T23:18:59Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"2f4bf6bf171ba9ab8e2bacb1d6940c00945764e543d94a9e64000bc91be3a4b7","abstract_canon_sha256":"b667b17d7c6a4929ab4b5cb6dd600fc992408255d7db4e9b71e7706bb89ac677"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:28.989940Z","signature_b64":"qXuRCRYzsYrsjnc0ISMNzhOTvOKd/U0KLZBXIom5iNcj4xyZegDjpKwXb2nqF/OuT3sqbS2h5bWGYtXWqZ0uAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0233a3a5eb4e789c75cb04b245d1f5802dd21b22f79dd391811164fecd861390","last_reissued_at":"2026-05-17T23:55:28.989496Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:28.989496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Edge Features in Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Liyu Gong, Qiang Cheng","submitted_at":"2018-09-07T23:18:59Z","abstract_excerpt":"Edge features contain important information about graphs. However, current state-of-the-art neural network models designed for graph learning, e.g. graph convolutional networks (GCN) and graph attention networks (GAT), adequately utilize edge features, especially multi-dimensional edge features. In this paper, we build a new framework for a family of new graph neural network models that can more sufficiently exploit edge features, including those of undirected or multi-dimensional edges. The proposed framework can consolidate current graph neural network models; e.g. graph convolutional networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02709","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":""},"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":"1809.02709","created_at":"2026-05-17T23:55:28.989578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02709v2","created_at":"2026-05-17T23:55:28.989578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02709","created_at":"2026-05-17T23:55:28.989578+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIZ2HJPLJZ4J","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIZ2HJPLJZ4JY5OL","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIZ2HJPL","created_at":"2026-05-18T12:32:13.499390+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/AIZ2HJPLJZ4JY5OLASZELUPVQA","json":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA.json","graph_json":"https://pith.science/api/pith-number/AIZ2HJPLJZ4JY5OLASZELUPVQA/graph.json","events_json":"https://pith.science/api/pith-number/AIZ2HJPLJZ4JY5OLASZELUPVQA/events.json","paper":"https://pith.science/paper/AIZ2HJPL"},"agent_actions":{"view_html":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA","download_json":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA.json","view_paper":"https://pith.science/paper/AIZ2HJPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02709&json=true","fetch_graph":"https://pith.science/api/pith-number/AIZ2HJPLJZ4JY5OLASZELUPVQA/graph.json","fetch_events":"https://pith.science/api/pith-number/AIZ2HJPLJZ4JY5OLASZELUPVQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA/action/storage_attestation","attest_author":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA/action/author_attestation","sign_citation":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA/action/citation_signature","submit_replication":"https://pith.science/pith/AIZ2HJPLJZ4JY5OLASZELUPVQA/action/replication_record"}},"created_at":"2026-05-17T23:55:28.989578+00:00","updated_at":"2026-05-17T23:55:28.989578+00:00"}