{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NSCBO27RCNXH6MRSW3PUYWBP5H","short_pith_number":"pith:NSCBO27R","schema_version":"1.0","canonical_sha256":"6c84176bf1136e7f3232b6df4c582fe9dd5196a356fae4ee7ac983b17b2572da","source":{"kind":"arxiv","id":"2602.08843","version":1},"attestation_state":"computed","paper":{"title":"The Presort Hierarchy for Geometric Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Ivor van der Hoog, Jack Spalding-Jamieson, Lasse Wulf","submitted_at":"2026-02-09T16:09:43Z","abstract_excerpt":"Many fundamental problems in computational geometry admit no algorithm running in $o(n \\log n)$ time for $n$ planar input points, via classical reductions from sorting. Prominent examples include the computation of convex hulls, quadtrees, onion layer decompositions, Euclidean minimum spanning trees, KD-trees, Voronoi diagrams, and decremental closest-pair.\n  A classical result shows that, given $n$ points sorted along a single direction, the convex hull can be constructed in linear time. Subsequent works established that for all of the other above problems, this information does not suffice. "},"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":"2602.08843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-02-09T16:09:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"34cf42554ec020e2a6f160e3aa5bb035e94dac7fb0e2f725575fc0c501b100ea","abstract_canon_sha256":"705b1fc25f22e11ab621ee10d0139e4cddda60185281711b005388d9b818c29c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:34.069609Z","signature_b64":"+Te5rnkdNemB1TcYkv91CWOLc4xDYbCk25Uul1APFq0e8FiDN02FxAnd/urs9NjyqwlZ0pekLgfe+IecQzrzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c84176bf1136e7f3232b6df4c582fe9dd5196a356fae4ee7ac983b17b2572da","last_reissued_at":"2026-05-20T00:00:34.069017Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:34.069017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Presort Hierarchy for Geometric Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Eva Rotenberg, Ivor van der Hoog, Jack Spalding-Jamieson, Lasse Wulf","submitted_at":"2026-02-09T16:09:43Z","abstract_excerpt":"Many fundamental problems in computational geometry admit no algorithm running in $o(n \\log n)$ time for $n$ planar input points, via classical reductions from sorting. Prominent examples include the computation of convex hulls, quadtrees, onion layer decompositions, Euclidean minimum spanning trees, KD-trees, Voronoi diagrams, and decremental closest-pair.\n  A classical result shows that, given $n$ points sorted along a single direction, the convex hull can be constructed in linear time. Subsequent works established that for all of the other above problems, this information does not suffice. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.08843","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.08843/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.08843","created_at":"2026-05-20T00:00:34.069107+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.08843v1","created_at":"2026-05-20T00:00:34.069107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.08843","created_at":"2026-05-20T00:00:34.069107+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSCBO27RCNXH","created_at":"2026-05-20T00:00:34.069107+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSCBO27RCNXH6MRS","created_at":"2026-05-20T00:00:34.069107+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSCBO27R","created_at":"2026-05-20T00:00:34.069107+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/NSCBO27RCNXH6MRSW3PUYWBP5H","json":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H.json","graph_json":"https://pith.science/api/pith-number/NSCBO27RCNXH6MRSW3PUYWBP5H/graph.json","events_json":"https://pith.science/api/pith-number/NSCBO27RCNXH6MRSW3PUYWBP5H/events.json","paper":"https://pith.science/paper/NSCBO27R"},"agent_actions":{"view_html":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H","download_json":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H.json","view_paper":"https://pith.science/paper/NSCBO27R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.08843&json=true","fetch_graph":"https://pith.science/api/pith-number/NSCBO27RCNXH6MRSW3PUYWBP5H/graph.json","fetch_events":"https://pith.science/api/pith-number/NSCBO27RCNXH6MRSW3PUYWBP5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/action/storage_attestation","attest_author":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/action/author_attestation","sign_citation":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/action/citation_signature","submit_replication":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/action/replication_record"}},"created_at":"2026-05-20T00:00:34.069107+00:00","updated_at":"2026-05-20T00:00:34.069107+00:00"}