{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HQM6FEFVL32F7TSPMJWUFH4Y4M","short_pith_number":"pith:HQM6FEFV","schema_version":"1.0","canonical_sha256":"3c19e290b55ef45fce4f626d429f98e3372a47811efb8745c508b44da2f6686a","source":{"kind":"arxiv","id":"1702.01719","version":1},"attestation_state":"computed","paper":{"title":"A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Philippe Demontigny, Therese Biedl","submitted_at":"2017-02-06T17:38:26Z","abstract_excerpt":"In this paper, we study planar drawings of maximal outerplanar graphs with the objective of achieving small height. A recent paper gave an algorithm for such drawings that is within a factor of 4 of the optimum height. In this paper, we substantially improve the approximation factor to become 2. The main ingredient is to define a new parameter of outerplanar graphs (the so-called umbrella depth, obtained by recursively splitting the graph into graphs called umbrellas). We argue that the height of any poly-line drawing must be at least the umbrella depth, and then devise an algorithm that achie"},"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":"1702.01719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-06T17:38:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"07a3dd2c97fef3ef5ff82f5978d01bcb1706fc9e56b29ca637f0b7d150352445","abstract_canon_sha256":"db506cfbb8efc12e2a7500b07ea0dc445c9392ab8828279909d34902ff68f740"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:19.761246Z","signature_b64":"7lVEP1wH1EWWZF9FEZjXL7MhgE/GPBUF2sh0LO8YX4csXp5r4e503RH5BcNEf1qZxcvBy8J7wbr09IUm0yEYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c19e290b55ef45fce4f626d429f98e3372a47811efb8745c508b44da2f6686a","last_reissued_at":"2026-05-18T00:51:19.760512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:19.760512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Philippe Demontigny, Therese Biedl","submitted_at":"2017-02-06T17:38:26Z","abstract_excerpt":"In this paper, we study planar drawings of maximal outerplanar graphs with the objective of achieving small height. A recent paper gave an algorithm for such drawings that is within a factor of 4 of the optimum height. In this paper, we substantially improve the approximation factor to become 2. The main ingredient is to define a new parameter of outerplanar graphs (the so-called umbrella depth, obtained by recursively splitting the graph into graphs called umbrellas). We argue that the height of any poly-line drawing must be at least the umbrella depth, and then devise an algorithm that achie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01719","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":"1702.01719","created_at":"2026-05-18T00:51:19.760630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01719v1","created_at":"2026-05-18T00:51:19.760630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01719","created_at":"2026-05-18T00:51:19.760630+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQM6FEFVL32F","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQM6FEFVL32F7TSP","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQM6FEFV","created_at":"2026-05-18T12:31:18.294218+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/HQM6FEFVL32F7TSPMJWUFH4Y4M","json":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M.json","graph_json":"https://pith.science/api/pith-number/HQM6FEFVL32F7TSPMJWUFH4Y4M/graph.json","events_json":"https://pith.science/api/pith-number/HQM6FEFVL32F7TSPMJWUFH4Y4M/events.json","paper":"https://pith.science/paper/HQM6FEFV"},"agent_actions":{"view_html":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M","download_json":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M.json","view_paper":"https://pith.science/paper/HQM6FEFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01719&json=true","fetch_graph":"https://pith.science/api/pith-number/HQM6FEFVL32F7TSPMJWUFH4Y4M/graph.json","fetch_events":"https://pith.science/api/pith-number/HQM6FEFVL32F7TSPMJWUFH4Y4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M/action/storage_attestation","attest_author":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M/action/author_attestation","sign_citation":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M/action/citation_signature","submit_replication":"https://pith.science/pith/HQM6FEFVL32F7TSPMJWUFH4Y4M/action/replication_record"}},"created_at":"2026-05-18T00:51:19.760630+00:00","updated_at":"2026-05-18T00:51:19.760630+00:00"}