{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EPJ3SUNXG2574EAECDURNESUNC","short_pith_number":"pith:EPJ3SUNX","canonical_record":{"source":{"id":"2002.04025","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-10T18:53:30Z","cross_cats_sorted":["cs.DM","stat.ML"],"title_canon_sha256":"74e89fa45092d6a061eae6e796b190f1fce8ad17a0f24d70cccd5e391d0e1757","abstract_canon_sha256":"7993dea3b8b082d1bef25e539052b7d521ed133cd1c6dde55287526107bcf9b7"},"schema_version":"1.0"},"canonical_sha256":"23d3b951b736bbfe100410e916925468aad1442655e8a57a98595a678d838ad7","source":{"kind":"arxiv","id":"2002.04025","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.04025","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"2002.04025v4","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.04025","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"EPJ3SUNXG257","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"pith_short_16","alias_value":"EPJ3SUNXG2574EAE","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"pith_short_8","alias_value":"EPJ3SUNX","created_at":"2026-07-05T01:47:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EPJ3SUNXG2574EAECDURNESUNC","target":"record","payload":{"canonical_record":{"source":{"id":"2002.04025","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-10T18:53:30Z","cross_cats_sorted":["cs.DM","stat.ML"],"title_canon_sha256":"74e89fa45092d6a061eae6e796b190f1fce8ad17a0f24d70cccd5e391d0e1757","abstract_canon_sha256":"7993dea3b8b082d1bef25e539052b7d521ed133cd1c6dde55287526107bcf9b7"},"schema_version":"1.0"},"canonical_sha256":"23d3b951b736bbfe100410e916925468aad1442655e8a57a98595a678d838ad7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:29.727269Z","signature_b64":"TVm/Sv7sJUrCGH/SMJsfpQNqV5ox61/9fPSeHzrY/3HQGqjvd/irHOrVx8xxsYKKJku2bJAZvqnx83UljRy7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23d3b951b736bbfe100410e916925468aad1442655e8a57a98595a678d838ad7","last_reissued_at":"2026-07-05T01:47:29.726915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:29.726915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.04025","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-07-05T01:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gRzqjTUjIg5zfwZ5grC09vQ6kbzSfkgjBodc8wzGbfC/T9tNo2rMMtx86W4MtE1V+30+NC4gFdoJOojVTxr7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:57:10.461036Z"},"content_sha256":"ae71ce83ccb7c8a0bb27ef87557849de0ab0bbaee000ccf52d426a916068fc2e","schema_version":"1.0","event_id":"sha256:ae71ce83ccb7c8a0bb27ef87557849de0ab0bbaee000ccf52d426a916068fc2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EPJ3SUNXG2574EAECDURNESUNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Graph Neural Networks Count Substructures?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Joan Bruna, Lei Chen, Soledad Villar, Zhengdao Chen","submitted_at":"2020-02-10T18:53:30Z","abstract_excerpt":"The ability to detect and count certain substructures in graphs is important for solving many tasks on graph-structured data, especially in the contexts of computational chemistry and biology as well as social network analysis. Inspired by this, we propose to study the expressive power of graph neural networks (GNNs) via their ability to count attributed graph substructures, extending recent works that examine their power in graph isomorphism testing and function approximation. We distinguish between two types of substructure counting: induced-subgraph-count and subgraph-count, and establish b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.04025","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.04025/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-05T01:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOoxMj9g5iaMfRZ24nOh5mClhu9OXguO6khD1yNHpBk0do0NdueKwtnRJd+0fNImn7KXGIwdcQk/PsxQkEfsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:57:10.461679Z"},"content_sha256":"972b04b27bb1e2356cb749cc875f3531c191b2c284e3149895e0ff278600edab","schema_version":"1.0","event_id":"sha256:972b04b27bb1e2356cb749cc875f3531c191b2c284e3149895e0ff278600edab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPJ3SUNXG2574EAECDURNESUNC/bundle.json","state_url":"https://pith.science/pith/EPJ3SUNXG2574EAECDURNESUNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPJ3SUNXG2574EAECDURNESUNC/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-13T15:57:10Z","links":{"resolver":"https://pith.science/pith/EPJ3SUNXG2574EAECDURNESUNC","bundle":"https://pith.science/pith/EPJ3SUNXG2574EAECDURNESUNC/bundle.json","state":"https://pith.science/pith/EPJ3SUNXG2574EAECDURNESUNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPJ3SUNXG2574EAECDURNESUNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EPJ3SUNXG2574EAECDURNESUNC","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":"7993dea3b8b082d1bef25e539052b7d521ed133cd1c6dde55287526107bcf9b7","cross_cats_sorted":["cs.DM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-10T18:53:30Z","title_canon_sha256":"74e89fa45092d6a061eae6e796b190f1fce8ad17a0f24d70cccd5e391d0e1757"},"schema_version":"1.0","source":{"id":"2002.04025","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.04025","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"2002.04025v4","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.04025","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"EPJ3SUNXG257","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"pith_short_16","alias_value":"EPJ3SUNXG2574EAE","created_at":"2026-07-05T01:47:29Z"},{"alias_kind":"pith_short_8","alias_value":"EPJ3SUNX","created_at":"2026-07-05T01:47:29Z"}],"graph_snapshots":[{"event_id":"sha256:972b04b27bb1e2356cb749cc875f3531c191b2c284e3149895e0ff278600edab","target":"graph","created_at":"2026-07-05T01:47:29Z","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/2002.04025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The ability to detect and count certain substructures in graphs is important for solving many tasks on graph-structured data, especially in the contexts of computational chemistry and biology as well as social network analysis. Inspired by this, we propose to study the expressive power of graph neural networks (GNNs) via their ability to count attributed graph substructures, extending recent works that examine their power in graph isomorphism testing and function approximation. We distinguish between two types of substructure counting: induced-subgraph-count and subgraph-count, and establish b","authors_text":"Joan Bruna, Lei Chen, Soledad Villar, Zhengdao Chen","cross_cats":["cs.DM","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-10T18:53:30Z","title":"Can Graph Neural Networks Count Substructures?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.04025","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:ae71ce83ccb7c8a0bb27ef87557849de0ab0bbaee000ccf52d426a916068fc2e","target":"record","created_at":"2026-07-05T01:47:29Z","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":"7993dea3b8b082d1bef25e539052b7d521ed133cd1c6dde55287526107bcf9b7","cross_cats_sorted":["cs.DM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-10T18:53:30Z","title_canon_sha256":"74e89fa45092d6a061eae6e796b190f1fce8ad17a0f24d70cccd5e391d0e1757"},"schema_version":"1.0","source":{"id":"2002.04025","kind":"arxiv","version":4}},"canonical_sha256":"23d3b951b736bbfe100410e916925468aad1442655e8a57a98595a678d838ad7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23d3b951b736bbfe100410e916925468aad1442655e8a57a98595a678d838ad7","first_computed_at":"2026-07-05T01:47:29.726915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:47:29.726915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TVm/Sv7sJUrCGH/SMJsfpQNqV5ox61/9fPSeHzrY/3HQGqjvd/irHOrVx8xxsYKKJku2bJAZvqnx83UljRy7BA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:47:29.727269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.04025","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae71ce83ccb7c8a0bb27ef87557849de0ab0bbaee000ccf52d426a916068fc2e","sha256:972b04b27bb1e2356cb749cc875f3531c191b2c284e3149895e0ff278600edab"],"state_sha256":"5b731598c9e0278bae93528deb21bd2b97e0a809dca8a5b41bf05c8064eedc06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2etGDfY1Ak1xaDdv8yXks70ka55r8hNLKGDcV1o0Mzx2ShfYkJDnFTPL293sCPieII8vXmoKFFTS4BiCunkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:57:10.467890Z","bundle_sha256":"1a9efdc10cfc99f06637d074b2e96c6682ec0a4cd9086db77dcfb05a4bc46bb1"}}