{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NS2TQHMYEB6BSMHKBUNFQFINPN","short_pith_number":"pith:NS2TQHMY","schema_version":"1.0","canonical_sha256":"6cb5381d98207c1930ea0d1a58150d7b4f860b083e397c5f513d88c0d60fac55","source":{"kind":"arxiv","id":"1905.10990","version":1},"attestation_state":"computed","paper":{"title":"Edge Contraction Pooling for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Frederik Diehl","submitted_at":"2019-05-27T06:18:24Z","abstract_excerpt":"Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups of nodes instead of single nodes. To close this gap, we propose a graph pooling layer relying on the notion of edge contraction: EdgePool learns a localized and sparse hard pooling transform. We show that EdgePool outperforms alternative pooling methods, can be easily integrated into most GNN models, and improves performance on both node and graph classification."},"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":"1905.10990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T06:18:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cd616ce2daec3d44139d0c0ba159b394be1a52a0de42a2687470ce6ba310e1e2","abstract_canon_sha256":"b857cd97e969642b3ed0c638aea059a687e12865e2fbe91d184f3252711883c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.206036Z","signature_b64":"03P4AlFar/EzU5/lcjMMtbPSlnJ2oJItV9O6LpUf1h0NMUNcPg0OnCND+r2kDaHdY0ZBESGrdRKMXz5k/ekLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cb5381d98207c1930ea0d1a58150d7b4f860b083e397c5f513d88c0d60fac55","last_reissued_at":"2026-05-17T23:45:03.205514Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.205514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge Contraction Pooling for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Frederik Diehl","submitted_at":"2019-05-27T06:18:24Z","abstract_excerpt":"Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups of nodes instead of single nodes. To close this gap, we propose a graph pooling layer relying on the notion of edge contraction: EdgePool learns a localized and sparse hard pooling transform. We show that EdgePool outperforms alternative pooling methods, can be easily integrated into most GNN models, and improves performance on both node and graph classification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10990","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.10990","created_at":"2026-05-17T23:45:03.205591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10990v1","created_at":"2026-05-17T23:45:03.205591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10990","created_at":"2026-05-17T23:45:03.205591+00:00"},{"alias_kind":"pith_short_12","alias_value":"NS2TQHMYEB6B","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NS2TQHMYEB6BSMHK","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NS2TQHMY","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2501.00773","citing_title":"OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2601.01123","citing_title":"Learning from Historical Activations in Graph Neural Networks","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2512.12642","citing_title":"Torch Geometric Pool: the PyTorch library for pooling in Graph Neural Networks","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10975","citing_title":"Hierarchical Multi-Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing Mitigation","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06250","citing_title":"The Role of Node Features in Graph Pooling","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN","json":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN.json","graph_json":"https://pith.science/api/pith-number/NS2TQHMYEB6BSMHKBUNFQFINPN/graph.json","events_json":"https://pith.science/api/pith-number/NS2TQHMYEB6BSMHKBUNFQFINPN/events.json","paper":"https://pith.science/paper/NS2TQHMY"},"agent_actions":{"view_html":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN","download_json":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN.json","view_paper":"https://pith.science/paper/NS2TQHMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10990&json=true","fetch_graph":"https://pith.science/api/pith-number/NS2TQHMYEB6BSMHKBUNFQFINPN/graph.json","fetch_events":"https://pith.science/api/pith-number/NS2TQHMYEB6BSMHKBUNFQFINPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN/action/storage_attestation","attest_author":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN/action/author_attestation","sign_citation":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN/action/citation_signature","submit_replication":"https://pith.science/pith/NS2TQHMYEB6BSMHKBUNFQFINPN/action/replication_record"}},"created_at":"2026-05-17T23:45:03.205591+00:00","updated_at":"2026-05-17T23:45:03.205591+00:00"}