{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SYQI6XLJ2ZZT2HBV66VC6WW5JN","short_pith_number":"pith:SYQI6XLJ","canonical_record":{"source":{"id":"1903.02541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T18:37:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dac5901f302134c4e18e72a43bc5f28806a125109348266869d57c3e8bb18409","abstract_canon_sha256":"c8c61411c87e91ec361e45c967d4abcf4d6f881cd9f5dc51355f3ff84290781e"},"schema_version":"1.0"},"canonical_sha256":"96208f5d69d6733d1c35f7aa2f5add4b7fbdcdd0a0fc09504471c3ae8212bfda","source":{"kind":"arxiv","id":"1903.02541","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02541","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02541v2","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02541","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"SYQI6XLJ2ZZT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SYQI6XLJ2ZZT2HBV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SYQI6XLJ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SYQI6XLJ2ZZT2HBV66VC6WW5JN","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T18:37:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dac5901f302134c4e18e72a43bc5f28806a125109348266869d57c3e8bb18409","abstract_canon_sha256":"c8c61411c87e91ec361e45c967d4abcf4d6f881cd9f5dc51355f3ff84290781e"},"schema_version":"1.0"},"canonical_sha256":"96208f5d69d6733d1c35f7aa2f5add4b7fbdcdd0a0fc09504471c3ae8212bfda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:09.040855Z","signature_b64":"xu6wFMZ77jUCGiz0Mtl1XB85iqcdHOp610/Jc08yI3L9ZXhVa/ICb+pLrAjcuBec7r5gDwLXErPB9EqbjrKuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96208f5d69d6733d1c35f7aa2f5add4b7fbdcdd0a0fc09504471c3ae8212bfda","last_reissued_at":"2026-05-17T23:46:09.040356Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:09.040356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02541","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:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jo43FjZXBOJ2NTbzIUS/8pin5QUIjAe5RKMBjIKNkqXifgj2qHcOVxTwjrWNiFem+U/SM6iINM2LJd6keUwBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:17:32.188354Z"},"content_sha256":"7716e2ed96fd30f157e66f4af09ae4216b8facc1073ad2785c7101c4183cfbc8","schema_version":"1.0","event_id":"sha256:7716e2ed96fd30f157e66f4af09ae4216b8facc1073ad2785c7101c4183cfbc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SYQI6XLJ2ZZT2HBV66VC6WW5JN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational Pooling for Graph Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Balasubramaniam Srinivasan, Bruno Ribeiro, Ryan L. Murphy, Vinayak Rao","submitted_at":"2019-03-06T18:37:26Z","abstract_excerpt":"This work generalizes graph neural networks (GNNs) beyond those based on the Weisfeiler-Lehman (WL) algorithm, graph Laplacians, and diffusions. Our approach, denoted Relational Pooling (RP), draws from the theory of finite partial exchangeability to provide a framework with maximal representation power for graphs. RP can work with existing graph representation models and, somewhat counterintuitively, can make them even more powerful than the original WL isomorphism test. Additionally, RP allows architectures like Recurrent Neural Networks and Convolutional Neural Networks to be used in a theo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02541","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:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdGTpygjHwcwn/3G+MghuuwcCqBkzg/EIchKT6qxM0kwy7zByugTPsaMdEjRikb4UYgv8e7qDNbWTkDmcUrYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:17:32.189000Z"},"content_sha256":"cffa352550d92e8a50481b2957218e5a6a497edb5d358ba4eb4bc67e127b57ad","schema_version":"1.0","event_id":"sha256:cffa352550d92e8a50481b2957218e5a6a497edb5d358ba4eb4bc67e127b57ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYQI6XLJ2ZZT2HBV66VC6WW5JN/bundle.json","state_url":"https://pith.science/pith/SYQI6XLJ2ZZT2HBV66VC6WW5JN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYQI6XLJ2ZZT2HBV66VC6WW5JN/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-05-25T20:17:32Z","links":{"resolver":"https://pith.science/pith/SYQI6XLJ2ZZT2HBV66VC6WW5JN","bundle":"https://pith.science/pith/SYQI6XLJ2ZZT2HBV66VC6WW5JN/bundle.json","state":"https://pith.science/pith/SYQI6XLJ2ZZT2HBV66VC6WW5JN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYQI6XLJ2ZZT2HBV66VC6WW5JN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SYQI6XLJ2ZZT2HBV66VC6WW5JN","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":"c8c61411c87e91ec361e45c967d4abcf4d6f881cd9f5dc51355f3ff84290781e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T18:37:26Z","title_canon_sha256":"dac5901f302134c4e18e72a43bc5f28806a125109348266869d57c3e8bb18409"},"schema_version":"1.0","source":{"id":"1903.02541","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02541","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02541v2","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02541","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"SYQI6XLJ2ZZT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SYQI6XLJ2ZZT2HBV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SYQI6XLJ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:cffa352550d92e8a50481b2957218e5a6a497edb5d358ba4eb4bc67e127b57ad","target":"graph","created_at":"2026-05-17T23:46:09Z","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":"This work generalizes graph neural networks (GNNs) beyond those based on the Weisfeiler-Lehman (WL) algorithm, graph Laplacians, and diffusions. Our approach, denoted Relational Pooling (RP), draws from the theory of finite partial exchangeability to provide a framework with maximal representation power for graphs. RP can work with existing graph representation models and, somewhat counterintuitively, can make them even more powerful than the original WL isomorphism test. Additionally, RP allows architectures like Recurrent Neural Networks and Convolutional Neural Networks to be used in a theo","authors_text":"Balasubramaniam Srinivasan, Bruno Ribeiro, Ryan L. Murphy, Vinayak Rao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T18:37:26Z","title":"Relational Pooling for Graph Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02541","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:7716e2ed96fd30f157e66f4af09ae4216b8facc1073ad2785c7101c4183cfbc8","target":"record","created_at":"2026-05-17T23:46:09Z","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":"c8c61411c87e91ec361e45c967d4abcf4d6f881cd9f5dc51355f3ff84290781e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-06T18:37:26Z","title_canon_sha256":"dac5901f302134c4e18e72a43bc5f28806a125109348266869d57c3e8bb18409"},"schema_version":"1.0","source":{"id":"1903.02541","kind":"arxiv","version":2}},"canonical_sha256":"96208f5d69d6733d1c35f7aa2f5add4b7fbdcdd0a0fc09504471c3ae8212bfda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96208f5d69d6733d1c35f7aa2f5add4b7fbdcdd0a0fc09504471c3ae8212bfda","first_computed_at":"2026-05-17T23:46:09.040356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:09.040356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xu6wFMZ77jUCGiz0Mtl1XB85iqcdHOp610/Jc08yI3L9ZXhVa/ICb+pLrAjcuBec7r5gDwLXErPB9EqbjrKuBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:09.040855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02541","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7716e2ed96fd30f157e66f4af09ae4216b8facc1073ad2785c7101c4183cfbc8","sha256:cffa352550d92e8a50481b2957218e5a6a497edb5d358ba4eb4bc67e127b57ad"],"state_sha256":"b69bedd4b47377d49a9ef8337e9190f9c94c9e61c6242f83f87554f1c73ced22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5N1segnTrv0oR0UbN7Z5Sf5NjZ1BUYuZieIhiGTwaIzb/IhbGL5BPi6rKlF0jfQYw5A94o3R7WJsEiON2jeICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:17:32.191879Z","bundle_sha256":"b7af842fe184c989dded994a862b4ccf8e8743dbd550495776a31714932048fd"}}