{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YYDLJTFJ3VYMCLWAFZW3ONNQLU","short_pith_number":"pith:YYDLJTFJ","schema_version":"1.0","canonical_sha256":"c606b4cca9dd70c12ec02e6db735b05d3ebf0468849486821bff7c71f1bb7ba5","source":{"kind":"arxiv","id":"1811.06482","version":3},"attestation_state":"computed","paper":{"title":"A Note On Universal Point Sets for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Hendrik Schrezenmaier, Manfred Scheucher, Raphael Steiner","submitted_at":"2018-11-15T17:16:50Z","abstract_excerpt":"We investigate which planar point sets allow simultaneous straight-line embeddings of all planar graphs on a fixed number of vertices. We first show that $(1.293-o(1))n$ points are required to find a straight-line drawing of each $n$-vertex planar graph (vertices are drawn as the given points); this improves the previous best constant $1.235$ by Kurowski (2004).\n  Our second main result is based on exhaustive computer search: We show that no set of 11 points exists, on which all planar 11-vertex graphs can be simultaneously drawn plane straight-line. This strengthens the result by Cardinal, Ho"},"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":"1811.06482","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-15T17:16:50Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"350a521e5e70ed70b1b6722418fb3f4150edca07165173ae0ad29c2f85b5fdd5","abstract_canon_sha256":"2316cc4e46184e4bec94c5fbdf0f528b8ed75c7d1def6a7b48af1b4fb8bbe45f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:05.829943Z","signature_b64":"YESA+RHWPjr0Fay78rYYbJRFbLYH4uRXyipX28vUEUUu1Nkqz0pTld4czg2smb3RGuW/SpDGys/ZFDOPnXmVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c606b4cca9dd70c12ec02e6db735b05d3ebf0468849486821bff7c71f1bb7ba5","last_reissued_at":"2026-07-05T00:07:05.829451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:05.829451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note On Universal Point Sets for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Hendrik Schrezenmaier, Manfred Scheucher, Raphael Steiner","submitted_at":"2018-11-15T17:16:50Z","abstract_excerpt":"We investigate which planar point sets allow simultaneous straight-line embeddings of all planar graphs on a fixed number of vertices. We first show that $(1.293-o(1))n$ points are required to find a straight-line drawing of each $n$-vertex planar graph (vertices are drawn as the given points); this improves the previous best constant $1.235$ by Kurowski (2004).\n  Our second main result is based on exhaustive computer search: We show that no set of 11 points exists, on which all planar 11-vertex graphs can be simultaneously drawn plane straight-line. This strengthens the result by Cardinal, Ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06482","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.06482/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1811.06482","created_at":"2026-07-05T00:07:05.829510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06482v3","created_at":"2026-07-05T00:07:05.829510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06482","created_at":"2026-07-05T00:07:05.829510+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYDLJTFJ3VYM","created_at":"2026-07-05T00:07:05.829510+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYDLJTFJ3VYMCLWA","created_at":"2026-07-05T00:07:05.829510+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYDLJTFJ","created_at":"2026-07-05T00:07:05.829510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07097","citing_title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU","json":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU.json","graph_json":"https://pith.science/api/pith-number/YYDLJTFJ3VYMCLWAFZW3ONNQLU/graph.json","events_json":"https://pith.science/api/pith-number/YYDLJTFJ3VYMCLWAFZW3ONNQLU/events.json","paper":"https://pith.science/paper/YYDLJTFJ"},"agent_actions":{"view_html":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU","download_json":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU.json","view_paper":"https://pith.science/paper/YYDLJTFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06482&json=true","fetch_graph":"https://pith.science/api/pith-number/YYDLJTFJ3VYMCLWAFZW3ONNQLU/graph.json","fetch_events":"https://pith.science/api/pith-number/YYDLJTFJ3VYMCLWAFZW3ONNQLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU/action/storage_attestation","attest_author":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU/action/author_attestation","sign_citation":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU/action/citation_signature","submit_replication":"https://pith.science/pith/YYDLJTFJ3VYMCLWAFZW3ONNQLU/action/replication_record"}},"created_at":"2026-07-05T00:07:05.829510+00:00","updated_at":"2026-07-05T00:07:05.829510+00:00"}