{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SH3HNNIJ4UGLHQF5OAQJ7QWONH","short_pith_number":"pith:SH3HNNIJ","canonical_record":{"source":{"id":"1904.08082","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T05:02:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4b3743e775a9dd1cd701092749076c622f9ffc75a5c680ff02496bc52e7722df","abstract_canon_sha256":"a81f04209876d08c980b52f8ad0c8ab76347edc9891ee304a1b0bd83ec3ac4c9"},"schema_version":"1.0"},"canonical_sha256":"91f676b509e50cb3c0bd70209fc2ce69e5c82cc4812e3d4ec745aa5d73e447c7","source":{"kind":"arxiv","id":"1904.08082","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08082","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08082v4","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08082","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"SH3HNNIJ4UGL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SH3HNNIJ4UGLHQF5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SH3HNNIJ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SH3HNNIJ4UGLHQF5OAQJ7QWONH","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08082","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T05:02:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4b3743e775a9dd1cd701092749076c622f9ffc75a5c680ff02496bc52e7722df","abstract_canon_sha256":"a81f04209876d08c980b52f8ad0c8ab76347edc9891ee304a1b0bd83ec3ac4c9"},"schema_version":"1.0"},"canonical_sha256":"91f676b509e50cb3c0bd70209fc2ce69e5c82cc4812e3d4ec745aa5d73e447c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:27.682121Z","signature_b64":"yTYf9wcbruJEEc+nxhtIH19nisafWGJOIn0eqAvsyx1vqXVnYN64X8N5XbJKYX406LNjCfKxHiF213UyUs/UBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f676b509e50cb3c0bd70209fc2ce69e5c82cc4812e3d4ec745aa5d73e447c7","last_reissued_at":"2026-05-17T23:43:27.681652Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:27.681652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08082","source_version":4,"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-05-17T23:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJvuwyq4cNHaTPuOKRqWI76K5hxOzMqj2HDTz98qYLIqgwfexGDt2tXJG3LYi+8qTNxhhqoJn04yfKhhEdKbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:46:01.495286Z"},"content_sha256":"266955400fd2d02a957e181b3f89aafd0f6162d4aba7cba8a92d029be5cb3df3","schema_version":"1.0","event_id":"sha256:266955400fd2d02a957e181b3f89aafd0f6162d4aba7cba8a92d029be5cb3df3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SH3HNNIJ4UGLHQF5OAQJ7QWONH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Attention Graph Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Inyeop Lee, Jaewoo Kang, Junhyun Lee","submitted_at":"2019-04-17T05:02:24Z","abstract_excerpt":"Advanced methods of applying deep learning to structured data such as graphs have been proposed in recent years. In particular, studies have focused on generalizing convolutional neural networks to graph data, which includes redefining the convolution and the downsampling (pooling) operations for graphs. The method of generalizing the convolution operation to graphs has been proven to improve performance and is widely used. However, the method of applying downsampling to graphs is still difficult to perform and has room for improvement. In this paper, we propose a graph pooling method based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08082","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9X8uxl/czT0reOM4tPgIp2bjhhQG581ScAeaQ38tXZZDSGtl8kQrLoDMyGuhTxtSEg9/vsUeuCH6Gn4hy2gpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:46:01.495744Z"},"content_sha256":"242cfbcd2c127cbaba9f905518acc61c2e107fbb3058bccac6402cf79b6301f1","schema_version":"1.0","event_id":"sha256:242cfbcd2c127cbaba9f905518acc61c2e107fbb3058bccac6402cf79b6301f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SH3HNNIJ4UGLHQF5OAQJ7QWONH/bundle.json","state_url":"https://pith.science/pith/SH3HNNIJ4UGLHQF5OAQJ7QWONH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SH3HNNIJ4UGLHQF5OAQJ7QWONH/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-19T22:46:01Z","links":{"resolver":"https://pith.science/pith/SH3HNNIJ4UGLHQF5OAQJ7QWONH","bundle":"https://pith.science/pith/SH3HNNIJ4UGLHQF5OAQJ7QWONH/bundle.json","state":"https://pith.science/pith/SH3HNNIJ4UGLHQF5OAQJ7QWONH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SH3HNNIJ4UGLHQF5OAQJ7QWONH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SH3HNNIJ4UGLHQF5OAQJ7QWONH","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":"a81f04209876d08c980b52f8ad0c8ab76347edc9891ee304a1b0bd83ec3ac4c9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T05:02:24Z","title_canon_sha256":"4b3743e775a9dd1cd701092749076c622f9ffc75a5c680ff02496bc52e7722df"},"schema_version":"1.0","source":{"id":"1904.08082","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08082","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08082v4","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08082","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"SH3HNNIJ4UGL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SH3HNNIJ4UGLHQF5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SH3HNNIJ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:242cfbcd2c127cbaba9f905518acc61c2e107fbb3058bccac6402cf79b6301f1","target":"graph","created_at":"2026-05-17T23:43:27Z","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"},"paper":{"abstract_excerpt":"Advanced methods of applying deep learning to structured data such as graphs have been proposed in recent years. In particular, studies have focused on generalizing convolutional neural networks to graph data, which includes redefining the convolution and the downsampling (pooling) operations for graphs. The method of generalizing the convolution operation to graphs has been proven to improve performance and is widely used. However, the method of applying downsampling to graphs is still difficult to perform and has room for improvement. In this paper, we propose a graph pooling method based on","authors_text":"Inyeop Lee, Jaewoo Kang, Junhyun Lee","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T05:02:24Z","title":"Self-Attention Graph Pooling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08082","kind":"arxiv","version":4},"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:266955400fd2d02a957e181b3f89aafd0f6162d4aba7cba8a92d029be5cb3df3","target":"record","created_at":"2026-05-17T23:43:27Z","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":"a81f04209876d08c980b52f8ad0c8ab76347edc9891ee304a1b0bd83ec3ac4c9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T05:02:24Z","title_canon_sha256":"4b3743e775a9dd1cd701092749076c622f9ffc75a5c680ff02496bc52e7722df"},"schema_version":"1.0","source":{"id":"1904.08082","kind":"arxiv","version":4}},"canonical_sha256":"91f676b509e50cb3c0bd70209fc2ce69e5c82cc4812e3d4ec745aa5d73e447c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91f676b509e50cb3c0bd70209fc2ce69e5c82cc4812e3d4ec745aa5d73e447c7","first_computed_at":"2026-05-17T23:43:27.681652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:27.681652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yTYf9wcbruJEEc+nxhtIH19nisafWGJOIn0eqAvsyx1vqXVnYN64X8N5XbJKYX406LNjCfKxHiF213UyUs/UBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:27.682121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08082","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:266955400fd2d02a957e181b3f89aafd0f6162d4aba7cba8a92d029be5cb3df3","sha256:242cfbcd2c127cbaba9f905518acc61c2e107fbb3058bccac6402cf79b6301f1"],"state_sha256":"9937f8d28e276ac7c52f3a9d53efd4c42a92ae9fb0bbc69ca9327ba986f0d82b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFC4e9PTVPo8IBRlWq6PWYHuX+YOrfdBzHUIIkUPqaEH3O0NNcBBYTv3NjrZsUAT/O8CClPehfiMeC9ijmqVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T22:46:01.499698Z","bundle_sha256":"54eab28e4bb10299055df9788e55d6ebfaf2c58ab68557e2efd87818ff0b1a97"}}