{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UK4F3CBIESDNHAWWNAV3ORJXKK","short_pith_number":"pith:UK4F3CBI","schema_version":"1.0","canonical_sha256":"a2b85d88282486d382d6682bb7453752a58f54772daab40cdabc3c953295afc2","source":{"kind":"arxiv","id":"1009.1315","version":2},"attestation_state":"computed","paper":{"title":"Drawing planar graphs of bounded degree with few slopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, J\\'anos Pach","submitted_at":"2010-09-07T14:50:13Z","abstract_excerpt":"We settle a problem of Dujmovi\\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using at most $f(d)$ different slopes. If we allow the edges to be represented by polygonal paths with {\\em one} bend, then 2d slopes suffice. Allowing {\\em two} bends per edge, every planar graph with maximum degree $d\\ge 3$ can be drawn using segments of at most $\\lceil d/2\\rceil$ different slopes. There is only one exception: the graph formed by the edges of an "},"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":"1009.1315","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-07T14:50:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4460eaadf42fdf5505281743f1497e5f22462c9fb633d27a87c6afa56045140e","abstract_canon_sha256":"d04407dd3ce591521f615eb4b044b1dfb8444364dbd5b80096568ba02d177493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:09.364778Z","signature_b64":"xW92E0ahPbFAll6WUoOTwIPfjE+1RHe7gUxgSg/GsN5WWuGG2m8PDKQDKcj9EUyubNFwbg9YuFffHhACtM1OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b85d88282486d382d6682bb7453752a58f54772daab40cdabc3c953295afc2","last_reissued_at":"2026-05-18T04:36:09.363855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:09.363855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing planar graphs of bounded degree with few slopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, J\\'anos Pach","submitted_at":"2010-09-07T14:50:13Z","abstract_excerpt":"We settle a problem of Dujmovi\\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using at most $f(d)$ different slopes. If we allow the edges to be represented by polygonal paths with {\\em one} bend, then 2d slopes suffice. Allowing {\\em two} bends per edge, every planar graph with maximum degree $d\\ge 3$ can be drawn using segments of at most $\\lceil d/2\\rceil$ different slopes. There is only one exception: the graph formed by the edges of an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1315","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":"1009.1315","created_at":"2026-05-18T04:36:09.363986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1315v2","created_at":"2026-05-18T04:36:09.363986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1315","created_at":"2026-05-18T04:36:09.363986+00:00"},{"alias_kind":"pith_short_12","alias_value":"UK4F3CBIESDN","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UK4F3CBIESDNHAWW","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UK4F3CBI","created_at":"2026-05-18T12:26:15.391820+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/UK4F3CBIESDNHAWWNAV3ORJXKK","json":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK.json","graph_json":"https://pith.science/api/pith-number/UK4F3CBIESDNHAWWNAV3ORJXKK/graph.json","events_json":"https://pith.science/api/pith-number/UK4F3CBIESDNHAWWNAV3ORJXKK/events.json","paper":"https://pith.science/paper/UK4F3CBI"},"agent_actions":{"view_html":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK","download_json":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK.json","view_paper":"https://pith.science/paper/UK4F3CBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1315&json=true","fetch_graph":"https://pith.science/api/pith-number/UK4F3CBIESDNHAWWNAV3ORJXKK/graph.json","fetch_events":"https://pith.science/api/pith-number/UK4F3CBIESDNHAWWNAV3ORJXKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/action/storage_attestation","attest_author":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/action/author_attestation","sign_citation":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/action/citation_signature","submit_replication":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/action/replication_record"}},"created_at":"2026-05-18T04:36:09.363986+00:00","updated_at":"2026-05-18T04:36:09.363986+00:00"}