{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JATHD27VYANTET6HI4IORYSGUH","short_pith_number":"pith:JATHD27V","schema_version":"1.0","canonical_sha256":"482671ebf5c01b324fc74710e8e246a1fd4b5cbb61fd5e5b21dc398abc0aa6d0","source":{"kind":"arxiv","id":"1205.2548","version":2},"attestation_state":"computed","paper":{"title":"Outerplanar graph drawings with few slopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Bartosz Walczak, Kolja Knauer, Piotr Micek","submitted_at":"2012-05-11T15:07:51Z","abstract_excerpt":"We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that $\\Delta-1$ edge slopes suffice for every outerplanar graph with maximum degree $\\Delta\\ge 4$. This improves on the previous bound of $O(\\Delta^5)$, which was shown for planar partial 3-trees, a superclass of outerplanar graphs. The bound is tight: for every $\\Delta\\ge 4$ there is an outerplanar graph with maximum degree $\\Delta$ that requires at least $\\Delta-1$ distinc"},"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":"1205.2548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-11T15:07:51Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e29ad7da6572a7e1592c290faa87679bd16a0c80fde7d04dc69617706464b0cb","abstract_canon_sha256":"db81d0a19ddd622f061da332329027fa53881dbd05bd8b05d4c19608fd224a37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:30.935420Z","signature_b64":"+yinyws1YoPqbNHFlkZmbSi66qyxzp/fgpwzJIIuGthZBLfze5gyzuDJnJs6KMNN9CGj2B7qnl+9q87P0I3wBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"482671ebf5c01b324fc74710e8e246a1fd4b5cbb61fd5e5b21dc398abc0aa6d0","last_reissued_at":"2026-05-18T02:54:30.934969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:30.934969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Outerplanar graph drawings with few slopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Bartosz Walczak, Kolja Knauer, Piotr Micek","submitted_at":"2012-05-11T15:07:51Z","abstract_excerpt":"We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that $\\Delta-1$ edge slopes suffice for every outerplanar graph with maximum degree $\\Delta\\ge 4$. This improves on the previous bound of $O(\\Delta^5)$, which was shown for planar partial 3-trees, a superclass of outerplanar graphs. The bound is tight: for every $\\Delta\\ge 4$ there is an outerplanar graph with maximum degree $\\Delta$ that requires at least $\\Delta-1$ distinc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2548","kind":"arxiv","version":2},"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":"1205.2548","created_at":"2026-05-18T02:54:30.935034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2548v2","created_at":"2026-05-18T02:54:30.935034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2548","created_at":"2026-05-18T02:54:30.935034+00:00"},{"alias_kind":"pith_short_12","alias_value":"JATHD27VYANT","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JATHD27VYANTET6H","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JATHD27V","created_at":"2026-05-18T12:27:11.947152+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/JATHD27VYANTET6HI4IORYSGUH","json":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH.json","graph_json":"https://pith.science/api/pith-number/JATHD27VYANTET6HI4IORYSGUH/graph.json","events_json":"https://pith.science/api/pith-number/JATHD27VYANTET6HI4IORYSGUH/events.json","paper":"https://pith.science/paper/JATHD27V"},"agent_actions":{"view_html":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH","download_json":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH.json","view_paper":"https://pith.science/paper/JATHD27V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2548&json=true","fetch_graph":"https://pith.science/api/pith-number/JATHD27VYANTET6HI4IORYSGUH/graph.json","fetch_events":"https://pith.science/api/pith-number/JATHD27VYANTET6HI4IORYSGUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH/action/storage_attestation","attest_author":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH/action/author_attestation","sign_citation":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH/action/citation_signature","submit_replication":"https://pith.science/pith/JATHD27VYANTET6HI4IORYSGUH/action/replication_record"}},"created_at":"2026-05-18T02:54:30.935034+00:00","updated_at":"2026-05-18T02:54:30.935034+00:00"}