{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LIJFW2GD2BKAV34HWCLF53I7MM","short_pith_number":"pith:LIJFW2GD","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"},"canonical_sha256":"5a125b68c3d0540aef87b0965eed1f6335675502d25153a7bd62a35990b5a592","source":{"kind":"arxiv","id":"1811.08270","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08270","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08270v2","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08270","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"LIJFW2GD2BKA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIJFW2GD2BKAV34H","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIJFW2GD","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LIJFW2GD2BKAV34HWCLF53I7MM","target":"record","payload":{"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"},"canonical_sha256":"5a125b68c3d0540aef87b0965eed1f6335675502d25153a7bd62a35990b5a592","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"},"source_kind":"arxiv","source_id":"1811.08270","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-05-17T23:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPc/ufarh3TG5v6pgred8eO9uq5HJXVtM7Oxz+6sydbCB3uss+7wjjyTNot5a9PCKkX9s1efRs1YnoBr3PfRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:14:13.159758Z"},"content_sha256":"17a6700b76b340a8a909104152e799587ad0e099d6d4751b867ccd02124a636e","schema_version":"1.0","event_id":"sha256:17a6700b76b340a8a909104152e799587ad0e099d6d4751b867ccd02124a636e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LIJFW2GD2BKAV34HWCLF53I7MM","target":"graph","payload":{"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"},"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-05-17T23:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQBornZ+afh3eoV9eq9r3vy4esgCkVxWy/MCP7oV5qih46TbJcA0yp4VyCV4/Zb4vj43FwIl2XzXtA4qVn4WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:14:13.160102Z"},"content_sha256":"7f47cadb4d5e702b2a4c8136e83422eef9864a5f5b37c3c5398d191591f361ef","schema_version":"1.0","event_id":"sha256:7f47cadb4d5e702b2a4c8136e83422eef9864a5f5b37c3c5398d191591f361ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/bundle.json","state_url":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIJFW2GD2BKAV34HWCLF53I7MM/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-05-28T06:14:13Z","links":{"resolver":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM","bundle":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/bundle.json","state":"https://pith.science/pith/LIJFW2GD2BKAV34HWCLF53I7MM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIJFW2GD2BKAV34HWCLF53I7MM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LIJFW2GD2BKAV34HWCLF53I7MM","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":"d67876a7ba17b1d4afff32c9e5c43a94d797fe1a0f31e17f9349e60801640d21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T14:15:23Z","title_canon_sha256":"0703409870ec1e6591c92e62aff48fe317ab75da4f1de859107c0739cf1f0eb0"},"schema_version":"1.0","source":{"id":"1811.08270","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08270","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08270v2","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08270","created_at":"2026-05-17T23:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"LIJFW2GD2BKA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIJFW2GD2BKAV34H","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIJFW2GD","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:7f47cadb4d5e702b2a4c8136e83422eef9864a5f5b37c3c5398d191591f361ef","target":"graph","created_at":"2026-05-17T23:52:51Z","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"},"paper":{"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","authors_text":"Hao Peng, Jianxin Li, Philip S. Yu, Qiran Gong, Senzhang Wang, Yuanxing Ning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T14:15:23Z","title":"Graph Convolutional Neural Networks via Motif-based Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08270","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:17a6700b76b340a8a909104152e799587ad0e099d6d4751b867ccd02124a636e","target":"record","created_at":"2026-05-17T23:52:51Z","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":"d67876a7ba17b1d4afff32c9e5c43a94d797fe1a0f31e17f9349e60801640d21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-11T14:15:23Z","title_canon_sha256":"0703409870ec1e6591c92e62aff48fe317ab75da4f1de859107c0739cf1f0eb0"},"schema_version":"1.0","source":{"id":"1811.08270","kind":"arxiv","version":2}},"canonical_sha256":"5a125b68c3d0540aef87b0965eed1f6335675502d25153a7bd62a35990b5a592","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a125b68c3d0540aef87b0965eed1f6335675502d25153a7bd62a35990b5a592","first_computed_at":"2026-05-17T23:52:51.520032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:51.520032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c8ID9lo2wSvgEPc6EL+iuCHm47+37vDB7XXkeVDiPO3Q2nxD0kXdJoWtGaT5HrCVpBadFB/MtUcI6YhwMPLcCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:51.520732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08270","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a6700b76b340a8a909104152e799587ad0e099d6d4751b867ccd02124a636e","sha256:7f47cadb4d5e702b2a4c8136e83422eef9864a5f5b37c3c5398d191591f361ef"],"state_sha256":"f4e08a6c6164f2a8beea33fc0ca2814fd12ad2bbb654af6b4c089f4969a156a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFrljRFNJ9f33aKmR9bDA7j6H6Gy/Z9HHQX8IbfFs3AjpXT387qlmFXqM5OUHA04sL/xs/jJpQFSXpMMJLPqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:14:13.162294Z","bundle_sha256":"5244e5caae6a752b2645953d19b74dc443f78fa28ca802a870021e6dc70c43a8"}}