{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ROH6J5D7VPH2B7N3NHKMDUFOY2","short_pith_number":"pith:ROH6J5D7","canonical_record":{"source":{"id":"1806.03536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-09T19:49:57Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"0b90bc2f38cd2020a6c152556e1930425453ef9d67a9bc02d8711edea0ed0cd0","abstract_canon_sha256":"da9ede32a1fc25ae0f08ed0d39927c06ffc5f74f4fb7751ad4681c5efcdea5a1"},"schema_version":"1.0"},"canonical_sha256":"8b8fe4f47fabcfa0fdbb69d4c1d0aec69ef34b1e8e10fec4aed71dd14039b173","source":{"kind":"arxiv","id":"1806.03536","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03536","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03536v2","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03536","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"ROH6J5D7VPH2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"ROH6J5D7VPH2B7N3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"ROH6J5D7","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ROH6J5D7VPH2B7N3NHKMDUFOY2","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-09T19:49:57Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"0b90bc2f38cd2020a6c152556e1930425453ef9d67a9bc02d8711edea0ed0cd0","abstract_canon_sha256":"da9ede32a1fc25ae0f08ed0d39927c06ffc5f74f4fb7751ad4681c5efcdea5a1"},"schema_version":"1.0"},"canonical_sha256":"8b8fe4f47fabcfa0fdbb69d4c1d0aec69ef34b1e8e10fec4aed71dd14039b173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:24.113331Z","signature_b64":"QqnXal7M3T1TDVKUSLfNfVm5kRpYEJLgOdTc87OAlTwFJ3RNUjRsChCslP2bTNep8ic88bF7mCtjiNuXJ9M/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8fe4f47fabcfa0fdbb69d4c1d0aec69ef34b1e8e10fec4aed71dd14039b173","last_reissued_at":"2026-05-18T00:12:24.112584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:24.112584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03536","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:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BE3hDXGxv1OeiSWNB+6gFWHGJYNrn+fpbtjT9rUK2fNEdDKDWx/5i1N7RJboQrn6A09zHJytsqOjdjXILu5gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:41:25.806896Z"},"content_sha256":"3a9aebac765bfcfc48bb450fc1537c00fd8a430e6a68ec0047ba96510787959e","schema_version":"1.0","event_id":"sha256:3a9aebac765bfcfc48bb450fc1537c00fd8a430e6a68ec0047ba96510787959e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ROH6J5D7VPH2B7N3NHKMDUFOY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representation Learning on Graphs with Jumping Knowledge Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chengtao Li, Ken-ichi Kawarabayashi, Keyulu Xu, Stefanie Jegelka, Tomohiro Sonobe, Yonglong Tian","submitted_at":"2018-06-09T19:49:57Z","abstract_excerpt":"Recent deep learning approaches for representation learning on graphs follow a neighborhood aggregation procedure. We analyze some important properties of these models, and propose a strategy to overcome those. In particular, the range of \"neighboring\" nodes that a node's representation draws from strongly depends on the graph structure, analogous to the spread of a random walk. To adapt to local neighborhood properties and tasks, we explore an architecture -- jumping knowledge (JK) networks -- that flexibly leverages, for each node, different neighborhood ranges to enable better structure-awa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03536","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:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FYLq7X574wpuA5su5mR8WVh+4KaEEz1sbKI1n4AF172KVkxOwzZ6FfzdvDiHeVBwwuNyHZ8F4JYl2u64LeGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:41:25.807651Z"},"content_sha256":"dc19dad34df46eac22c590d9b30073509cc243959b3347de057ac17acf3e9a08","schema_version":"1.0","event_id":"sha256:dc19dad34df46eac22c590d9b30073509cc243959b3347de057ac17acf3e9a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/bundle.json","state_url":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/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-26T16:41:25Z","links":{"resolver":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2","bundle":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/bundle.json","state":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ROH6J5D7VPH2B7N3NHKMDUFOY2","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":"da9ede32a1fc25ae0f08ed0d39927c06ffc5f74f4fb7751ad4681c5efcdea5a1","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-09T19:49:57Z","title_canon_sha256":"0b90bc2f38cd2020a6c152556e1930425453ef9d67a9bc02d8711edea0ed0cd0"},"schema_version":"1.0","source":{"id":"1806.03536","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03536","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03536v2","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03536","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"ROH6J5D7VPH2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"ROH6J5D7VPH2B7N3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"ROH6J5D7","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:dc19dad34df46eac22c590d9b30073509cc243959b3347de057ac17acf3e9a08","target":"graph","created_at":"2026-05-18T00:12: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":"Recent deep learning approaches for representation learning on graphs follow a neighborhood aggregation procedure. We analyze some important properties of these models, and propose a strategy to overcome those. In particular, the range of \"neighboring\" nodes that a node's representation draws from strongly depends on the graph structure, analogous to the spread of a random walk. To adapt to local neighborhood properties and tasks, we explore an architecture -- jumping knowledge (JK) networks -- that flexibly leverages, for each node, different neighborhood ranges to enable better structure-awa","authors_text":"Chengtao Li, Ken-ichi Kawarabayashi, Keyulu Xu, Stefanie Jegelka, Tomohiro Sonobe, Yonglong Tian","cross_cats":["cs.AI","cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-09T19:49:57Z","title":"Representation Learning on Graphs with Jumping Knowledge Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03536","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:3a9aebac765bfcfc48bb450fc1537c00fd8a430e6a68ec0047ba96510787959e","target":"record","created_at":"2026-05-18T00:12: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":"da9ede32a1fc25ae0f08ed0d39927c06ffc5f74f4fb7751ad4681c5efcdea5a1","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-09T19:49:57Z","title_canon_sha256":"0b90bc2f38cd2020a6c152556e1930425453ef9d67a9bc02d8711edea0ed0cd0"},"schema_version":"1.0","source":{"id":"1806.03536","kind":"arxiv","version":2}},"canonical_sha256":"8b8fe4f47fabcfa0fdbb69d4c1d0aec69ef34b1e8e10fec4aed71dd14039b173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b8fe4f47fabcfa0fdbb69d4c1d0aec69ef34b1e8e10fec4aed71dd14039b173","first_computed_at":"2026-05-18T00:12:24.112584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:24.112584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QqnXal7M3T1TDVKUSLfNfVm5kRpYEJLgOdTc87OAlTwFJ3RNUjRsChCslP2bTNep8ic88bF7mCtjiNuXJ9M/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:24.113331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03536","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a9aebac765bfcfc48bb450fc1537c00fd8a430e6a68ec0047ba96510787959e","sha256:dc19dad34df46eac22c590d9b30073509cc243959b3347de057ac17acf3e9a08"],"state_sha256":"7c38092bb5c5b56c2986ae3454d4c6ab910981e6935d36bf974829ed5980712b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZ+NF6rgYMuEgzyPX+HyBiWn9YwiDe1NwIk5cVvG3QtS6KplEzNmiDi+LPdPSe1RX0n1dg6/1Z48icnArTuRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:41:25.811504Z","bundle_sha256":"7092eded6cbb911f5b1465a10da7a4bbf3b3bd60f3c539b6000b359d88987d8d"}}