{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:SZI3ZJEVH52Z67PLEMMZCCYC6W","short_pith_number":"pith:SZI3ZJEV","schema_version":"1.0","canonical_sha256":"9651bca4953f759f7deb2319910b02f59b94c06c945618631ede597cb32b88ea","source":{"kind":"arxiv","id":"0806.0253","version":5},"attestation_state":"computed","paper":{"title":"On collinear sets in straight line drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Alexander Ravsky, Oleg Verbitsky","submitted_at":"2008-06-02T18:01:35Z","abstract_excerpt":"We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \\emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum number of vertices that can be left fixed in the worst case. In the \\emph{allocation problem}, we are given a planar graph $G$ on $n$ vertices together with an $n$-point set $X$ in the plane and have to draw $G$ without edge crossings so that as many vertices as possible are located in $X$. Let $fit(G)$ denote the maximum number of points fitting this purpos"},"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":"0806.0253","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2008-06-02T18:01:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a65aff66ff7c0d471e19eaafcd4fe2b95406e2016461e9039b71a5559e0d25c2","abstract_canon_sha256":"70a5c82688d59b36e1f34d220558aa754e38c10d4e7ce17df20e27183e3e44a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:33.760447Z","signature_b64":"VB6m1/nr3m3YWRxdV16s2O0l/guUlUpEQTkjxrDXY1Su8mfjUBDzAUp/HWg8qPsXhJ7KkhnjANNbhbJGfNazAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9651bca4953f759f7deb2319910b02f59b94c06c945618631ede597cb32b88ea","last_reissued_at":"2026-05-18T04:08:33.759760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:33.759760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On collinear sets in straight line drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Alexander Ravsky, Oleg Verbitsky","submitted_at":"2008-06-02T18:01:35Z","abstract_excerpt":"We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \\emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum number of vertices that can be left fixed in the worst case. In the \\emph{allocation problem}, we are given a planar graph $G$ on $n$ vertices together with an $n$-point set $X$ in the plane and have to draw $G$ without edge crossings so that as many vertices as possible are located in $X$. Let $fit(G)$ denote the maximum number of points fitting this purpos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0253","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":"0806.0253","created_at":"2026-05-18T04:08:33.759872+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.0253v5","created_at":"2026-05-18T04:08:33.759872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0253","created_at":"2026-05-18T04:08:33.759872+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZI3ZJEVH52Z","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZI3ZJEVH52Z67PL","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZI3ZJEV","created_at":"2026-05-18T12:25:58.018023+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/SZI3ZJEVH52Z67PLEMMZCCYC6W","json":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W.json","graph_json":"https://pith.science/api/pith-number/SZI3ZJEVH52Z67PLEMMZCCYC6W/graph.json","events_json":"https://pith.science/api/pith-number/SZI3ZJEVH52Z67PLEMMZCCYC6W/events.json","paper":"https://pith.science/paper/SZI3ZJEV"},"agent_actions":{"view_html":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W","download_json":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W.json","view_paper":"https://pith.science/paper/SZI3ZJEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.0253&json=true","fetch_graph":"https://pith.science/api/pith-number/SZI3ZJEVH52Z67PLEMMZCCYC6W/graph.json","fetch_events":"https://pith.science/api/pith-number/SZI3ZJEVH52Z67PLEMMZCCYC6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W/action/storage_attestation","attest_author":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W/action/author_attestation","sign_citation":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W/action/citation_signature","submit_replication":"https://pith.science/pith/SZI3ZJEVH52Z67PLEMMZCCYC6W/action/replication_record"}},"created_at":"2026-05-18T04:08:33.759872+00:00","updated_at":"2026-05-18T04:08:33.759872+00:00"}