{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4P2HV7ESOPM6AXYWZULTQG7UME","short_pith_number":"pith:4P2HV7ES","schema_version":"1.0","canonical_sha256":"e3f47afc9273d9e05f16cd17381bf46132f3e1552179a55097f2adc2e9492901","source":{"kind":"arxiv","id":"2409.04074","version":1},"attestation_state":"computed","paper":{"title":"Morphing Planar Graph Drawings via Orthogonal Box Drawings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Jack Spalding-Jamieson, Therese Biedl","submitted_at":"2024-09-06T07:29:08Z","abstract_excerpt":"We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph on an $O(n) \\times O(n)$ grid. The planarity-preserving morph is composed of $O(n)$ linear morphs between successive pairs of drawings, each on an $O(n) \\times O(n)$ grid with a constant number of bends per edge. The algorithm to compute the morph runs in $O(n^2)$ time on a word RAM model with standard arithmetic operations -- in particular no square roots "},"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":"2409.04074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-06T07:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"49db9817a8df450d86fd9e6fbd22d15f93b2cc5d0abaf784c17867db73759cf9","abstract_canon_sha256":"a79b955f7508e298d5232c99058c834c6e948df180b3625d8fead990b391fd86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:01.128842Z","signature_b64":"HsNqfSRmqWB6S5aruYLuUDWu13vCX1ShcwGYD+KZj3VqYKtfcVWnaA/RRtQ2b3gAOeU6vcc8oYVaCTouO16+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3f47afc9273d9e05f16cd17381bf46132f3e1552179a55097f2adc2e9492901","last_reissued_at":"2026-07-05T09:04:01.128364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:01.128364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Morphing Planar Graph Drawings via Orthogonal Box Drawings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Jack Spalding-Jamieson, Therese Biedl","submitted_at":"2024-09-06T07:29:08Z","abstract_excerpt":"We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph on an $O(n) \\times O(n)$ grid. The planarity-preserving morph is composed of $O(n)$ linear morphs between successive pairs of drawings, each on an $O(n) \\times O(n)$ grid with a constant number of bends per edge. The algorithm to compute the morph runs in $O(n^2)$ time on a word RAM model with standard arithmetic operations -- in particular no square roots "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04074","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/2409.04074/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":"2409.04074","created_at":"2026-07-05T09:04:01.128421+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04074v1","created_at":"2026-07-05T09:04:01.128421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04074","created_at":"2026-07-05T09:04:01.128421+00:00"},{"alias_kind":"pith_short_12","alias_value":"4P2HV7ESOPM6","created_at":"2026-07-05T09:04:01.128421+00:00"},{"alias_kind":"pith_short_16","alias_value":"4P2HV7ESOPM6AXYW","created_at":"2026-07-05T09:04:01.128421+00:00"},{"alias_kind":"pith_short_8","alias_value":"4P2HV7ES","created_at":"2026-07-05T09:04:01.128421+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/4P2HV7ESOPM6AXYWZULTQG7UME","json":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME.json","graph_json":"https://pith.science/api/pith-number/4P2HV7ESOPM6AXYWZULTQG7UME/graph.json","events_json":"https://pith.science/api/pith-number/4P2HV7ESOPM6AXYWZULTQG7UME/events.json","paper":"https://pith.science/paper/4P2HV7ES"},"agent_actions":{"view_html":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME","download_json":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME.json","view_paper":"https://pith.science/paper/4P2HV7ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04074&json=true","fetch_graph":"https://pith.science/api/pith-number/4P2HV7ESOPM6AXYWZULTQG7UME/graph.json","fetch_events":"https://pith.science/api/pith-number/4P2HV7ESOPM6AXYWZULTQG7UME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/action/storage_attestation","attest_author":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/action/author_attestation","sign_citation":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/action/citation_signature","submit_replication":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/action/replication_record"}},"created_at":"2026-07-05T09:04:01.128421+00:00","updated_at":"2026-07-05T09:04:01.128421+00:00"}