{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5XG3K7O4XT5BDLXU3NKXHYI3EJ","short_pith_number":"pith:5XG3K7O4","canonical_record":{"source":{"id":"1707.05124","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:49:20Z","cross_cats_sorted":[],"title_canon_sha256":"679d5fb64ddba0356981766ca382b472cf68096047762993171b355c4db5f6de","abstract_canon_sha256":"92f1722dfb7038c767c50013e504bc83c31f1a4b98534ffe1acd7aec599acfe7"},"schema_version":"1.0"},"canonical_sha256":"edcdb57ddcbcfa11aef4db5573e11b2248ab9120282d304724a54f66abd43671","source":{"kind":"arxiv","id":"1707.05124","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05124","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05124v3","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05124","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"5XG3K7O4XT5B","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XG3K7O4XT5BDLXU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XG3K7O4","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5XG3K7O4XT5BDLXU3NKXHYI3EJ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05124","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:49:20Z","cross_cats_sorted":[],"title_canon_sha256":"679d5fb64ddba0356981766ca382b472cf68096047762993171b355c4db5f6de","abstract_canon_sha256":"92f1722dfb7038c767c50013e504bc83c31f1a4b98534ffe1acd7aec599acfe7"},"schema_version":"1.0"},"canonical_sha256":"edcdb57ddcbcfa11aef4db5573e11b2248ab9120282d304724a54f66abd43671","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:04.545048Z","signature_b64":"mxAqYkvDlrxWGvhDyWMzPcu7kq3sWQ+H7mc2yp24jUgs/c1gSSGeCpNvdAjhSJL8OpsumUjDFPJVFP04iIbYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edcdb57ddcbcfa11aef4db5573e11b2248ab9120282d304724a54f66abd43671","last_reissued_at":"2026-05-17T23:46:04.544445Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:04.544445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05124","source_version":3,"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-17T23:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRcHk2xwwfC80e/U24t+vh2MaHWQoSL5TaEhH7unvYt6vFRuCGCKpDg6uOertBj2f9C/rDjflf0cYY62KjbnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:49:29.815100Z"},"content_sha256":"a176207f38b3850d63050dd32e9e8d7d531a8931908d63a71b79b2e374f88382","schema_version":"1.0","event_id":"sha256:a176207f38b3850d63050dd32e9e8d7d531a8931908d63a71b79b2e374f88382"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5XG3K7O4XT5BDLXU3NKXHYI3EJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Analysis of Randomized Greedy MIS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Noever, Manuela Fischer","submitted_at":"2017-07-17T12:49:20Z","abstract_excerpt":"We provide a tight analysis which settles the round complexity of the well-studied parallel randomized greedy MIS algorithm, thus answering the main open question of Blelloch, Fineman, and Shun [SPAA'12].\n  The parallel/distributed randomized greedy Maximal Independent Set (MIS) algorithm works as follows. An order of the vertices is chosen uniformly at random. Then, in each round, all vertices that appear before their neighbors in the order are added to the independent set and removed from the graph along with their neighbors. The main question of interest is the number of rounds it takes unt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05124","kind":"arxiv","version":3},"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-17T23:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbXm+beMEee7zuSzFOQxWyiMggBY6DJn8oGN/4QojGSSBdZDZgflKDQPq4Lhmb8lrxiT6FcENSK1k27PrvI9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:49:29.815458Z"},"content_sha256":"df27e419ced1157b05bbc37741d5a44d95220a32cc26b8a87fa8d8102929ed8d","schema_version":"1.0","event_id":"sha256:df27e419ced1157b05bbc37741d5a44d95220a32cc26b8a87fa8d8102929ed8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XG3K7O4XT5BDLXU3NKXHYI3EJ/bundle.json","state_url":"https://pith.science/pith/5XG3K7O4XT5BDLXU3NKXHYI3EJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XG3K7O4XT5BDLXU3NKXHYI3EJ/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-03T18:49:29Z","links":{"resolver":"https://pith.science/pith/5XG3K7O4XT5BDLXU3NKXHYI3EJ","bundle":"https://pith.science/pith/5XG3K7O4XT5BDLXU3NKXHYI3EJ/bundle.json","state":"https://pith.science/pith/5XG3K7O4XT5BDLXU3NKXHYI3EJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XG3K7O4XT5BDLXU3NKXHYI3EJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5XG3K7O4XT5BDLXU3NKXHYI3EJ","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":"92f1722dfb7038c767c50013e504bc83c31f1a4b98534ffe1acd7aec599acfe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:49:20Z","title_canon_sha256":"679d5fb64ddba0356981766ca382b472cf68096047762993171b355c4db5f6de"},"schema_version":"1.0","source":{"id":"1707.05124","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05124","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05124v3","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05124","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"5XG3K7O4XT5B","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XG3K7O4XT5BDLXU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XG3K7O4","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:df27e419ced1157b05bbc37741d5a44d95220a32cc26b8a87fa8d8102929ed8d","target":"graph","created_at":"2026-05-17T23:46:04Z","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":"We provide a tight analysis which settles the round complexity of the well-studied parallel randomized greedy MIS algorithm, thus answering the main open question of Blelloch, Fineman, and Shun [SPAA'12].\n  The parallel/distributed randomized greedy Maximal Independent Set (MIS) algorithm works as follows. An order of the vertices is chosen uniformly at random. Then, in each round, all vertices that appear before their neighbors in the order are added to the independent set and removed from the graph along with their neighbors. The main question of interest is the number of rounds it takes unt","authors_text":"Andreas Noever, Manuela Fischer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:49:20Z","title":"Tight Analysis of Randomized Greedy MIS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05124","kind":"arxiv","version":3},"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:a176207f38b3850d63050dd32e9e8d7d531a8931908d63a71b79b2e374f88382","target":"record","created_at":"2026-05-17T23:46:04Z","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":"92f1722dfb7038c767c50013e504bc83c31f1a4b98534ffe1acd7aec599acfe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T12:49:20Z","title_canon_sha256":"679d5fb64ddba0356981766ca382b472cf68096047762993171b355c4db5f6de"},"schema_version":"1.0","source":{"id":"1707.05124","kind":"arxiv","version":3}},"canonical_sha256":"edcdb57ddcbcfa11aef4db5573e11b2248ab9120282d304724a54f66abd43671","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edcdb57ddcbcfa11aef4db5573e11b2248ab9120282d304724a54f66abd43671","first_computed_at":"2026-05-17T23:46:04.544445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:04.544445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mxAqYkvDlrxWGvhDyWMzPcu7kq3sWQ+H7mc2yp24jUgs/c1gSSGeCpNvdAjhSJL8OpsumUjDFPJVFP04iIbYDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:04.545048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05124","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a176207f38b3850d63050dd32e9e8d7d531a8931908d63a71b79b2e374f88382","sha256:df27e419ced1157b05bbc37741d5a44d95220a32cc26b8a87fa8d8102929ed8d"],"state_sha256":"c0197969050b957976937616ef716e3c18de14357c20676f71194abb94b8ff60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgIh91vSIaNfysx3kKYfc3AZ8ztsfZ0CtIubYiqt4IknkUh4FvF4uGbMs563eQ8qwiVnUz9rSWtQT7DOCRRPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:49:29.817342Z","bundle_sha256":"f399482b4e786cdb749db3a13722e1d2b1a8f97a2e27c545569123aaa4da2f72"}}