{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NR6YOHWP42MWPMZDAXOUF3GUFO","short_pith_number":"pith:NR6YOHWP","canonical_record":{"source":{"id":"1706.09916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-29T18:33:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c647c7e3e96dbf78c67db35ac71600c91f39b8ece0bead203f16fc3764f2d28c","abstract_canon_sha256":"7de6bba76582c97e249cda55e7650fdd2e4c3b5e982da0e777254ebfedfb4a85"},"schema_version":"1.0"},"canonical_sha256":"6c7d871ecfe69967b32305dd42ecd42b8c597fb17b2addf7ac5aa39e56d7cb70","source":{"kind":"arxiv","id":"1706.09916","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09916","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09916v2","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09916","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"pith_short_12","alias_value":"NR6YOHWP42MW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NR6YOHWP42MWPMZD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NR6YOHWP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NR6YOHWP42MWPMZDAXOUF3GUFO","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-29T18:33:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c647c7e3e96dbf78c67db35ac71600c91f39b8ece0bead203f16fc3764f2d28c","abstract_canon_sha256":"7de6bba76582c97e249cda55e7650fdd2e4c3b5e982da0e777254ebfedfb4a85"},"schema_version":"1.0"},"canonical_sha256":"6c7d871ecfe69967b32305dd42ecd42b8c597fb17b2addf7ac5aa39e56d7cb70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:25.625865Z","signature_b64":"PyVevZ652LOYZmPI/TS4HLel3TrYsPpyu89+YnieUM2i75ryY2uF7A4VF+/e38SCfhbpKzFyDv/OHM8ZaJZtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c7d871ecfe69967b32305dd42ecd42b8c597fb17b2addf7ac5aa39e56d7cb70","last_reissued_at":"2026-05-18T00:32:25.625268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:25.625268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09916","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-18T00:32:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKuD9rqU/h1ofwt2L8cKHbUrLHOF/QLRDJb/6Kt5THP5PvJRPLGaCIFt2HeqHHjGu50GX5lKR3424eFy93AVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:35:50.485162Z"},"content_sha256":"f2e5e4c40ed06706759fcb2f49dac459825a24d33fe4cbd7cee2b9a3373f5cc1","schema_version":"1.0","event_id":"sha256:f2e5e4c40ed06706759fcb2f49dac459825a24d33fe4cbd7cee2b9a3373f5cc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NR6YOHWP42MWPMZDAXOUF3GUFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Convolution: A High-Order and Adaptive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Xiaocheng Li, Zhenpeng Zhou","submitted_at":"2017-06-29T18:33:06Z","abstract_excerpt":"In this paper, we presented a novel convolutional neural network framework for graph modeling, with the introduction of two new modules specially designed for graph-structured data: the $k$-th order convolution operator and the adaptive filtering module. Importantly, our framework of High-order and Adaptive Graph Convolutional Network (HA-GCN) is a general-purposed architecture that fits various applications on both node and graph centrics, as well as graph generative models. We conducted extensive experiments on demonstrating the advantages of our framework. Particularly, our HA-GCN outperfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09916","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-18T00:32:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULd8Xe3VaR0QG3PVyZT/lyVXzwPWIG1BFQIM8twAZGuO+iEA7mEiwxh7RV6SAIBfrxEJK5RIU2SZHerddN+kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:35:50.485527Z"},"content_sha256":"1a76d6e86ab23e3c3d8b39c6d0f6729ddc54da4e64611f8d2f9a9a9de49a64af","schema_version":"1.0","event_id":"sha256:1a76d6e86ab23e3c3d8b39c6d0f6729ddc54da4e64611f8d2f9a9a9de49a64af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR6YOHWP42MWPMZDAXOUF3GUFO/bundle.json","state_url":"https://pith.science/pith/NR6YOHWP42MWPMZDAXOUF3GUFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR6YOHWP42MWPMZDAXOUF3GUFO/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-31T07:35:50Z","links":{"resolver":"https://pith.science/pith/NR6YOHWP42MWPMZDAXOUF3GUFO","bundle":"https://pith.science/pith/NR6YOHWP42MWPMZDAXOUF3GUFO/bundle.json","state":"https://pith.science/pith/NR6YOHWP42MWPMZDAXOUF3GUFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR6YOHWP42MWPMZDAXOUF3GUFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NR6YOHWP42MWPMZDAXOUF3GUFO","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":"7de6bba76582c97e249cda55e7650fdd2e4c3b5e982da0e777254ebfedfb4a85","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-29T18:33:06Z","title_canon_sha256":"c647c7e3e96dbf78c67db35ac71600c91f39b8ece0bead203f16fc3764f2d28c"},"schema_version":"1.0","source":{"id":"1706.09916","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09916","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09916v2","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09916","created_at":"2026-05-18T00:32:25Z"},{"alias_kind":"pith_short_12","alias_value":"NR6YOHWP42MW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NR6YOHWP42MWPMZD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NR6YOHWP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:1a76d6e86ab23e3c3d8b39c6d0f6729ddc54da4e64611f8d2f9a9a9de49a64af","target":"graph","created_at":"2026-05-18T00:32:25Z","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":"In this paper, we presented a novel convolutional neural network framework for graph modeling, with the introduction of two new modules specially designed for graph-structured data: the $k$-th order convolution operator and the adaptive filtering module. Importantly, our framework of High-order and Adaptive Graph Convolutional Network (HA-GCN) is a general-purposed architecture that fits various applications on both node and graph centrics, as well as graph generative models. We conducted extensive experiments on demonstrating the advantages of our framework. Particularly, our HA-GCN outperfor","authors_text":"Xiaocheng Li, Zhenpeng Zhou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-29T18:33:06Z","title":"Graph Convolution: A High-Order and Adaptive Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09916","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:f2e5e4c40ed06706759fcb2f49dac459825a24d33fe4cbd7cee2b9a3373f5cc1","target":"record","created_at":"2026-05-18T00:32:25Z","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":"7de6bba76582c97e249cda55e7650fdd2e4c3b5e982da0e777254ebfedfb4a85","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-29T18:33:06Z","title_canon_sha256":"c647c7e3e96dbf78c67db35ac71600c91f39b8ece0bead203f16fc3764f2d28c"},"schema_version":"1.0","source":{"id":"1706.09916","kind":"arxiv","version":2}},"canonical_sha256":"6c7d871ecfe69967b32305dd42ecd42b8c597fb17b2addf7ac5aa39e56d7cb70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c7d871ecfe69967b32305dd42ecd42b8c597fb17b2addf7ac5aa39e56d7cb70","first_computed_at":"2026-05-18T00:32:25.625268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:25.625268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PyVevZ652LOYZmPI/TS4HLel3TrYsPpyu89+YnieUM2i75ryY2uF7A4VF+/e38SCfhbpKzFyDv/OHM8ZaJZtAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:25.625865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09916","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2e5e4c40ed06706759fcb2f49dac459825a24d33fe4cbd7cee2b9a3373f5cc1","sha256:1a76d6e86ab23e3c3d8b39c6d0f6729ddc54da4e64611f8d2f9a9a9de49a64af"],"state_sha256":"b8b197957a593f87f88e71c032e6b09229932e2e6786ed28be31fa3f7766866b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmnQFFD/okoYjUJ1TypyzMBYryGBaQKJMZ418WafLbEtES8ppfXchyH2SYA9X8+qOua826nTiCzpqLWql3J/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:35:50.487941Z","bundle_sha256":"177b72a9194cbb7e6558b8ee89a0b2d44c502a04c94bd8e32b8271573fed2394"}}