{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XKV7LH5W4QSJM2ZM6U5SG4FYEX","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":"36446b3c86cb0eea8782dc537a2bf75716ba0438ad06b000648795ad83a9d26b","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-17T17:29:16Z","title_canon_sha256":"53581b2d25f306047cab53731fbb275874c1b2fbfd361a00c1dc7d7820dea978"},"schema_version":"1.0","source":{"id":"2305.10389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.10389","created_at":"2026-07-05T06:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"2305.10389v2","created_at":"2026-07-05T06:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10389","created_at":"2026-07-05T06:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"XKV7LH5W4QSJ","created_at":"2026-07-05T06:31:11Z"},{"alias_kind":"pith_short_16","alias_value":"XKV7LH5W4QSJM2ZM","created_at":"2026-07-05T06:31:11Z"},{"alias_kind":"pith_short_8","alias_value":"XKV7LH5W","created_at":"2026-07-05T06:31:11Z"}],"graph_snapshots":[{"event_id":"sha256:ffdba0753350a4e261fe37eb2e2aecff6d04fc7603c0a9a899098576adbe794e","target":"graph","created_at":"2026-07-05T06:31:11Z","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/2305.10389/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present two cache-oblivious sorting-based convex hull algorithms in the Binary Forking Model. The first is an algorithm for a presorted set of points which achieves $O(n)$ work, $O(\\log n)$ span, and $O(n/B)$ serial cache complexity, where $B$ is the cache line size. These are all optimal worst-case bounds for cache-oblivious algorithms in the Binary Forking Model. The second adapts Cole and Ramachandran's cache-oblivious sorting algorithm, matching its properties including achieving $O(n \\log n)$ work, $O(\\log n \\log \\log n)$ span, and $O(n/B \\log_M n)$ serial cache complexity. Here $M$ is","authors_text":"Reilly Browne, Rezaul Chowdhury, Shih-Yu Tsai, Yimin Zhu","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-17T17:29:16Z","title":"Cache-Oblivious Parallel Convex Hull in the Binary Forking Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10389","kind":"arxiv","version":2},"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:e7a47ebec964f064ca13fe560ff15373cb7afa241a3f2700ffc94952536926d0","target":"record","created_at":"2026-07-05T06:31:11Z","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":"36446b3c86cb0eea8782dc537a2bf75716ba0438ad06b000648795ad83a9d26b","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-17T17:29:16Z","title_canon_sha256":"53581b2d25f306047cab53731fbb275874c1b2fbfd361a00c1dc7d7820dea978"},"schema_version":"1.0","source":{"id":"2305.10389","kind":"arxiv","version":2}},"canonical_sha256":"baabf59fb6e424966b2cf53b2370b825f4079c633ff3d04e3bf2ac5dfae3b52a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baabf59fb6e424966b2cf53b2370b825f4079c633ff3d04e3bf2ac5dfae3b52a","first_computed_at":"2026-07-05T06:31:11.330364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:11.330364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MhFMXDnDHTAUgk1k3HlqoRxDeVwR5ZI4jsYYoGD+CqU367DHI81TIMFh/amavyjspsZMNZC/9kZaKf3KN9n/BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:11.330810Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.10389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7a47ebec964f064ca13fe560ff15373cb7afa241a3f2700ffc94952536926d0","sha256:ffdba0753350a4e261fe37eb2e2aecff6d04fc7603c0a9a899098576adbe794e"],"state_sha256":"54458fd0dd09905822a11f1bc7a62e1c18c1dd7bf0fd4b2e1054a13874082356"}