{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QACLWCZJ6N5PPEG6ZYC5UYKQOV","short_pith_number":"pith:QACLWCZJ","schema_version":"1.0","canonical_sha256":"8004bb0b29f37af790dece05da6150757e0b84252027db75d524eaa377b385a3","source":{"kind":"arxiv","id":"1902.06575","version":1},"attestation_state":"computed","paper":{"title":"Extending Upward Planar Graph Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Giordano Da Lozzo, Giuseppe Di Battista","submitted_at":"2019-02-18T14:03:25Z","abstract_excerpt":"In this paper we study the computational complexity of the Upward Planarity Extension problem, which takes in input an upward planar drawing $\\Gamma_H$ of a subgraph $H$ of a directed graph $G$ and asks whether $\\Gamma_H$ can be extended to an upward planar drawing of $G$. Our study fits into the line of research on the extensibility of partial representations, which has recently become a mainstream in Graph Drawing.\n  We show the following results.\n  First, we prove that the Upward Planarity Extension problem is NP-complete, even if $G$ has a prescribed upward embedding, the vertex set of $H$"},"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":"1902.06575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-18T14:03:25Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"a0ac85565ede6fc56a24dc83cb6dec49dcca52154573235357031ed4fab28c91","abstract_canon_sha256":"b2bb45f000a1044f27f0ab56375c3610a27ae7035b4d115f1ecbdafc6f72ac7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:45.091113Z","signature_b64":"xwyDAc+AzuNmTlcxa8OCiOl0Wg2ldSVoM3OtwMpjWk7d9khtFH8NUkvJCCfKXhRpWhOZiqkqnJQ2tD2zUBT8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8004bb0b29f37af790dece05da6150757e0b84252027db75d524eaa377b385a3","last_reissued_at":"2026-05-17T23:53:45.090526Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:45.090526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending Upward Planar Graph Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Giordano Da Lozzo, Giuseppe Di Battista","submitted_at":"2019-02-18T14:03:25Z","abstract_excerpt":"In this paper we study the computational complexity of the Upward Planarity Extension problem, which takes in input an upward planar drawing $\\Gamma_H$ of a subgraph $H$ of a directed graph $G$ and asks whether $\\Gamma_H$ can be extended to an upward planar drawing of $G$. Our study fits into the line of research on the extensibility of partial representations, which has recently become a mainstream in Graph Drawing.\n  We show the following results.\n  First, we prove that the Upward Planarity Extension problem is NP-complete, even if $G$ has a prescribed upward embedding, the vertex set of $H$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06575","kind":"arxiv","version":1},"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":"1902.06575","created_at":"2026-05-17T23:53:45.090599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06575v1","created_at":"2026-05-17T23:53:45.090599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06575","created_at":"2026-05-17T23:53:45.090599+00:00"},{"alias_kind":"pith_short_12","alias_value":"QACLWCZJ6N5P","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QACLWCZJ6N5PPEG6","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QACLWCZJ","created_at":"2026-05-18T12:33:27.125529+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/QACLWCZJ6N5PPEG6ZYC5UYKQOV","json":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV.json","graph_json":"https://pith.science/api/pith-number/QACLWCZJ6N5PPEG6ZYC5UYKQOV/graph.json","events_json":"https://pith.science/api/pith-number/QACLWCZJ6N5PPEG6ZYC5UYKQOV/events.json","paper":"https://pith.science/paper/QACLWCZJ"},"agent_actions":{"view_html":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV","download_json":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV.json","view_paper":"https://pith.science/paper/QACLWCZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06575&json=true","fetch_graph":"https://pith.science/api/pith-number/QACLWCZJ6N5PPEG6ZYC5UYKQOV/graph.json","fetch_events":"https://pith.science/api/pith-number/QACLWCZJ6N5PPEG6ZYC5UYKQOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/action/storage_attestation","attest_author":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/action/author_attestation","sign_citation":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/action/citation_signature","submit_replication":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/action/replication_record"}},"created_at":"2026-05-17T23:53:45.090599+00:00","updated_at":"2026-05-17T23:53:45.090599+00:00"}