{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:Y6WTXGMKCUDQOPJMIUVAK4B3I7","short_pith_number":"pith:Y6WTXGMK","canonical_record":{"source":{"id":"2012.03174","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-06T03:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"93cd18a06cebaa12226399f43b1e2cfe6626d2aa59a49b26c72430e777dd063c","abstract_canon_sha256":"d1e1e83e838313ae573c9a6b1f1a56e7b15666c57c55e5109f448a980a4209ae"},"schema_version":"1.0"},"canonical_sha256":"c7ad3b998a1507073d2c452a05703b47d2f6eb8a98b59db980bc45d369883848","source":{"kind":"arxiv","id":"2012.03174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.03174","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"2012.03174v2","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03174","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"Y6WTXGMKCUDQ","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"pith_short_16","alias_value":"Y6WTXGMKCUDQOPJM","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"pith_short_8","alias_value":"Y6WTXGMK","created_at":"2026-07-05T10:20:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:Y6WTXGMKCUDQOPJMIUVAK4B3I7","target":"record","payload":{"canonical_record":{"source":{"id":"2012.03174","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-06T03:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"93cd18a06cebaa12226399f43b1e2cfe6626d2aa59a49b26c72430e777dd063c","abstract_canon_sha256":"d1e1e83e838313ae573c9a6b1f1a56e7b15666c57c55e5109f448a980a4209ae"},"schema_version":"1.0"},"canonical_sha256":"c7ad3b998a1507073d2c452a05703b47d2f6eb8a98b59db980bc45d369883848","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:32.694802Z","signature_b64":"a4zqlMJ5az1JpnrqfFs+DvQ7MI1aS7BGH1JDoeto0zbjn0Y3rLZljs8UawwqQeTZAjTgeCJGvTIFvxEkFsEYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7ad3b998a1507073d2c452a05703b47d2f6eb8a98b59db980bc45d369883848","last_reissued_at":"2026-07-05T10:20:32.694329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:32.694329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.03174","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-07-05T10:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsjfj34nAOegGiccy2lh50ox2QiJ4tfjKIGKTfgtJRDdniiaaiVAvDrcq6qZlFI8G1AMaE1r3aRsWnpfQtV8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:04:37.279464Z"},"content_sha256":"5e9a7351dca78775584d8b026a3bc9ed865a1ccdab917cdb5130e543f030325a","schema_version":"1.0","event_id":"sha256:5e9a7351dca78775584d8b026a3bc9ed865a1ccdab917cdb5130e543f030325a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:Y6WTXGMKCUDQOPJMIUVAK4B3I7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Behrooz Tahmasebi, Derek Lim, Stefanie Jegelka","submitted_at":"2020-12-06T03:42:54Z","abstract_excerpt":"While message passing Graph Neural Networks (GNNs) have become increasingly popular architectures for learning with graphs, recent works have revealed important shortcomings in their expressive power. In response, several higher-order GNNs have been proposed that substantially increase the expressive power, albeit at a large computational cost. Motivated by this gap, we explore alternative strategies and lower bounds. In particular, we analyze a new recursive pooling technique of local neighborhoods that allows different tradeoffs of computational cost and expressive power. First, we prove tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03174","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.03174/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-05T10:20:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhrm6yvtjzu+9Ifn63RfMQjt3ucBqdhPFocJcqYZ2s/SIpW/O/vBNAJheFsu0QKb2Z+4djlxBcd4aQEOd1JbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:04:37.280091Z"},"content_sha256":"2de088100d7f5f4e8345571b49a1efab9e4236ed3c1174e502101ba9bc92515d","schema_version":"1.0","event_id":"sha256:2de088100d7f5f4e8345571b49a1efab9e4236ed3c1174e502101ba9bc92515d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6WTXGMKCUDQOPJMIUVAK4B3I7/bundle.json","state_url":"https://pith.science/pith/Y6WTXGMKCUDQOPJMIUVAK4B3I7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6WTXGMKCUDQOPJMIUVAK4B3I7/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-19T15:04:37Z","links":{"resolver":"https://pith.science/pith/Y6WTXGMKCUDQOPJMIUVAK4B3I7","bundle":"https://pith.science/pith/Y6WTXGMKCUDQOPJMIUVAK4B3I7/bundle.json","state":"https://pith.science/pith/Y6WTXGMKCUDQOPJMIUVAK4B3I7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6WTXGMKCUDQOPJMIUVAK4B3I7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:Y6WTXGMKCUDQOPJMIUVAK4B3I7","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":"d1e1e83e838313ae573c9a6b1f1a56e7b15666c57c55e5109f448a980a4209ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-06T03:42:54Z","title_canon_sha256":"93cd18a06cebaa12226399f43b1e2cfe6626d2aa59a49b26c72430e777dd063c"},"schema_version":"1.0","source":{"id":"2012.03174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.03174","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"arxiv_version","alias_value":"2012.03174v2","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03174","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"pith_short_12","alias_value":"Y6WTXGMKCUDQ","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"pith_short_16","alias_value":"Y6WTXGMKCUDQOPJM","created_at":"2026-07-05T10:20:32Z"},{"alias_kind":"pith_short_8","alias_value":"Y6WTXGMK","created_at":"2026-07-05T10:20:32Z"}],"graph_snapshots":[{"event_id":"sha256:2de088100d7f5f4e8345571b49a1efab9e4236ed3c1174e502101ba9bc92515d","target":"graph","created_at":"2026-07-05T10:20:32Z","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/2012.03174/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While message passing Graph Neural Networks (GNNs) have become increasingly popular architectures for learning with graphs, recent works have revealed important shortcomings in their expressive power. In response, several higher-order GNNs have been proposed that substantially increase the expressive power, albeit at a large computational cost. Motivated by this gap, we explore alternative strategies and lower bounds. In particular, we analyze a new recursive pooling technique of local neighborhoods that allows different tradeoffs of computational cost and expressive power. First, we prove tha","authors_text":"Behrooz Tahmasebi, Derek Lim, Stefanie Jegelka","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-06T03:42:54Z","title":"Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03174","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:5e9a7351dca78775584d8b026a3bc9ed865a1ccdab917cdb5130e543f030325a","target":"record","created_at":"2026-07-05T10:20:32Z","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":"d1e1e83e838313ae573c9a6b1f1a56e7b15666c57c55e5109f448a980a4209ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-06T03:42:54Z","title_canon_sha256":"93cd18a06cebaa12226399f43b1e2cfe6626d2aa59a49b26c72430e777dd063c"},"schema_version":"1.0","source":{"id":"2012.03174","kind":"arxiv","version":2}},"canonical_sha256":"c7ad3b998a1507073d2c452a05703b47d2f6eb8a98b59db980bc45d369883848","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7ad3b998a1507073d2c452a05703b47d2f6eb8a98b59db980bc45d369883848","first_computed_at":"2026-07-05T10:20:32.694329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:20:32.694329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a4zqlMJ5az1JpnrqfFs+DvQ7MI1aS7BGH1JDoeto0zbjn0Y3rLZljs8UawwqQeTZAjTgeCJGvTIFvxEkFsEYBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:20:32.694802Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.03174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e9a7351dca78775584d8b026a3bc9ed865a1ccdab917cdb5130e543f030325a","sha256:2de088100d7f5f4e8345571b49a1efab9e4236ed3c1174e502101ba9bc92515d"],"state_sha256":"ea7d44f30386c69cae5dd84a32213028d1c7112ae9f9caa233e13ed3f3aba754"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KamI9BmnZc2O5EjheqSNb04X4rfbKofHq28YMWRTOJccSwHPylQfk5wuldCV9zUhVLBbrOAqbJISIssd5g5uDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T15:04:37.284742Z","bundle_sha256":"bb16d71cb3857f378ae60d4a2df049653493a6d938c9b4a80c3b7393d4d34409"}}