{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3RWSN5TBGNXDZ4DXH24IDTR3WZ","short_pith_number":"pith:3RWSN5TB","canonical_record":{"source":{"id":"1708.07354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-24T11:06:19Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"4712b5fad7f4efcdd343c08a2ae172fd253dac72f7a7575ce0522489b49aeeb0","abstract_canon_sha256":"3f0d3384b14892ba0e1634647f22382d85981512e5ce8febcab5847ac1b5a52a"},"schema_version":"1.0"},"canonical_sha256":"dc6d26f661336e3cf0773eb881ce3bb674bb303e0bfb911a413b62f9b594e86b","source":{"kind":"arxiv","id":"1708.07354","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07354","created_at":"2026-05-18T00:36:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07354v1","created_at":"2026-05-18T00:36:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07354","created_at":"2026-05-18T00:36:44Z"},{"alias_kind":"pith_short_12","alias_value":"3RWSN5TBGNXD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3RWSN5TBGNXDZ4DX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3RWSN5TB","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3RWSN5TBGNXDZ4DXH24IDTR3WZ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-24T11:06:19Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"4712b5fad7f4efcdd343c08a2ae172fd253dac72f7a7575ce0522489b49aeeb0","abstract_canon_sha256":"3f0d3384b14892ba0e1634647f22382d85981512e5ce8febcab5847ac1b5a52a"},"schema_version":"1.0"},"canonical_sha256":"dc6d26f661336e3cf0773eb881ce3bb674bb303e0bfb911a413b62f9b594e86b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:44.569823Z","signature_b64":"YV3XLcKcKMGk/Himvj9wEFNLp4IdwFrPiTx1KV+i8h+yhHyOuT3Aihg3+XfIf/m/HPqNOC2u0EY4EBsJ84jBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc6d26f661336e3cf0773eb881ce3bb674bb303e0bfb911a413b62f9b594e86b","last_reissued_at":"2026-05-18T00:36:44.569220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:44.569220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07354","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-18T00:36:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2oK/hKZpLP9gs+pa6PNQRLOm25+y+4rq4Ck1BliOOyBctVn7XDupanZKaQPW/GoRNK+vujL0ppXPWzfxJArCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:54.562661Z"},"content_sha256":"d7bde5ec1cafa121e183bb7eed343aefcff56defd8e047864c77b9e424d2a24a","schema_version":"1.0","event_id":"sha256:d7bde5ec1cafa121e183bb7eed343aefcff56defd8e047864c77b9e424d2a24a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3RWSN5TBGNXDZ4DXH24IDTR3WZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Weisfeiler-Leman Dimension of Planar Graphs is at most 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"cs.DM","authors_text":"Ilia Ponomarenko, Pascal Schweitzer, Sandra Kiefer","submitted_at":"2017-08-24T11:06:19Z","abstract_excerpt":"We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best known upper bounds for the dimension and number of variables were 14 and 15, respectively.\n  First we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of any arc-colored 3-connected graph belonging to this class.\n  Then we prove t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07354","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-18T00:36:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhwzsfBEwLUjwpvz2B22Ech/m03NqQCy/tfHn0nZzrKey6lyx/O4+hNqCttQ+qvcEIUwfB7JWToNaHV9y/ljDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:54.563358Z"},"content_sha256":"06b9a5331d1f9f417de443d3437890595d1000b882282bc3dadd50cfa074027f","schema_version":"1.0","event_id":"sha256:06b9a5331d1f9f417de443d3437890595d1000b882282bc3dadd50cfa074027f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RWSN5TBGNXDZ4DXH24IDTR3WZ/bundle.json","state_url":"https://pith.science/pith/3RWSN5TBGNXDZ4DXH24IDTR3WZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RWSN5TBGNXDZ4DXH24IDTR3WZ/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-05-28T18:15:54Z","links":{"resolver":"https://pith.science/pith/3RWSN5TBGNXDZ4DXH24IDTR3WZ","bundle":"https://pith.science/pith/3RWSN5TBGNXDZ4DXH24IDTR3WZ/bundle.json","state":"https://pith.science/pith/3RWSN5TBGNXDZ4DXH24IDTR3WZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RWSN5TBGNXDZ4DXH24IDTR3WZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3RWSN5TBGNXDZ4DXH24IDTR3WZ","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":"3f0d3384b14892ba0e1634647f22382d85981512e5ce8febcab5847ac1b5a52a","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-24T11:06:19Z","title_canon_sha256":"4712b5fad7f4efcdd343c08a2ae172fd253dac72f7a7575ce0522489b49aeeb0"},"schema_version":"1.0","source":{"id":"1708.07354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07354","created_at":"2026-05-18T00:36:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07354v1","created_at":"2026-05-18T00:36:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07354","created_at":"2026-05-18T00:36:44Z"},{"alias_kind":"pith_short_12","alias_value":"3RWSN5TBGNXD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3RWSN5TBGNXDZ4DX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3RWSN5TB","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:06b9a5331d1f9f417de443d3437890595d1000b882282bc3dadd50cfa074027f","target":"graph","created_at":"2026-05-18T00:36:44Z","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":"We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best known upper bounds for the dimension and number of variables were 14 and 15, respectively.\n  First we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of any arc-colored 3-connected graph belonging to this class.\n  Then we prove t","authors_text":"Ilia Ponomarenko, Pascal Schweitzer, Sandra Kiefer","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-24T11:06:19Z","title":"The Weisfeiler-Leman Dimension of Planar Graphs is at most 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07354","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:d7bde5ec1cafa121e183bb7eed343aefcff56defd8e047864c77b9e424d2a24a","target":"record","created_at":"2026-05-18T00:36:44Z","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":"3f0d3384b14892ba0e1634647f22382d85981512e5ce8febcab5847ac1b5a52a","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-24T11:06:19Z","title_canon_sha256":"4712b5fad7f4efcdd343c08a2ae172fd253dac72f7a7575ce0522489b49aeeb0"},"schema_version":"1.0","source":{"id":"1708.07354","kind":"arxiv","version":1}},"canonical_sha256":"dc6d26f661336e3cf0773eb881ce3bb674bb303e0bfb911a413b62f9b594e86b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc6d26f661336e3cf0773eb881ce3bb674bb303e0bfb911a413b62f9b594e86b","first_computed_at":"2026-05-18T00:36:44.569220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:44.569220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YV3XLcKcKMGk/Himvj9wEFNLp4IdwFrPiTx1KV+i8h+yhHyOuT3Aihg3+XfIf/m/HPqNOC2u0EY4EBsJ84jBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:44.569823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7bde5ec1cafa121e183bb7eed343aefcff56defd8e047864c77b9e424d2a24a","sha256:06b9a5331d1f9f417de443d3437890595d1000b882282bc3dadd50cfa074027f"],"state_sha256":"93f1fb152d804c059df489de3075a5a3f699642eef207414ef88d12f5f07769b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kLdg6FkE4cpZ9r7wsySk/eTT3DDcaAlYzGKwMkD0KWO6i2q6VMnJA2F932pTcDWrGSnMHfCdRMoIZ83i95s3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:15:54.566730Z","bundle_sha256":"a4d81738ff6279d1b9e886775fa1516326731bb3189dfad4036ec979311d2e25"}}