{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4P2HV7ESOPM6AXYWZULTQG7UME","short_pith_number":"pith:4P2HV7ES","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"},"canonical_sha256":"e3f47afc9273d9e05f16cd17381bf46132f3e1552179a55097f2adc2e9492901","source":{"kind":"arxiv","id":"2409.04074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.04074","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2409.04074v1","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04074","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"4P2HV7ESOPM6","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"4P2HV7ESOPM6AXYW","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"4P2HV7ES","created_at":"2026-07-05T09:04:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4P2HV7ESOPM6AXYWZULTQG7UME","target":"record","payload":{"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"},"canonical_sha256":"e3f47afc9273d9e05f16cd17381bf46132f3e1552179a55097f2adc2e9492901","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"},"source_kind":"arxiv","source_id":"2409.04074","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0xlJ6qdb/CgGpNwAAPDeN0I4hAzy8s8TZy9Uu8iG/usYP0Va2e7rWM5Wvoo34Rz7gXORem2jqCEthcrnwBWfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:09:17.956167Z"},"content_sha256":"be55c4e1219b1ffa67d214eec94c8d02ec99c24deea828aed124961b0f2974c4","schema_version":"1.0","event_id":"sha256:be55c4e1219b1ffa67d214eec94c8d02ec99c24deea828aed124961b0f2974c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4P2HV7ESOPM6AXYWZULTQG7UME","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29K6/qRl9hax0o3kP6ldJhA1EfG6lzqA4UR1DRr6DF5UPPVfnYdDabH0gxlE13XGv9HA1OXsnBZl1/506yeVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:09:17.956560Z"},"content_sha256":"00f3f260dac6ef801e7f51e811c1b7a4d80f133ac88528b40c17e2921c30e51d","schema_version":"1.0","event_id":"sha256:00f3f260dac6ef801e7f51e811c1b7a4d80f133ac88528b40c17e2921c30e51d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/bundle.json","state_url":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4P2HV7ESOPM6AXYWZULTQG7UME/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T04:09:17Z","links":{"resolver":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME","bundle":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/bundle.json","state":"https://pith.science/pith/4P2HV7ESOPM6AXYWZULTQG7UME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4P2HV7ESOPM6AXYWZULTQG7UME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4P2HV7ESOPM6AXYWZULTQG7UME","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a79b955f7508e298d5232c99058c834c6e948df180b3625d8fead990b391fd86","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-06T07:29:08Z","title_canon_sha256":"49db9817a8df450d86fd9e6fbd22d15f93b2cc5d0abaf784c17867db73759cf9"},"schema_version":"1.0","source":{"id":"2409.04074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.04074","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2409.04074v1","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04074","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"4P2HV7ESOPM6","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"4P2HV7ESOPM6AXYW","created_at":"2026-07-05T09:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"4P2HV7ES","created_at":"2026-07-05T09:04:01Z"}],"graph_snapshots":[{"event_id":"sha256:00f3f260dac6ef801e7f51e811c1b7a4d80f133ac88528b40c17e2921c30e51d","target":"graph","created_at":"2026-07-05T09:04:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.04074/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Anna Lubiw, Jack Spalding-Jamieson, Therese Biedl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-06T07:29:08Z","title":"Morphing Planar Graph Drawings via Orthogonal Box Drawings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04074","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:be55c4e1219b1ffa67d214eec94c8d02ec99c24deea828aed124961b0f2974c4","target":"record","created_at":"2026-07-05T09:04:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a79b955f7508e298d5232c99058c834c6e948df180b3625d8fead990b391fd86","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-09-06T07:29:08Z","title_canon_sha256":"49db9817a8df450d86fd9e6fbd22d15f93b2cc5d0abaf784c17867db73759cf9"},"schema_version":"1.0","source":{"id":"2409.04074","kind":"arxiv","version":1}},"canonical_sha256":"e3f47afc9273d9e05f16cd17381bf46132f3e1552179a55097f2adc2e9492901","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3f47afc9273d9e05f16cd17381bf46132f3e1552179a55097f2adc2e9492901","first_computed_at":"2026-07-05T09:04:01.128364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:04:01.128364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsNqfSRmqWB6S5aruYLuUDWu13vCX1ShcwGYD+KZj3VqYKtfcVWnaA/RRtQ2b3gAOeU6vcc8oYVaCTouO16+Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:04:01.128842Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.04074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be55c4e1219b1ffa67d214eec94c8d02ec99c24deea828aed124961b0f2974c4","sha256:00f3f260dac6ef801e7f51e811c1b7a4d80f133ac88528b40c17e2921c30e51d"],"state_sha256":"be6e6299b17a30eb64b15a65806160abcf1980aed3d72f0a9bea7fa8f2d7ba2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O08nuh7Bsfg7aNVYU5Nli0uXmNiFYmoEmOlSEg5AX4dbEWFUW21CYgmF6YIYUUFjfERRteD8Owt9F6A4Xr+MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:09:17.958672Z","bundle_sha256":"2423703bd3d3b80896b7a95d6429143cf30a580f1be57d48c33d3fac5dbc5986"}}