{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NSCBO27RCNXH6MRSW3PUYWBP5H","short_pith_number":"pith:NSCBO27R","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"},"canonical_sha256":"6c84176bf1136e7f3232b6df4c582fe9dd5196a356fae4ee7ac983b17b2572da","source":{"kind":"arxiv","id":"2602.08843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.08843","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2602.08843v1","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.08843","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"NSCBO27RCNXH","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSCBO27RCNXH6MRS","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSCBO27R","created_at":"2026-05-20T00:00:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NSCBO27RCNXH6MRSW3PUYWBP5H","target":"record","payload":{"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"},"canonical_sha256":"6c84176bf1136e7f3232b6df4c582fe9dd5196a356fae4ee7ac983b17b2572da","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"},"source_kind":"arxiv","source_id":"2602.08843","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-20T00:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdZQmmNFVlW4og0V/Fnkd58eGgzCcj6TJuMPNwz/7CzH3CtskauYqtH+H2m4MPukzy8fDhTA28FiveirtUqVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:14:07.452349Z"},"content_sha256":"c093af370735064154c63b90d92a53ae05673ef0bd4b5bf8a27bf96218f2cb11","schema_version":"1.0","event_id":"sha256:c093af370735064154c63b90d92a53ae05673ef0bd4b5bf8a27bf96218f2cb11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NSCBO27RCNXH6MRSW3PUYWBP5H","target":"graph","payload":{"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"},"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-20T00:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kv9zXSYTLDVyiozkRbuIutGqldHEr0kMnq08W3zPemAjIvQvQlowXtiZoB7s5WLPuTwX/9711rsCwuPYrjD6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:14:07.452764Z"},"content_sha256":"20c056766a3d94d9c5c0dd1e19609db03184bbc9e37932b565fcc88146a72d45","schema_version":"1.0","event_id":"sha256:20c056766a3d94d9c5c0dd1e19609db03184bbc9e37932b565fcc88146a72d45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/bundle.json","state_url":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/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-27T04:14:07Z","links":{"resolver":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H","bundle":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/bundle.json","state":"https://pith.science/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSCBO27RCNXH6MRSW3PUYWBP5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NSCBO27RCNXH6MRSW3PUYWBP5H","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":"705b1fc25f22e11ab621ee10d0139e4cddda60185281711b005388d9b818c29c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-02-09T16:09:43Z","title_canon_sha256":"34cf42554ec020e2a6f160e3aa5bb035e94dac7fb0e2f725575fc0c501b100ea"},"schema_version":"1.0","source":{"id":"2602.08843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.08843","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2602.08843v1","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.08843","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"NSCBO27RCNXH","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSCBO27RCNXH6MRS","created_at":"2026-05-20T00:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSCBO27R","created_at":"2026-05-20T00:00:34Z"}],"graph_snapshots":[{"event_id":"sha256:20c056766a3d94d9c5c0dd1e19609db03184bbc9e37932b565fcc88146a72d45","target":"graph","created_at":"2026-05-20T00:00:34Z","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/2602.08843/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. ","authors_text":"Eva Rotenberg, Ivor van der Hoog, Jack Spalding-Jamieson, Lasse Wulf","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-02-09T16:09:43Z","title":"The Presort Hierarchy for Geometric Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.08843","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:c093af370735064154c63b90d92a53ae05673ef0bd4b5bf8a27bf96218f2cb11","target":"record","created_at":"2026-05-20T00:00:34Z","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":"705b1fc25f22e11ab621ee10d0139e4cddda60185281711b005388d9b818c29c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-02-09T16:09:43Z","title_canon_sha256":"34cf42554ec020e2a6f160e3aa5bb035e94dac7fb0e2f725575fc0c501b100ea"},"schema_version":"1.0","source":{"id":"2602.08843","kind":"arxiv","version":1}},"canonical_sha256":"6c84176bf1136e7f3232b6df4c582fe9dd5196a356fae4ee7ac983b17b2572da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c84176bf1136e7f3232b6df4c582fe9dd5196a356fae4ee7ac983b17b2572da","first_computed_at":"2026-05-20T00:00:34.069017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:34.069017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Te5rnkdNemB1TcYkv91CWOLc4xDYbCk25Uul1APFq0e8FiDN02FxAnd/urs9NjyqwlZ0pekLgfe+IecQzrzCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:34.069609Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.08843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c093af370735064154c63b90d92a53ae05673ef0bd4b5bf8a27bf96218f2cb11","sha256:20c056766a3d94d9c5c0dd1e19609db03184bbc9e37932b565fcc88146a72d45"],"state_sha256":"d6635c0d32b0a0645cf58fbb419bc57f25cc9d67cf3f68cbe7450bec488e7e6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pU5gYCYPUo7UhujPKvB7fe0Tpd35xE6MJ+OhgrxjtLZg63g+thpTZs3HFwgZbSB9LNU3fyHrLNsP5G3Dzj5iCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:14:07.455493Z","bundle_sha256":"8e669d70501040a7fc26855ed546476f5b587c631860496270002b454fb1e47e"}}