{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IB6EUN2USO5R3IEDGBKHWIX6W7","short_pith_number":"pith:IB6EUN2U","canonical_record":{"source":{"id":"2002.00848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-30T13:58:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cc0cd953328bad7909d562066bf90f843ab19e55ed19a5842f556c08aca493f4","abstract_canon_sha256":"afc9477ea114d121db414840fe7b60bfc8a380e2ab292f967041724b85cd7607"},"schema_version":"1.0"},"canonical_sha256":"407c4a375493bb1da08330547b22feb7ec2459228e476276536d25ddc0d1f05c","source":{"kind":"arxiv","id":"2002.00848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.00848","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"2002.00848v1","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.00848","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"IB6EUN2USO5R","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"pith_short_16","alias_value":"IB6EUN2USO5R3IED","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"pith_short_8","alias_value":"IB6EUN2U","created_at":"2026-07-05T00:38:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IB6EUN2USO5R3IEDGBKHWIX6W7","target":"record","payload":{"canonical_record":{"source":{"id":"2002.00848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-30T13:58:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cc0cd953328bad7909d562066bf90f843ab19e55ed19a5842f556c08aca493f4","abstract_canon_sha256":"afc9477ea114d121db414840fe7b60bfc8a380e2ab292f967041724b85cd7607"},"schema_version":"1.0"},"canonical_sha256":"407c4a375493bb1da08330547b22feb7ec2459228e476276536d25ddc0d1f05c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:37.368746Z","signature_b64":"5FDTevbH1afCdWgDDgyjV8pnpKAVSYE1LANNjDUBZ5HJkTyHYmXoc6Kn3hE8TdtuNM8P2rCMZWjimBjxOvMXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"407c4a375493bb1da08330547b22feb7ec2459228e476276536d25ddc0d1f05c","last_reissued_at":"2026-07-05T00:38:37.368322Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:37.368322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.00848","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-05T00:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdDpvgEsXFnGGuoLNP49Sj7Y5tggBp+FJCaiDQWdGbwbtHXlW+idAXhqbtBR5x4++eGYIrzT+FWQ1JrlRsGmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:42:17.535134Z"},"content_sha256":"4898c5a0d202b7ed6dcc291c3fc3ffa37698ba7baea4997f77866174052c66c9","schema_version":"1.0","event_id":"sha256:4898c5a0d202b7ed6dcc291c3fc3ffa37698ba7baea4997f77866174052c66c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IB6EUN2USO5R3IEDGBKHWIX6W7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure-Feature based Graph Self-adaptive Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Guangming Zhu, Hongsheng Li, Liang Zhang, Mohammed Bennamoun, Peiyi Shen, Ping Li, Syed Afaq Ali Shah, Xiaoyuan Lu, Xudong Wang","submitted_at":"2020-01-30T13:58:49Z","abstract_excerpt":"Various methods to deal with graph data have been proposed in recent years. However, most of these methods focus on graph feature aggregation rather than graph pooling. Besides, the existing top-k selection graph pooling methods have a few problems. First, to construct the pooled graph topology, current top-k selection methods evaluate the importance of the node from a single perspective only, which is simplistic and unobjective. Second, the feature information of unselected nodes is directly lost during the pooling process, which inevitably leads to a massive loss of graph feature information"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.00848","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/2002.00848/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-05T00:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYg1gHFEWb4WbwxttN/Nwf1AmbTrrOLFbjD/cmnUkHvJ5jfdMG0dFB/QDFi8g9t1f+tYWLFLvWYqc7WSmz45Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:42:17.535811Z"},"content_sha256":"3001ee68926c0dc39ee3350dcac779219e40495562c4eb8ac561328429011da7","schema_version":"1.0","event_id":"sha256:3001ee68926c0dc39ee3350dcac779219e40495562c4eb8ac561328429011da7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IB6EUN2USO5R3IEDGBKHWIX6W7/bundle.json","state_url":"https://pith.science/pith/IB6EUN2USO5R3IEDGBKHWIX6W7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IB6EUN2USO5R3IEDGBKHWIX6W7/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-07-05T14:42:17Z","links":{"resolver":"https://pith.science/pith/IB6EUN2USO5R3IEDGBKHWIX6W7","bundle":"https://pith.science/pith/IB6EUN2USO5R3IEDGBKHWIX6W7/bundle.json","state":"https://pith.science/pith/IB6EUN2USO5R3IEDGBKHWIX6W7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IB6EUN2USO5R3IEDGBKHWIX6W7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IB6EUN2USO5R3IEDGBKHWIX6W7","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":"afc9477ea114d121db414840fe7b60bfc8a380e2ab292f967041724b85cd7607","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-30T13:58:49Z","title_canon_sha256":"cc0cd953328bad7909d562066bf90f843ab19e55ed19a5842f556c08aca493f4"},"schema_version":"1.0","source":{"id":"2002.00848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.00848","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"2002.00848v1","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.00848","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"IB6EUN2USO5R","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"pith_short_16","alias_value":"IB6EUN2USO5R3IED","created_at":"2026-07-05T00:38:37Z"},{"alias_kind":"pith_short_8","alias_value":"IB6EUN2U","created_at":"2026-07-05T00:38:37Z"}],"graph_snapshots":[{"event_id":"sha256:3001ee68926c0dc39ee3350dcac779219e40495562c4eb8ac561328429011da7","target":"graph","created_at":"2026-07-05T00:38:37Z","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/2002.00848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Various methods to deal with graph data have been proposed in recent years. However, most of these methods focus on graph feature aggregation rather than graph pooling. Besides, the existing top-k selection graph pooling methods have a few problems. First, to construct the pooled graph topology, current top-k selection methods evaluate the importance of the node from a single perspective only, which is simplistic and unobjective. Second, the feature information of unselected nodes is directly lost during the pooling process, which inevitably leads to a massive loss of graph feature information","authors_text":"Guangming Zhu, Hongsheng Li, Liang Zhang, Mohammed Bennamoun, Peiyi Shen, Ping Li, Syed Afaq Ali Shah, Xiaoyuan Lu, Xudong Wang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-30T13:58:49Z","title":"Structure-Feature based Graph Self-adaptive Pooling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.00848","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:4898c5a0d202b7ed6dcc291c3fc3ffa37698ba7baea4997f77866174052c66c9","target":"record","created_at":"2026-07-05T00:38:37Z","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":"afc9477ea114d121db414840fe7b60bfc8a380e2ab292f967041724b85cd7607","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-01-30T13:58:49Z","title_canon_sha256":"cc0cd953328bad7909d562066bf90f843ab19e55ed19a5842f556c08aca493f4"},"schema_version":"1.0","source":{"id":"2002.00848","kind":"arxiv","version":1}},"canonical_sha256":"407c4a375493bb1da08330547b22feb7ec2459228e476276536d25ddc0d1f05c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"407c4a375493bb1da08330547b22feb7ec2459228e476276536d25ddc0d1f05c","first_computed_at":"2026-07-05T00:38:37.368322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:38:37.368322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FDTevbH1afCdWgDDgyjV8pnpKAVSYE1LANNjDUBZ5HJkTyHYmXoc6Kn3hE8TdtuNM8P2rCMZWjimBjxOvMXBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:38:37.368746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.00848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4898c5a0d202b7ed6dcc291c3fc3ffa37698ba7baea4997f77866174052c66c9","sha256:3001ee68926c0dc39ee3350dcac779219e40495562c4eb8ac561328429011da7"],"state_sha256":"cae48146e6c3c155871aade5791c67910e15d8a6a402a8f980772fd116b9faab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAI/HCw6ZHHgEcy+n9yTV0DyMlJhs410EfAB00TgeqjSdzjma8g8IpLF74SmAG3U7fAym9fKeOQ5LkasdxuDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:42:17.539101Z","bundle_sha256":"d8d7a9ebbf428122978037ea1296a63496e01537571920bdcc3b3696008202a6"}}