{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:USIKIZLIPECD667TA7PS3LNFNI","short_pith_number":"pith:USIKIZLI","canonical_record":{"source":{"id":"1901.06965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-21T15:35:43Z","cross_cats_sorted":[],"title_canon_sha256":"e2c8caf81a835c4012968083787811b17ea44bf9e71ac258a42560b1ed08cab0","abstract_canon_sha256":"59057d6af81a373a0f4053f86fa8dc29501512ac9d2681b4d30b314e68250781"},"schema_version":"1.0"},"canonical_sha256":"a490a4656879043f7bf307df2dada56a219c876c4a036bbc706cd5f204f3db76","source":{"kind":"arxiv","id":"1901.06965","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06965","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06965v2","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06965","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"USIKIZLIPECD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USIKIZLIPECD667T","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USIKIZLI","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:USIKIZLIPECD667TA7PS3LNFNI","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-21T15:35:43Z","cross_cats_sorted":[],"title_canon_sha256":"e2c8caf81a835c4012968083787811b17ea44bf9e71ac258a42560b1ed08cab0","abstract_canon_sha256":"59057d6af81a373a0f4053f86fa8dc29501512ac9d2681b4d30b314e68250781"},"schema_version":"1.0"},"canonical_sha256":"a490a4656879043f7bf307df2dada56a219c876c4a036bbc706cd5f204f3db76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.787481Z","signature_b64":"hHERg04O51tNyMMnRm1lPIqBHie8lmfsk5/TznExc347KA8Isx+Tc5jyf5/vIw0d0b/a0sPiSsWR7qFtM6uzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a490a4656879043f7bf307df2dada56a219c876c4a036bbc706cd5f204f3db76","last_reissued_at":"2026-05-17T23:51:41.787035Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.787035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06965","source_version":2,"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:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqCkP5zMEYJpC7kMKzWrQ64r8b6T4rYbH72qclYunzQZzmhx4PEeTlgxqIis6vs4gKTqJokFYpmARy17hvXIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:52:12.654222Z"},"content_sha256":"50ad6d9bb58c504f9b807abd76644fe735ada778fa236311fdeeecd9d0ad8116","schema_version":"1.0","event_id":"sha256:50ad6d9bb58c504f9b807abd76644fe735ada778fa236311fdeeecd9d0ad8116"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:USIKIZLIPECD667TA7PS3LNFNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Graph Pooling and Hybrid Convolutional Operations for Text Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hongyang Gao, Shuiwang Ji, Yongjun Chen","submitted_at":"2019-01-21T15:35:43Z","abstract_excerpt":"With the development of graph convolutional networks (GCN), deep learning methods have started to be used on graph data. In additional to convolutional layers, pooling layers are another important components of deep learning. However, no effective pooling methods have been developed for graphs currently. In this work, we propose the graph pooling (gPool) layer, which employs a trainable projection vector to measure the importance of nodes in graphs. By selecting the k-most important nodes to form the new graph, gPool achieves the same objective as regular max pooling layers operating on images"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06965","kind":"arxiv","version":2},"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:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ms2Himea/TJ+SFMHjE77Av+zQN2KiAWZNhc13nkgs/6zwPqwOhARIf8XQ5B96BRKEZtRx2vsgT6pkd8u9n0PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:52:12.654595Z"},"content_sha256":"25fd5067525a37b4ae74a68e61b1fb0a156036005467d92df3adc4c6e8b45b2e","schema_version":"1.0","event_id":"sha256:25fd5067525a37b4ae74a68e61b1fb0a156036005467d92df3adc4c6e8b45b2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USIKIZLIPECD667TA7PS3LNFNI/bundle.json","state_url":"https://pith.science/pith/USIKIZLIPECD667TA7PS3LNFNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USIKIZLIPECD667TA7PS3LNFNI/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-06-07T17:52:12Z","links":{"resolver":"https://pith.science/pith/USIKIZLIPECD667TA7PS3LNFNI","bundle":"https://pith.science/pith/USIKIZLIPECD667TA7PS3LNFNI/bundle.json","state":"https://pith.science/pith/USIKIZLIPECD667TA7PS3LNFNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USIKIZLIPECD667TA7PS3LNFNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:USIKIZLIPECD667TA7PS3LNFNI","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":"59057d6af81a373a0f4053f86fa8dc29501512ac9d2681b4d30b314e68250781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-21T15:35:43Z","title_canon_sha256":"e2c8caf81a835c4012968083787811b17ea44bf9e71ac258a42560b1ed08cab0"},"schema_version":"1.0","source":{"id":"1901.06965","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06965","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06965v2","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06965","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"USIKIZLIPECD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"USIKIZLIPECD667T","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"USIKIZLI","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:25fd5067525a37b4ae74a68e61b1fb0a156036005467d92df3adc4c6e8b45b2e","target":"graph","created_at":"2026-05-17T23:51:41Z","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":"With the development of graph convolutional networks (GCN), deep learning methods have started to be used on graph data. In additional to convolutional layers, pooling layers are another important components of deep learning. However, no effective pooling methods have been developed for graphs currently. In this work, we propose the graph pooling (gPool) layer, which employs a trainable projection vector to measure the importance of nodes in graphs. By selecting the k-most important nodes to form the new graph, gPool achieves the same objective as regular max pooling layers operating on images","authors_text":"Hongyang Gao, Shuiwang Ji, Yongjun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-21T15:35:43Z","title":"Learning Graph Pooling and Hybrid Convolutional Operations for Text Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06965","kind":"arxiv","version":2},"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:50ad6d9bb58c504f9b807abd76644fe735ada778fa236311fdeeecd9d0ad8116","target":"record","created_at":"2026-05-17T23:51:41Z","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":"59057d6af81a373a0f4053f86fa8dc29501512ac9d2681b4d30b314e68250781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-21T15:35:43Z","title_canon_sha256":"e2c8caf81a835c4012968083787811b17ea44bf9e71ac258a42560b1ed08cab0"},"schema_version":"1.0","source":{"id":"1901.06965","kind":"arxiv","version":2}},"canonical_sha256":"a490a4656879043f7bf307df2dada56a219c876c4a036bbc706cd5f204f3db76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a490a4656879043f7bf307df2dada56a219c876c4a036bbc706cd5f204f3db76","first_computed_at":"2026-05-17T23:51:41.787035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:41.787035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hHERg04O51tNyMMnRm1lPIqBHie8lmfsk5/TznExc347KA8Isx+Tc5jyf5/vIw0d0b/a0sPiSsWR7qFtM6uzAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:41.787481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06965","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50ad6d9bb58c504f9b807abd76644fe735ada778fa236311fdeeecd9d0ad8116","sha256:25fd5067525a37b4ae74a68e61b1fb0a156036005467d92df3adc4c6e8b45b2e"],"state_sha256":"f7e3179fa42619068bb179aa980d6e18100fadb44d607cf43aaebfb8ef2fd0b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5068Eqxi37bjVogJJKfiR1jiHWt4HMp7mGAo1JnrP+pHq7VNKEfCfPZA0zCx9ZgdweHqVaAALQPoO8shiUFdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:52:12.657809Z","bundle_sha256":"2bfc819d273540d21f7da06689d9607c0bfc04c62e21a8ce6bb98b29ada5ba41"}}