{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:REYV3G3MCSHTZ4OKKDHF2UMWDW","short_pith_number":"pith:REYV3G3M","schema_version":"1.0","canonical_sha256":"89315d9b6c148f3cf1ca50ce5d51961daaaa017d998eb92130603ba95c4357c7","source":{"kind":"arxiv","id":"1808.10826","version":3},"attestation_state":"computed","paper":{"title":"Upward Planar Morphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Giordano Da Lozzo, Giuseppe Di Battista, Maurizio Patrignani, Vincenzo Roselli","submitted_at":"2018-08-31T16:03:51Z","abstract_excerpt":"We prove that, given two topologically-equivalent upward planar straight-line drawings of an $n$-vertex directed graph $G$, there always exists a morph between them such that all the intermediate drawings of the morph are upward planar and straight-line. Such a morph consists of $O(1)$ morphing steps if $G$ is a reduced planar $st$-graph, $O(n)$ morphing steps if $G$ is a planar $st$-graph, $O(n)$ morphing steps if $G$ is a reduced upward planar graph, and $O(n^2)$ morphing steps if $G$ is a general upward planar graph. Further, we show that $\\Omega(n)$ morphing steps might be necessary for an"},"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.10826","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T16:03:51Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"79730f15713152eabbf46263b4bea8d61fdba388301055cc1816fe5888e41bea","abstract_canon_sha256":"2f18d73647a3b04e223fe56b2d39d2d11976736271dcb7634715023c16f6ae7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:31.686293Z","signature_b64":"CCXjfG7KtDjum6p5s1EpLUaMDL+/Ve9B9OHngZssBL75Kt6v5HhAHY81viqr5iH87MIoQdIxym+A4e2VjmQtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89315d9b6c148f3cf1ca50ce5d51961daaaa017d998eb92130603ba95c4357c7","last_reissued_at":"2026-05-18T00:03:31.685697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:31.685697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upward Planar Morphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Giordano Da Lozzo, Giuseppe Di Battista, Maurizio Patrignani, Vincenzo Roselli","submitted_at":"2018-08-31T16:03:51Z","abstract_excerpt":"We prove that, given two topologically-equivalent upward planar straight-line drawings of an $n$-vertex directed graph $G$, there always exists a morph between them such that all the intermediate drawings of the morph are upward planar and straight-line. Such a morph consists of $O(1)$ morphing steps if $G$ is a reduced planar $st$-graph, $O(n)$ morphing steps if $G$ is a planar $st$-graph, $O(n)$ morphing steps if $G$ is a reduced upward planar graph, and $O(n^2)$ morphing steps if $G$ is a general upward planar graph. Further, we show that $\\Omega(n)$ morphing steps might be necessary for an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10826","kind":"arxiv","version":3},"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.10826","created_at":"2026-05-18T00:03:31.685796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10826v3","created_at":"2026-05-18T00:03:31.685796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10826","created_at":"2026-05-18T00:03:31.685796+00:00"},{"alias_kind":"pith_short_12","alias_value":"REYV3G3MCSHT","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"REYV3G3MCSHTZ4OK","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"REYV3G3M","created_at":"2026-05-18T12:32:50.500415+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/REYV3G3MCSHTZ4OKKDHF2UMWDW","json":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW.json","graph_json":"https://pith.science/api/pith-number/REYV3G3MCSHTZ4OKKDHF2UMWDW/graph.json","events_json":"https://pith.science/api/pith-number/REYV3G3MCSHTZ4OKKDHF2UMWDW/events.json","paper":"https://pith.science/paper/REYV3G3M"},"agent_actions":{"view_html":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW","download_json":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW.json","view_paper":"https://pith.science/paper/REYV3G3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10826&json=true","fetch_graph":"https://pith.science/api/pith-number/REYV3G3MCSHTZ4OKKDHF2UMWDW/graph.json","fetch_events":"https://pith.science/api/pith-number/REYV3G3MCSHTZ4OKKDHF2UMWDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW/action/storage_attestation","attest_author":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW/action/author_attestation","sign_citation":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW/action/citation_signature","submit_replication":"https://pith.science/pith/REYV3G3MCSHTZ4OKKDHF2UMWDW/action/replication_record"}},"created_at":"2026-05-18T00:03:31.685796+00:00","updated_at":"2026-05-18T00:03:31.685796+00:00"}