{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:O2UFNGKPCD6HMZPXYY5S4TUQRZ","short_pith_number":"pith:O2UFNGKP","schema_version":"1.0","canonical_sha256":"76a856994f10fc7665f7c63b2e4e908e739c6d2c0e64b6d68df73d25b7e42922","source":{"kind":"arxiv","id":"2209.03473","version":1},"attestation_state":"computed","paper":{"title":"Higher-order Clustering and Pooling for Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexandre Duval, Fragkiskos Malliaros","submitted_at":"2022-09-02T09:17:10Z","abstract_excerpt":"Graph Neural Networks achieve state-of-the-art performance on a plethora of graph classification tasks, especially due to pooling operators, which aggregate learned node embeddings hierarchically into a final graph representation. However, they are not only questioned by recent work showing on par performance with random pooling, but also ignore completely higher-order connectivity patterns. To tackle this issue, we propose HoscPool, a clustering-based graph pooling operator that captures higher-order information hierarchically, leading to richer graph representations. In fact, we learn a prob"},"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":"2209.03473","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-02T09:17:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"284a56c0a0c92b73738c806f0b3dd811983abd9d36f2a144a8dbfbbe9b81e757","abstract_canon_sha256":"5331d731ef04f0b23640d7624f13df1f547be0c6616a51f4a3bd125e68411554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:42.255966Z","signature_b64":"DyIW95qWp9kGvdbrlgW7SrSoLFA/LPz+j+dZG8YnbhATNB0Oye4XWr5Em0437rMkWy8+BCsE84zY1IkfxElvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a856994f10fc7665f7c63b2e4e908e739c6d2c0e64b6d68df73d25b7e42922","last_reissued_at":"2026-07-05T04:55:42.255442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:42.255442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order Clustering and Pooling for Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexandre Duval, Fragkiskos Malliaros","submitted_at":"2022-09-02T09:17:10Z","abstract_excerpt":"Graph Neural Networks achieve state-of-the-art performance on a plethora of graph classification tasks, especially due to pooling operators, which aggregate learned node embeddings hierarchically into a final graph representation. However, they are not only questioned by recent work showing on par performance with random pooling, but also ignore completely higher-order connectivity patterns. To tackle this issue, we propose HoscPool, a clustering-based graph pooling operator that captures higher-order information hierarchically, leading to richer graph representations. In fact, we learn a prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03473","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.03473/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.03473","created_at":"2026-07-05T04:55:42.255504+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.03473v1","created_at":"2026-07-05T04:55:42.255504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03473","created_at":"2026-07-05T04:55:42.255504+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2UFNGKPCD6H","created_at":"2026-07-05T04:55:42.255504+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2UFNGKPCD6HMZPX","created_at":"2026-07-05T04:55:42.255504+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2UFNGKP","created_at":"2026-07-05T04:55:42.255504+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/O2UFNGKPCD6HMZPXYY5S4TUQRZ","json":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ.json","graph_json":"https://pith.science/api/pith-number/O2UFNGKPCD6HMZPXYY5S4TUQRZ/graph.json","events_json":"https://pith.science/api/pith-number/O2UFNGKPCD6HMZPXYY5S4TUQRZ/events.json","paper":"https://pith.science/paper/O2UFNGKP"},"agent_actions":{"view_html":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ","download_json":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ.json","view_paper":"https://pith.science/paper/O2UFNGKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.03473&json=true","fetch_graph":"https://pith.science/api/pith-number/O2UFNGKPCD6HMZPXYY5S4TUQRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/O2UFNGKPCD6HMZPXYY5S4TUQRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ/action/storage_attestation","attest_author":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ/action/author_attestation","sign_citation":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ/action/citation_signature","submit_replication":"https://pith.science/pith/O2UFNGKPCD6HMZPXYY5S4TUQRZ/action/replication_record"}},"created_at":"2026-07-05T04:55:42.255504+00:00","updated_at":"2026-07-05T04:55:42.255504+00:00"}