{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TKHVJR2LGOKQXX3LFHGKAAVKJK","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":"9eae949c7d2787399405ad916240383868c1125de3f56e04f2caeecb76cc9174","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T10:31:45Z","title_canon_sha256":"ebb284da50cfa1175724401da82000f917e313d04b62d3cb5fb11e8a148bb036"},"schema_version":"1.0","source":{"id":"2605.09464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09464","created_at":"2026-05-21T01:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09464v2","created_at":"2026-05-21T01:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09464","created_at":"2026-05-21T01:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"TKHVJR2LGOKQ","created_at":"2026-05-21T01:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"TKHVJR2LGOKQXX3L","created_at":"2026-05-21T01:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"TKHVJR2L","created_at":"2026-05-21T01:05:20Z"}],"graph_snapshots":[{"event_id":"sha256:9c4495d4a976fd5b6f1693f7815d5429d0670f13dde01d02ee5d0b5ec6468b81","target":"graph","created_at":"2026-05-21T01:05:20Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that no deterministic output-sensitive algorithm for the planar convex hull and maxima problems can obtain both optimal time and I/O complexity, where the optimality is defined with respect to both the input and output sizes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The lower bound holds in the standard external-memory model where time and I/O complexities are measured separately and optimality is defined with respect to input size n and output size h."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"No deterministic output-sensitive algorithm for planar maxima or convex hull can simultaneously achieve optimal time and I/O complexity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"No deterministic output-sensitive algorithm achieves both optimal time and optimal I/O for planar convex hull and maxima."}],"snapshot_sha256":"51cb7be529084b534fe032341dfedab1dba114675e6f5d8d57f048ec4756c492"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T07:42:01.423220Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:35:13.755092Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T13:01:17.996977Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T10:11:41.179681Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.09464/integrity.json","findings":[],"snapshot_sha256":"74f454eeddb162c018a29289af0dd7fb16f39c83ac937b4dcaa29baeaf546654","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that no deterministic output-sensitive algorithm for the planar convex hull and maxima problems can obtain both optimal time and I/O complexity, where the optimality is defined with respect to both the input and output sizes. This explains why the best previous algorithms achieved an optimal I/O bound at the cost of sub-optimal running time (Goodrich et al. [FOCS, 1993]). To the best of our knowledge, the impossibility of simultaneous optimality was only shown previously for the permutation problem by Brodal and Fagerberg [STOC, 2003]. Our results imply that no optimal deterministic o","authors_text":"Gerth St{\\o}lting Brodal, Nodari Sitchinava, Peyman Afshani","cross_cats":["cs.CG"],"headline":"No deterministic output-sensitive algorithm achieves both optimal time and optimal I/O for planar convex hull and maxima.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T10:31:45Z","title":"The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.09464","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T04:35:02.142354Z","id":"278d871b-3bc3-4964-af56-19040685a1ee","model_set":{"reader":"grok-4.3"},"one_line_summary":"No deterministic output-sensitive algorithm for planar maxima or convex hull can simultaneously achieve optimal time and I/O complexity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"No deterministic output-sensitive algorithm achieves both optimal time and optimal I/O for planar convex hull and maxima.","strongest_claim":"We prove that no deterministic output-sensitive algorithm for the planar convex hull and maxima problems can obtain both optimal time and I/O complexity, where the optimality is defined with respect to both the input and output sizes.","weakest_assumption":"The lower bound holds in the standard external-memory model where time and I/O complexities are measured separately and optimality is defined with respect to input size n and output size h."}},"verdict_id":"278d871b-3bc3-4964-af56-19040685a1ee"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:58d954e490c06aed8e972bce24b6cd292f0fbc7142386aa120c2f213de31a4eb","target":"record","created_at":"2026-05-21T01:05:20Z","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":"9eae949c7d2787399405ad916240383868c1125de3f56e04f2caeecb76cc9174","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T10:31:45Z","title_canon_sha256":"ebb284da50cfa1175724401da82000f917e313d04b62d3cb5fb11e8a148bb036"},"schema_version":"1.0","source":{"id":"2605.09464","kind":"arxiv","version":2}},"canonical_sha256":"9a8f54c74b33950bdf6b29cca002aa4a8f8bb81211f03ff2e289e0bfd45befd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a8f54c74b33950bdf6b29cca002aa4a8f8bb81211f03ff2e289e0bfd45befd1","first_computed_at":"2026-05-21T01:05:20.806715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:20.806715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDtubFlRFMUGiB+MMp+sKLWijoGVDxToHvPD0jxJ2FGv2Thm8NCmnxK42KV2NNPGVOUWp9wHjzenJ5qlSdfvDA==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:20.807287Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.09464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58d954e490c06aed8e972bce24b6cd292f0fbc7142386aa120c2f213de31a4eb","sha256:9c4495d4a976fd5b6f1693f7815d5429d0670f13dde01d02ee5d0b5ec6468b81"],"state_sha256":"2949f3979ee59918e27849c678b5e383ab03ffc8d6e047630508cfc93864349a"}