{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:22RFW7MBAXAEDXW4XLATRCWAHL","short_pith_number":"pith:22RFW7MB","schema_version":"1.0","canonical_sha256":"d6a25b7d8105c041dedcbac1388ac03af53d40ef2919685d46d59ebbd2236088","source":{"kind":"arxiv","id":"1402.4364","version":2},"attestation_state":"computed","paper":{"title":"Morphing Planar Graph Drawings Optimally","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, Maurizio Patrignani, Patrizio Angelini, Vincenzo Roselli","submitted_at":"2014-02-18T14:55:41Z","abstract_excerpt":"We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound. Further, we prove that our algorithm is optimal, that is, we show that there exist two planar straight-line drawings $\\Gamma_s$ and $\\Gamma_t$ of an $n$-vertex plane graph $G$ such that any planar morph between $\\Gamma_s$ and $\\Gamma_t$ requires $\\Omega(n)$ morphing steps."},"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":"1402.4364","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-18T14:55:41Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"75b289ec6216cb995cb129f8ccfbd3fc1d9181d0d1ce60c1e0e83b775f11280c","abstract_canon_sha256":"ce41a6b1538f2a8779f66d4cf5b5e4215b4c3001f2b26acb11c10950ad3257cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:34.094816Z","signature_b64":"8PWFPKqUJLI4PGozAWDj0e6fItkakQVDf+SJR2DrKHzVk9a2MMIYefCrYslu4xpEygagpQz2rYGrveFbtHdGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a25b7d8105c041dedcbac1388ac03af53d40ef2919685d46d59ebbd2236088","last_reissued_at":"2026-05-18T02:58:34.094118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:34.094118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Morphing Planar Graph Drawings Optimally","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, Maurizio Patrignani, Patrizio Angelini, Vincenzo Roselli","submitted_at":"2014-02-18T14:55:41Z","abstract_excerpt":"We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound. Further, we prove that our algorithm is optimal, that is, we show that there exist two planar straight-line drawings $\\Gamma_s$ and $\\Gamma_t$ of an $n$-vertex plane graph $G$ such that any planar morph between $\\Gamma_s$ and $\\Gamma_t$ requires $\\Omega(n)$ morphing steps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4364","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":"1402.4364","created_at":"2026-05-18T02:58:34.094235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4364v2","created_at":"2026-05-18T02:58:34.094235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4364","created_at":"2026-05-18T02:58:34.094235+00:00"},{"alias_kind":"pith_short_12","alias_value":"22RFW7MBAXAE","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"22RFW7MBAXAEDXW4","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"22RFW7MB","created_at":"2026-05-18T12:28:09.283467+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/22RFW7MBAXAEDXW4XLATRCWAHL","json":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL.json","graph_json":"https://pith.science/api/pith-number/22RFW7MBAXAEDXW4XLATRCWAHL/graph.json","events_json":"https://pith.science/api/pith-number/22RFW7MBAXAEDXW4XLATRCWAHL/events.json","paper":"https://pith.science/paper/22RFW7MB"},"agent_actions":{"view_html":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL","download_json":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL.json","view_paper":"https://pith.science/paper/22RFW7MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4364&json=true","fetch_graph":"https://pith.science/api/pith-number/22RFW7MBAXAEDXW4XLATRCWAHL/graph.json","fetch_events":"https://pith.science/api/pith-number/22RFW7MBAXAEDXW4XLATRCWAHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL/action/storage_attestation","attest_author":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL/action/author_attestation","sign_citation":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL/action/citation_signature","submit_replication":"https://pith.science/pith/22RFW7MBAXAEDXW4XLATRCWAHL/action/replication_record"}},"created_at":"2026-05-18T02:58:34.094235+00:00","updated_at":"2026-05-18T02:58:34.094235+00:00"}