{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:D3PVDJCJNMD5ER7QCOBLBZTINM","short_pith_number":"pith:D3PVDJCJ","schema_version":"1.0","canonical_sha256":"1edf51a4496b07d247f01382b0e6686b159b8bdcfb16a26e10d85e9617d08ace","source":{"kind":"arxiv","id":"2204.12881","version":1},"attestation_state":"computed","paper":{"title":"LiftPool: Lifting-based Graph Pooling for Hierarchical Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenglin Li, Hongkai Xiong, Junni Zou, Mingxing Xu, Wenrui Dai","submitted_at":"2022-04-27T12:38:02Z","abstract_excerpt":"Graph pooling has been increasingly considered for graph neural networks (GNNs) to facilitate hierarchical graph representation learning. Existing graph pooling methods commonly consist of two stages, i.e., selecting the top-ranked nodes and removing the rest nodes to construct a coarsened graph representation. However, local structural information of the removed nodes would be inevitably dropped in these methods, due to the inherent coupling of nodes (location) and their features (signals). In this paper, we propose an enhanced three-stage method via lifting, named LiftPool, to improve hierar"},"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":"2204.12881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-27T12:38:02Z","cross_cats_sorted":[],"title_canon_sha256":"608be873bc0a6bce227c5c867108fd4754f7ebe41b729b465892be201cb5b9b4","abstract_canon_sha256":"05e0e869b5cff6d1e9134581d9ea31d5e6f49b85f0c37bbde9b543c3c21ad28b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:23.820654Z","signature_b64":"8dHZPdtIA7DCAA8uJ+/+RF5FzYfGKULGofs69D3EFAez8QilQiukg9HhvgbAww/B4C2umvE3tJKYYpKMhOWDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1edf51a4496b07d247f01382b0e6686b159b8bdcfb16a26e10d85e9617d08ace","last_reissued_at":"2026-07-05T04:18:23.820259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:23.820259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LiftPool: Lifting-based Graph Pooling for Hierarchical Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chenglin Li, Hongkai Xiong, Junni Zou, Mingxing Xu, Wenrui Dai","submitted_at":"2022-04-27T12:38:02Z","abstract_excerpt":"Graph pooling has been increasingly considered for graph neural networks (GNNs) to facilitate hierarchical graph representation learning. Existing graph pooling methods commonly consist of two stages, i.e., selecting the top-ranked nodes and removing the rest nodes to construct a coarsened graph representation. However, local structural information of the removed nodes would be inevitably dropped in these methods, due to the inherent coupling of nodes (location) and their features (signals). In this paper, we propose an enhanced three-stage method via lifting, named LiftPool, to improve hierar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.12881","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/2204.12881/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":"2204.12881","created_at":"2026-07-05T04:18:23.820313+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.12881v1","created_at":"2026-07-05T04:18:23.820313+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.12881","created_at":"2026-07-05T04:18:23.820313+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3PVDJCJNMD5","created_at":"2026-07-05T04:18:23.820313+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3PVDJCJNMD5ER7Q","created_at":"2026-07-05T04:18:23.820313+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3PVDJCJ","created_at":"2026-07-05T04:18:23.820313+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18446","citing_title":"Mitigating Context Bias in Domain Adaptation for Object Detection using Mask Pooling","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM","json":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM.json","graph_json":"https://pith.science/api/pith-number/D3PVDJCJNMD5ER7QCOBLBZTINM/graph.json","events_json":"https://pith.science/api/pith-number/D3PVDJCJNMD5ER7QCOBLBZTINM/events.json","paper":"https://pith.science/paper/D3PVDJCJ"},"agent_actions":{"view_html":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM","download_json":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM.json","view_paper":"https://pith.science/paper/D3PVDJCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.12881&json=true","fetch_graph":"https://pith.science/api/pith-number/D3PVDJCJNMD5ER7QCOBLBZTINM/graph.json","fetch_events":"https://pith.science/api/pith-number/D3PVDJCJNMD5ER7QCOBLBZTINM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM/action/storage_attestation","attest_author":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM/action/author_attestation","sign_citation":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM/action/citation_signature","submit_replication":"https://pith.science/pith/D3PVDJCJNMD5ER7QCOBLBZTINM/action/replication_record"}},"created_at":"2026-07-05T04:18:23.820313+00:00","updated_at":"2026-07-05T04:18:23.820313+00:00"}