{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:42JQ5XKGIMDEYD6QWAIV5P4DZD","short_pith_number":"pith:42JQ5XKG","schema_version":"1.0","canonical_sha256":"e6930edd4643064c0fd0b0115ebf83c8edc8f41858b37bef8d7691063e967e15","source":{"kind":"arxiv","id":"1311.3607","version":2},"attestation_state":"computed","paper":{"title":"Advancements on SEFE and Partitioned Book Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Daniel Neuwirth, Giordano Da Lozzo, Patrizio Angelini","submitted_at":"2013-11-14T19:00:59Z","abstract_excerpt":"In this work we investigate the complexity of some problems related to the {\\em Simultaneous Embedding with Fixed Edges} (SEFE) of $k$ planar graphs and the PARTITIONED $k$-PAGE BOOK EMBEDDING (PBE-$k$) problems, which are known to be equivalent under certain conditions.\n  While the computational complexity of SEFE for $k=2$ is still a central open question in Graph Drawing, the problem is NP-complete for $k \\geq 3$ [Gassner {\\em et al.}, WG '06], even if the intersection graph is the same for each pair of graphs ({\\em sunflower intersection}) [Schaefer, JGAA (2013)].\n  We improve on these res"},"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":"1311.3607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-14T19:00:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"282b0d03d432940bfd456c07371b05a9bbac1b831fdebc2c1842e265438a2a38","abstract_canon_sha256":"f4e526373693bf80688fef3a46061f21f69dfb0ed3313c6bf6e4d85ce517cf37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.774653Z","signature_b64":"Jn+cWpiQqK4AdRIftm5PVbFlssHwIjUnSuu3kgMctOpJG3j6kk6Bp/Cj5TsMhZ1MmLstCUWXzGh06jsN1V57AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6930edd4643064c0fd0b0115ebf83c8edc8f41858b37bef8d7691063e967e15","last_reissued_at":"2026-05-18T02:53:07.774047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.774047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advancements on SEFE and Partitioned Book Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Daniel Neuwirth, Giordano Da Lozzo, Patrizio Angelini","submitted_at":"2013-11-14T19:00:59Z","abstract_excerpt":"In this work we investigate the complexity of some problems related to the {\\em Simultaneous Embedding with Fixed Edges} (SEFE) of $k$ planar graphs and the PARTITIONED $k$-PAGE BOOK EMBEDDING (PBE-$k$) problems, which are known to be equivalent under certain conditions.\n  While the computational complexity of SEFE for $k=2$ is still a central open question in Graph Drawing, the problem is NP-complete for $k \\geq 3$ [Gassner {\\em et al.}, WG '06], even if the intersection graph is the same for each pair of graphs ({\\em sunflower intersection}) [Schaefer, JGAA (2013)].\n  We improve on these res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3607","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":"1311.3607","created_at":"2026-05-18T02:53:07.774159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3607v2","created_at":"2026-05-18T02:53:07.774159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3607","created_at":"2026-05-18T02:53:07.774159+00:00"},{"alias_kind":"pith_short_12","alias_value":"42JQ5XKGIMDE","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"42JQ5XKGIMDEYD6Q","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"42JQ5XKG","created_at":"2026-05-18T12:27:32.513160+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/42JQ5XKGIMDEYD6QWAIV5P4DZD","json":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD.json","graph_json":"https://pith.science/api/pith-number/42JQ5XKGIMDEYD6QWAIV5P4DZD/graph.json","events_json":"https://pith.science/api/pith-number/42JQ5XKGIMDEYD6QWAIV5P4DZD/events.json","paper":"https://pith.science/paper/42JQ5XKG"},"agent_actions":{"view_html":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD","download_json":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD.json","view_paper":"https://pith.science/paper/42JQ5XKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3607&json=true","fetch_graph":"https://pith.science/api/pith-number/42JQ5XKGIMDEYD6QWAIV5P4DZD/graph.json","fetch_events":"https://pith.science/api/pith-number/42JQ5XKGIMDEYD6QWAIV5P4DZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD/action/storage_attestation","attest_author":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD/action/author_attestation","sign_citation":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD/action/citation_signature","submit_replication":"https://pith.science/pith/42JQ5XKGIMDEYD6QWAIV5P4DZD/action/replication_record"}},"created_at":"2026-05-18T02:53:07.774159+00:00","updated_at":"2026-05-18T02:53:07.774159+00:00"}