{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RHF7SWL3SOMRMCJ5WXQPB6JWDD","short_pith_number":"pith:RHF7SWL3","canonical_record":{"source":{"id":"1810.00455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-30T19:36:23Z","cross_cats_sorted":[],"title_canon_sha256":"9ca8c9543b7d6972a8b2b8df23a56adf3288f8213864c032d33fb672e1bb23a8","abstract_canon_sha256":"de32ba02e9910c06f718662867dd634898289b6fff5bf18c105a95cb99c4050c"},"schema_version":"1.0"},"canonical_sha256":"89cbf9597b939916093db5e0f0f93618f3e546ed0e796e7047c6fd56dbf58448","source":{"kind":"arxiv","id":"1810.00455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00455","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00455v1","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00455","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"RHF7SWL3SOMR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RHF7SWL3SOMRMCJ5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RHF7SWL3","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RHF7SWL3SOMRMCJ5WXQPB6JWDD","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-30T19:36:23Z","cross_cats_sorted":[],"title_canon_sha256":"9ca8c9543b7d6972a8b2b8df23a56adf3288f8213864c032d33fb672e1bb23a8","abstract_canon_sha256":"de32ba02e9910c06f718662867dd634898289b6fff5bf18c105a95cb99c4050c"},"schema_version":"1.0"},"canonical_sha256":"89cbf9597b939916093db5e0f0f93618f3e546ed0e796e7047c6fd56dbf58448","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:27.827681Z","signature_b64":"IHW1xDgW+vQICyJiDH0OJTqMN7TEqMZHpbbi0HxgKUdNqwxBH9zKoKItMZztKJ2iwuE3Voyjd4+pDQe7ycUmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89cbf9597b939916093db5e0f0f93618f3e546ed0e796e7047c6fd56dbf58448","last_reissued_at":"2026-05-18T00:04:27.827212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:27.827212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00455","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:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Af8YgYm0A8Ly6kSAlqNJllIHU9276p1YHg5hGVWG7z7oLPye4vZlwe5XaTeuABXakXdkWKVpCuwfTTnb3UEZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:42:08.679359Z"},"content_sha256":"b742a2fe2469f2282beb1ad957e664e746681277a284bb14f68f4beab47497df","schema_version":"1.0","event_id":"sha256:b742a2fe2469f2282beb1ad957e664e746681277a284bb14f68f4beab47497df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RHF7SWL3SOMRMCJ5WXQPB6JWDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Algorithms for Planar Convex Hulls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Martin Farach-Colton, Meng Li, Meng-Tsung Tsai","submitted_at":"2018-09-30T19:36:23Z","abstract_excerpt":"Many classical algorithms are known for computing the convex hull of a set of $n$ point in $\\mathbb{R}^2$ using $O(n)$ space. For large point sets, whose size exceeds the size of the working space, these algorithms cannot be directly used. The current best streaming algorithm for computing the convex hull is computationally expensive, because it needs to solve a set of linear programs. In this paper, we propose simpler and faster streaming and W-stream algorithms for computing the convex hull. Our streaming algorithm has small pass complexity, which is roughly a square root of the current best"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00455","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:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UppE7pe5wbUKug6FxWKYsU/GGcsrxPhzRKjSvXprkomQAuijHU2z+r37Oc9CDKlp58cgC2X2ODMsJngwOOIpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:42:08.679717Z"},"content_sha256":"87973cfc3b774ed4839023cd77a33e901724fbaae138bb1ef971afea25678950","schema_version":"1.0","event_id":"sha256:87973cfc3b774ed4839023cd77a33e901724fbaae138bb1ef971afea25678950"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHF7SWL3SOMRMCJ5WXQPB6JWDD/bundle.json","state_url":"https://pith.science/pith/RHF7SWL3SOMRMCJ5WXQPB6JWDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHF7SWL3SOMRMCJ5WXQPB6JWDD/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-05-30T07:42:08Z","links":{"resolver":"https://pith.science/pith/RHF7SWL3SOMRMCJ5WXQPB6JWDD","bundle":"https://pith.science/pith/RHF7SWL3SOMRMCJ5WXQPB6JWDD/bundle.json","state":"https://pith.science/pith/RHF7SWL3SOMRMCJ5WXQPB6JWDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHF7SWL3SOMRMCJ5WXQPB6JWDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RHF7SWL3SOMRMCJ5WXQPB6JWDD","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":"de32ba02e9910c06f718662867dd634898289b6fff5bf18c105a95cb99c4050c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-30T19:36:23Z","title_canon_sha256":"9ca8c9543b7d6972a8b2b8df23a56adf3288f8213864c032d33fb672e1bb23a8"},"schema_version":"1.0","source":{"id":"1810.00455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00455","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00455v1","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00455","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"RHF7SWL3SOMR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RHF7SWL3SOMRMCJ5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RHF7SWL3","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:87973cfc3b774ed4839023cd77a33e901724fbaae138bb1ef971afea25678950","target":"graph","created_at":"2026-05-18T00:04:27Z","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":"Many classical algorithms are known for computing the convex hull of a set of $n$ point in $\\mathbb{R}^2$ using $O(n)$ space. For large point sets, whose size exceeds the size of the working space, these algorithms cannot be directly used. The current best streaming algorithm for computing the convex hull is computationally expensive, because it needs to solve a set of linear programs. In this paper, we propose simpler and faster streaming and W-stream algorithms for computing the convex hull. Our streaming algorithm has small pass complexity, which is roughly a square root of the current best","authors_text":"Martin Farach-Colton, Meng Li, Meng-Tsung Tsai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-30T19:36:23Z","title":"Streaming Algorithms for Planar Convex Hulls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00455","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:b742a2fe2469f2282beb1ad957e664e746681277a284bb14f68f4beab47497df","target":"record","created_at":"2026-05-18T00:04:27Z","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":"de32ba02e9910c06f718662867dd634898289b6fff5bf18c105a95cb99c4050c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-30T19:36:23Z","title_canon_sha256":"9ca8c9543b7d6972a8b2b8df23a56adf3288f8213864c032d33fb672e1bb23a8"},"schema_version":"1.0","source":{"id":"1810.00455","kind":"arxiv","version":1}},"canonical_sha256":"89cbf9597b939916093db5e0f0f93618f3e546ed0e796e7047c6fd56dbf58448","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89cbf9597b939916093db5e0f0f93618f3e546ed0e796e7047c6fd56dbf58448","first_computed_at":"2026-05-18T00:04:27.827212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:27.827212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IHW1xDgW+vQICyJiDH0OJTqMN7TEqMZHpbbi0HxgKUdNqwxBH9zKoKItMZztKJ2iwuE3Voyjd4+pDQe7ycUmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:27.827681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b742a2fe2469f2282beb1ad957e664e746681277a284bb14f68f4beab47497df","sha256:87973cfc3b774ed4839023cd77a33e901724fbaae138bb1ef971afea25678950"],"state_sha256":"1e511ab9ac730168a6afdcbfaa8e624c9ac9fa3077c79019d9bbf8677bb2da64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlcSDYZ1k7cYdwvmlvRoslZS+xlMi2hsCmhWoRRfVbytUeG7ImAAAC+F+LVo7q7Iv74XSAJh7L0Po8eeo027AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:42:08.681681Z","bundle_sha256":"1c997622791fb638c96869cbb1590fe109f55215280abace82431c60d0cdf3b0"}}