{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2IZW7WPIOMYJ4VH2UMDTEROMP7","short_pith_number":"pith:2IZW7WPI","schema_version":"1.0","canonical_sha256":"d2336fd9e873309e54faa3073245cc7ff7e0e2a7ac3408e5118d30fb05c9cb9f","source":{"kind":"arxiv","id":"1904.07216","version":1},"attestation_state":"computed","paper":{"title":"A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math.CO"],"primary_cat":"cs.DM","authors_text":"Martin Grohe, Sandra Kiefer","submitted_at":"2019-04-15T17:49:07Z","abstract_excerpt":"The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension can also be characterised in terms of the number of variables that is required to describe the graph up to isomorphism in first-order logic with counting quantifiers.\n  It is known that the WL dimension is upper-bounded for all graphs that exclude some fixed graph as a minor (Grohe, JACM 2012). However, the bounds that can be derived from this general result "},"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":"1904.07216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-15T17:49:07Z","cross_cats_sorted":["cs.CC","cs.LO","math.CO"],"title_canon_sha256":"fca11e830d4ca1f19fa79e9b98a2f40d4d199b9686caa2b86f763c14cda59d20","abstract_canon_sha256":"ff780301e70f2f8ef621cc6511541bbc8f826aeed3594196cf9d65fe689e007c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:34.898126Z","signature_b64":"1kp9nBsLw/q4A+kzQ133AwEFI+WSHJchEpq2Ce715xMDZcc1A5LCbkP9OHPJrV3usCUb1D9wXUBP4A61Jwk5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2336fd9e873309e54faa3073245cc7ff7e0e2a7ac3408e5118d30fb05c9cb9f","last_reissued_at":"2026-05-17T23:48:34.897606Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:34.897606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math.CO"],"primary_cat":"cs.DM","authors_text":"Martin Grohe, Sandra Kiefer","submitted_at":"2019-04-15T17:49:07Z","abstract_excerpt":"The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension can also be characterised in terms of the number of variables that is required to describe the graph up to isomorphism in first-order logic with counting quantifiers.\n  It is known that the WL dimension is upper-bounded for all graphs that exclude some fixed graph as a minor (Grohe, JACM 2012). However, the bounds that can be derived from this general result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07216","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.07216","created_at":"2026-05-17T23:48:34.897692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07216v1","created_at":"2026-05-17T23:48:34.897692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07216","created_at":"2026-05-17T23:48:34.897692+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IZW7WPIOMYJ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IZW7WPIOMYJ4VH2","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IZW7WPI","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7","json":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7.json","graph_json":"https://pith.science/api/pith-number/2IZW7WPIOMYJ4VH2UMDTEROMP7/graph.json","events_json":"https://pith.science/api/pith-number/2IZW7WPIOMYJ4VH2UMDTEROMP7/events.json","paper":"https://pith.science/paper/2IZW7WPI"},"agent_actions":{"view_html":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7","download_json":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7.json","view_paper":"https://pith.science/paper/2IZW7WPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07216&json=true","fetch_graph":"https://pith.science/api/pith-number/2IZW7WPIOMYJ4VH2UMDTEROMP7/graph.json","fetch_events":"https://pith.science/api/pith-number/2IZW7WPIOMYJ4VH2UMDTEROMP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/action/storage_attestation","attest_author":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/action/author_attestation","sign_citation":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/action/citation_signature","submit_replication":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/action/replication_record"}},"created_at":"2026-05-17T23:48:34.897692+00:00","updated_at":"2026-05-17T23:48:34.897692+00:00"}