{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VN7OFAWNJYVIIL4VS4UF4PSABO","short_pith_number":"pith:VN7OFAWN","canonical_record":{"source":{"id":"1802.06867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"0e859781a61515735fc9b1ff3d946db4a44d5c239660132eef68068f9766eb78","abstract_canon_sha256":"0c48f4a00488ac0d6b72445072e7b5cd212338ec0317e37d3cfeb857486c2ec0"},"schema_version":"1.0"},"canonical_sha256":"ab7ee282cd4e2a842f9597285e3e400b8c08f18be80cd6f8393385c526323cd5","source":{"kind":"arxiv","id":"1802.06867","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06867","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06867v2","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06867","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"VN7OFAWNJYVI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VN7OFAWNJYVIIL4V","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VN7OFAWN","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VN7OFAWNJYVIIL4VS4UF4PSABO","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"0e859781a61515735fc9b1ff3d946db4a44d5c239660132eef68068f9766eb78","abstract_canon_sha256":"0c48f4a00488ac0d6b72445072e7b5cd212338ec0317e37d3cfeb857486c2ec0"},"schema_version":"1.0"},"canonical_sha256":"ab7ee282cd4e2a842f9597285e3e400b8c08f18be80cd6f8393385c526323cd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.824951Z","signature_b64":"Y1RgReH058pFOpbhsDf2nz9VOc7/kSc9wzXbV2YErVCIHzZNc8a7TqBMh+4qbaUGZlj0GPraNpED7ZZxNR56AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab7ee282cd4e2a842f9597285e3e400b8c08f18be80cd6f8393385c526323cd5","last_reissued_at":"2026-05-18T00:16:07.824303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.824303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06867","source_version":2,"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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0Df59usAUeQk+ZGgHr02/ePoBiOOjkQwblSYINi13Y+1NXoSWGjKAJwmZHfaMmI3aQT1oc7Eyt4OXayy6cWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:00:04.697553Z"},"content_sha256":"f9c52da54dce7eec43d92d9f48a069dec48264182263e0ae7e45da33def2e91a","schema_version":"1.0","event_id":"sha256:f9c52da54dce7eec43d92d9f48a069dec48264182263e0ae7e45da33def2e91a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VN7OFAWNJYVIIL4VS4UF4PSABO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost logarithmic-time space optimal leader election in population protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Grzegorz Stachowiak, Leszek G\\k{a}sieniec, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-02-19T21:41:51Z","abstract_excerpt":"The model of population protocols refers to a large collection of simple indistinguishable entities, frequently called {\\em agents}. The agents communicate and perform computation through pairwise interactions. We study fast and space efficient leader election in population of cardinality $n$ governed by a random scheduler, where during each time step the scheduler uniformly at random selects for interaction exactly one pair of agents.\n  We propose the first $o(\\log^2 n)$-time leader election protocol. Our solution operates in expected parallel time $O(\\log n\\log\\log n)$ which is equivalent to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06867","kind":"arxiv","version":2},"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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98diXBsXMyeJbSqxYiOJEwZM7tQlVJj7fhlrsnUwpRk0D6Kpzp2zBpQY6nhYenHJln4vjV/Dkv/t5XNWuH9pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:00:04.698291Z"},"content_sha256":"9a84fbac6cf5d464c0de196b9f1a6e38dcde1c35c7f738a4d432ba465a316c8a","schema_version":"1.0","event_id":"sha256:9a84fbac6cf5d464c0de196b9f1a6e38dcde1c35c7f738a4d432ba465a316c8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/bundle.json","state_url":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/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-09T05:00:04Z","links":{"resolver":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO","bundle":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/bundle.json","state":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VN7OFAWNJYVIIL4VS4UF4PSABO","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":"0c48f4a00488ac0d6b72445072e7b5cd212338ec0317e37d3cfeb857486c2ec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:41:51Z","title_canon_sha256":"0e859781a61515735fc9b1ff3d946db4a44d5c239660132eef68068f9766eb78"},"schema_version":"1.0","source":{"id":"1802.06867","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06867","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06867v2","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06867","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"VN7OFAWNJYVI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VN7OFAWNJYVIIL4V","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VN7OFAWN","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:9a84fbac6cf5d464c0de196b9f1a6e38dcde1c35c7f738a4d432ba465a316c8a","target":"graph","created_at":"2026-05-18T00:16:07Z","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 model of population protocols refers to a large collection of simple indistinguishable entities, frequently called {\\em agents}. The agents communicate and perform computation through pairwise interactions. We study fast and space efficient leader election in population of cardinality $n$ governed by a random scheduler, where during each time step the scheduler uniformly at random selects for interaction exactly one pair of agents.\n  We propose the first $o(\\log^2 n)$-time leader election protocol. Our solution operates in expected parallel time $O(\\log n\\log\\log n)$ which is equivalent to","authors_text":"Grzegorz Stachowiak, Leszek G\\k{a}sieniec, Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:41:51Z","title":"Almost logarithmic-time space optimal leader election in population protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06867","kind":"arxiv","version":2},"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:f9c52da54dce7eec43d92d9f48a069dec48264182263e0ae7e45da33def2e91a","target":"record","created_at":"2026-05-18T00:16:07Z","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":"0c48f4a00488ac0d6b72445072e7b5cd212338ec0317e37d3cfeb857486c2ec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:41:51Z","title_canon_sha256":"0e859781a61515735fc9b1ff3d946db4a44d5c239660132eef68068f9766eb78"},"schema_version":"1.0","source":{"id":"1802.06867","kind":"arxiv","version":2}},"canonical_sha256":"ab7ee282cd4e2a842f9597285e3e400b8c08f18be80cd6f8393385c526323cd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab7ee282cd4e2a842f9597285e3e400b8c08f18be80cd6f8393385c526323cd5","first_computed_at":"2026-05-18T00:16:07.824303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:07.824303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y1RgReH058pFOpbhsDf2nz9VOc7/kSc9wzXbV2YErVCIHzZNc8a7TqBMh+4qbaUGZlj0GPraNpED7ZZxNR56AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:07.824951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06867","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9c52da54dce7eec43d92d9f48a069dec48264182263e0ae7e45da33def2e91a","sha256:9a84fbac6cf5d464c0de196b9f1a6e38dcde1c35c7f738a4d432ba465a316c8a"],"state_sha256":"4f4cc640c18f7e957517b93933a576cbdfdd4021f445acf1c5cd69903a7e3627"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9moJfAlqDF0RzQ7PJYJGVssUXodZfVxZLXzjp+5LOfLcKnZuzu016LNwloOhS6T+IHyUcvJgShIpuZGic0AGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:00:04.702080Z","bundle_sha256":"af3554bbcd0510c9f8a6871c5e6101a0c3ca461d8936f72f5141dc292ebdcf07"}}