{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XKV7LH5W4QSJM2ZM6U5SG4FYEX","short_pith_number":"pith:XKV7LH5W","schema_version":"1.0","canonical_sha256":"baabf59fb6e424966b2cf53b2370b825f4079c633ff3d04e3bf2ac5dfae3b52a","source":{"kind":"arxiv","id":"2305.10389","version":2},"attestation_state":"computed","paper":{"title":"Cache-Oblivious Parallel Convex Hull in the Binary Forking Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Reilly Browne, Rezaul Chowdhury, Shih-Yu Tsai, Yimin Zhu","submitted_at":"2023-05-17T17:29:16Z","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"},"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":"2305.10389","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-17T17:29:16Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"53581b2d25f306047cab53731fbb275874c1b2fbfd361a00c1dc7d7820dea978","abstract_canon_sha256":"36446b3c86cb0eea8782dc537a2bf75716ba0438ad06b000648795ad83a9d26b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:11.330810Z","signature_b64":"MhFMXDnDHTAUgk1k3HlqoRxDeVwR5ZI4jsYYoGD+CqU367DHI81TIMFh/amavyjspsZMNZC/9kZaKf3KN9n/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baabf59fb6e424966b2cf53b2370b825f4079c633ff3d04e3bf2ac5dfae3b52a","last_reissued_at":"2026-07-05T06:31:11.330364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:11.330364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-Oblivious Parallel Convex Hull in the Binary Forking Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Reilly Browne, Rezaul Chowdhury, Shih-Yu Tsai, Yimin Zhu","submitted_at":"2023-05-17T17:29:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10389","kind":"arxiv","version":2},"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/2305.10389/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.10389","created_at":"2026-07-05T06:31:11.330423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.10389v2","created_at":"2026-07-05T06:31:11.330423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10389","created_at":"2026-07-05T06:31:11.330423+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKV7LH5W4QSJ","created_at":"2026-07-05T06:31:11.330423+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKV7LH5W4QSJM2ZM","created_at":"2026-07-05T06:31:11.330423+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKV7LH5W","created_at":"2026-07-05T06:31:11.330423+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/XKV7LH5W4QSJM2ZM6U5SG4FYEX","json":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX.json","graph_json":"https://pith.science/api/pith-number/XKV7LH5W4QSJM2ZM6U5SG4FYEX/graph.json","events_json":"https://pith.science/api/pith-number/XKV7LH5W4QSJM2ZM6U5SG4FYEX/events.json","paper":"https://pith.science/paper/XKV7LH5W"},"agent_actions":{"view_html":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX","download_json":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX.json","view_paper":"https://pith.science/paper/XKV7LH5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.10389&json=true","fetch_graph":"https://pith.science/api/pith-number/XKV7LH5W4QSJM2ZM6U5SG4FYEX/graph.json","fetch_events":"https://pith.science/api/pith-number/XKV7LH5W4QSJM2ZM6U5SG4FYEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX/action/storage_attestation","attest_author":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX/action/author_attestation","sign_citation":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX/action/citation_signature","submit_replication":"https://pith.science/pith/XKV7LH5W4QSJM2ZM6U5SG4FYEX/action/replication_record"}},"created_at":"2026-07-05T06:31:11.330423+00:00","updated_at":"2026-07-05T06:31:11.330423+00:00"}