{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5TI4BM3A3YUCBWOGFBWEGE5K4K","short_pith_number":"pith:5TI4BM3A","schema_version":"1.0","canonical_sha256":"ecd1c0b360de2820d9c6286c4313aae29cc3291d0bc0ea94d7c696e486403865","source":{"kind":"arxiv","id":"2309.17053","version":3},"attestation_state":"computed","paper":{"title":"On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Matthias Lanzinger, Pablo Barcel\\'o","submitted_at":"2023-09-29T08:26:44Z","abstract_excerpt":"Seminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the $k$-dimensional Weisfeiler-Leman ($k$WL) test, a widely-recognized method for verifying graph isomorphism. This connection has reignited interest in comprehending the specific graph properties effectively distinguishable by the $k$WL test. A central focus of research in this field revolves around determining the least dimensionality $k$, for which $k$WL can discern graphs with different number of occurrences of a pattern graph $P$. We refer to s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.17053","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-29T08:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"7adefcf72834bc01339281e70dfc0f63ed9465543f66c31ce3341eab630a9450","abstract_canon_sha256":"ca5f3b1677aacf23896e3a3e75c5328c4776783075393015962b9f32fa6cd3b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:32.815996Z","signature_b64":"v2v/dqAutKhAmprhTQpSVmwzR0yVZdsCxlRvbIs4lfiIH8pL/sgmWG1kOYNQqYIN+IgynQFr48Y6Hoj6TX3vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd1c0b360de2820d9c6286c4313aae29cc3291d0bc0ea94d7c696e486403865","last_reissued_at":"2026-07-05T08:01:32.815478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:32.815478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Matthias Lanzinger, Pablo Barcel\\'o","submitted_at":"2023-09-29T08:26:44Z","abstract_excerpt":"Seminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the $k$-dimensional Weisfeiler-Leman ($k$WL) test, a widely-recognized method for verifying graph isomorphism. This connection has reignited interest in comprehending the specific graph properties effectively distinguishable by the $k$WL test. A central focus of research in this field revolves around determining the least dimensionality $k$, for which $k$WL can discern graphs with different number of occurrences of a pattern graph $P$. We refer to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.17053","kind":"arxiv","version":3},"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/2309.17053/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.17053","created_at":"2026-07-05T08:01:32.815539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.17053v3","created_at":"2026-07-05T08:01:32.815539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.17053","created_at":"2026-07-05T08:01:32.815539+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TI4BM3A3YUC","created_at":"2026-07-05T08:01:32.815539+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TI4BM3A3YUCBWOG","created_at":"2026-07-05T08:01:32.815539+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TI4BM3A","created_at":"2026-07-05T08:01:32.815539+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07934","citing_title":"Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2606.31803","citing_title":"Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K","json":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K.json","graph_json":"https://pith.science/api/pith-number/5TI4BM3A3YUCBWOGFBWEGE5K4K/graph.json","events_json":"https://pith.science/api/pith-number/5TI4BM3A3YUCBWOGFBWEGE5K4K/events.json","paper":"https://pith.science/paper/5TI4BM3A"},"agent_actions":{"view_html":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K","download_json":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K.json","view_paper":"https://pith.science/paper/5TI4BM3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.17053&json=true","fetch_graph":"https://pith.science/api/pith-number/5TI4BM3A3YUCBWOGFBWEGE5K4K/graph.json","fetch_events":"https://pith.science/api/pith-number/5TI4BM3A3YUCBWOGFBWEGE5K4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K/action/storage_attestation","attest_author":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K/action/author_attestation","sign_citation":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K/action/citation_signature","submit_replication":"https://pith.science/pith/5TI4BM3A3YUCBWOGFBWEGE5K4K/action/replication_record"}},"created_at":"2026-07-05T08:01:32.815539+00:00","updated_at":"2026-07-05T08:01:32.815539+00:00"}