{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QFCQQAG5AGC75ZVHVELE4OZXOY","short_pith_number":"pith:QFCQQAG5","canonical_record":{"source":{"id":"2006.11118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-19T13:09:44Z","cross_cats_sorted":["eess.SP","stat.ML"],"title_canon_sha256":"49fbe775a08cf4c3c417f5343947566d2db6af1f02feba27f4ef45d4c2f1e8af","abstract_canon_sha256":"d0afd28c6f4bb37fcfd74dd542006b452352e110acafacdc2a6c7ad2bccb542f"},"schema_version":"1.0"},"canonical_sha256":"81450800dd0185fee6a7a9164e3b37763045f04283173bc058dae7c6caa5b508","source":{"kind":"arxiv","id":"2006.11118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.11118","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"arxiv_version","alias_value":"2006.11118v1","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.11118","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"pith_short_12","alias_value":"QFCQQAG5AGC7","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"pith_short_16","alias_value":"QFCQQAG5AGC75ZVH","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"pith_short_8","alias_value":"QFCQQAG5","created_at":"2026-07-05T01:11:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QFCQQAG5AGC75ZVHVELE4OZXOY","target":"record","payload":{"canonical_record":{"source":{"id":"2006.11118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-19T13:09:44Z","cross_cats_sorted":["eess.SP","stat.ML"],"title_canon_sha256":"49fbe775a08cf4c3c417f5343947566d2db6af1f02feba27f4ef45d4c2f1e8af","abstract_canon_sha256":"d0afd28c6f4bb37fcfd74dd542006b452352e110acafacdc2a6c7ad2bccb542f"},"schema_version":"1.0"},"canonical_sha256":"81450800dd0185fee6a7a9164e3b37763045f04283173bc058dae7c6caa5b508","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:35.402509Z","signature_b64":"KnnQVgjH7clALLKRQilbLE+DqiDGRd4vd7tnkQCyyUnkGBcraxafB8IPZ9l2TfRMOZm0HNC+NAMpbutSz2PNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81450800dd0185fee6a7a9164e3b37763045f04283173bc058dae7c6caa5b508","last_reissued_at":"2026-07-05T01:11:35.402133Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:35.402133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.11118","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:11:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qMXkUskOLtrAmCU3gjJeOm3p+2adMnuQPhrJCFyNoDHzUY0NnKzHQ5ryulCw3WXKtLn0BCO6ySTLy8ZjZYdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:32:45.315151Z"},"content_sha256":"f611acaa8d51f33f254a86cdce4b3ac09883734258b592dae48e73477a1f5df8","schema_version":"1.0","event_id":"sha256:f611acaa8d51f33f254a86cdce4b3ac09883734258b592dae48e73477a1f5df8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QFCQQAG5AGC75ZVHVELE4OZXOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Pooling with Node Proximity for Hierarchical Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenglin Li, Hongkai Xiong, Pascal Frossard, Wenrui Dai, Xing Gao","submitted_at":"2020-06-19T13:09:44Z","abstract_excerpt":"Graph neural networks have attracted wide attentions to enable representation learning of graph data in recent works. In complement to graph convolution operators, graph pooling is crucial for extracting hierarchical representation of graph data. However, most recent graph pooling methods still fail to efficiently exploit the geometry of graph data. In this paper, we propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology. Node proximity is obtained by harmonizing the kernel representat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.11118","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/2006.11118/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:11:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2e870We0bm4lFIuPlm6bVU+INSTimhwdQTMzlCGp170g6a8UTbDZOVfUM4zFIWnPYbiACSmI0T8w60zU+FnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:32:45.315651Z"},"content_sha256":"e1e654e7aaf6567ac23355be01181044e2e5c353bfa7226717790d92a8f327e5","schema_version":"1.0","event_id":"sha256:e1e654e7aaf6567ac23355be01181044e2e5c353bfa7226717790d92a8f327e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFCQQAG5AGC75ZVHVELE4OZXOY/bundle.json","state_url":"https://pith.science/pith/QFCQQAG5AGC75ZVHVELE4OZXOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFCQQAG5AGC75ZVHVELE4OZXOY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T11:32:45Z","links":{"resolver":"https://pith.science/pith/QFCQQAG5AGC75ZVHVELE4OZXOY","bundle":"https://pith.science/pith/QFCQQAG5AGC75ZVHVELE4OZXOY/bundle.json","state":"https://pith.science/pith/QFCQQAG5AGC75ZVHVELE4OZXOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFCQQAG5AGC75ZVHVELE4OZXOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QFCQQAG5AGC75ZVHVELE4OZXOY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d0afd28c6f4bb37fcfd74dd542006b452352e110acafacdc2a6c7ad2bccb542f","cross_cats_sorted":["eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-19T13:09:44Z","title_canon_sha256":"49fbe775a08cf4c3c417f5343947566d2db6af1f02feba27f4ef45d4c2f1e8af"},"schema_version":"1.0","source":{"id":"2006.11118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.11118","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"arxiv_version","alias_value":"2006.11118v1","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.11118","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"pith_short_12","alias_value":"QFCQQAG5AGC7","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"pith_short_16","alias_value":"QFCQQAG5AGC75ZVH","created_at":"2026-07-05T01:11:35Z"},{"alias_kind":"pith_short_8","alias_value":"QFCQQAG5","created_at":"2026-07-05T01:11:35Z"}],"graph_snapshots":[{"event_id":"sha256:e1e654e7aaf6567ac23355be01181044e2e5c353bfa7226717790d92a8f327e5","target":"graph","created_at":"2026-07-05T01:11:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.11118/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks have attracted wide attentions to enable representation learning of graph data in recent works. In complement to graph convolution operators, graph pooling is crucial for extracting hierarchical representation of graph data. However, most recent graph pooling methods still fail to efficiently exploit the geometry of graph data. In this paper, we propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology. Node proximity is obtained by harmonizing the kernel representat","authors_text":"Chenglin Li, Hongkai Xiong, Pascal Frossard, Wenrui Dai, Xing Gao","cross_cats":["eess.SP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-19T13:09:44Z","title":"Graph Pooling with Node Proximity for Hierarchical Representation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.11118","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f611acaa8d51f33f254a86cdce4b3ac09883734258b592dae48e73477a1f5df8","target":"record","created_at":"2026-07-05T01:11:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d0afd28c6f4bb37fcfd74dd542006b452352e110acafacdc2a6c7ad2bccb542f","cross_cats_sorted":["eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-19T13:09:44Z","title_canon_sha256":"49fbe775a08cf4c3c417f5343947566d2db6af1f02feba27f4ef45d4c2f1e8af"},"schema_version":"1.0","source":{"id":"2006.11118","kind":"arxiv","version":1}},"canonical_sha256":"81450800dd0185fee6a7a9164e3b37763045f04283173bc058dae7c6caa5b508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81450800dd0185fee6a7a9164e3b37763045f04283173bc058dae7c6caa5b508","first_computed_at":"2026-07-05T01:11:35.402133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:11:35.402133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KnnQVgjH7clALLKRQilbLE+DqiDGRd4vd7tnkQCyyUnkGBcraxafB8IPZ9l2TfRMOZm0HNC+NAMpbutSz2PNDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:11:35.402509Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.11118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f611acaa8d51f33f254a86cdce4b3ac09883734258b592dae48e73477a1f5df8","sha256:e1e654e7aaf6567ac23355be01181044e2e5c353bfa7226717790d92a8f327e5"],"state_sha256":"099707995b6b8e733a6c6b81e9fa898f648202f5abe5cbf53c06c1140acf81f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfG9njUij1a1ukEMY4128nDYKDncr1LXYsCZPlHvJ69JdXu/mE2fKzf0zW0W3KraMBzbtSMEHmdzz+4oN5LUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:32:45.319469Z","bundle_sha256":"db62b8cfaf507dfdb0e294cb01623f1d373ef0af0d879d29a0afa4fff35df43a"}}