{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UK4F3CBIESDNHAWWNAV3ORJXKK","short_pith_number":"pith:UK4F3CBI","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"},"canonical_sha256":"a2b85d88282486d382d6682bb7453752a58f54772daab40cdabc3c953295afc2","source":{"kind":"arxiv","id":"1009.1315","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1315","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1315v2","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1315","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"UK4F3CBIESDN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UK4F3CBIESDNHAWW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UK4F3CBI","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UK4F3CBIESDNHAWWNAV3ORJXKK","target":"record","payload":{"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"},"canonical_sha256":"a2b85d88282486d382d6682bb7453752a58f54772daab40cdabc3c953295afc2","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"},"source_kind":"arxiv","source_id":"1009.1315","source_version":2,"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-05-18T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXpsoRf8iYNuqJDIomTjIAo8P3Ytk6jSkQu+v6t+e/ypxlHk8ID0I2qSVBq3bn+8GrRbzqN6TLh4dMh4fbExAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:01:05.889975Z"},"content_sha256":"ca4719b6c990598525f25c7acaf910565d09865809dee2b5e17c90575586ff04","schema_version":"1.0","event_id":"sha256:ca4719b6c990598525f25c7acaf910565d09865809dee2b5e17c90575586ff04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UK4F3CBIESDNHAWWNAV3ORJXKK","target":"graph","payload":{"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"},"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-05-18T04:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeKgSP/2+fctFKHV/phFbtJM+O6id7s1EM80eSXoGhI68rP7wmWBuKplX6WtllNnmGCEJLNClysTkFm7VbPJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:01:05.890667Z"},"content_sha256":"41f4f7d685596477422beb8366a03bf3b59221b83b28afaaa1641f1e6ab7e9f1","schema_version":"1.0","event_id":"sha256:41f4f7d685596477422beb8366a03bf3b59221b83b28afaaa1641f1e6ab7e9f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/bundle.json","state_url":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/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-05-26T00:01:05Z","links":{"resolver":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK","bundle":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/bundle.json","state":"https://pith.science/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UK4F3CBIESDNHAWWNAV3ORJXKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UK4F3CBIESDNHAWWNAV3ORJXKK","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":"d04407dd3ce591521f615eb4b044b1dfb8444364dbd5b80096568ba02d177493","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-07T14:50:13Z","title_canon_sha256":"4460eaadf42fdf5505281743f1497e5f22462c9fb633d27a87c6afa56045140e"},"schema_version":"1.0","source":{"id":"1009.1315","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1315","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1315v2","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1315","created_at":"2026-05-18T04:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"UK4F3CBIESDN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UK4F3CBIESDNHAWW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UK4F3CBI","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:41f4f7d685596477422beb8366a03bf3b59221b83b28afaaa1641f1e6ab7e9f1","target":"graph","created_at":"2026-05-18T04:36:09Z","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"},"paper":{"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 ","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, J\\'anos Pach","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-07T14:50:13Z","title":"Drawing planar graphs of bounded degree with few slopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1315","kind":"arxiv","version":2},"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:ca4719b6c990598525f25c7acaf910565d09865809dee2b5e17c90575586ff04","target":"record","created_at":"2026-05-18T04:36:09Z","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":"d04407dd3ce591521f615eb4b044b1dfb8444364dbd5b80096568ba02d177493","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-07T14:50:13Z","title_canon_sha256":"4460eaadf42fdf5505281743f1497e5f22462c9fb633d27a87c6afa56045140e"},"schema_version":"1.0","source":{"id":"1009.1315","kind":"arxiv","version":2}},"canonical_sha256":"a2b85d88282486d382d6682bb7453752a58f54772daab40cdabc3c953295afc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2b85d88282486d382d6682bb7453752a58f54772daab40cdabc3c953295afc2","first_computed_at":"2026-05-18T04:36:09.363855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:09.363855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xW92E0ahPbFAll6WUoOTwIPfjE+1RHe7gUxgSg/GsN5WWuGG2m8PDKQDKcj9EUyubNFwbg9YuFffHhACtM1OAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:09.364778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1315","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca4719b6c990598525f25c7acaf910565d09865809dee2b5e17c90575586ff04","sha256:41f4f7d685596477422beb8366a03bf3b59221b83b28afaaa1641f1e6ab7e9f1"],"state_sha256":"60c3ddd95898002c6345c5f3999b23c34167577cbca2e2fc2d7af0bd817037b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8q7Yr3R8vxC4DhtXagAaSNxS75zwgZxmmTz+PBv3QZa+qP9paVqxcLgc3LK6oSf34Q2j52L0GKc/SHxF/i9hCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:01:05.894465Z","bundle_sha256":"7160960075350fb5ecf3aa16f74ec5360ce322e4a4344be8c585b27099720122"}}