{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:42SMWMHS3G5GQJZI5EQCPBJK3L","short_pith_number":"pith:42SMWMHS","schema_version":"1.0","canonical_sha256":"e6a4cb30f2d9ba682728e92027852adaff90c5f5fb13ff0780139be1c8535a86","source":{"kind":"arxiv","id":"0803.0858","version":5},"attestation_state":"computed","paper":{"title":"Untangling planar graphs from a specified vertex position - Hard cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Alexander Ravsky, Mathias Schacht, Mihyun Kang, Oleg Pikhurko, Oleg Verbitsky","submitted_at":"2008-03-06T13:08:41Z","abstract_excerpt":"Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\\pi$ of the vertex set of $G$ into the plane. We prove that a wheel graph $W_n$ admits a drawing $\\pi$ such that, if one wants to eliminate edge crossings by shifting vertices to new positions in the plane, then at most $(2+o(1))\\sqrt n$ of all $n$ vertices can stay fixed. Moreover, such a drawing $\\pi$ exists even if it is presupposed that the vertices occupy any prescribed set of points in t"},"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":"0803.0858","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-03-06T13:08:41Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"c957781a8a8b92058589a1fa90780e40a99623ca0f7f8fa962bfe37f3d65e734","abstract_canon_sha256":"59784f96a6f2486b021477fbc11bd8b9bfedcc3c90a4713e6ef54055327e8fda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:51.871270Z","signature_b64":"I2JMkUFolxhJ22EkTQO0NsOIbdKCXhizKvzN6+ev0fv27yk6OVX2RIpgUchwTXFIfbW/Jc9N0foqOfeyuMchAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6a4cb30f2d9ba682728e92027852adaff90c5f5fb13ff0780139be1c8535a86","last_reissued_at":"2026-05-18T04:21:51.870702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:51.870702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Untangling planar graphs from a specified vertex position - Hard cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Alexander Ravsky, Mathias Schacht, Mihyun Kang, Oleg Pikhurko, Oleg Verbitsky","submitted_at":"2008-03-06T13:08:41Z","abstract_excerpt":"Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\\pi$ of the vertex set of $G$ into the plane. We prove that a wheel graph $W_n$ admits a drawing $\\pi$ such that, if one wants to eliminate edge crossings by shifting vertices to new positions in the plane, then at most $(2+o(1))\\sqrt n$ of all $n$ vertices can stay fixed. Moreover, such a drawing $\\pi$ exists even if it is presupposed that the vertices occupy any prescribed set of points in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0858","kind":"arxiv","version":5},"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":"0803.0858","created_at":"2026-05-18T04:21:51.870799+00:00"},{"alias_kind":"arxiv_version","alias_value":"0803.0858v5","created_at":"2026-05-18T04:21:51.870799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0858","created_at":"2026-05-18T04:21:51.870799+00:00"},{"alias_kind":"pith_short_12","alias_value":"42SMWMHS3G5G","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"42SMWMHS3G5GQJZI","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"42SMWMHS","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/42SMWMHS3G5GQJZI5EQCPBJK3L","json":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L.json","graph_json":"https://pith.science/api/pith-number/42SMWMHS3G5GQJZI5EQCPBJK3L/graph.json","events_json":"https://pith.science/api/pith-number/42SMWMHS3G5GQJZI5EQCPBJK3L/events.json","paper":"https://pith.science/paper/42SMWMHS"},"agent_actions":{"view_html":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L","download_json":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L.json","view_paper":"https://pith.science/paper/42SMWMHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0803.0858&json=true","fetch_graph":"https://pith.science/api/pith-number/42SMWMHS3G5GQJZI5EQCPBJK3L/graph.json","fetch_events":"https://pith.science/api/pith-number/42SMWMHS3G5GQJZI5EQCPBJK3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L/action/storage_attestation","attest_author":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L/action/author_attestation","sign_citation":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L/action/citation_signature","submit_replication":"https://pith.science/pith/42SMWMHS3G5GQJZI5EQCPBJK3L/action/replication_record"}},"created_at":"2026-05-18T04:21:51.870799+00:00","updated_at":"2026-05-18T04:21:51.870799+00:00"}