{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TKHVJR2LGOKQXX3LFHGKAAVKJK","short_pith_number":"pith:TKHVJR2L","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"},"canonical_sha256":"9a8f54c74b33950bdf6b29cca002aa4a8f8bb81211f03ff2e289e0bfd45befd1","source":{"kind":"arxiv","id":"2605.09464","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TKHVJR2LGOKQXX3LFHGKAAVKJK","target":"record","payload":{"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"},"canonical_sha256":"9a8f54c74b33950bdf6b29cca002aa4a8f8bb81211f03ff2e289e0bfd45befd1","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"},"source_kind":"arxiv","source_id":"2605.09464","source_version":2,"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-21T01:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2sarR9+7zP8W6AuC8Xz+eQbXyAshSnNS+4kHeMQpCoHmQvyuj7+66Tm1Ql5g7uo1bCW27gS/Af6n88tKWGzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:50:33.615606Z"},"content_sha256":"58d954e490c06aed8e972bce24b6cd292f0fbc7142386aa120c2f213de31a4eb","schema_version":"1.0","event_id":"sha256:58d954e490c06aed8e972bce24b6cd292f0fbc7142386aa120c2f213de31a4eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TKHVJR2LGOKQXX3LFHGKAAVKJK","target":"graph","payload":{"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"},"verdict_id":"278d871b-3bc3-4964-af56-19040685a1ee"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbPoC4H7ruzNyenm39Wov/t6B0QfJZ0eRUGpWVjxoYIb+qd3fWismnJmer7LSWAjvGujySskMOInFSK0qyTtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:50:33.616124Z"},"content_sha256":"9c4495d4a976fd5b6f1693f7815d5429d0670f13dde01d02ee5d0b5ec6468b81","schema_version":"1.0","event_id":"sha256:9c4495d4a976fd5b6f1693f7815d5429d0670f13dde01d02ee5d0b5ec6468b81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/bundle.json","state_url":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/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-06-03T03:50:33Z","links":{"resolver":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK","bundle":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/bundle.json","state":"https://pith.science/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKHVJR2LGOKQXX3LFHGKAAVKJK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBfXGM5SFktCyt/NL2bdOGU0XQvr4tA7waFb1L6PnGNoXl+tD3t6gzPuTcmZ1Pj69l7mYRFf5kaIkTNGwl6PAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:50:33.618492Z","bundle_sha256":"11e93e36bed62562c57ee75929bf004e13ef989e73bcad6cfa653156a2ee9953"}}