{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OXTBJAOPQJUZXF4UIURZCEE5BI","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":"5c8455b3aa4e95ac1f13377e24250b4d30c0a6dd56d295846eca09e0d16fa3ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T16:19:00Z","title_canon_sha256":"07b07681fc5990b9b60a116fcb2453fb57c734d368c482a030e5f6f26f02ec6b"},"schema_version":"1.0","source":{"id":"1512.04839","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04839","created_at":"2026-05-18T00:23:17Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04839v4","created_at":"2026-05-18T00:23:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04839","created_at":"2026-05-18T00:23:17Z"},{"alias_kind":"pith_short_12","alias_value":"OXTBJAOPQJUZ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXTBJAOPQJUZXF4U","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXTBJAOP","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:ca52a754528b288ed2ef19f328bdcb783c88c1ebf22d70aff313e5678a8219c6","target":"graph","created_at":"2026-05-18T00:23:17Z","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":"Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation substitutes a vertex $v$ by at most $k$ new vertices such that each neighbor of $v$ is connected to at least one of the new vertices.\n  We first examine the planar split thickness of complete graphs, complete bipartite graphs, multipartite graphs, bounded degree graphs, and genus-1 graphs. We then prove that it is NP-hard to recognize graphs that are $2$-splittable i","authors_text":"Anna Lubiw, Aude Maignan, David Eppstein, Debajyoti Mondal, Giuseppe Liotta, Hamideh Vosoughpour, Philipp Kindermann, Stephen Kobourov, Stephen Wismath, Sue Whitesides","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T16:19:00Z","title":"On the Planar Split Thickness of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04839","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:9e58781612f3d4583b79ba2bf9221d5229ba4d601844653c6c245f91e8d94e0c","target":"record","created_at":"2026-05-18T00:23:17Z","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":"5c8455b3aa4e95ac1f13377e24250b4d30c0a6dd56d295846eca09e0d16fa3ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T16:19:00Z","title_canon_sha256":"07b07681fc5990b9b60a116fcb2453fb57c734d368c482a030e5f6f26f02ec6b"},"schema_version":"1.0","source":{"id":"1512.04839","kind":"arxiv","version":4}},"canonical_sha256":"75e61481cf82699b9794452391109d0a36532abc839ba09c6dba749d65bd6fa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e61481cf82699b9794452391109d0a36532abc839ba09c6dba749d65bd6fa1","first_computed_at":"2026-05-18T00:23:17.321811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:17.321811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JMmGgPDC2/xCxjS/PyfleDm/gj25ms8CncVtsu7h7eojLt/gRG4sHpw8Ec3iXqUtuT0DHFl82ngGNUTX93PLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:17.322408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04839","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e58781612f3d4583b79ba2bf9221d5229ba4d601844653c6c245f91e8d94e0c","sha256:ca52a754528b288ed2ef19f328bdcb783c88c1ebf22d70aff313e5678a8219c6"],"state_sha256":"d6e8c909aecb90adaad868805458368c3db9dabec0b93d0e7305bfcc3fb8dba7"}