{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VHQBYQWL2RU2KMRIX7XIQGD5PY","short_pith_number":"pith:VHQBYQWL","schema_version":"1.0","canonical_sha256":"a9e01c42cbd469a53228bfee88187d7e2d3ceb328be52d870fd048f373652bc1","source":{"kind":"arxiv","id":"1908.08365","version":1},"attestation_state":"computed","paper":{"title":"Optimal Morphs of Planar Orthogonal Drawings II","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arthur van Goethem, Bettina Speckmann, Kevin Verbeek","submitted_at":"2019-08-22T13:36:09Z","abstract_excerpt":"Van Goethem and Verbeek recently showed how to morph between two planar orthogonal drawings $\\Gamma_I$ and $\\Gamma_O$ of a connected graph $G$ while preserving planarity, orthogonality, and the complexity of the drawing during the morph. Necessarily drawings $\\Gamma_I$ and $\\Gamma_O$ must be equivalent, that is, there exists a homeomorphism of the plane that transforms $\\Gamma_I$ into $\\Gamma_O$. Van Goethem and Verbeek use $O(n)$ linear morphs, where $n$ is the maximum complexity of the input drawings. However, if the graph is disconnected their method requires $O(n^{1.5})$ linear morphs. In "},"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":"1908.08365","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2019-08-22T13:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"501e31c070e4205d64cebff482059c31b29b3782befc06c6363823e37bbea80d","abstract_canon_sha256":"50b568b216396ffd137b42a22bc9d30cedb50798c63c853afc13e9bc6ceb892c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:12.123484Z","signature_b64":"BlavPeLUc3tisX7kw0MNeqRmXtEiy8ky711GtAgF0N3azrTpsve8+asMwgckz0f09p8nUXwsHoDZaeDkwrgzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e01c42cbd469a53228bfee88187d7e2d3ceb328be52d870fd048f373652bc1","last_reissued_at":"2026-07-04T23:59:12.123013Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:12.123013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Morphs of Planar Orthogonal Drawings II","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arthur van Goethem, Bettina Speckmann, Kevin Verbeek","submitted_at":"2019-08-22T13:36:09Z","abstract_excerpt":"Van Goethem and Verbeek recently showed how to morph between two planar orthogonal drawings $\\Gamma_I$ and $\\Gamma_O$ of a connected graph $G$ while preserving planarity, orthogonality, and the complexity of the drawing during the morph. Necessarily drawings $\\Gamma_I$ and $\\Gamma_O$ must be equivalent, that is, there exists a homeomorphism of the plane that transforms $\\Gamma_I$ into $\\Gamma_O$. Van Goethem and Verbeek use $O(n)$ linear morphs, where $n$ is the maximum complexity of the input drawings. However, if the graph is disconnected their method requires $O(n^{1.5})$ linear morphs. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.08365","created_at":"2026-07-04T23:59:12.123073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08365v1","created_at":"2026-07-04T23:59:12.123073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08365","created_at":"2026-07-04T23:59:12.123073+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHQBYQWL2RU2","created_at":"2026-07-04T23:59:12.123073+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHQBYQWL2RU2KMRI","created_at":"2026-07-04T23:59:12.123073+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHQBYQWL","created_at":"2026-07-04T23:59:12.123073+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/VHQBYQWL2RU2KMRIX7XIQGD5PY","json":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY.json","graph_json":"https://pith.science/api/pith-number/VHQBYQWL2RU2KMRIX7XIQGD5PY/graph.json","events_json":"https://pith.science/api/pith-number/VHQBYQWL2RU2KMRIX7XIQGD5PY/events.json","paper":"https://pith.science/paper/VHQBYQWL"},"agent_actions":{"view_html":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY","download_json":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY.json","view_paper":"https://pith.science/paper/VHQBYQWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08365&json=true","fetch_graph":"https://pith.science/api/pith-number/VHQBYQWL2RU2KMRIX7XIQGD5PY/graph.json","fetch_events":"https://pith.science/api/pith-number/VHQBYQWL2RU2KMRIX7XIQGD5PY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY/action/storage_attestation","attest_author":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY/action/author_attestation","sign_citation":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY/action/citation_signature","submit_replication":"https://pith.science/pith/VHQBYQWL2RU2KMRIX7XIQGD5PY/action/replication_record"}},"created_at":"2026-07-04T23:59:12.123073+00:00","updated_at":"2026-07-04T23:59:12.123073+00:00"}