{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:L637OZSVZK2CLNFEFCMIYN5B5A","short_pith_number":"pith:L637OZSV","schema_version":"1.0","canonical_sha256":"5fb7f76655cab425b4a428988c37a1e82cf6b8cb78a7ebabc6bb656bd1b566f3","source":{"kind":"arxiv","id":"1012.4137","version":1},"attestation_state":"computed","paper":{"title":"The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Eva Jel\\'inkov\\'a, Jan Kratochv\\'il, Marek Tesa\\v{r}, Tom\\v{s} Vysko\\v{c}il, V\\'it Jel\\'inek","submitted_at":"2010-12-19T00:46:05Z","abstract_excerpt":"It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar graph with maximum degree $\\Delta$. We show that the planar slope number of every planar partial 3-tree and also every plane partial 3-tree is at most $O(\\Delta^5)$. In particular, we answer the question of Dujmovi\\'c et al. [Computational Geometry 38 (3), pp. 194--212 (2007)] whether there is a function $f$ such that plane maximal outerplanar graphs can be "},"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":"1012.4137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-19T00:46:05Z","cross_cats_sorted":[],"title_canon_sha256":"3474114f830f4c5b1222004ac8929c6db7b4f4eb1aa7c07d251e056958beddcc","abstract_canon_sha256":"aa0c63e21fcdeb2a2c88d0527e9fedaa64dfafa218400a55bc205f52669f5438"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:53.462473Z","signature_b64":"rKtZm2ABKebLXL4Z0mm9VhE53TSup7JroOtB77Ubr2Cw06s3l5D5SM6USJ6artPSa6BSrdOnChkFcY2bmfdFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fb7f76655cab425b4a428988c37a1e82cf6b8cb78a7ebabc6bb656bd1b566f3","last_reissued_at":"2026-05-18T03:52:53.461635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:53.461635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Eva Jel\\'inkov\\'a, Jan Kratochv\\'il, Marek Tesa\\v{r}, Tom\\v{s} Vysko\\v{c}il, V\\'it Jel\\'inek","submitted_at":"2010-12-19T00:46:05Z","abstract_excerpt":"It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar graph with maximum degree $\\Delta$. We show that the planar slope number of every planar partial 3-tree and also every plane partial 3-tree is at most $O(\\Delta^5)$. In particular, we answer the question of Dujmovi\\'c et al. [Computational Geometry 38 (3), pp. 194--212 (2007)] whether there is a function $f$ such that plane maximal outerplanar graphs can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4137","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":"1012.4137","created_at":"2026-05-18T03:52:53.461772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4137v1","created_at":"2026-05-18T03:52:53.461772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4137","created_at":"2026-05-18T03:52:53.461772+00:00"},{"alias_kind":"pith_short_12","alias_value":"L637OZSVZK2C","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"L637OZSVZK2CLNFE","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"L637OZSV","created_at":"2026-05-18T12:26:10.704358+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/L637OZSVZK2CLNFEFCMIYN5B5A","json":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A.json","graph_json":"https://pith.science/api/pith-number/L637OZSVZK2CLNFEFCMIYN5B5A/graph.json","events_json":"https://pith.science/api/pith-number/L637OZSVZK2CLNFEFCMIYN5B5A/events.json","paper":"https://pith.science/paper/L637OZSV"},"agent_actions":{"view_html":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A","download_json":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A.json","view_paper":"https://pith.science/paper/L637OZSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4137&json=true","fetch_graph":"https://pith.science/api/pith-number/L637OZSVZK2CLNFEFCMIYN5B5A/graph.json","fetch_events":"https://pith.science/api/pith-number/L637OZSVZK2CLNFEFCMIYN5B5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A/action/storage_attestation","attest_author":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A/action/author_attestation","sign_citation":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A/action/citation_signature","submit_replication":"https://pith.science/pith/L637OZSVZK2CLNFEFCMIYN5B5A/action/replication_record"}},"created_at":"2026-05-18T03:52:53.461772+00:00","updated_at":"2026-05-18T03:52:53.461772+00:00"}