{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KV2IMES2MH5CQJWWE2NTX7MUPO","short_pith_number":"pith:KV2IMES2","canonical_record":{"source":{"id":"1806.00770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-03T11:15:15Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"b353861a7cc366884fd9cd53c71e36a7fb0ff34ec2289d6061767ad87c8753dc","abstract_canon_sha256":"472f86b4736aed8d7844d8aa5ed9d4e21740152fc9b440cbfb85f54e429a7328"},"schema_version":"1.0"},"canonical_sha256":"557486125a61fa2826d6269b3bfd947b816fdcf00a4c70d05f9b2fb692011e59","source":{"kind":"arxiv","id":"1806.00770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00770","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00770v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00770","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"KV2IMES2MH5C","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KV2IMES2MH5CQJWW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KV2IMES2","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KV2IMES2MH5CQJWWE2NTX7MUPO","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-03T11:15:15Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"b353861a7cc366884fd9cd53c71e36a7fb0ff34ec2289d6061767ad87c8753dc","abstract_canon_sha256":"472f86b4736aed8d7844d8aa5ed9d4e21740152fc9b440cbfb85f54e429a7328"},"schema_version":"1.0"},"canonical_sha256":"557486125a61fa2826d6269b3bfd947b816fdcf00a4c70d05f9b2fb692011e59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.500801Z","signature_b64":"NADS5RKNALE4K3Z5qXsgeoQZZXcWAy/ZHwUZ5tczLIpgTrSsWq6/2l4kyAyJynrXFLTDUA8Yf9NTaD3AcgxqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557486125a61fa2826d6269b3bfd947b816fdcf00a4c70d05f9b2fb692011e59","last_reissued_at":"2026-05-18T00:14:18.500282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.500282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00770","source_version":1,"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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUgNSCdH3qeWGu87y8AJaDItRq+IWhtKEv/wRoCMtJmy97kyTNF5m68dWMtUCWoW+sR6p3rmMM4vFThOzcFJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:27:33.965387Z"},"content_sha256":"56b649c4d75c0efbcb59e2cfc1e91030c8f8cdeb1f840df9316172be80c1a927","schema_version":"1.0","event_id":"sha256:56b649c4d75c0efbcb59e2cfc1e91030c8f8cdeb1f840df9316172be80c1a927"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KV2IMES2MH5CQJWWE2NTX7MUPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual-Primal Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksandar Bojchevski, Federico Monti, Michael M. Bronstein, Oleksandr Shchur, Or Litany, Stephan G\\\"unnemann","submitted_at":"2018-06-03T11:15:15Z","abstract_excerpt":"In recent years, there has been a surge of interest in developing deep learning methods for non-Euclidean structured data such as graphs. In this paper, we propose Dual-Primal Graph CNN, a graph convolutional architecture that alternates convolution-like operations on the graph and its dual. Our approach allows to learn both vertex- and edge features and generalizes the previous graph attention (GAT) model. We provide extensive experimental validation showing state-of-the-art results on a variety of tasks tested on established graph benchmarks, including CORA and Citeseer citation networks as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00770","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"},"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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EL6Qq2qMBv/sDNw4KVMKWsnrS2W9jela+0peq0NM9EMJvn4krPRskaDTKzw5Y+e2A9MJLIapXZbiWA5cQhyQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:27:33.965759Z"},"content_sha256":"a43486127874c280f3a767a0b800c68645590f653abd7a4f7598022e7771d6ea","schema_version":"1.0","event_id":"sha256:a43486127874c280f3a767a0b800c68645590f653abd7a4f7598022e7771d6ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KV2IMES2MH5CQJWWE2NTX7MUPO/bundle.json","state_url":"https://pith.science/pith/KV2IMES2MH5CQJWWE2NTX7MUPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KV2IMES2MH5CQJWWE2NTX7MUPO/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-23T20:27:33Z","links":{"resolver":"https://pith.science/pith/KV2IMES2MH5CQJWWE2NTX7MUPO","bundle":"https://pith.science/pith/KV2IMES2MH5CQJWWE2NTX7MUPO/bundle.json","state":"https://pith.science/pith/KV2IMES2MH5CQJWWE2NTX7MUPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KV2IMES2MH5CQJWWE2NTX7MUPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KV2IMES2MH5CQJWWE2NTX7MUPO","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":"472f86b4736aed8d7844d8aa5ed9d4e21740152fc9b440cbfb85f54e429a7328","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-03T11:15:15Z","title_canon_sha256":"b353861a7cc366884fd9cd53c71e36a7fb0ff34ec2289d6061767ad87c8753dc"},"schema_version":"1.0","source":{"id":"1806.00770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00770","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00770v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00770","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"KV2IMES2MH5C","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KV2IMES2MH5CQJWW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KV2IMES2","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:a43486127874c280f3a767a0b800c68645590f653abd7a4f7598022e7771d6ea","target":"graph","created_at":"2026-05-18T00:14:18Z","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 recent years, there has been a surge of interest in developing deep learning methods for non-Euclidean structured data such as graphs. In this paper, we propose Dual-Primal Graph CNN, a graph convolutional architecture that alternates convolution-like operations on the graph and its dual. Our approach allows to learn both vertex- and edge features and generalizes the previous graph attention (GAT) model. We provide extensive experimental validation showing state-of-the-art results on a variety of tasks tested on established graph benchmarks, including CORA and Citeseer citation networks as ","authors_text":"Aleksandar Bojchevski, Federico Monti, Michael M. Bronstein, Oleksandr Shchur, Or Litany, Stephan G\\\"unnemann","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-03T11:15:15Z","title":"Dual-Primal Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00770","kind":"arxiv","version":1},"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:56b649c4d75c0efbcb59e2cfc1e91030c8f8cdeb1f840df9316172be80c1a927","target":"record","created_at":"2026-05-18T00:14:18Z","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":"472f86b4736aed8d7844d8aa5ed9d4e21740152fc9b440cbfb85f54e429a7328","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-03T11:15:15Z","title_canon_sha256":"b353861a7cc366884fd9cd53c71e36a7fb0ff34ec2289d6061767ad87c8753dc"},"schema_version":"1.0","source":{"id":"1806.00770","kind":"arxiv","version":1}},"canonical_sha256":"557486125a61fa2826d6269b3bfd947b816fdcf00a4c70d05f9b2fb692011e59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"557486125a61fa2826d6269b3bfd947b816fdcf00a4c70d05f9b2fb692011e59","first_computed_at":"2026-05-18T00:14:18.500282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:18.500282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NADS5RKNALE4K3Z5qXsgeoQZZXcWAy/ZHwUZ5tczLIpgTrSsWq6/2l4kyAyJynrXFLTDUA8Yf9NTaD3AcgxqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:18.500801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56b649c4d75c0efbcb59e2cfc1e91030c8f8cdeb1f840df9316172be80c1a927","sha256:a43486127874c280f3a767a0b800c68645590f653abd7a4f7598022e7771d6ea"],"state_sha256":"48fcff97b2a38bc46f5d30d987018ca1f18b015f38d670bfe2b06f1cbc5f6867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5/Y5q1er0PFEuo3XgUEjoENF+iPSpCleRn6wP9RvgWfe6k4HeC7m4/qq9QbfROeD/6uqnUPtkD25vBAYcUwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:27:33.968251Z","bundle_sha256":"604660a2feff03d7651641b5a73658df4c85699018fbc0d69d268a7c4ee849e6"}}