{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HZS5G3TNWSIL3FN4EHMGBZ27YK","short_pith_number":"pith:HZS5G3TN","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"},"canonical_sha256":"3e65d36e6db490bd95bc21d860e75fc28fb3264066a62d6ece46fab703e552b2","source":{"kind":"arxiv","id":"1212.0804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0804","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0804v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0804","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"HZS5G3TNWSIL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HZS5G3TNWSIL3FN4","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HZS5G3TN","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HZS5G3TNWSIL3FN4EHMGBZ27YK","target":"record","payload":{"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"},"canonical_sha256":"3e65d36e6db490bd95bc21d860e75fc28fb3264066a62d6ece46fab703e552b2","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"},"source_kind":"arxiv","source_id":"1212.0804","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Q5GVwQVY1KuIjxityXnTtdaRV48QxKTjgyNyotN3Q1uRKBDXC2UrczqdqtXmu1hurGhk2U7GSeQzBe0T0FcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:57:28.522094Z"},"content_sha256":"99936bd1f42d35b3245ff76dd7cca870e19542af18fc62b079f2d27434f41bf7","schema_version":"1.0","event_id":"sha256:99936bd1f42d35b3245ff76dd7cca870e19542af18fc62b079f2d27434f41bf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HZS5G3TNWSIL3FN4EHMGBZ27YK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jI6Z6UEGxy1U+cwAp6OaYGu8bysev82NhoRd1W7kN1o8FjRRnAghHVNm1iIBRH8Ggmfqm8sg6PCY8x/b14D2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:57:28.522491Z"},"content_sha256":"ceffb9b0322c4f02a90f79455fea65ccec7e5185b465569db0c510e3c41739a7","schema_version":"1.0","event_id":"sha256:ceffb9b0322c4f02a90f79455fea65ccec7e5185b465569db0c510e3c41739a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/bundle.json","state_url":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T09:57:28Z","links":{"resolver":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK","bundle":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/bundle.json","state":"https://pith.science/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZS5G3TNWSIL3FN4EHMGBZ27YK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HZS5G3TNWSIL3FN4EHMGBZ27YK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cce4340d0566fa5713cdf78d8136a4d439f0d148b6bbbb956d170c13b96056c1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T17:33:45Z","title_canon_sha256":"e4bc2b28e44f279208257a83357f5251667924e722afdd2541defe0d5fdc8d23"},"schema_version":"1.0","source":{"id":"1212.0804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0804","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0804v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0804","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"HZS5G3TNWSIL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HZS5G3TNWSIL3FN4","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HZS5G3TN","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:ceffb9b0322c4f02a90f79455fea65ccec7e5185b465569db0c510e3c41739a7","target":"graph","created_at":"2026-05-18T03:39:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T17:33:45Z","title":"How many vertex locations can be arbitrarily chosen when drawing planar graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0804","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:99936bd1f42d35b3245ff76dd7cca870e19542af18fc62b079f2d27434f41bf7","target":"record","created_at":"2026-05-18T03:39:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cce4340d0566fa5713cdf78d8136a4d439f0d148b6bbbb956d170c13b96056c1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T17:33:45Z","title_canon_sha256":"e4bc2b28e44f279208257a83357f5251667924e722afdd2541defe0d5fdc8d23"},"schema_version":"1.0","source":{"id":"1212.0804","kind":"arxiv","version":1}},"canonical_sha256":"3e65d36e6db490bd95bc21d860e75fc28fb3264066a62d6ece46fab703e552b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e65d36e6db490bd95bc21d860e75fc28fb3264066a62d6ece46fab703e552b2","first_computed_at":"2026-05-18T03:39:15.180625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:15.180625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hIdsZ74szugJ6X/KeptghWGcTLkNMRQ074oC3iDVBbbz85aDsHYM/RflaysMyRXabAuX/fUkXxrTOHudc/E8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:15.181365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99936bd1f42d35b3245ff76dd7cca870e19542af18fc62b079f2d27434f41bf7","sha256:ceffb9b0322c4f02a90f79455fea65ccec7e5185b465569db0c510e3c41739a7"],"state_sha256":"96d4835c45b2f8c815fa5a341c4ab73b2845e33fe934367a8d362a0694eaf349"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZU9zRGU/7Cd58oINO8m0kizYQ0hINj2CvIpwJGUFaImktrJupNRh7l7BX8wCmUVio9Z2faiAmD2qmYSj6XqfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:57:28.524328Z","bundle_sha256":"98bb7e0eb53fe37e31348dc1f9e46b0f8195e49427bbd1947ef11bd4c42e921a"}}