{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QACLWCZJ6N5PPEG6ZYC5UYKQOV","short_pith_number":"pith:QACLWCZJ","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"},"canonical_sha256":"8004bb0b29f37af790dece05da6150757e0b84252027db75d524eaa377b385a3","source":{"kind":"arxiv","id":"1902.06575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06575","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06575v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06575","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"QACLWCZJ6N5P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QACLWCZJ6N5PPEG6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QACLWCZJ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QACLWCZJ6N5PPEG6ZYC5UYKQOV","target":"record","payload":{"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"},"canonical_sha256":"8004bb0b29f37af790dece05da6150757e0b84252027db75d524eaa377b385a3","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"},"source_kind":"arxiv","source_id":"1902.06575","source_version":1,"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-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prOjL51WMhQ3Jv/9WoahtjfDItmzyBHreA1ZXSaEdf/7yYGpjyI8abK12pAXA4wiAXQMDsNrRLmX1RGfE//jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:23:41.433046Z"},"content_sha256":"ce96fb96bbaca99920bd53fb75ed8c841d85b7d3b9eb3fe33836d985a936ab13","schema_version":"1.0","event_id":"sha256:ce96fb96bbaca99920bd53fb75ed8c841d85b7d3b9eb3fe33836d985a936ab13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QACLWCZJ6N5PPEG6ZYC5UYKQOV","target":"graph","payload":{"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"},"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-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WqFKgszNM/x/BqOv5suR2R8/3fNbqUxVXFKpI/BprQoxx8yRNtsnMDwmfWxT6bd31l/sBb6+Nz2NrwhvwS/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:23:41.433401Z"},"content_sha256":"1f0fb9ea79cd83136132775f7ead3f8c8b01ad9c74b95d8673b0469644b7fae6","schema_version":"1.0","event_id":"sha256:1f0fb9ea79cd83136132775f7ead3f8c8b01ad9c74b95d8673b0469644b7fae6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/bundle.json","state_url":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/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-05-30T12:23:41Z","links":{"resolver":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV","bundle":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/bundle.json","state":"https://pith.science/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QACLWCZJ6N5PPEG6ZYC5UYKQOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QACLWCZJ6N5PPEG6ZYC5UYKQOV","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":"b2bb45f000a1044f27f0ab56375c3610a27ae7035b4d115f1ecbdafc6f72ac7e","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-18T14:03:25Z","title_canon_sha256":"a0ac85565ede6fc56a24dc83cb6dec49dcca52154573235357031ed4fab28c91"},"schema_version":"1.0","source":{"id":"1902.06575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06575","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06575v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06575","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"QACLWCZJ6N5P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QACLWCZJ6N5PPEG6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QACLWCZJ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:1f0fb9ea79cd83136132775f7ead3f8c8b01ad9c74b95d8673b0469644b7fae6","target":"graph","created_at":"2026-05-17T23:53:45Z","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":"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$","authors_text":"Fabrizio Frati, Giordano Da Lozzo, Giuseppe Di Battista","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-18T14:03:25Z","title":"Extending Upward Planar Graph Drawings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06575","kind":"arxiv","version":1},"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:ce96fb96bbaca99920bd53fb75ed8c841d85b7d3b9eb3fe33836d985a936ab13","target":"record","created_at":"2026-05-17T23:53:45Z","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":"b2bb45f000a1044f27f0ab56375c3610a27ae7035b4d115f1ecbdafc6f72ac7e","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-18T14:03:25Z","title_canon_sha256":"a0ac85565ede6fc56a24dc83cb6dec49dcca52154573235357031ed4fab28c91"},"schema_version":"1.0","source":{"id":"1902.06575","kind":"arxiv","version":1}},"canonical_sha256":"8004bb0b29f37af790dece05da6150757e0b84252027db75d524eaa377b385a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8004bb0b29f37af790dece05da6150757e0b84252027db75d524eaa377b385a3","first_computed_at":"2026-05-17T23:53:45.090526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:45.090526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xwyDAc+AzuNmTlcxa8OCiOl0Wg2ldSVoM3OtwMpjWk7d9khtFH8NUkvJCCfKXhRpWhOZiqkqnJQ2tD2zUBT8BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:45.091113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce96fb96bbaca99920bd53fb75ed8c841d85b7d3b9eb3fe33836d985a936ab13","sha256:1f0fb9ea79cd83136132775f7ead3f8c8b01ad9c74b95d8673b0469644b7fae6"],"state_sha256":"2e54b3de6b99ab2466219420afb9ae75b4fc7ca8832e93dde0b6505e54effad1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ObIo647nNgf6hzpOL+y0ckCG3fXqvQOWyF5yVgCR62Z/gGdxGwcs5155ASue6M6FtCbzI9QWSJ+uUwryBRRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:23:41.435230Z","bundle_sha256":"6d6c045350731a7cedc199da8970ad984916b84881e141918f6a42e40a8b9194"}}