{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TKHVJR2LGOKQXX3LFHGKAAVKJK","short_pith_number":"pith:TKHVJR2L","schema_version":"1.0","canonical_sha256":"9a8f54c74b33950bdf6b29cca002aa4a8f8bb81211f03ff2e289e0bfd45befd1","source":{"kind":"arxiv","id":"2605.09464","version":2},"attestation_state":"computed","paper":{"title":"The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"No deterministic output-sensitive algorithm achieves both optimal time and optimal I/O for planar convex hull and maxima.","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Gerth St{\\o}lting Brodal, Nodari Sitchinava, Peyman Afshani","submitted_at":"2026-05-10T10:31:45Z","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"},"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":"2605.09464","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-10T10:31:45Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ebb284da50cfa1175724401da82000f917e313d04b62d3cb5fb11e8a148bb036","abstract_canon_sha256":"9eae949c7d2787399405ad916240383868c1125de3f56e04f2caeecb76cc9174"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:20.807287Z","signature_b64":"SDtubFlRFMUGiB+MMp+sKLWijoGVDxToHvPD0jxJ2FGv2Thm8NCmnxK42KV2NNPGVOUWp9wHjzenJ5qlSdfvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a8f54c74b33950bdf6b29cca002aa4a8f8bb81211f03ff2e289e0bfd45befd1","last_reissued_at":"2026-05-21T01:05:20.806715Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:20.806715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"No deterministic output-sensitive algorithm achieves both optimal time and optimal I/O for planar convex hull and maxima.","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Gerth St{\\o}lting Brodal, Nodari Sitchinava, Peyman Afshani","submitted_at":"2026-05-10T10:31:45Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"No deterministic output-sensitive algorithm for planar maxima or convex hull can simultaneously achieve optimal time and I/O complexity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"No deterministic output-sensitive algorithm achieves both optimal time and optimal I/O for planar convex hull and maxima.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"51cb7be529084b534fe032341dfedab1dba114675e6f5d8d57f048ec4756c492"},"source":{"id":"2605.09464","kind":"arxiv","version":2},"verdict":{"id":"278d871b-3bc3-4964-af56-19040685a1ee","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T04:35:02.142354Z","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.","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","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.","pith_extraction_headline":"No deterministic output-sensitive algorithm achieves both optimal time and optimal I/O for planar convex hull and maxima."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.09464/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"74f454eeddb162c018a29289af0dd7fb16f39c83ac937b4dcaa29baeaf546654"},"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":"2605.09464","created_at":"2026-05-21T01:05:20.806818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.09464v2","created_at":"2026-05-21T01:05:20.806818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09464","created_at":"2026-05-21T01:05:20.806818+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKHVJR2LGOKQ","created_at":"2026-05-21T01:05:20.806818+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKHVJR2LGOKQXX3L","created_at":"2026-05-21T01:05:20.806818+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKHVJR2L","created_at":"2026-05-21T01:05:20.806818+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/TKHVJR2LGOKQXX3LFHGKAAVKJK","json":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK.json","graph_json":"https://pith.science/api/pith-number/TKHVJR2LGOKQXX3LFHGKAAVKJK/graph.json","events_json":"https://pith.science/api/pith-number/TKHVJR2LGOKQXX3LFHGKAAVKJK/events.json","paper":"https://pith.science/paper/TKHVJR2L"},"agent_actions":{"view_html":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK","download_json":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK.json","view_paper":"https://pith.science/paper/TKHVJR2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.09464&json=true","fetch_graph":"https://pith.science/api/pith-number/TKHVJR2LGOKQXX3LFHGKAAVKJK/graph.json","fetch_events":"https://pith.science/api/pith-number/TKHVJR2LGOKQXX3LFHGKAAVKJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/action/storage_attestation","attest_author":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/action/author_attestation","sign_citation":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/action/citation_signature","submit_replication":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/action/replication_record"}},"created_at":"2026-05-21T01:05:20.806818+00:00","updated_at":"2026-05-21T01:05:20.806818+00:00"}