{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:34Z33QKO3GHDLC3Y3K4OBYD75A","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":"3afa4e7a05cac40f20cd34ea7d3b530017f1a09b84021f8d0df4f4d6fd6554f8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-02-10T09:28:15Z","title_canon_sha256":"21ec41fe30ce811629b9da05da7c7329cc284c343605e454b9aec2847ac9f320"},"schema_version":"1.0","source":{"id":"0802.1312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1312","created_at":"2026-05-18T04:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1312v2","created_at":"2026-05-18T04:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1312","created_at":"2026-05-18T04:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"34Z33QKO3GHD","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"34Z33QKO3GHDLC3Y","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"34Z33QKO","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:33ad84c2b260fbe4cb58b8df728229287d14e263b55b2daa7b0c8e71d77432c3","target":"graph","created_at":"2026-05-18T04:30:04Z","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":"Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at least \\Omega(n^{2/3}) vertices fixed. For any graph G, we also present an upper bound on the number of fixed vertices in the worst case. The bound is a function of the number of vertices, maximum degree and diameter of G. One of its consequences is the upper bound O((n log n)^{2/3}) for all 3-vertex-connected planar graphs.","authors_text":"Josef Cibulka","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-02-10T09:28:15Z","title":"Untangling polygons and graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1312","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:7f1e4bc214407a9580a60e69e4efb0ba57d418c79d9388dbe342f72158c75a4c","target":"record","created_at":"2026-05-18T04:30:04Z","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":"3afa4e7a05cac40f20cd34ea7d3b530017f1a09b84021f8d0df4f4d6fd6554f8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-02-10T09:28:15Z","title_canon_sha256":"21ec41fe30ce811629b9da05da7c7329cc284c343605e454b9aec2847ac9f320"},"schema_version":"1.0","source":{"id":"0802.1312","kind":"arxiv","version":2}},"canonical_sha256":"df33bdc14ed98e358b78dab8e0e07fe83004a1d94367add64cdc9e754b4af40f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df33bdc14ed98e358b78dab8e0e07fe83004a1d94367add64cdc9e754b4af40f","first_computed_at":"2026-05-18T04:30:04.064466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:04.064466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WX7HVvlEOSs65HpEkgVIyXXtwXLMxbBW1yOdRy+BYeBKO0zR74UVC2AWL5EzqPBRmGfEfWz4R6ePg366tlFqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:04.064983Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.1312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f1e4bc214407a9580a60e69e4efb0ba57d418c79d9388dbe342f72158c75a4c","sha256:33ad84c2b260fbe4cb58b8df728229287d14e263b55b2daa7b0c8e71d77432c3"],"state_sha256":"e28342275357f0674bb3e5d627911f380a8734da17f6142519a0b49ad6c4ee06"}