{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ROH6J5D7VPH2B7N3NHKMDUFOY2","short_pith_number":"pith:ROH6J5D7","schema_version":"1.0","canonical_sha256":"8b8fe4f47fabcfa0fdbb69d4c1d0aec69ef34b1e8e10fec4aed71dd14039b173","source":{"kind":"arxiv","id":"1806.03536","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.03536","created_at":"2026-05-18T00:12:24.112709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03536v2","created_at":"2026-05-18T00:12:24.112709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03536","created_at":"2026-05-18T00:12:24.112709+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROH6J5D7VPH2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROH6J5D7VPH2B7N3","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROH6J5D7","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.12330","citing_title":"Graph Star Net for Generalized Multi-Task Learning","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2","json":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2.json","graph_json":"https://pith.science/api/pith-number/ROH6J5D7VPH2B7N3NHKMDUFOY2/graph.json","events_json":"https://pith.science/api/pith-number/ROH6J5D7VPH2B7N3NHKMDUFOY2/events.json","paper":"https://pith.science/paper/ROH6J5D7"},"agent_actions":{"view_html":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2","download_json":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2.json","view_paper":"https://pith.science/paper/ROH6J5D7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03536&json=true","fetch_graph":"https://pith.science/api/pith-number/ROH6J5D7VPH2B7N3NHKMDUFOY2/graph.json","fetch_events":"https://pith.science/api/pith-number/ROH6J5D7VPH2B7N3NHKMDUFOY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/action/storage_attestation","attest_author":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/action/author_attestation","sign_citation":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/action/citation_signature","submit_replication":"https://pith.science/pith/ROH6J5D7VPH2B7N3NHKMDUFOY2/action/replication_record"}},"created_at":"2026-05-18T00:12:24.112709+00:00","updated_at":"2026-05-18T00:12:24.112709+00:00"}