{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DEH3OEWAU3HKKCS63SCM5KRIJU","short_pith_number":"pith:DEH3OEWA","schema_version":"1.0","canonical_sha256":"190fb712c0a6cea50a5edc84ceaa284d3da93613a66ee76b5978d97383297a84","source":{"kind":"arxiv","id":"1010.1948","version":1},"attestation_state":"computed","paper":{"title":"Transdichotomous Results in Computational Geometry, II: Offline Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Mihai Patrascu, Timothy M. Chan","submitted_at":"2010-10-10T18:24:29Z","abstract_excerpt":"We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm for offline point location, a two-dimensional analog of sorting where one needs to order points with respect to segments. This result implies, for example, that the convex hull of n points in three dimensions can be constructed in (randomized) time n 2^O(sqrt{lglg n}). Similar bounds hold for numerous other geometric problems, such as planar Voronoi diagrams, planar off-line nearest neighbor search, line segment interse"},"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":"1010.1948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-10T18:24:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e1956ea2b8e5c107b0cee75b045b763b973452f71282b55490377238a4a2af08","abstract_canon_sha256":"efd327cde1ee031bf94d491bcd5bca8065d26c17697405a173b9a9a8f8b0b34a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:30.009002Z","signature_b64":"I2VoqikukvZcO0Z9W7EfUXbQut/VFudZrXymMD4SDwPlthwvynJ7XELjPzbzTsWxpAc8ejfA3uNV5/0N9cYzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"190fb712c0a6cea50a5edc84ceaa284d3da93613a66ee76b5978d97383297a84","last_reissued_at":"2026-05-18T04:39:30.008522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:30.008522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transdichotomous Results in Computational Geometry, II: Offline Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Mihai Patrascu, Timothy M. Chan","submitted_at":"2010-10-10T18:24:29Z","abstract_excerpt":"We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm for offline point location, a two-dimensional analog of sorting where one needs to order points with respect to segments. This result implies, for example, that the convex hull of n points in three dimensions can be constructed in (randomized) time n 2^O(sqrt{lglg n}). Similar bounds hold for numerous other geometric problems, such as planar Voronoi diagrams, planar off-line nearest neighbor search, line segment interse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1948","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.1948","created_at":"2026-05-18T04:39:30.008602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1948v1","created_at":"2026-05-18T04:39:30.008602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1948","created_at":"2026-05-18T04:39:30.008602+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEH3OEWAU3HK","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEH3OEWAU3HKKCS6","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEH3OEWA","created_at":"2026-05-18T12:26:06.534383+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/DEH3OEWAU3HKKCS63SCM5KRIJU","json":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU.json","graph_json":"https://pith.science/api/pith-number/DEH3OEWAU3HKKCS63SCM5KRIJU/graph.json","events_json":"https://pith.science/api/pith-number/DEH3OEWAU3HKKCS63SCM5KRIJU/events.json","paper":"https://pith.science/paper/DEH3OEWA"},"agent_actions":{"view_html":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU","download_json":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU.json","view_paper":"https://pith.science/paper/DEH3OEWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1948&json=true","fetch_graph":"https://pith.science/api/pith-number/DEH3OEWAU3HKKCS63SCM5KRIJU/graph.json","fetch_events":"https://pith.science/api/pith-number/DEH3OEWAU3HKKCS63SCM5KRIJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU/action/storage_attestation","attest_author":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU/action/author_attestation","sign_citation":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU/action/citation_signature","submit_replication":"https://pith.science/pith/DEH3OEWAU3HKKCS63SCM5KRIJU/action/replication_record"}},"created_at":"2026-05-18T04:39:30.008602+00:00","updated_at":"2026-05-18T04:39:30.008602+00:00"}