{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6BABLCUVNHS2KF2XAHLTBH5WIL","short_pith_number":"pith:6BABLCUV","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"},"canonical_sha256":"f040158a9569e5a5175701d7309fb642e2efbde4ba27e80159063ea034b94f25","source":{"kind":"arxiv","id":"1808.08925","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08925","created_at":"2026-05-18T00:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08925v2","created_at":"2026-05-18T00:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08925","created_at":"2026-05-18T00:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"6BABLCUVNHS2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6BABLCUVNHS2KF2X","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6BABLCUV","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6BABLCUVNHS2KF2XAHLTBH5WIL","target":"record","payload":{"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"},"canonical_sha256":"f040158a9569e5a5175701d7309fb642e2efbde4ba27e80159063ea034b94f25","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"},"source_kind":"arxiv","source_id":"1808.08925","source_version":2,"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:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lmuvsqY8+AQgjoey7O1kGqYOAgyCzDSiRVywY4S3e6ooxN7klSKj2RUo2f0vSjlZyL/7m/FaCV61QO1oAGDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:01.199144Z"},"content_sha256":"d31a4e5d54fb69fe55b36394f4a6bf85ab3b7b97f56b675067210b17bc95e07c","schema_version":"1.0","event_id":"sha256:d31a4e5d54fb69fe55b36394f4a6bf85ab3b7b97f56b675067210b17bc95e07c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6BABLCUVNHS2KF2XAHLTBH5WIL","target":"graph","payload":{"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"},"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:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Q39GEMlNF+eFlBq/4VUdMcBjVX+d1olg/Llu3WuIUOCUkJXux12j5uE3Bp4CGr/jKVUFFJl+CZi0fyIQSjbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:01.199798Z"},"content_sha256":"6153e4588be913d19bca898529527e71b024d7a3419c80bc896d90d870b84458","schema_version":"1.0","event_id":"sha256:6153e4588be913d19bca898529527e71b024d7a3419c80bc896d90d870b84458"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/bundle.json","state_url":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/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-06-02T14:32:01Z","links":{"resolver":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL","bundle":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/bundle.json","state":"https://pith.science/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BABLCUVNHS2KF2XAHLTBH5WIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6BABLCUVNHS2KF2XAHLTBH5WIL","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":"52da077ecaee10fd05b891a248ec923466cc321327b484fb3e01b3fc99ee4148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T16:55:54Z","title_canon_sha256":"c21d2a2d161d5e42514f3aa2335476034fb39d2d8e3644c3edc8655680b15997"},"schema_version":"1.0","source":{"id":"1808.08925","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08925","created_at":"2026-05-18T00:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08925v2","created_at":"2026-05-18T00:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08925","created_at":"2026-05-18T00:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"6BABLCUVNHS2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6BABLCUVNHS2KF2X","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6BABLCUV","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:6153e4588be913d19bca898529527e71b024d7a3419c80bc896d90d870b84458","target":"graph","created_at":"2026-05-18T00:07:05Z","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 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$ ","authors_text":"Alessandra Tappini, Alfredo Navarra, Giuseppe Liotta, Karsten Klein, Patrizio Angelini, Peter Eades, Seok-Hee Hong, Stephen Kobourov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T16:55:54Z","title":"Turning Cliques into Paths to Achieve Planarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08925","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:d31a4e5d54fb69fe55b36394f4a6bf85ab3b7b97f56b675067210b17bc95e07c","target":"record","created_at":"2026-05-18T00:07:05Z","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":"52da077ecaee10fd05b891a248ec923466cc321327b484fb3e01b3fc99ee4148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T16:55:54Z","title_canon_sha256":"c21d2a2d161d5e42514f3aa2335476034fb39d2d8e3644c3edc8655680b15997"},"schema_version":"1.0","source":{"id":"1808.08925","kind":"arxiv","version":2}},"canonical_sha256":"f040158a9569e5a5175701d7309fb642e2efbde4ba27e80159063ea034b94f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f040158a9569e5a5175701d7309fb642e2efbde4ba27e80159063ea034b94f25","first_computed_at":"2026-05-18T00:07:05.042803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:05.042803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IBUURa0q+BtnMH54LLDuHBUAPCRzxGs/jhRh/coEajFWVC1hRTYcyxo65qIuyOAxv2DGOfuFvFeCe7KvZMHkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:05.043530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08925","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d31a4e5d54fb69fe55b36394f4a6bf85ab3b7b97f56b675067210b17bc95e07c","sha256:6153e4588be913d19bca898529527e71b024d7a3419c80bc896d90d870b84458"],"state_sha256":"98a39181a7c7f05a30cab2421710eb9735ab49f8bcfe73997f25cfee13348ea6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1n10ucl+S65v8YR2nBj7inw49NKNDXaWQFO0M9BWsQZmBlHeAGc1buPzsf6cLuKiViYpkA6qynassRwhdNuOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:32:01.203052Z","bundle_sha256":"9ad9f2a4a0c2e01a0a741ee4f5cd13ddb98819cc9782025ee6f90f3678cf8a56"}}