{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6Z64B57BZ6YFTBN4MXGYO47WDE","short_pith_number":"pith:6Z64B57B","canonical_record":{"source":{"id":"1702.03008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-09T22:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"f093c33e471c591a0d955b09e4b15129de0186bf0f4687546a6c0cbb172cd07a","abstract_canon_sha256":"cd8660b14c0edf350f875bff3574c2ab9427674cd4d317b3d62d4ff6414a2edd"},"schema_version":"1.0"},"canonical_sha256":"f67dc0f7e1cfb05985bc65cd8773f6190e09ee588ae5981c7f140ba4e6c9dadb","source":{"kind":"arxiv","id":"1702.03008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03008","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03008v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03008","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"6Z64B57BZ6YF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6Z64B57BZ6YFTBN4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6Z64B57B","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6Z64B57BZ6YFTBN4MXGYO47WDE","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-09T22:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"f093c33e471c591a0d955b09e4b15129de0186bf0f4687546a6c0cbb172cd07a","abstract_canon_sha256":"cd8660b14c0edf350f875bff3574c2ab9427674cd4d317b3d62d4ff6414a2edd"},"schema_version":"1.0"},"canonical_sha256":"f67dc0f7e1cfb05985bc65cd8773f6190e09ee588ae5981c7f140ba4e6c9dadb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:58.873877Z","signature_b64":"AfZZlUeUA1SyQgwOm303wSKUU/JeLVD+Qf98o0hjGZd0E3ZXh+Z3tAK8as3R+A76cR1ywQfDolHcEEOI/dhXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67dc0f7e1cfb05985bc65cd8773f6190e09ee588ae5981c7f140ba4e6c9dadb","last_reissued_at":"2026-05-18T00:50:58.873442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:58.873442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03008","source_version":1,"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-18T00:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSt+FNCzdKFeeOnFS/P34VGVh7pDrw3ibbLPJjmtEt9+8wBspMhFFygpzlZoKJUVDVp5iluLHWBsZtzdzUGpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:18:11.195273Z"},"content_sha256":"6f2c273028d7f9ba40f63210e420882d514c63a4c423c1e5b42914efa6343393","schema_version":"1.0","event_id":"sha256:6f2c273028d7f9ba40f63210e420882d514c63a4c423c1e5b42914efa6343393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6Z64B57BZ6YFTBN4MXGYO47WDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finer-grained Locking in Concurrent Dynamic Planar Convex Hulls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"James Smith, K. Alex Mills","submitted_at":"2017-02-09T22:51:07Z","abstract_excerpt":"The convex hull of a planar point set is the smallest convex polygon containing each point in the set. The dynamic convex hull problem concerns efficiently maintaining the convex hull of a set of points subject to additions and removals. One algorithm for this problem uses two external balanced binary search trees (BSTs) (M. H. Overmars, J. van Leeuwen 1981). We present the first concurrent solution for this problem, which uses a single BST that stores references to intermediate convex hull solutions at each node. We implement and evaluate two lock-based approaches: a) fine-grained locking, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03008","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsmpJl41rozBZ5Nr5mASHyCk5CND0wlfLAGpzb4x9Ffz5d8b6nNgGfMcCrhaJhW/IPDl7d0H0ijgTrJ08RkjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:18:11.196028Z"},"content_sha256":"7ef217613331944fa5668c9befad45463b2b0026371d128f5f4f56d044d5bdca","schema_version":"1.0","event_id":"sha256:7ef217613331944fa5668c9befad45463b2b0026371d128f5f4f56d044d5bdca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z64B57BZ6YFTBN4MXGYO47WDE/bundle.json","state_url":"https://pith.science/pith/6Z64B57BZ6YFTBN4MXGYO47WDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z64B57BZ6YFTBN4MXGYO47WDE/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-10T11:18:11Z","links":{"resolver":"https://pith.science/pith/6Z64B57BZ6YFTBN4MXGYO47WDE","bundle":"https://pith.science/pith/6Z64B57BZ6YFTBN4MXGYO47WDE/bundle.json","state":"https://pith.science/pith/6Z64B57BZ6YFTBN4MXGYO47WDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z64B57BZ6YFTBN4MXGYO47WDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6Z64B57BZ6YFTBN4MXGYO47WDE","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":"cd8660b14c0edf350f875bff3574c2ab9427674cd4d317b3d62d4ff6414a2edd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-09T22:51:07Z","title_canon_sha256":"f093c33e471c591a0d955b09e4b15129de0186bf0f4687546a6c0cbb172cd07a"},"schema_version":"1.0","source":{"id":"1702.03008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03008","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03008v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03008","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"6Z64B57BZ6YF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6Z64B57BZ6YFTBN4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6Z64B57B","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:7ef217613331944fa5668c9befad45463b2b0026371d128f5f4f56d044d5bdca","target":"graph","created_at":"2026-05-18T00:50:58Z","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"},"paper":{"abstract_excerpt":"The convex hull of a planar point set is the smallest convex polygon containing each point in the set. The dynamic convex hull problem concerns efficiently maintaining the convex hull of a set of points subject to additions and removals. One algorithm for this problem uses two external balanced binary search trees (BSTs) (M. H. Overmars, J. van Leeuwen 1981). We present the first concurrent solution for this problem, which uses a single BST that stores references to intermediate convex hull solutions at each node. We implement and evaluate two lock-based approaches: a) fine-grained locking, wh","authors_text":"James Smith, K. Alex Mills","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-09T22:51:07Z","title":"Finer-grained Locking in Concurrent Dynamic Planar Convex Hulls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03008","kind":"arxiv","version":1},"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:6f2c273028d7f9ba40f63210e420882d514c63a4c423c1e5b42914efa6343393","target":"record","created_at":"2026-05-18T00:50:58Z","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":"cd8660b14c0edf350f875bff3574c2ab9427674cd4d317b3d62d4ff6414a2edd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-09T22:51:07Z","title_canon_sha256":"f093c33e471c591a0d955b09e4b15129de0186bf0f4687546a6c0cbb172cd07a"},"schema_version":"1.0","source":{"id":"1702.03008","kind":"arxiv","version":1}},"canonical_sha256":"f67dc0f7e1cfb05985bc65cd8773f6190e09ee588ae5981c7f140ba4e6c9dadb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f67dc0f7e1cfb05985bc65cd8773f6190e09ee588ae5981c7f140ba4e6c9dadb","first_computed_at":"2026-05-18T00:50:58.873442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:58.873442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AfZZlUeUA1SyQgwOm303wSKUU/JeLVD+Qf98o0hjGZd0E3ZXh+Z3tAK8as3R+A76cR1ywQfDolHcEEOI/dhXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:58.873877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f2c273028d7f9ba40f63210e420882d514c63a4c423c1e5b42914efa6343393","sha256:7ef217613331944fa5668c9befad45463b2b0026371d128f5f4f56d044d5bdca"],"state_sha256":"c6bbe11176fd0e5c65d77667d4a92e3a4722cb7eec116a453841c2be223f5a81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epQWc2KGaJJ2XwpIfd9Q2grHmf8MCAB5OsBF6IzwfOBwsjqS5EZLPDoj85II7dpH0Uz5bHzWl84Lo/lwY9q4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:18:11.200152Z","bundle_sha256":"203529d506f73578cfee1df96cd1bb8827bee2c040c88fec24a32f87e4810df1"}}