{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:34Z33QKO3GHDLC3Y3K4OBYD75A","short_pith_number":"pith:34Z33QKO","schema_version":"1.0","canonical_sha256":"df33bdc14ed98e358b78dab8e0e07fe83004a1d94367add64cdc9e754b4af40f","source":{"kind":"arxiv","id":"0802.1312","version":2},"attestation_state":"computed","paper":{"title":"Untangling polygons and graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Josef Cibulka","submitted_at":"2008-02-10T09:28:15Z","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."},"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":"0802.1312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-02-10T09:28:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"21ec41fe30ce811629b9da05da7c7329cc284c343605e454b9aec2847ac9f320","abstract_canon_sha256":"3afa4e7a05cac40f20cd34ea7d3b530017f1a09b84021f8d0df4f4d6fd6554f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:04.064983Z","signature_b64":"WX7HVvlEOSs65HpEkgVIyXXtwXLMxbBW1yOdRy+BYeBKO0zR74UVC2AWL5EzqPBRmGfEfWz4R6ePg366tlFqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df33bdc14ed98e358b78dab8e0e07fe83004a1d94367add64cdc9e754b4af40f","last_reissued_at":"2026-05-18T04:30:04.064466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:04.064466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Untangling polygons and graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Josef Cibulka","submitted_at":"2008-02-10T09:28:15Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1312","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":"0802.1312","created_at":"2026-05-18T04:30:04.064563+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.1312v2","created_at":"2026-05-18T04:30:04.064563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1312","created_at":"2026-05-18T04:30:04.064563+00:00"},{"alias_kind":"pith_short_12","alias_value":"34Z33QKO3GHD","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"34Z33QKO3GHDLC3Y","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"34Z33QKO","created_at":"2026-05-18T12:25:56.245647+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/34Z33QKO3GHDLC3Y3K4OBYD75A","json":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A.json","graph_json":"https://pith.science/api/pith-number/34Z33QKO3GHDLC3Y3K4OBYD75A/graph.json","events_json":"https://pith.science/api/pith-number/34Z33QKO3GHDLC3Y3K4OBYD75A/events.json","paper":"https://pith.science/paper/34Z33QKO"},"agent_actions":{"view_html":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A","download_json":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A.json","view_paper":"https://pith.science/paper/34Z33QKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.1312&json=true","fetch_graph":"https://pith.science/api/pith-number/34Z33QKO3GHDLC3Y3K4OBYD75A/graph.json","fetch_events":"https://pith.science/api/pith-number/34Z33QKO3GHDLC3Y3K4OBYD75A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A/action/storage_attestation","attest_author":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A/action/author_attestation","sign_citation":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A/action/citation_signature","submit_replication":"https://pith.science/pith/34Z33QKO3GHDLC3Y3K4OBYD75A/action/replication_record"}},"created_at":"2026-05-18T04:30:04.064563+00:00","updated_at":"2026-05-18T04:30:04.064563+00:00"}