{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:L637OZSVZK2CLNFEFCMIYN5B5A","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":"aa0c63e21fcdeb2a2c88d0527e9fedaa64dfafa218400a55bc205f52669f5438","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-19T00:46:05Z","title_canon_sha256":"3474114f830f4c5b1222004ac8929c6db7b4f4eb1aa7c07d251e056958beddcc"},"schema_version":"1.0","source":{"id":"1012.4137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4137","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4137v1","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4137","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"L637OZSVZK2C","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"L637OZSVZK2CLNFE","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"L637OZSV","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:7421c09e50f6b5b03f520a84dbf90b580f919c4aaf17009f1e6b7f957df87ccb","target":"graph","created_at":"2026-05-18T03:52:53Z","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":"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 ","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-19T00:46:05Z","title":"The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4137","kind":"arxiv","version":1},"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:c83a2b91220fd4d19960127b896f313421708a0342fbe803e20630e561eb51ba","target":"record","created_at":"2026-05-18T03:52:53Z","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":"aa0c63e21fcdeb2a2c88d0527e9fedaa64dfafa218400a55bc205f52669f5438","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-19T00:46:05Z","title_canon_sha256":"3474114f830f4c5b1222004ac8929c6db7b4f4eb1aa7c07d251e056958beddcc"},"schema_version":"1.0","source":{"id":"1012.4137","kind":"arxiv","version":1}},"canonical_sha256":"5fb7f76655cab425b4a428988c37a1e82cf6b8cb78a7ebabc6bb656bd1b566f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fb7f76655cab425b4a428988c37a1e82cf6b8cb78a7ebabc6bb656bd1b566f3","first_computed_at":"2026-05-18T03:52:53.461635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:53.461635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rKtZm2ABKebLXL4Z0mm9VhE53TSup7JroOtB77Ubr2Cw06s3l5D5SM6USJ6artPSa6BSrdOnChkFcY2bmfdFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:53.462473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c83a2b91220fd4d19960127b896f313421708a0342fbe803e20630e561eb51ba","sha256:7421c09e50f6b5b03f520a84dbf90b580f919c4aaf17009f1e6b7f957df87ccb"],"state_sha256":"940fa21ba6d58c170c36f00af1872d5ee7ad87af85bdb8e45dde6872bfda39ba"}