{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YN73XEL3CYMOEYKJNYIU5HEZYG","short_pith_number":"pith:YN73XEL3","canonical_record":{"source":{"id":"1605.05273","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T18:13:13Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"a4a30f7e72fc9ea2268dec0878b28eedfdf2e3e5b41418fe7cb4d5438ebb320a","abstract_canon_sha256":"0eb4a1ef5a2dd98e976cd9b0ff82a74705019552f7d01628b2ba582aa5ea06a1"},"schema_version":"1.0"},"canonical_sha256":"c37fbb917b1618e261496e114e9c99c1977cabac1248d464dc3d22dea9d76dee","source":{"kind":"arxiv","id":"1605.05273","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05273","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05273v4","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05273","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"YN73XEL3CYMO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YN73XEL3CYMOEYKJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YN73XEL3","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YN73XEL3CYMOEYKJNYIU5HEZYG","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05273","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T18:13:13Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"a4a30f7e72fc9ea2268dec0878b28eedfdf2e3e5b41418fe7cb4d5438ebb320a","abstract_canon_sha256":"0eb4a1ef5a2dd98e976cd9b0ff82a74705019552f7d01628b2ba582aa5ea06a1"},"schema_version":"1.0"},"canonical_sha256":"c37fbb917b1618e261496e114e9c99c1977cabac1248d464dc3d22dea9d76dee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:41.800364Z","signature_b64":"ZG25p/fWJNoknOnUvzWo+YJVg7WVII5qQfc/uuKwOo9qUIJa8Fj7HLimvwJwkpxLFtCGij0+2+VaTFBFDv3QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c37fbb917b1618e261496e114e9c99c1977cabac1248d464dc3d22dea9d76dee","last_reissued_at":"2026-05-18T01:12:41.799836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:41.799836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05273","source_version":4,"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-18T01:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AI59aL37bhHWLY3ywB1y8BB8QsqGYIKVVsoUYG0fiWTg449JJ15Djiu2lwv/CpgEjoUnEFs+6AdsPDmDO2CaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:45:23.301274Z"},"content_sha256":"7ea6f2683948abbeba100109110d4dc72250cde66b0ac3387d97a472f80f39ad","schema_version":"1.0","event_id":"sha256:7ea6f2683948abbeba100109110d4dc72250cde66b0ac3387d97a472f80f39ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YN73XEL3CYMOEYKJNYIU5HEZYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Convolutional Neural Networks for Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Konstantin Kutzkov, Mathias Niepert, Mohamed Ahmed","submitted_at":"2016-05-17T18:13:13Z","abstract_excerpt":"Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that operate on locally connected regions of the input, we present a general approach to extracting locally connected regions from graphs. Using established benchmark data sets, we demonstrate that the learned feature representations are competitive with state of the art graph kernels a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05273","kind":"arxiv","version":4},"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-18T01:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuEIFR4EucwRGog14IMbNSRwDjqpSie6kXUxCb7XIssljbBNX8zLSD3z39TvFP253J0XI6vXHN8EMyZT26cJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:45:23.301630Z"},"content_sha256":"9e1ceaead2350c9e01b1b4331e9016d59d8263ffee928498e60af18ec6245ce1","schema_version":"1.0","event_id":"sha256:9e1ceaead2350c9e01b1b4331e9016d59d8263ffee928498e60af18ec6245ce1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YN73XEL3CYMOEYKJNYIU5HEZYG/bundle.json","state_url":"https://pith.science/pith/YN73XEL3CYMOEYKJNYIU5HEZYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YN73XEL3CYMOEYKJNYIU5HEZYG/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-06-20T10:45:23Z","links":{"resolver":"https://pith.science/pith/YN73XEL3CYMOEYKJNYIU5HEZYG","bundle":"https://pith.science/pith/YN73XEL3CYMOEYKJNYIU5HEZYG/bundle.json","state":"https://pith.science/pith/YN73XEL3CYMOEYKJNYIU5HEZYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YN73XEL3CYMOEYKJNYIU5HEZYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YN73XEL3CYMOEYKJNYIU5HEZYG","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":"0eb4a1ef5a2dd98e976cd9b0ff82a74705019552f7d01628b2ba582aa5ea06a1","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T18:13:13Z","title_canon_sha256":"a4a30f7e72fc9ea2268dec0878b28eedfdf2e3e5b41418fe7cb4d5438ebb320a"},"schema_version":"1.0","source":{"id":"1605.05273","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05273","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05273v4","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05273","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"YN73XEL3CYMO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YN73XEL3CYMOEYKJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YN73XEL3","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9e1ceaead2350c9e01b1b4331e9016d59d8263ffee928498e60af18ec6245ce1","target":"graph","created_at":"2026-05-18T01:12:41Z","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":"Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that operate on locally connected regions of the input, we present a general approach to extracting locally connected regions from graphs. Using established benchmark data sets, we demonstrate that the learned feature representations are competitive with state of the art graph kernels a","authors_text":"Konstantin Kutzkov, Mathias Niepert, Mohamed Ahmed","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T18:13:13Z","title":"Learning Convolutional Neural Networks for Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05273","kind":"arxiv","version":4},"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:7ea6f2683948abbeba100109110d4dc72250cde66b0ac3387d97a472f80f39ad","target":"record","created_at":"2026-05-18T01:12:41Z","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":"0eb4a1ef5a2dd98e976cd9b0ff82a74705019552f7d01628b2ba582aa5ea06a1","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-17T18:13:13Z","title_canon_sha256":"a4a30f7e72fc9ea2268dec0878b28eedfdf2e3e5b41418fe7cb4d5438ebb320a"},"schema_version":"1.0","source":{"id":"1605.05273","kind":"arxiv","version":4}},"canonical_sha256":"c37fbb917b1618e261496e114e9c99c1977cabac1248d464dc3d22dea9d76dee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c37fbb917b1618e261496e114e9c99c1977cabac1248d464dc3d22dea9d76dee","first_computed_at":"2026-05-18T01:12:41.799836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:41.799836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZG25p/fWJNoknOnUvzWo+YJVg7WVII5qQfc/uuKwOo9qUIJa8Fj7HLimvwJwkpxLFtCGij0+2+VaTFBFDv3QDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:41.800364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05273","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ea6f2683948abbeba100109110d4dc72250cde66b0ac3387d97a472f80f39ad","sha256:9e1ceaead2350c9e01b1b4331e9016d59d8263ffee928498e60af18ec6245ce1"],"state_sha256":"fbf64c70d618ddce0bc166247b47631aa2cec9190f0ccb2c77163a989c99d3b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yE622V5d5664ih+JYA0wx/m/xP47dgqNbgg5dz4HikL5kG6sZKSzTSFXXH9XGQfE1JaFZeAJYCngyqmh8tFhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:45:23.303771Z","bundle_sha256":"81e1111eb4d8f598c86f5874050c6beba5dff06c92247de1da78f5708207ac24"}}