{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BTQAD2GZYIGX25EWHUIT5S3ZBA","short_pith_number":"pith:BTQAD2GZ","schema_version":"1.0","canonical_sha256":"0ce001e8d9c20d7d74963d113ecb790806a05586846ea8b7818db070486d66f8","source":{"kind":"arxiv","id":"1209.3594","version":5},"attestation_state":"computed","paper":{"title":"On Universal Point Sets for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jean Cardinal, Michael Hoffmann, Vincent Kusters","submitted_at":"2012-09-17T08:54:44Z","abstract_excerpt":"A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely, we use a computer program to show that there exist universal point sets for all n<=10 and to enumerate all corresponding order types. Finally, we describe a collection G of 7'393 planar graphs on 35 vertices that do not admit a simultaneous geometric embedding without mapping, that is, no set of 35 points in the plane supports a plane straight-line embeddin"},"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":"1209.3594","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-17T08:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"035ee63c902f0d4269bd08711e7e309fee87ff945c740401b53b9f3af6104f70","abstract_canon_sha256":"4b2a0d8c0ec4a57d3af5be78b443592ca08d8959d13393e5e7a34f2167e31d08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:53.138513Z","signature_b64":"aFNLSdp56ir+hypFSBSjBm+5UI4dx3mgq+8NaAImaY0S9I6WEXeTFYqSDfvDXLKYrgg8mZ6IxWCcNeM63iuQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ce001e8d9c20d7d74963d113ecb790806a05586846ea8b7818db070486d66f8","last_reissued_at":"2026-05-18T03:14:53.137710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:53.137710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Universal Point Sets for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jean Cardinal, Michael Hoffmann, Vincent Kusters","submitted_at":"2012-09-17T08:54:44Z","abstract_excerpt":"A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely, we use a computer program to show that there exist universal point sets for all n<=10 and to enumerate all corresponding order types. Finally, we describe a collection G of 7'393 planar graphs on 35 vertices that do not admit a simultaneous geometric embedding without mapping, that is, no set of 35 points in the plane supports a plane straight-line embeddin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3594","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":"1209.3594","created_at":"2026-05-18T03:14:53.137828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.3594v5","created_at":"2026-05-18T03:14:53.137828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3594","created_at":"2026-05-18T03:14:53.137828+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTQAD2GZYIGX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTQAD2GZYIGX25EW","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTQAD2GZ","created_at":"2026-05-18T12:27:01.376967+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/BTQAD2GZYIGX25EWHUIT5S3ZBA","json":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA.json","graph_json":"https://pith.science/api/pith-number/BTQAD2GZYIGX25EWHUIT5S3ZBA/graph.json","events_json":"https://pith.science/api/pith-number/BTQAD2GZYIGX25EWHUIT5S3ZBA/events.json","paper":"https://pith.science/paper/BTQAD2GZ"},"agent_actions":{"view_html":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA","download_json":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA.json","view_paper":"https://pith.science/paper/BTQAD2GZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.3594&json=true","fetch_graph":"https://pith.science/api/pith-number/BTQAD2GZYIGX25EWHUIT5S3ZBA/graph.json","fetch_events":"https://pith.science/api/pith-number/BTQAD2GZYIGX25EWHUIT5S3ZBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA/action/storage_attestation","attest_author":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA/action/author_attestation","sign_citation":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA/action/citation_signature","submit_replication":"https://pith.science/pith/BTQAD2GZYIGX25EWHUIT5S3ZBA/action/replication_record"}},"created_at":"2026-05-18T03:14:53.137828+00:00","updated_at":"2026-05-18T03:14:53.137828+00:00"}