{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Y3QLWGRT5L4RGM66O5YAH5RJKK","short_pith_number":"pith:Y3QLWGRT","schema_version":"1.0","canonical_sha256":"c6e0bb1a33eaf91333de777003f62952bc21cda75323cb99655ae7f552452bef","source":{"kind":"arxiv","id":"2311.12644","version":1},"attestation_state":"computed","paper":{"title":"Careful Selection and Thoughtful Discarding: Graph Explicit Pooling Utilizing Discarded Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Du, Chuang Liu, Jia Wu, kuang Gao, Wenbin Hu, Wenhang Yu, Xueqi Ma, Yibing Zhan","submitted_at":"2023-11-21T14:44:51Z","abstract_excerpt":"Graph pooling has been increasingly recognized as crucial for Graph Neural Networks (GNNs) to facilitate hierarchical graph representation learning. Existing graph pooling methods commonly consist of two stages: selecting top-ranked nodes and discarding the remaining to construct coarsened graph representations. However, this paper highlights two key issues with these methods: 1) The process of selecting nodes to discard frequently employs additional Graph Convolutional Networks or Multilayer Perceptrons, lacking a thorough evaluation of each node's impact on the final graph representation and"},"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":"2311.12644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-21T14:44:51Z","cross_cats_sorted":[],"title_canon_sha256":"419bbc0074855b416adcfc29e8570dfdc54c51f4274a0afce4334c2608714313","abstract_canon_sha256":"5ca748c9ae731562dd717464baf9c755dc4d8144e04bca63733593b3cb8bb36b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:08.322779Z","signature_b64":"YsY0TDnO+pG6ul+ybHMV5icAzCSjiGzjAofjZ43seCUzciLvQAgBY1s+28oOug/bbkk5lF6R1b9Xl03bYhjTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6e0bb1a33eaf91333de777003f62952bc21cda75323cb99655ae7f552452bef","last_reissued_at":"2026-07-05T07:15:08.322222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:08.322222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Careful Selection and Thoughtful Discarding: Graph Explicit Pooling Utilizing Discarded Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Du, Chuang Liu, Jia Wu, kuang Gao, Wenbin Hu, Wenhang Yu, Xueqi Ma, Yibing Zhan","submitted_at":"2023-11-21T14:44:51Z","abstract_excerpt":"Graph pooling has been increasingly recognized as crucial for Graph Neural Networks (GNNs) to facilitate hierarchical graph representation learning. Existing graph pooling methods commonly consist of two stages: selecting top-ranked nodes and discarding the remaining to construct coarsened graph representations. However, this paper highlights two key issues with these methods: 1) The process of selecting nodes to discard frequently employs additional Graph Convolutional Networks or Multilayer Perceptrons, lacking a thorough evaluation of each node's impact on the final graph representation and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12644","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/2311.12644/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":"2311.12644","created_at":"2026-07-05T07:15:08.322285+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.12644v1","created_at":"2026-07-05T07:15:08.322285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12644","created_at":"2026-07-05T07:15:08.322285+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3QLWGRT5L4R","created_at":"2026-07-05T07:15:08.322285+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3QLWGRT5L4RGM66","created_at":"2026-07-05T07:15:08.322285+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3QLWGRT","created_at":"2026-07-05T07:15:08.322285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30101","citing_title":"SIR: Structured Image Representations for Explainable Robot Learning","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK","json":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK.json","graph_json":"https://pith.science/api/pith-number/Y3QLWGRT5L4RGM66O5YAH5RJKK/graph.json","events_json":"https://pith.science/api/pith-number/Y3QLWGRT5L4RGM66O5YAH5RJKK/events.json","paper":"https://pith.science/paper/Y3QLWGRT"},"agent_actions":{"view_html":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK","download_json":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK.json","view_paper":"https://pith.science/paper/Y3QLWGRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.12644&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3QLWGRT5L4RGM66O5YAH5RJKK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3QLWGRT5L4RGM66O5YAH5RJKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK/action/storage_attestation","attest_author":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK/action/author_attestation","sign_citation":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK/action/citation_signature","submit_replication":"https://pith.science/pith/Y3QLWGRT5L4RGM66O5YAH5RJKK/action/replication_record"}},"created_at":"2026-07-05T07:15:08.322285+00:00","updated_at":"2026-07-05T07:15:08.322285+00:00"}