{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QRHEU2VE5WYGGR3LA3V54YVSVO","short_pith_number":"pith:QRHEU2VE","canonical_record":{"source":{"id":"1812.06177","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-14T21:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"4523009aa13ba772e85dc54ac0ea51487c75fac59b561e8b13374d06519810b2","abstract_canon_sha256":"a153d8d277da1a2551c6dece67622962cd52aab6fc1612008f658b4213af9188"},"schema_version":"1.0"},"canonical_sha256":"844e4a6aa4edb063476b06ebde62b2abbc62333121612eec14ec2a29c33cc357","source":{"kind":"arxiv","id":"1812.06177","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06177","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06177v5","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06177","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"QRHEU2VE5WYG","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"pith_short_16","alias_value":"QRHEU2VE5WYGGR3L","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"pith_short_8","alias_value":"QRHEU2VE","created_at":"2026-07-05T00:45:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QRHEU2VE5WYGGR3LA3V54YVSVO","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06177","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-14T21:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"4523009aa13ba772e85dc54ac0ea51487c75fac59b561e8b13374d06519810b2","abstract_canon_sha256":"a153d8d277da1a2551c6dece67622962cd52aab6fc1612008f658b4213af9188"},"schema_version":"1.0"},"canonical_sha256":"844e4a6aa4edb063476b06ebde62b2abbc62333121612eec14ec2a29c33cc357","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:03.140418Z","signature_b64":"au1hKxN9Ms/q/fGDd39yeaomdUACisZfqQvDXXAHx3G87aUh6/K51kje87DOereiL3c7ueo/MhYET2YopQ2tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"844e4a6aa4edb063476b06ebde62b2abbc62333121612eec14ec2a29c33cc357","last_reissued_at":"2026-07-05T00:45:03.140031Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:03.140031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06177","source_version":5,"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-07-05T00:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FtiJY23lpyhyuVDBf9v8c/XQxXfjWNMyhBuN8jDEqdssJisV3CAFLm/FLuhPjtddBFYTeqiTJYsJHnnSQd5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:47:31.085413Z"},"content_sha256":"c75a8f1122342e21e97ab10076457e8c066def80ec7de50b41a831a69dc0a263","schema_version":"1.0","event_id":"sha256:c75a8f1122342e21e97ab10076457e8c066def80ec7de50b41a831a69dc0a263"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QRHEU2VE5WYGGR3LA3V54YVSVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Concurrent Labeling Algorithms for Connected Components","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Robert E. Tarjan, S. Cliff Liu","submitted_at":"2018-12-14T21:40:09Z","abstract_excerpt":"We study a class of simple algorithms for concurrently computing the connected components of an $n$-vertex, $m$-edge graph. Our algorithms are easy to implement in either the COMBINING CRCW PRAM or the MPC computing model. For two related algorithms in this class, we obtain $\\Theta(\\lg n)$ step and $\\Theta(m \\lg n)$ work bounds. For two others, we obtain $O(\\lg^2 n)$ step and $O(m \\lg^2 n)$ work bounds, which are tight for one of them. All our algorithms are simpler than related algorithms in the literature. We also point out some gaps and errors in the analysis of previous algorithms. Our res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06177","kind":"arxiv","version":5},"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/1812.06177/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"},"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-07-05T00:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzTt/TXtdC9Z1JzrN+sU6BXHoiqmgMxEA3lzqC7RFK1mMBrTyjfjQ1gSU1VFzVH4mrHQrZAET9CtxII+ufQvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:47:31.086318Z"},"content_sha256":"d0a84d868e7b1eb4e8a9c32c300ff5d0722a3f0533078c773db25a9b5ce85778","schema_version":"1.0","event_id":"sha256:d0a84d868e7b1eb4e8a9c32c300ff5d0722a3f0533078c773db25a9b5ce85778"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRHEU2VE5WYGGR3LA3V54YVSVO/bundle.json","state_url":"https://pith.science/pith/QRHEU2VE5WYGGR3LA3V54YVSVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRHEU2VE5WYGGR3LA3V54YVSVO/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-08-21T18:47:31Z","links":{"resolver":"https://pith.science/pith/QRHEU2VE5WYGGR3LA3V54YVSVO","bundle":"https://pith.science/pith/QRHEU2VE5WYGGR3LA3V54YVSVO/bundle.json","state":"https://pith.science/pith/QRHEU2VE5WYGGR3LA3V54YVSVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRHEU2VE5WYGGR3LA3V54YVSVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QRHEU2VE5WYGGR3LA3V54YVSVO","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":"a153d8d277da1a2551c6dece67622962cd52aab6fc1612008f658b4213af9188","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-14T21:40:09Z","title_canon_sha256":"4523009aa13ba772e85dc54ac0ea51487c75fac59b561e8b13374d06519810b2"},"schema_version":"1.0","source":{"id":"1812.06177","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06177","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06177v5","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06177","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"QRHEU2VE5WYG","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"pith_short_16","alias_value":"QRHEU2VE5WYGGR3L","created_at":"2026-07-05T00:45:03Z"},{"alias_kind":"pith_short_8","alias_value":"QRHEU2VE","created_at":"2026-07-05T00:45:03Z"}],"graph_snapshots":[{"event_id":"sha256:d0a84d868e7b1eb4e8a9c32c300ff5d0722a3f0533078c773db25a9b5ce85778","target":"graph","created_at":"2026-07-05T00:45:03Z","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/1812.06177/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a class of simple algorithms for concurrently computing the connected components of an $n$-vertex, $m$-edge graph. Our algorithms are easy to implement in either the COMBINING CRCW PRAM or the MPC computing model. For two related algorithms in this class, we obtain $\\Theta(\\lg n)$ step and $\\Theta(m \\lg n)$ work bounds. For two others, we obtain $O(\\lg^2 n)$ step and $O(m \\lg^2 n)$ work bounds, which are tight for one of them. All our algorithms are simpler than related algorithms in the literature. We also point out some gaps and errors in the analysis of previous algorithms. Our res","authors_text":"Robert E. Tarjan, S. Cliff Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-14T21:40:09Z","title":"Simple Concurrent Labeling Algorithms for Connected Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06177","kind":"arxiv","version":5},"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:c75a8f1122342e21e97ab10076457e8c066def80ec7de50b41a831a69dc0a263","target":"record","created_at":"2026-07-05T00:45:03Z","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":"a153d8d277da1a2551c6dece67622962cd52aab6fc1612008f658b4213af9188","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-14T21:40:09Z","title_canon_sha256":"4523009aa13ba772e85dc54ac0ea51487c75fac59b561e8b13374d06519810b2"},"schema_version":"1.0","source":{"id":"1812.06177","kind":"arxiv","version":5}},"canonical_sha256":"844e4a6aa4edb063476b06ebde62b2abbc62333121612eec14ec2a29c33cc357","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"844e4a6aa4edb063476b06ebde62b2abbc62333121612eec14ec2a29c33cc357","first_computed_at":"2026-07-05T00:45:03.140031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:45:03.140031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"au1hKxN9Ms/q/fGDd39yeaomdUACisZfqQvDXXAHx3G87aUh6/K51kje87DOereiL3c7ueo/MhYET2YopQ2tCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:45:03.140418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06177","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c75a8f1122342e21e97ab10076457e8c066def80ec7de50b41a831a69dc0a263","sha256:d0a84d868e7b1eb4e8a9c32c300ff5d0722a3f0533078c773db25a9b5ce85778"],"state_sha256":"7b946e89adff61de3822e68587d3354d0fd529490c30bede27db8b074c0d1aa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+VfXUnofCoVysVG2c9a5Kuvc83hSskHUAispCcKDLMVs81V9oDl7tAv2aptIPHSThlzASxV8GntaZ4tUZsBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T18:47:31.092021Z","bundle_sha256":"e63992bfcb79a6dc52e9cca3edcf5d66374044c41820d5a4bfd02144a9a62a15"}}