{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IJNOHS46NJGVB74J3TFXHO2SVS","short_pith_number":"pith:IJNOHS46","canonical_record":{"source":{"id":"1810.05303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-12T01:05:11Z","cross_cats_sorted":[],"title_canon_sha256":"ef096c9b34f4765b8bdaac871086468b87668558ffb4e2ed5655dfcd1ea885ca","abstract_canon_sha256":"08564ba9a963b0dec5013b486599229fb71ba8c8736ad1f099c0883b52d86c09"},"schema_version":"1.0"},"canonical_sha256":"425ae3cb9e6a4d50ff89dccb73bb52aca26cfb4e9059b8b9c09fb28a3c74de41","source":{"kind":"arxiv","id":"1810.05303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05303","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05303v1","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05303","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"IJNOHS46NJGV","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IJNOHS46NJGVB74J","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IJNOHS46","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IJNOHS46NJGVB74J3TFXHO2SVS","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-12T01:05:11Z","cross_cats_sorted":[],"title_canon_sha256":"ef096c9b34f4765b8bdaac871086468b87668558ffb4e2ed5655dfcd1ea885ca","abstract_canon_sha256":"08564ba9a963b0dec5013b486599229fb71ba8c8736ad1f099c0883b52d86c09"},"schema_version":"1.0"},"canonical_sha256":"425ae3cb9e6a4d50ff89dccb73bb52aca26cfb4e9059b8b9c09fb28a3c74de41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:31.065019Z","signature_b64":"UFCOqMc8kKTxLMmMrIITntc8DBlQUePC+Vw0ayFZIIe/TpCIv2N0PhQF1zc0aLvFBZaWDKMcuMWFBU1/RcpIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"425ae3cb9e6a4d50ff89dccb73bb52aca26cfb4e9059b8b9c09fb28a3c74de41","last_reissued_at":"2026-05-18T00:03:31.064491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:31.064491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05303","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:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7OlexJ7kW/KVPAmKmhGBdfTuBlezG6i4iZYEEtGLoSb9os39iyialT85+A4adjGdaH3qtxX6JEGXd8cZFWwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:20:10.336423Z"},"content_sha256":"b33761f937be973f965e52fbab894e6ae87c4a9786d8ed13fba0d62e09b98171","schema_version":"1.0","event_id":"sha256:b33761f937be973f965e52fbab894e6ae87c4a9786d8ed13fba0d62e09b98171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IJNOHS46NJGVB74J3TFXHO2SVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallelism in Randomized Incremental Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Julian Shun, Yan Gu, Yihan Sun","submitted_at":"2018-10-12T01:05:11Z","abstract_excerpt":"In this paper we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems including Delaunay triangulation, linear programming, closest pair, smallest enclosing disk, least-element lists, and strongly connected components.\n  We analyze the dependences between iterations in an algorithm, and show that the dependence structure is shallow with high probability, or that by violating some dependences the structure is shallow and the work is not increased significantly. We identify three types of algorithms based on their dependenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05303","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:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HteHAuiF/7rjo+K/c5PDMvR8mTZ+NhnMwE6zS5g8BwUaZUTX3dCAvIWv5Oja8L3o23DncefHQ8HSKflzy1qfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:20:10.336762Z"},"content_sha256":"a46543ab38bf4658c8d9695933b95d350d92fde99184b3d9291cd91e00ba6c7c","schema_version":"1.0","event_id":"sha256:a46543ab38bf4658c8d9695933b95d350d92fde99184b3d9291cd91e00ba6c7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJNOHS46NJGVB74J3TFXHO2SVS/bundle.json","state_url":"https://pith.science/pith/IJNOHS46NJGVB74J3TFXHO2SVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJNOHS46NJGVB74J3TFXHO2SVS/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-01T16:20:10Z","links":{"resolver":"https://pith.science/pith/IJNOHS46NJGVB74J3TFXHO2SVS","bundle":"https://pith.science/pith/IJNOHS46NJGVB74J3TFXHO2SVS/bundle.json","state":"https://pith.science/pith/IJNOHS46NJGVB74J3TFXHO2SVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJNOHS46NJGVB74J3TFXHO2SVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IJNOHS46NJGVB74J3TFXHO2SVS","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":"08564ba9a963b0dec5013b486599229fb71ba8c8736ad1f099c0883b52d86c09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-12T01:05:11Z","title_canon_sha256":"ef096c9b34f4765b8bdaac871086468b87668558ffb4e2ed5655dfcd1ea885ca"},"schema_version":"1.0","source":{"id":"1810.05303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05303","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05303v1","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05303","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"IJNOHS46NJGV","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IJNOHS46NJGVB74J","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IJNOHS46","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:a46543ab38bf4658c8d9695933b95d350d92fde99184b3d9291cd91e00ba6c7c","target":"graph","created_at":"2026-05-18T00:03:31Z","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":"In this paper we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems including Delaunay triangulation, linear programming, closest pair, smallest enclosing disk, least-element lists, and strongly connected components.\n  We analyze the dependences between iterations in an algorithm, and show that the dependence structure is shallow with high probability, or that by violating some dependences the structure is shallow and the work is not increased significantly. We identify three types of algorithms based on their dependenc","authors_text":"Guy E. Blelloch, Julian Shun, Yan Gu, Yihan Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-12T01:05:11Z","title":"Parallelism in Randomized Incremental Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05303","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:b33761f937be973f965e52fbab894e6ae87c4a9786d8ed13fba0d62e09b98171","target":"record","created_at":"2026-05-18T00:03:31Z","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":"08564ba9a963b0dec5013b486599229fb71ba8c8736ad1f099c0883b52d86c09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-12T01:05:11Z","title_canon_sha256":"ef096c9b34f4765b8bdaac871086468b87668558ffb4e2ed5655dfcd1ea885ca"},"schema_version":"1.0","source":{"id":"1810.05303","kind":"arxiv","version":1}},"canonical_sha256":"425ae3cb9e6a4d50ff89dccb73bb52aca26cfb4e9059b8b9c09fb28a3c74de41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"425ae3cb9e6a4d50ff89dccb73bb52aca26cfb4e9059b8b9c09fb28a3c74de41","first_computed_at":"2026-05-18T00:03:31.064491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:31.064491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFCOqMc8kKTxLMmMrIITntc8DBlQUePC+Vw0ayFZIIe/TpCIv2N0PhQF1zc0aLvFBZaWDKMcuMWFBU1/RcpIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:31.065019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b33761f937be973f965e52fbab894e6ae87c4a9786d8ed13fba0d62e09b98171","sha256:a46543ab38bf4658c8d9695933b95d350d92fde99184b3d9291cd91e00ba6c7c"],"state_sha256":"057247c2f8c1fe8ff2e034b7e877e88e0fcdee99e6846e0e18d6e15159e7cf0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pY2E0m/uiNryXAVwlbJbNeaRGRktCu24FSc/uKFAU3dZ/X6LUe4bt+fVZV8Z+wtUDshZhI4hVIKHFiS5kmOTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:20:10.338697Z","bundle_sha256":"053b31e15959806fe0b6012f2dc20378ef15f911fe084f26de302090e18bf9e7"}}