{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XMX3C64MG7WVDIGDZ7SXIVLH4T","short_pith_number":"pith:XMX3C64M","canonical_record":{"source":{"id":"1811.01287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-03T21:39:43Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"21f1f7485b7655caacee2d6493257b241715613a838a21875ab8fe35bb724f24","abstract_canon_sha256":"c23bdfc0133f569ba17e30960d08c2567390ef268c7a510980b8c704c39a497c"},"schema_version":"1.0"},"canonical_sha256":"bb2fb17b8c37ed51a0c3cfe5745567e4ead9aa1a9cf81e56a9b455f0f95d0f8b","source":{"kind":"arxiv","id":"1811.01287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01287","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01287v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01287","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"XMX3C64MG7WV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XMX3C64MG7WVDIGD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XMX3C64M","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XMX3C64MG7WVDIGDZ7SXIVLH4T","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-03T21:39:43Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"21f1f7485b7655caacee2d6493257b241715613a838a21875ab8fe35bb724f24","abstract_canon_sha256":"c23bdfc0133f569ba17e30960d08c2567390ef268c7a510980b8c704c39a497c"},"schema_version":"1.0"},"canonical_sha256":"bb2fb17b8c37ed51a0c3cfe5745567e4ead9aa1a9cf81e56a9b455f0f95d0f8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.754626Z","signature_b64":"FDe5MWQiDrt13whZD5mXJAp9kO+SqpagDAorFmLasXRnqxx9xhxsil/y4MNmdvyNYNxrdZaGOmSOdw01cWuhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb2fb17b8c37ed51a0c3cfe5745567e4ead9aa1a9cf81e56a9b455f0f95d0f8b","last_reissued_at":"2026-05-18T00:01:34.754050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.754050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01287","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-05-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZ0bu1te3tk/NnDsAxlEHfbZ7hnbLmS55h+zGO0wSnxXyTBXJWstvds50ddmnyPR6RgM6W2VbTmpJS263Xb1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:38:15.224612Z"},"content_sha256":"7cc637adb67aeb51af0871fc4f7e3772644e459f5d32fe3cfa9f385667229464","schema_version":"1.0","event_id":"sha256:7cc637adb67aeb51af0871fc4f7e3772644e459f5d32fe3cfa9f385667229464"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XMX3C64MG7WVDIGDZ7SXIVLH4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Sparse Hierarchical Graph Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"C\\u{a}t\\u{a}lina Cangea, Nikola Jovanovi\\'c, Petar Veli\\v{c}kovi\\'c, Pietro Li\\`o, Thomas Kipf","submitted_at":"2018-11-03T21:39:43Z","abstract_excerpt":"Recent advances in representation learning on graphs, mainly leveraging graph convolutional networks, have brought a substantial improvement on many graph-based benchmark tasks. While novel approaches to learning node embeddings are highly suitable for node classification and link prediction, their application to graph classification (predicting a single label for the entire graph) remains mostly rudimentary, typically using a single global pooling step to aggregate node features or a hand-designed, fixed heuristic for hierarchical coarsening of the graph structure. An important step towards a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01287","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":""},"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-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzDGEWpQBBNTDLnaVey4AOmYJkHelTc3qkap74g5/QPb89vf4c8XJSe/hmlAuuiQmGBKaJoOkGywW+/3gevAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:38:15.224961Z"},"content_sha256":"0850360bc029fd374dfd429f8761e5e59f16107a6228d729a71ffa6bc2276017","schema_version":"1.0","event_id":"sha256:0850360bc029fd374dfd429f8761e5e59f16107a6228d729a71ffa6bc2276017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMX3C64MG7WVDIGDZ7SXIVLH4T/bundle.json","state_url":"https://pith.science/pith/XMX3C64MG7WVDIGDZ7SXIVLH4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMX3C64MG7WVDIGDZ7SXIVLH4T/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-03T16:38:15Z","links":{"resolver":"https://pith.science/pith/XMX3C64MG7WVDIGDZ7SXIVLH4T","bundle":"https://pith.science/pith/XMX3C64MG7WVDIGDZ7SXIVLH4T/bundle.json","state":"https://pith.science/pith/XMX3C64MG7WVDIGDZ7SXIVLH4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMX3C64MG7WVDIGDZ7SXIVLH4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XMX3C64MG7WVDIGDZ7SXIVLH4T","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":"c23bdfc0133f569ba17e30960d08c2567390ef268c7a510980b8c704c39a497c","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-03T21:39:43Z","title_canon_sha256":"21f1f7485b7655caacee2d6493257b241715613a838a21875ab8fe35bb724f24"},"schema_version":"1.0","source":{"id":"1811.01287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01287","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01287v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01287","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"XMX3C64MG7WV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XMX3C64MG7WVDIGD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XMX3C64M","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:0850360bc029fd374dfd429f8761e5e59f16107a6228d729a71ffa6bc2276017","target":"graph","created_at":"2026-05-18T00:01:34Z","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":"Recent advances in representation learning on graphs, mainly leveraging graph convolutional networks, have brought a substantial improvement on many graph-based benchmark tasks. While novel approaches to learning node embeddings are highly suitable for node classification and link prediction, their application to graph classification (predicting a single label for the entire graph) remains mostly rudimentary, typically using a single global pooling step to aggregate node features or a hand-designed, fixed heuristic for hierarchical coarsening of the graph structure. An important step towards a","authors_text":"C\\u{a}t\\u{a}lina Cangea, Nikola Jovanovi\\'c, Petar Veli\\v{c}kovi\\'c, Pietro Li\\`o, Thomas Kipf","cross_cats":["cs.AI","cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-03T21:39:43Z","title":"Towards Sparse Hierarchical Graph Classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01287","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:7cc637adb67aeb51af0871fc4f7e3772644e459f5d32fe3cfa9f385667229464","target":"record","created_at":"2026-05-18T00:01:34Z","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":"c23bdfc0133f569ba17e30960d08c2567390ef268c7a510980b8c704c39a497c","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-11-03T21:39:43Z","title_canon_sha256":"21f1f7485b7655caacee2d6493257b241715613a838a21875ab8fe35bb724f24"},"schema_version":"1.0","source":{"id":"1811.01287","kind":"arxiv","version":1}},"canonical_sha256":"bb2fb17b8c37ed51a0c3cfe5745567e4ead9aa1a9cf81e56a9b455f0f95d0f8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb2fb17b8c37ed51a0c3cfe5745567e4ead9aa1a9cf81e56a9b455f0f95d0f8b","first_computed_at":"2026-05-18T00:01:34.754050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.754050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FDe5MWQiDrt13whZD5mXJAp9kO+SqpagDAorFmLasXRnqxx9xhxsil/y4MNmdvyNYNxrdZaGOmSOdw01cWuhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.754626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cc637adb67aeb51af0871fc4f7e3772644e459f5d32fe3cfa9f385667229464","sha256:0850360bc029fd374dfd429f8761e5e59f16107a6228d729a71ffa6bc2276017"],"state_sha256":"e1bfe31833b1b7d6119b37778349775379154f7cd9cb79914cb1e9c3c1e6007e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7EcKDZEJgTyxZ6En4O4mrHc+OOkeCL+gSwPO5b1tYVfnw1myE+UCGlpjKuHih97oXSH3g3el8xDtrSevVaEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:38:15.226862Z","bundle_sha256":"3a580613986b2ae01ff235d2d922e75f8c27d479e4cf502223fdbe1bc1e488ac"}}