{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K5XI5GQRL3ANLK23GV5CMAWLO4","short_pith_number":"pith:K5XI5GQR","schema_version":"1.0","canonical_sha256":"576e8e9a115ec0d5ab5b357a2602cb7722b60a2862c4f61ad58e16990adb2a39","source":{"kind":"arxiv","id":"1606.00425","version":1},"attestation_state":"computed","paper":{"title":"How to morph planar graph drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Bryan T. Wilkinson, Fabrizio Frati, Fidel Barrera-Cruz, Giordano Da Lozzo, Giuseppe Di Battista, Maurizio Patrignani, Patrizio Angelini, Penny Haxell, Sahil Singla, Soroush Alamdari, Timothy M. Chan, Vincenzo Roselli","submitted_at":"2016-06-01T19:53:45Z","abstract_excerpt":"Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves straight-line planarity and consists of $O(n)$ steps, which we prove is optimal in the worst case. Each step is a unidirectional linear morph, which means that every vertex moves at constant speed along a straight line, and the lines are parallel although the vertex speeds may differ. Thus we provide an efficient version of Cairns' 1944 proof of the existence of st"},"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":"1606.00425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-01T19:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"9178f9430b8da2f5c9c84d962986d78abee23870fb5ed6498d4fa9990f3333fa","abstract_canon_sha256":"334fb4a841af9b0ab57c3a0fe29024137ca0ea6f137e69c64af24b4648fe304c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.368032Z","signature_b64":"hg+cARRuIj17L2Fekjprf2qPGml3lQjApSbg7uHhQ+rVHQHbAm8rvfAtF6cdhOGLYTEBmy8zXjp1KlYPH2KkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"576e8e9a115ec0d5ab5b357a2602cb7722b60a2862c4f61ad58e16990adb2a39","last_reissued_at":"2026-05-18T01:13:05.367677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.367677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to morph planar graph drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Bryan T. Wilkinson, Fabrizio Frati, Fidel Barrera-Cruz, Giordano Da Lozzo, Giuseppe Di Battista, Maurizio Patrignani, Patrizio Angelini, Penny Haxell, Sahil Singla, Soroush Alamdari, Timothy M. Chan, Vincenzo Roselli","submitted_at":"2016-06-01T19:53:45Z","abstract_excerpt":"Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves straight-line planarity and consists of $O(n)$ steps, which we prove is optimal in the worst case. Each step is a unidirectional linear morph, which means that every vertex moves at constant speed along a straight line, and the lines are parallel although the vertex speeds may differ. Thus we provide an efficient version of Cairns' 1944 proof of the existence of st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00425","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":"1606.00425","created_at":"2026-05-18T01:13:05.367734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00425v1","created_at":"2026-05-18T01:13:05.367734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00425","created_at":"2026-05-18T01:13:05.367734+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5XI5GQRL3AN","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5XI5GQRL3ANLK23","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5XI5GQR","created_at":"2026-05-18T12:30:25.849896+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/K5XI5GQRL3ANLK23GV5CMAWLO4","json":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4.json","graph_json":"https://pith.science/api/pith-number/K5XI5GQRL3ANLK23GV5CMAWLO4/graph.json","events_json":"https://pith.science/api/pith-number/K5XI5GQRL3ANLK23GV5CMAWLO4/events.json","paper":"https://pith.science/paper/K5XI5GQR"},"agent_actions":{"view_html":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4","download_json":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4.json","view_paper":"https://pith.science/paper/K5XI5GQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00425&json=true","fetch_graph":"https://pith.science/api/pith-number/K5XI5GQRL3ANLK23GV5CMAWLO4/graph.json","fetch_events":"https://pith.science/api/pith-number/K5XI5GQRL3ANLK23GV5CMAWLO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4/action/storage_attestation","attest_author":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4/action/author_attestation","sign_citation":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4/action/citation_signature","submit_replication":"https://pith.science/pith/K5XI5GQRL3ANLK23GV5CMAWLO4/action/replication_record"}},"created_at":"2026-05-18T01:13:05.367734+00:00","updated_at":"2026-05-18T01:13:05.367734+00:00"}