{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TDWTTDEBHHKAE7FF3JH7N7JZK3","short_pith_number":"pith:TDWTTDEB","schema_version":"1.0","canonical_sha256":"98ed398c8139d4027ca5da4ff6fd3956e02e8ec5f0039b20788eed6e5aabed7c","source":{"kind":"arxiv","id":"1809.07697","version":1},"attestation_state":"computed","paper":{"title":"Higher-order Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Anup Rao, Eunyee Koh, John Boaz Lee, Ryan A. Rossi, Sungchul Kim, Xiangnan Kong","submitted_at":"2018-09-12T02:08:29Z","abstract_excerpt":"Following the success of deep convolutional networks in various vision and speech related tasks, researchers have started investigating generalizations of the well-known technique for graph-structured data. A recently-proposed method called Graph Convolutional Networks has been able to achieve state-of-the-art results in the task of node classification. However, since the proposed method relies on localized first-order approximations of spectral graph convolutions, it is unable to capture higher-order interactions between nodes in the graph. In this work, we propose a motif-based graph attenti"},"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.07697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-12T02:08:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dc415a5399cf3b493191ab311a9277ffdb381053cd3de526529fcf66b63ad18e","abstract_canon_sha256":"2a3c0ad68abc072d8f03128b22094ff217dea93cbbd6208ee60e2571afbffab2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:15.423971Z","signature_b64":"YgXNvKNsSAXsylyuKY7lgXlDCHhd8/TemFms1WRiPa4bzCI99NlUD9cna5qtH+ehoOZTwIviCdKQ4W712rPrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98ed398c8139d4027ca5da4ff6fd3956e02e8ec5f0039b20788eed6e5aabed7c","last_reissued_at":"2026-05-18T00:05:15.423308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:15.423308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Anup Rao, Eunyee Koh, John Boaz Lee, Ryan A. Rossi, Sungchul Kim, Xiangnan Kong","submitted_at":"2018-09-12T02:08:29Z","abstract_excerpt":"Following the success of deep convolutional networks in various vision and speech related tasks, researchers have started investigating generalizations of the well-known technique for graph-structured data. A recently-proposed method called Graph Convolutional Networks has been able to achieve state-of-the-art results in the task of node classification. However, since the proposed method relies on localized first-order approximations of spectral graph convolutions, it is unable to capture higher-order interactions between nodes in the graph. In this work, we propose a motif-based graph attenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07697","kind":"arxiv","version":1},"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.07697","created_at":"2026-05-18T00:05:15.423432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07697v1","created_at":"2026-05-18T00:05:15.423432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07697","created_at":"2026-05-18T00:05:15.423432+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDWTTDEBHHKA","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDWTTDEBHHKAE7FF","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDWTTDEB","created_at":"2026-05-18T12:32:53.628368+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/TDWTTDEBHHKAE7FF3JH7N7JZK3","json":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3.json","graph_json":"https://pith.science/api/pith-number/TDWTTDEBHHKAE7FF3JH7N7JZK3/graph.json","events_json":"https://pith.science/api/pith-number/TDWTTDEBHHKAE7FF3JH7N7JZK3/events.json","paper":"https://pith.science/paper/TDWTTDEB"},"agent_actions":{"view_html":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3","download_json":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3.json","view_paper":"https://pith.science/paper/TDWTTDEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07697&json=true","fetch_graph":"https://pith.science/api/pith-number/TDWTTDEBHHKAE7FF3JH7N7JZK3/graph.json","fetch_events":"https://pith.science/api/pith-number/TDWTTDEBHHKAE7FF3JH7N7JZK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3/action/storage_attestation","attest_author":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3/action/author_attestation","sign_citation":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3/action/citation_signature","submit_replication":"https://pith.science/pith/TDWTTDEBHHKAE7FF3JH7N7JZK3/action/replication_record"}},"created_at":"2026-05-18T00:05:15.423432+00:00","updated_at":"2026-05-18T00:05:15.423432+00:00"}