{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I5F7MO4MDS4WRO3BRD3XJNCT4E","short_pith_number":"pith:I5F7MO4M","schema_version":"1.0","canonical_sha256":"474bf63b8c1cb968bb6188f774b453e129524f4c7a564c7b9196ad28c0158bc8","source":{"kind":"arxiv","id":"1806.08804","version":4},"attestation_state":"computed","paper":{"title":"Hierarchical Graph Representation Learning with Differentiable Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Morris, Jiaxuan You, Jure Leskovec, Rex Ying, William L. Hamilton, Xiang Ren","submitted_at":"2018-06-22T18:04:46Z","abstract_excerpt":"Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node classification and link prediction. However, current GNN methods are inherently flat and do not learn hierarchical representations of graphs---a limitation that is especially problematic for the task of graph classification, where the goal is to predict the label associated with an entire graph. Here we propose DiffPool, a differentiable graph pooling module that can generate hierarchical r"},"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.08804","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T18:04:46Z","cross_cats_sorted":["cs.NE","cs.SI","stat.ML"],"title_canon_sha256":"143eae5e9f0c51b7511e9a773dbd63bae94173b9a75048fa74dace76c15da4b0","abstract_canon_sha256":"62efd6d6b447f9b289b97be11f76ae0b922d08d1527da439378296d543ec2cbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:09.475010Z","signature_b64":"fVSD4vzqfAtPZUzryXAnwbWMx4OByNFPJlIwdFKlJRmoGwQRrr1YP98XbVc1OmOwFSsRn/c7PT8zsJYli4dRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"474bf63b8c1cb968bb6188f774b453e129524f4c7a564c7b9196ad28c0158bc8","last_reissued_at":"2026-05-17T23:53:09.474479Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:09.474479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Graph Representation Learning with Differentiable Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Morris, Jiaxuan You, Jure Leskovec, Rex Ying, William L. Hamilton, Xiang Ren","submitted_at":"2018-06-22T18:04:46Z","abstract_excerpt":"Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node classification and link prediction. However, current GNN methods are inherently flat and do not learn hierarchical representations of graphs---a limitation that is especially problematic for the task of graph classification, where the goal is to predict the label associated with an entire graph. Here we propose DiffPool, a differentiable graph pooling module that can generate hierarchical r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08804","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.08804","created_at":"2026-05-17T23:53:09.474565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08804v4","created_at":"2026-05-17T23:53:09.474565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08804","created_at":"2026-05-17T23:53:09.474565+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5F7MO4MDS4W","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5F7MO4MDS4WRO3B","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5F7MO4M","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E","json":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E.json","graph_json":"https://pith.science/api/pith-number/I5F7MO4MDS4WRO3BRD3XJNCT4E/graph.json","events_json":"https://pith.science/api/pith-number/I5F7MO4MDS4WRO3BRD3XJNCT4E/events.json","paper":"https://pith.science/paper/I5F7MO4M"},"agent_actions":{"view_html":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E","download_json":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E.json","view_paper":"https://pith.science/paper/I5F7MO4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08804&json=true","fetch_graph":"https://pith.science/api/pith-number/I5F7MO4MDS4WRO3BRD3XJNCT4E/graph.json","fetch_events":"https://pith.science/api/pith-number/I5F7MO4MDS4WRO3BRD3XJNCT4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E/action/storage_attestation","attest_author":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E/action/author_attestation","sign_citation":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E/action/citation_signature","submit_replication":"https://pith.science/pith/I5F7MO4MDS4WRO3BRD3XJNCT4E/action/replication_record"}},"created_at":"2026-05-17T23:53:09.474565+00:00","updated_at":"2026-05-17T23:53:09.474565+00:00"}