{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2IZW7WPIOMYJ4VH2UMDTEROMP7","short_pith_number":"pith:2IZW7WPI","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"},"canonical_sha256":"d2336fd9e873309e54faa3073245cc7ff7e0e2a7ac3408e5118d30fb05c9cb9f","source":{"kind":"arxiv","id":"1904.07216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07216","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07216v1","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07216","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"2IZW7WPIOMYJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2IZW7WPIOMYJ4VH2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2IZW7WPI","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2IZW7WPIOMYJ4VH2UMDTEROMP7","target":"record","payload":{"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"},"canonical_sha256":"d2336fd9e873309e54faa3073245cc7ff7e0e2a7ac3408e5118d30fb05c9cb9f","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"},"source_kind":"arxiv","source_id":"1904.07216","source_version":1,"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:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHgfv43v9K/L3VWOfAd08zURixuBtxeP0OTgVplO21eAOBb4FHhVvtOwot1JJ2IGUaSIMgFidfNKwXE0c8AADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:01:24.931003Z"},"content_sha256":"a4927372076e2760315202b233d404825e291d343833478c1b8e3869c5fade4a","schema_version":"1.0","event_id":"sha256:a4927372076e2760315202b233d404825e291d343833478c1b8e3869c5fade4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2IZW7WPIOMYJ4VH2UMDTEROMP7","target":"graph","payload":{"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"},"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:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeDxTLz+MQuiblUQl+xHpLpwuwHsafK/NP0WZnKtA8hJpYQuan7KpYJCnePzoc7gxUb5wQdTIKwMyveTF693Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:01:24.931369Z"},"content_sha256":"ab4edd5af11dee8c238681348076801fb331d768f48c692212935c16e5139c04","schema_version":"1.0","event_id":"sha256:ab4edd5af11dee8c238681348076801fb331d768f48c692212935c16e5139c04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/bundle.json","state_url":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/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-06-05T10:01:24Z","links":{"resolver":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7","bundle":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/bundle.json","state":"https://pith.science/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IZW7WPIOMYJ4VH2UMDTEROMP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2IZW7WPIOMYJ4VH2UMDTEROMP7","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":"ff780301e70f2f8ef621cc6511541bbc8f826aeed3594196cf9d65fe689e007c","cross_cats_sorted":["cs.CC","cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-15T17:49:07Z","title_canon_sha256":"fca11e830d4ca1f19fa79e9b98a2f40d4d199b9686caa2b86f763c14cda59d20"},"schema_version":"1.0","source":{"id":"1904.07216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07216","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07216v1","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07216","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"2IZW7WPIOMYJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2IZW7WPIOMYJ4VH2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2IZW7WPI","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:ab4edd5af11dee8c238681348076801fb331d768f48c692212935c16e5139c04","target":"graph","created_at":"2026-05-17T23:48:34Z","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":"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 ","authors_text":"Martin Grohe, Sandra Kiefer","cross_cats":["cs.CC","cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-15T17:49:07Z","title":"A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07216","kind":"arxiv","version":1},"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:a4927372076e2760315202b233d404825e291d343833478c1b8e3869c5fade4a","target":"record","created_at":"2026-05-17T23:48:34Z","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":"ff780301e70f2f8ef621cc6511541bbc8f826aeed3594196cf9d65fe689e007c","cross_cats_sorted":["cs.CC","cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-15T17:49:07Z","title_canon_sha256":"fca11e830d4ca1f19fa79e9b98a2f40d4d199b9686caa2b86f763c14cda59d20"},"schema_version":"1.0","source":{"id":"1904.07216","kind":"arxiv","version":1}},"canonical_sha256":"d2336fd9e873309e54faa3073245cc7ff7e0e2a7ac3408e5118d30fb05c9cb9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2336fd9e873309e54faa3073245cc7ff7e0e2a7ac3408e5118d30fb05c9cb9f","first_computed_at":"2026-05-17T23:48:34.897606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:34.897606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1kp9nBsLw/q4A+kzQ133AwEFI+WSHJchEpq2Ce715xMDZcc1A5LCbkP9OHPJrV3usCUb1D9wXUBP4A61Jwk5Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:34.898126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4927372076e2760315202b233d404825e291d343833478c1b8e3869c5fade4a","sha256:ab4edd5af11dee8c238681348076801fb331d768f48c692212935c16e5139c04"],"state_sha256":"e93a3e1ba39c81949cf9dde2667d2c6f96a48bf70cbe270c8d654262acc8ca70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HywvfOwFp2vOh47fWTQiR3mgGKnesSp8Hu1w5tKCgr/GTBxwvSgv+aaIrCVTIEKIqW1zhD97MlHMX/syVCJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:01:24.933358Z","bundle_sha256":"25dac180543d581e6dcbb51adcd3f2c7d2af412d8b44a9fc5f70d21be79d0250"}}