{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HZS5G3TNWSIL3FN4EHMGBZ27YK","short_pith_number":"pith:HZS5G3TN","schema_version":"1.0","canonical_sha256":"3e65d36e6db490bd95bc21d860e75fc28fb3264066a62d6ece46fab703e552b2","source":{"kind":"arxiv","id":"1212.0804","version":1},"attestation_state":"computed","paper":{"title":"How many vertex locations can be arbitrarily chosen when drawing planar graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze","submitted_at":"2012-12-04T17:33:45Z","abstract_excerpt":"It is proven that every set $S$ of distinct points in the plane with cardinality $\\lceil \\frac{\\sqrt{\\log_2 n}-1}{4} \\rceil$ can be a subset of the vertices of a crossing-free straight-line drawing of any planar graph with $n$ vertices. It is also proven that if $S$ is restricted to be a one-sided convex point set, its cardinality increases to $\\lceil \\sqrt[3]{n} \\rceil$. The proofs are constructive and give rise to O(n)-time drawing algorithms. As a part of our proofs, we show that every maximal planar graph contains a large induced biconnected outerplanar graphs and a large induced outerpath"},"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":"1212.0804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T17:33:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e4bc2b28e44f279208257a83357f5251667924e722afdd2541defe0d5fdc8d23","abstract_canon_sha256":"cce4340d0566fa5713cdf78d8136a4d439f0d148b6bbbb956d170c13b96056c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:15.181365Z","signature_b64":"hIdsZ74szugJ6X/KeptghWGcTLkNMRQ074oC3iDVBbbz85aDsHYM/RflaysMyRXabAuX/fUkXxrTOHudc/E8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e65d36e6db490bd95bc21d860e75fc28fb3264066a62d6ece46fab703e552b2","last_reissued_at":"2026-05-18T03:39:15.180625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:15.180625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How many vertex locations can be arbitrarily chosen when drawing planar graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze","submitted_at":"2012-12-04T17:33:45Z","abstract_excerpt":"It is proven that every set $S$ of distinct points in the plane with cardinality $\\lceil \\frac{\\sqrt{\\log_2 n}-1}{4} \\rceil$ can be a subset of the vertices of a crossing-free straight-line drawing of any planar graph with $n$ vertices. It is also proven that if $S$ is restricted to be a one-sided convex point set, its cardinality increases to $\\lceil \\sqrt[3]{n} \\rceil$. The proofs are constructive and give rise to O(n)-time drawing algorithms. As a part of our proofs, we show that every maximal planar graph contains a large induced biconnected outerplanar graphs and a large induced outerpath"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0804","kind":"arxiv","version":1},"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":"1212.0804","created_at":"2026-05-18T03:39:15.180737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0804v1","created_at":"2026-05-18T03:39:15.180737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0804","created_at":"2026-05-18T03:39:15.180737+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZS5G3TNWSIL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZS5G3TNWSIL3FN4","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZS5G3TN","created_at":"2026-05-18T12:27:09.501522+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/HZS5G3TNWSIL3FN4EHMGBZ27YK","json":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK.json","graph_json":"https://pith.science/api/pith-number/HZS5G3TNWSIL3FN4EHMGBZ27YK/graph.json","events_json":"https://pith.science/api/pith-number/HZS5G3TNWSIL3FN4EHMGBZ27YK/events.json","paper":"https://pith.science/paper/HZS5G3TN"},"agent_actions":{"view_html":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK","download_json":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK.json","view_paper":"https://pith.science/paper/HZS5G3TN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0804&json=true","fetch_graph":"https://pith.science/api/pith-number/HZS5G3TNWSIL3FN4EHMGBZ27YK/graph.json","fetch_events":"https://pith.science/api/pith-number/HZS5G3TNWSIL3FN4EHMGBZ27YK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/action/storage_attestation","attest_author":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/action/author_attestation","sign_citation":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/action/citation_signature","submit_replication":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/action/replication_record"}},"created_at":"2026-05-18T03:39:15.180737+00:00","updated_at":"2026-05-18T03:39:15.180737+00:00"}