{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6BABLCUVNHS2KF2XAHLTBH5WIL","short_pith_number":"pith:6BABLCUV","schema_version":"1.0","canonical_sha256":"f040158a9569e5a5175701d7309fb642e2efbde4ba27e80159063ea034b94f25","source":{"kind":"arxiv","id":"1808.08925","version":2},"attestation_state":"computed","paper":{"title":"Turning Cliques into Paths to Achieve Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alessandra Tappini, Alfredo Navarra, Giuseppe Liotta, Karsten Klein, Patrizio Angelini, Peter Eades, Seok-Hee Hong, Stephen Kobourov","submitted_at":"2018-08-27T16:55:54Z","abstract_excerpt":"Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices are partitioned into subsets of size at most $h$, each inducing a clique, remove edges from each clique so that the subgraph induced by each subset is a path, in such a way that the resulting subgraph of $G$ is planar. We study this problem when $G$ is a simple topological graph, and establish its complexity in relation to $k$-planarity. We prove that $h$-Clique2Path Planarity is NP-complete even when $h=4$ and $G$ "},"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":"1808.08925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T16:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"c21d2a2d161d5e42514f3aa2335476034fb39d2d8e3644c3edc8655680b15997","abstract_canon_sha256":"52da077ecaee10fd05b891a248ec923466cc321327b484fb3e01b3fc99ee4148"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:05.043530Z","signature_b64":"IBUURa0q+BtnMH54LLDuHBUAPCRzxGs/jhRh/coEajFWVC1hRTYcyxo65qIuyOAxv2DGOfuFvFeCe7KvZMHkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f040158a9569e5a5175701d7309fb642e2efbde4ba27e80159063ea034b94f25","last_reissued_at":"2026-05-18T00:07:05.042803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:05.042803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turning Cliques into Paths to Achieve Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alessandra Tappini, Alfredo Navarra, Giuseppe Liotta, Karsten Klein, Patrizio Angelini, Peter Eades, Seok-Hee Hong, Stephen Kobourov","submitted_at":"2018-08-27T16:55:54Z","abstract_excerpt":"Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices are partitioned into subsets of size at most $h$, each inducing a clique, remove edges from each clique so that the subgraph induced by each subset is a path, in such a way that the resulting subgraph of $G$ is planar. We study this problem when $G$ is a simple topological graph, and establish its complexity in relation to $k$-planarity. We prove that $h$-Clique2Path Planarity is NP-complete even when $h=4$ and $G$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08925","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":"1808.08925","created_at":"2026-05-18T00:07:05.042940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08925v2","created_at":"2026-05-18T00:07:05.042940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08925","created_at":"2026-05-18T00:07:05.042940+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BABLCUVNHS2","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BABLCUVNHS2KF2X","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BABLCUV","created_at":"2026-05-18T12:32:08.215937+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/6BABLCUVNHS2KF2XAHLTBH5WIL","json":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL.json","graph_json":"https://pith.science/api/pith-number/6BABLCUVNHS2KF2XAHLTBH5WIL/graph.json","events_json":"https://pith.science/api/pith-number/6BABLCUVNHS2KF2XAHLTBH5WIL/events.json","paper":"https://pith.science/paper/6BABLCUV"},"agent_actions":{"view_html":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL","download_json":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL.json","view_paper":"https://pith.science/paper/6BABLCUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08925&json=true","fetch_graph":"https://pith.science/api/pith-number/6BABLCUVNHS2KF2XAHLTBH5WIL/graph.json","fetch_events":"https://pith.science/api/pith-number/6BABLCUVNHS2KF2XAHLTBH5WIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/action/storage_attestation","attest_author":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/action/author_attestation","sign_citation":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/action/citation_signature","submit_replication":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/action/replication_record"}},"created_at":"2026-05-18T00:07:05.042940+00:00","updated_at":"2026-05-18T00:07:05.042940+00:00"}