{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FFWCUCIHGUSLLAPIGKVG6ZYIRO","short_pith_number":"pith:FFWCUCIH","canonical_record":{"source":{"id":"1102.2008","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-09T23:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"7045ccfc19c97e19a9234d003dbaf670c05df7bb67abe5310cab9131e0e6849c","abstract_canon_sha256":"d08a1e2a40a8526f2289ee00ee48338ec18c6f409fd1e00dfe841291452be37b"},"schema_version":"1.0"},"canonical_sha256":"296c2a09073524b581e832aa6f67088baac72d3d7baf50a632682a76cc8b4a60","source":{"kind":"arxiv","id":"1102.2008","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2008","created_at":"2026-05-18T03:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2008v3","created_at":"2026-05-18T03:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2008","created_at":"2026-05-18T03:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"FFWCUCIHGUSL","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FFWCUCIHGUSLLAPI","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FFWCUCIH","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FFWCUCIHGUSLLAPIGKVG6ZYIRO","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2008","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-09T23:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"7045ccfc19c97e19a9234d003dbaf670c05df7bb67abe5310cab9131e0e6849c","abstract_canon_sha256":"d08a1e2a40a8526f2289ee00ee48338ec18c6f409fd1e00dfe841291452be37b"},"schema_version":"1.0"},"canonical_sha256":"296c2a09073524b581e832aa6f67088baac72d3d7baf50a632682a76cc8b4a60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:53.402990Z","signature_b64":"L6YpS/X+dcyHvh8wHh9cWP1FOWMuPNHxgLtw7Sao81irxZRa7ayVVV9U/KSggEAOqKp9P4V/wiSWBojuGPDpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"296c2a09073524b581e832aa6f67088baac72d3d7baf50a632682a76cc8b4a60","last_reissued_at":"2026-05-18T03:37:53.402447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:53.402447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2008","source_version":3,"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:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQQf38yrQfPqhCQCsnaHQ11dmJeSNXyV4N2LXb6hHX4+qAksBg6FpIZ285OcP8dUtHc/6LSfpkTHzQ0ZMguMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:30:31.109161Z"},"content_sha256":"8d7143550749028e86e2f201f38d4d72614ea7eeda8e0fa9fffdc1329a44ddbb","schema_version":"1.0","event_id":"sha256:8d7143550749028e86e2f201f38d4d72614ea7eeda8e0fa9fffdc1329a44ddbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FFWCUCIHGUSLLAPIGKVG6ZYIRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Hull of Points Lying on Lines in o(n log n) Time after Preprocessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Esther Ezra, Wolfgang Mulzer","submitted_at":"2011-02-09T23:38:26Z","abstract_excerpt":"Motivated by the desire to cope with data imprecision, we study methods for taking advantage of preliminary information about point sets in order to speed up the computation of certain structures associated with them.\n  In particular, we study the following problem: given a set L of n lines in the plane, we wish to preprocess L such that later, upon receiving a set P of n points, each of which lies on a distinct line of L, we can construct the convex hull of P efficiently. We show that in quadratic time and space it is possible to construct a data structure on L that enables us to compute the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2008","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":""},"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:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87vSeQCnh+CEeBGpKX7BnGFSdGBoRgoZXxzCTGv5d5dzJXeeJ/YlS1+SLheg2910qOOarFeOJ+FxY2+irmpUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:30:31.109664Z"},"content_sha256":"aae95de6ab147477b12611af20d2ff60b9fc66492a69e5e27d42fcca080936bf","schema_version":"1.0","event_id":"sha256:aae95de6ab147477b12611af20d2ff60b9fc66492a69e5e27d42fcca080936bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFWCUCIHGUSLLAPIGKVG6ZYIRO/bundle.json","state_url":"https://pith.science/pith/FFWCUCIHGUSLLAPIGKVG6ZYIRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFWCUCIHGUSLLAPIGKVG6ZYIRO/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-05-25T08:30:31Z","links":{"resolver":"https://pith.science/pith/FFWCUCIHGUSLLAPIGKVG6ZYIRO","bundle":"https://pith.science/pith/FFWCUCIHGUSLLAPIGKVG6ZYIRO/bundle.json","state":"https://pith.science/pith/FFWCUCIHGUSLLAPIGKVG6ZYIRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFWCUCIHGUSLLAPIGKVG6ZYIRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FFWCUCIHGUSLLAPIGKVG6ZYIRO","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":"d08a1e2a40a8526f2289ee00ee48338ec18c6f409fd1e00dfe841291452be37b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-09T23:38:26Z","title_canon_sha256":"7045ccfc19c97e19a9234d003dbaf670c05df7bb67abe5310cab9131e0e6849c"},"schema_version":"1.0","source":{"id":"1102.2008","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2008","created_at":"2026-05-18T03:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2008v3","created_at":"2026-05-18T03:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2008","created_at":"2026-05-18T03:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"FFWCUCIHGUSL","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FFWCUCIHGUSLLAPI","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FFWCUCIH","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:aae95de6ab147477b12611af20d2ff60b9fc66492a69e5e27d42fcca080936bf","target":"graph","created_at":"2026-05-18T03:37:53Z","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":"Motivated by the desire to cope with data imprecision, we study methods for taking advantage of preliminary information about point sets in order to speed up the computation of certain structures associated with them.\n  In particular, we study the following problem: given a set L of n lines in the plane, we wish to preprocess L such that later, upon receiving a set P of n points, each of which lies on a distinct line of L, we can construct the convex hull of P efficiently. We show that in quadratic time and space it is possible to construct a data structure on L that enables us to compute the ","authors_text":"Esther Ezra, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-09T23:38:26Z","title":"Convex Hull of Points Lying on Lines in o(n log n) Time after Preprocessing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2008","kind":"arxiv","version":3},"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:8d7143550749028e86e2f201f38d4d72614ea7eeda8e0fa9fffdc1329a44ddbb","target":"record","created_at":"2026-05-18T03:37:53Z","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":"d08a1e2a40a8526f2289ee00ee48338ec18c6f409fd1e00dfe841291452be37b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-09T23:38:26Z","title_canon_sha256":"7045ccfc19c97e19a9234d003dbaf670c05df7bb67abe5310cab9131e0e6849c"},"schema_version":"1.0","source":{"id":"1102.2008","kind":"arxiv","version":3}},"canonical_sha256":"296c2a09073524b581e832aa6f67088baac72d3d7baf50a632682a76cc8b4a60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"296c2a09073524b581e832aa6f67088baac72d3d7baf50a632682a76cc8b4a60","first_computed_at":"2026-05-18T03:37:53.402447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:53.402447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L6YpS/X+dcyHvh8wHh9cWP1FOWMuPNHxgLtw7Sao81irxZRa7ayVVV9U/KSggEAOqKp9P4V/wiSWBojuGPDpBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:53.402990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2008","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d7143550749028e86e2f201f38d4d72614ea7eeda8e0fa9fffdc1329a44ddbb","sha256:aae95de6ab147477b12611af20d2ff60b9fc66492a69e5e27d42fcca080936bf"],"state_sha256":"d3c5ff544ad4671c48db2b97c3d3f3020ac21b32283c90f9e71a4afe5a132639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHKnQfAIWp7oXRwOfHQxXhI5bVFsmxex6+mp8peaKkSungByqdbotrXeflPVec5sTSz+xwhCdQAvSW+TZM+5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:30:31.112873Z","bundle_sha256":"561e711dfe16197598bd2d01b686c279154a1cfcc4ff0f9732e75bfeefe2fc41"}}