{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N656AL7NYE3FTAUAPCXORGF2VR","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":"ce32724728a16076844ea9fe608552fb65888e9b4dcdb7e24f2f82bb85d6bc17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-28T08:06:22Z","title_canon_sha256":"8d32250a0109de80074b544a96f202629e20b9fa654b5a132843e0ff2324e5f6"},"schema_version":"1.0","source":{"id":"1802.10300","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10300","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10300v2","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10300","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"N656AL7NYE3F","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N656AL7NYE3FTAUA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N656AL7N","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2faeb26b4adad9099df90b41eaec062486a86775dc600372d191d33e8f450ddf","target":"graph","created_at":"2026-05-18T00:12:43Z","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":"A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a graph with a simpler structure. While this problem has been studied for $k=1$, we focus on optimal $2$-plane and $3$-plane graphs, which are $2$-plane and $3$-plane graphs with maximum density. We prove the following results. (i) It is not possible to partition the edges of a simple optimal $2$-plane graph into a $1$-plane graph and a forest, while (ii) an edg","authors_text":"Chrysanthi Raftopoulou, Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Michael Bekos, Walter Didimo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-28T08:06:22Z","title":"Edge Partitions of Optimal $2$-plane and $3$-plane Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10300","kind":"arxiv","version":2},"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:0ce225b4e8a360cdf9e330533c08860cb27f9127fb7577cb03197f3d05395cae","target":"record","created_at":"2026-05-18T00:12:43Z","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":"ce32724728a16076844ea9fe608552fb65888e9b4dcdb7e24f2f82bb85d6bc17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-28T08:06:22Z","title_canon_sha256":"8d32250a0109de80074b544a96f202629e20b9fa654b5a132843e0ff2324e5f6"},"schema_version":"1.0","source":{"id":"1802.10300","kind":"arxiv","version":2}},"canonical_sha256":"6fbbe02fedc13659828078aee898baac4bf9304812448c8b42a5d09ef35bbf4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fbbe02fedc13659828078aee898baac4bf9304812448c8b42a5d09ef35bbf4c","first_computed_at":"2026-05-18T00:12:43.390275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:43.390275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AOwPTT8JTYUot8x5jvxd+u8xTvGM3xFeWCFjVhtjRHDjA10o4rU3uIFEVJbHIt6SE7GRVKrvgw4mPytvQswGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:43.390888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10300","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ce225b4e8a360cdf9e330533c08860cb27f9127fb7577cb03197f3d05395cae","sha256:2faeb26b4adad9099df90b41eaec062486a86775dc600372d191d33e8f450ddf"],"state_sha256":"c5d69ebe59a42fd8ad6d70e59d62892e942775d2b8b5eb42ccbf0b6b03961da2"}