{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N656AL7NYE3FTAUAPCXORGF2VR","short_pith_number":"pith:N656AL7N","schema_version":"1.0","canonical_sha256":"6fbbe02fedc13659828078aee898baac4bf9304812448c8b42a5d09ef35bbf4c","source":{"kind":"arxiv","id":"1802.10300","version":2},"attestation_state":"computed","paper":{"title":"Edge Partitions of Optimal $2$-plane and $3$-plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chrysanthi Raftopoulou, Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Michael Bekos, Walter Didimo","submitted_at":"2018-02-28T08:06:22Z","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"},"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":"1802.10300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-28T08:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"8d32250a0109de80074b544a96f202629e20b9fa654b5a132843e0ff2324e5f6","abstract_canon_sha256":"ce32724728a16076844ea9fe608552fb65888e9b4dcdb7e24f2f82bb85d6bc17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:43.390888Z","signature_b64":"AOwPTT8JTYUot8x5jvxd+u8xTvGM3xFeWCFjVhtjRHDjA10o4rU3uIFEVJbHIt6SE7GRVKrvgw4mPytvQswGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fbbe02fedc13659828078aee898baac4bf9304812448c8b42a5d09ef35bbf4c","last_reissued_at":"2026-05-18T00:12:43.390275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:43.390275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge Partitions of Optimal $2$-plane and $3$-plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chrysanthi Raftopoulou, Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Michael Bekos, Walter Didimo","submitted_at":"2018-02-28T08:06:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10300","kind":"arxiv","version":2},"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":"1802.10300","created_at":"2026-05-18T00:12:43.390370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10300v2","created_at":"2026-05-18T00:12:43.390370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10300","created_at":"2026-05-18T00:12:43.390370+00:00"},{"alias_kind":"pith_short_12","alias_value":"N656AL7NYE3F","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N656AL7NYE3FTAUA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N656AL7N","created_at":"2026-05-18T12:32:40.477152+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/N656AL7NYE3FTAUAPCXORGF2VR","json":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR.json","graph_json":"https://pith.science/api/pith-number/N656AL7NYE3FTAUAPCXORGF2VR/graph.json","events_json":"https://pith.science/api/pith-number/N656AL7NYE3FTAUAPCXORGF2VR/events.json","paper":"https://pith.science/paper/N656AL7N"},"agent_actions":{"view_html":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR","download_json":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR.json","view_paper":"https://pith.science/paper/N656AL7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10300&json=true","fetch_graph":"https://pith.science/api/pith-number/N656AL7NYE3FTAUAPCXORGF2VR/graph.json","fetch_events":"https://pith.science/api/pith-number/N656AL7NYE3FTAUAPCXORGF2VR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR/action/storage_attestation","attest_author":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR/action/author_attestation","sign_citation":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR/action/citation_signature","submit_replication":"https://pith.science/pith/N656AL7NYE3FTAUAPCXORGF2VR/action/replication_record"}},"created_at":"2026-05-18T00:12:43.390370+00:00","updated_at":"2026-05-18T00:12:43.390370+00:00"}