{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TKDKRHFVY3UYOF4XBAZHM3BC5U","short_pith_number":"pith:TKDKRHFV","canonical_record":{"source":{"id":"1904.02278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T00:04:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2d7170101a2208c52e1b609c03d62f2f7fb2fb3d29681d2b3997a43fe37fc68e","abstract_canon_sha256":"63c643e15a77f6af94cde3fc44f7f052f56d3eafeeea25c011e68977338b0d28"},"schema_version":"1.0"},"canonical_sha256":"9a86a89cb5c6e98717970832766c22ed2ab0a1f1eb026bc0310029df35f2b557","source":{"kind":"arxiv","id":"1904.02278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02278","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02278v1","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02278","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"TKDKRHFVY3UY","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TKDKRHFVY3UYOF4X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TKDKRHFV","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TKDKRHFVY3UYOF4XBAZHM3BC5U","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T00:04:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2d7170101a2208c52e1b609c03d62f2f7fb2fb3d29681d2b3997a43fe37fc68e","abstract_canon_sha256":"63c643e15a77f6af94cde3fc44f7f052f56d3eafeeea25c011e68977338b0d28"},"schema_version":"1.0"},"canonical_sha256":"9a86a89cb5c6e98717970832766c22ed2ab0a1f1eb026bc0310029df35f2b557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:24.062518Z","signature_b64":"XTa2hF1XOZHYNIXHZVLzqY90yMUr6/RDVTP6Go5R5+tq9uicNQLFqxgmo2pBG7h6+YjdOsC0l97g3hDnwMO7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a86a89cb5c6e98717970832766c22ed2ab0a1f1eb026bc0310029df35f2b557","last_reissued_at":"2026-05-17T23:49:24.062072Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:24.062072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02278","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-17T23:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpaWau1uEVXfFVzruS0VA1NApyeOKXoH5/fzKZlNmE9EOKKGoLlvw9XIdhsxFUmnhQHPkHMMiwoHFpnSp6oYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:13:29.878718Z"},"content_sha256":"4985f9b18dca6af8920561932f8eebe9cb3d1abd378bcee6a107ccee1200c619","schema_version":"1.0","event_id":"sha256:4985f9b18dca6af8920561932f8eebe9cb3d1abd378bcee6a107ccee1200c619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TKDKRHFVY3UYOF4XBAZHM3BC5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DAGCN: Dual Attention Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fengwen Chen, Guodong Long, Huan Huo, Jing Jiang, Shirui Pan","submitted_at":"2019-04-04T00:04:57Z","abstract_excerpt":"Graph convolutional networks (GCNs) have recently become one of the most powerful tools for graph analytics tasks in numerous applications, ranging from social networks and natural language processing to bioinformatics and chemoinformatics, thanks to their ability to capture the complex relationships between concepts. At present, the vast majority of GCNs use a neighborhood aggregation framework to learn a continuous and compact vector, then performing a pooling operation to generalize graph embedding for the classification task. These approaches have two disadvantages in the graph classificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02278","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-17T23:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQHlI/9q9j0BmXz+4yWu+++eKbD/nlSQ2kz00vx1kTLCq5f2B/Z3CHeQsonGgz1d6SVBYAAWeIsaprykvmOaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:13:29.879087Z"},"content_sha256":"e036d1fb3bb3976d720e932a052ad21bead14fe73a06bb7cd3af49fe8b35bd2d","schema_version":"1.0","event_id":"sha256:e036d1fb3bb3976d720e932a052ad21bead14fe73a06bb7cd3af49fe8b35bd2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKDKRHFVY3UYOF4XBAZHM3BC5U/bundle.json","state_url":"https://pith.science/pith/TKDKRHFVY3UYOF4XBAZHM3BC5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKDKRHFVY3UYOF4XBAZHM3BC5U/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-29T16:13:29Z","links":{"resolver":"https://pith.science/pith/TKDKRHFVY3UYOF4XBAZHM3BC5U","bundle":"https://pith.science/pith/TKDKRHFVY3UYOF4XBAZHM3BC5U/bundle.json","state":"https://pith.science/pith/TKDKRHFVY3UYOF4XBAZHM3BC5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKDKRHFVY3UYOF4XBAZHM3BC5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TKDKRHFVY3UYOF4XBAZHM3BC5U","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":"63c643e15a77f6af94cde3fc44f7f052f56d3eafeeea25c011e68977338b0d28","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T00:04:57Z","title_canon_sha256":"2d7170101a2208c52e1b609c03d62f2f7fb2fb3d29681d2b3997a43fe37fc68e"},"schema_version":"1.0","source":{"id":"1904.02278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02278","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02278v1","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02278","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"TKDKRHFVY3UY","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TKDKRHFVY3UYOF4X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TKDKRHFV","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:e036d1fb3bb3976d720e932a052ad21bead14fe73a06bb7cd3af49fe8b35bd2d","target":"graph","created_at":"2026-05-17T23:49:24Z","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":"Graph convolutional networks (GCNs) have recently become one of the most powerful tools for graph analytics tasks in numerous applications, ranging from social networks and natural language processing to bioinformatics and chemoinformatics, thanks to their ability to capture the complex relationships between concepts. At present, the vast majority of GCNs use a neighborhood aggregation framework to learn a continuous and compact vector, then performing a pooling operation to generalize graph embedding for the classification task. These approaches have two disadvantages in the graph classificat","authors_text":"Fengwen Chen, Guodong Long, Huan Huo, Jing Jiang, Shirui Pan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T00:04:57Z","title":"DAGCN: Dual Attention Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02278","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:4985f9b18dca6af8920561932f8eebe9cb3d1abd378bcee6a107ccee1200c619","target":"record","created_at":"2026-05-17T23:49:24Z","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":"63c643e15a77f6af94cde3fc44f7f052f56d3eafeeea25c011e68977338b0d28","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T00:04:57Z","title_canon_sha256":"2d7170101a2208c52e1b609c03d62f2f7fb2fb3d29681d2b3997a43fe37fc68e"},"schema_version":"1.0","source":{"id":"1904.02278","kind":"arxiv","version":1}},"canonical_sha256":"9a86a89cb5c6e98717970832766c22ed2ab0a1f1eb026bc0310029df35f2b557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a86a89cb5c6e98717970832766c22ed2ab0a1f1eb026bc0310029df35f2b557","first_computed_at":"2026-05-17T23:49:24.062072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:24.062072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XTa2hF1XOZHYNIXHZVLzqY90yMUr6/RDVTP6Go5R5+tq9uicNQLFqxgmo2pBG7h6+YjdOsC0l97g3hDnwMO7Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:24.062518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4985f9b18dca6af8920561932f8eebe9cb3d1abd378bcee6a107ccee1200c619","sha256:e036d1fb3bb3976d720e932a052ad21bead14fe73a06bb7cd3af49fe8b35bd2d"],"state_sha256":"2cec9d5df88591e47297a037078afedc09450ddd2da6366df1e3ce842ea825f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHl1pDaAOC5z/TWTi+kzz674XQ28v+towYqJyXJcm2WjuGyt+3ncTX8jJ3q30JYbUPVm8GvERASluCwPSaltCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:13:29.881667Z","bundle_sha256":"5d9e53a34364b56f5cbc5161e688757898acfa0eaa1a5ea9c5bdf5a2643045da"}}