{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LIJFW2GD2BKAV34HWCLF53I7MM","short_pith_number":"pith:LIJFW2GD","schema_version":"1.0","canonical_sha256":"5a125b68c3d0540aef87b0965eed1f6335675502d25153a7bd62a35990b5a592","source":{"kind":"arxiv","id":"1811.08270","version":2},"attestation_state":"computed","paper":{"title":"Graph Convolutional Neural Networks via Motif-based Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Peng, Jianxin Li, Philip S. Yu, Qiran Gong, Senzhang Wang, Yuanxing Ning","submitted_at":"2018-11-11T14:15:23Z","abstract_excerpt":"Many real-world problems can be represented as graph-based learning problems. In this paper, we propose a novel framework for learning spatial and attentional convolution neural networks on arbitrary graphs. Different from previous convolutional neural networks on graphs, we first design a motif-matching guided subgraph normalization method to capture neighborhood information. Then we implement subgraph-level self-attentional layers to learn different importances from different subgraphs to solve graph classification problems. Analogous to image-based attentional convolution networks that oper"},"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":"1811.08270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T14:15:23Z","cross_cats_sorted":[],"title_canon_sha256":"0703409870ec1e6591c92e62aff48fe317ab75da4f1de859107c0739cf1f0eb0","abstract_canon_sha256":"d67876a7ba17b1d4afff32c9e5c43a94d797fe1a0f31e17f9349e60801640d21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:51.520732Z","signature_b64":"c8ID9lo2wSvgEPc6EL+iuCHm47+37vDB7XXkeVDiPO3Q2nxD0kXdJoWtGaT5HrCVpBadFB/MtUcI6YhwMPLcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a125b68c3d0540aef87b0965eed1f6335675502d25153a7bd62a35990b5a592","last_reissued_at":"2026-05-17T23:52:51.520032Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:51.520032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Convolutional Neural Networks via Motif-based Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Peng, Jianxin Li, Philip S. Yu, Qiran Gong, Senzhang Wang, Yuanxing Ning","submitted_at":"2018-11-11T14:15:23Z","abstract_excerpt":"Many real-world problems can be represented as graph-based learning problems. In this paper, we propose a novel framework for learning spatial and attentional convolution neural networks on arbitrary graphs. Different from previous convolutional neural networks on graphs, we first design a motif-matching guided subgraph normalization method to capture neighborhood information. Then we implement subgraph-level self-attentional layers to learn different importances from different subgraphs to solve graph classification problems. Analogous to image-based attentional convolution networks that oper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08270","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":"1811.08270","created_at":"2026-05-17T23:52:51.520141+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08270v2","created_at":"2026-05-17T23:52:51.520141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08270","created_at":"2026-05-17T23:52:51.520141+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIJFW2GD2BKA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIJFW2GD2BKAV34H","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIJFW2GD","created_at":"2026-05-18T12:32:37.024351+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/LIJFW2GD2BKAV34HWCLF53I7MM","json":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM.json","graph_json":"https://pith.science/api/pith-number/LIJFW2GD2BKAV34HWCLF53I7MM/graph.json","events_json":"https://pith.science/api/pith-number/LIJFW2GD2BKAV34HWCLF53I7MM/events.json","paper":"https://pith.science/paper/LIJFW2GD"},"agent_actions":{"view_html":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM","download_json":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM.json","view_paper":"https://pith.science/paper/LIJFW2GD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08270&json=true","fetch_graph":"https://pith.science/api/pith-number/LIJFW2GD2BKAV34HWCLF53I7MM/graph.json","fetch_events":"https://pith.science/api/pith-number/LIJFW2GD2BKAV34HWCLF53I7MM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/action/storage_attestation","attest_author":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/action/author_attestation","sign_citation":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/action/citation_signature","submit_replication":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/action/replication_record"}},"created_at":"2026-05-17T23:52:51.520141+00:00","updated_at":"2026-05-17T23:52:51.520141+00:00"}