{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ADBGHYG3VFDVPSHBBTLUCWUETL","short_pith_number":"pith:ADBGHYG3","canonical_record":{"source":{"id":"1908.07097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-19T22:57:53Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"ef3feb39a273c70a165442b2feaf56816f977b565e142b2de21233bebe575a56","abstract_canon_sha256":"167526aba8878f608e2e8d65144b6424a7446719538e49f8afab7b54f92d9578"},"schema_version":"1.0"},"canonical_sha256":"00c263e0dba94757c8e10cd7415a849ac203ac510fa422ed0d00f8089f1dd103","source":{"kind":"arxiv","id":"1908.07097","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07097","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07097v2","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07097","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"ADBGHYG3VFDV","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"ADBGHYG3VFDVPSHB","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"ADBGHYG3","created_at":"2026-07-05T00:03:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ADBGHYG3VFDVPSHBBTLUCWUETL","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-19T22:57:53Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"ef3feb39a273c70a165442b2feaf56816f977b565e142b2de21233bebe575a56","abstract_canon_sha256":"167526aba8878f608e2e8d65144b6424a7446719538e49f8afab7b54f92d9578"},"schema_version":"1.0"},"canonical_sha256":"00c263e0dba94757c8e10cd7415a849ac203ac510fa422ed0d00f8089f1dd103","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:58.273667Z","signature_b64":"DZ7xAgly1yR/ttdjCqg1npY9KQ6aW/qX5JGfK7/lvaqvCdHLuKpBM26T2FmSWF4nKTA8K/3M8wWi7DuUv89DCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00c263e0dba94757c8e10cd7415a849ac203ac510fa422ed0d00f8089f1dd103","last_reissued_at":"2026-07-05T00:03:58.273261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:58.273261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07097","source_version":2,"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-07-05T00:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6VxQA2iPuyilzAUe5MxohxOukY7ffO3GCkjxWeUAw0wtqs/80ezu3fWqXBNJ+q8raZmi1SjqeH7nS7ROWWZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:50:36.173271Z"},"content_sha256":"a03bd81b15868549c182252db3f8183ce2b4198837ab2ed0b1d1b812827ae226","schema_version":"1.0","event_id":"sha256:a03bd81b15868549c182252db3f8183ce2b4198837ab2ed0b1d1b812827ae226"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ADBGHYG3VFDVPSHBBTLUCWUETL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Alexander Choi, Kevin Costello, Marek Chrobak","submitted_at":"2019-08-19T22:57:53Z","abstract_excerpt":"A set $U\\subseteq \\reals^2$ is $n$-universal if all $n$-vertex planar graphs have a planar straight-line embedding into $U$. We prove that if $Q \\subseteq \\reals^2$ consists of points chosen randomly and uniformly from the unit square then $Q$ must have cardinality $\\Omega(n^2)$ in order to be $n$-universal with high probability. This shows that the probabilistic method, at least in its basic form, cannot be used to establish an $o(n^2)$ upper bound on universal sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07097","kind":"arxiv","version":2},"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/1908.07097/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"},"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-07-05T00:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rD6yj4eqKafDeWVGeKC9dVbn0sEfNiJSq7Q+EKLegNkX6FQXKASEyn+sv+mozy7h7awqRq+jSlaGFiWp9fbEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:50:36.173786Z"},"content_sha256":"cd6ca4162a1849ede3fa7d3b5d0e76b5c0426be535de9949b6aa091268d8cb27","schema_version":"1.0","event_id":"sha256:cd6ca4162a1849ede3fa7d3b5d0e76b5c0426be535de9949b6aa091268d8cb27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADBGHYG3VFDVPSHBBTLUCWUETL/bundle.json","state_url":"https://pith.science/pith/ADBGHYG3VFDVPSHBBTLUCWUETL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADBGHYG3VFDVPSHBBTLUCWUETL/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-08-16T06:50:36Z","links":{"resolver":"https://pith.science/pith/ADBGHYG3VFDVPSHBBTLUCWUETL","bundle":"https://pith.science/pith/ADBGHYG3VFDVPSHBBTLUCWUETL/bundle.json","state":"https://pith.science/pith/ADBGHYG3VFDVPSHBBTLUCWUETL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADBGHYG3VFDVPSHBBTLUCWUETL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ADBGHYG3VFDVPSHBBTLUCWUETL","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":"167526aba8878f608e2e8d65144b6424a7446719538e49f8afab7b54f92d9578","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-19T22:57:53Z","title_canon_sha256":"ef3feb39a273c70a165442b2feaf56816f977b565e142b2de21233bebe575a56"},"schema_version":"1.0","source":{"id":"1908.07097","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07097","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07097v2","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07097","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"ADBGHYG3VFDV","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"ADBGHYG3VFDVPSHB","created_at":"2026-07-05T00:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"ADBGHYG3","created_at":"2026-07-05T00:03:58Z"}],"graph_snapshots":[{"event_id":"sha256:cd6ca4162a1849ede3fa7d3b5d0e76b5c0426be535de9949b6aa091268d8cb27","target":"graph","created_at":"2026-07-05T00:03:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07097/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A set $U\\subseteq \\reals^2$ is $n$-universal if all $n$-vertex planar graphs have a planar straight-line embedding into $U$. We prove that if $Q \\subseteq \\reals^2$ consists of points chosen randomly and uniformly from the unit square then $Q$ must have cardinality $\\Omega(n^2)$ in order to be $n$-universal with high probability. This shows that the probabilistic method, at least in its basic form, cannot be used to establish an $o(n^2)$ upper bound on universal sets.","authors_text":"Alexander Choi, Kevin Costello, Marek Chrobak","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07097","kind":"arxiv","version":2},"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:a03bd81b15868549c182252db3f8183ce2b4198837ab2ed0b1d1b812827ae226","target":"record","created_at":"2026-07-05T00:03:58Z","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":"167526aba8878f608e2e8d65144b6424a7446719538e49f8afab7b54f92d9578","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-19T22:57:53Z","title_canon_sha256":"ef3feb39a273c70a165442b2feaf56816f977b565e142b2de21233bebe575a56"},"schema_version":"1.0","source":{"id":"1908.07097","kind":"arxiv","version":2}},"canonical_sha256":"00c263e0dba94757c8e10cd7415a849ac203ac510fa422ed0d00f8089f1dd103","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00c263e0dba94757c8e10cd7415a849ac203ac510fa422ed0d00f8089f1dd103","first_computed_at":"2026-07-05T00:03:58.273261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:03:58.273261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DZ7xAgly1yR/ttdjCqg1npY9KQ6aW/qX5JGfK7/lvaqvCdHLuKpBM26T2FmSWF4nKTA8K/3M8wWi7DuUv89DCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:03:58.273667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07097","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a03bd81b15868549c182252db3f8183ce2b4198837ab2ed0b1d1b812827ae226","sha256:cd6ca4162a1849ede3fa7d3b5d0e76b5c0426be535de9949b6aa091268d8cb27"],"state_sha256":"9c0593360a08606c6b2431a4558caf3bd808a17ba933120a6d72384220f55eb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96BAyYNbP+P4y/rSqYhcjx/BChHOJqePkuCX2uppz1zi9IXzEcgqnz+4m1URDtuja4BQgdT18xPF2YwHwwshCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:50:36.177565Z","bundle_sha256":"faf17f44ceee83e2eb6a750d08c08e0bda2eba2c941c97826f93f009fc1ce27e"}}