{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7MAYVCUWRPWQLUCJXXKCI2OG47","short_pith_number":"pith:7MAYVCUW","canonical_record":{"source":{"id":"1802.06872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:49:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f074c80553c946ca967a96bc782fc4623003f151a9d042bbc60e6d1609dde320","abstract_canon_sha256":"c2584c5280ca5aa3041c8afb8dc1af58098d097a59b7272d53cb645eea9a0e80"},"schema_version":"1.0"},"canonical_sha256":"fb018a8a968bed05d049bdd42469c6e7f111f6153762ca8af3fe43b9d399984e","source":{"kind":"arxiv","id":"1802.06872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06872","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06872v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06872","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"7MAYVCUWRPWQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7MAYVCUWRPWQLUCJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7MAYVCUW","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7MAYVCUWRPWQLUCJXXKCI2OG47","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:49:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f074c80553c946ca967a96bc782fc4623003f151a9d042bbc60e6d1609dde320","abstract_canon_sha256":"c2584c5280ca5aa3041c8afb8dc1af58098d097a59b7272d53cb645eea9a0e80"},"schema_version":"1.0"},"canonical_sha256":"fb018a8a968bed05d049bdd42469c6e7f111f6153762ca8af3fe43b9d399984e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.077412Z","signature_b64":"71FaJOFdgHHf+WBXHWUS6M9lNn0aLWdnyGk3Az5LxM1vb4QHDYBFq2urDFP3thmebQVZYkuPY9WnPm5br5LFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb018a8a968bed05d049bdd42469c6e7f111f6153762ca8af3fe43b9d399984e","last_reissued_at":"2026-05-18T00:18:09.076850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.076850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06872","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:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HooNEMjZkiRKS+fYyfU1YS0dRu7Ju84/+6q3cyYq6HgCgeaay8sAta5Wa8GfM2LNcgaiBr5hYXkAp0jmcDo9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T17:33:43.688593Z"},"content_sha256":"b6a5527a806e53827693b47a1b930209dc349d45975dd10eb4846b8f70f6fd75","schema_version":"1.0","event_id":"sha256:b6a5527a806e53827693b47a1b930209dc349d45975dd10eb4846b8f70f6fd75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7MAYVCUWRPWQLUCJXXKCI2OG47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Population Protocols Are Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Adrian Kosowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-02-19T21:49:01Z","abstract_excerpt":"A population protocol describes a set of state change rules for a population of $n$ indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a number of fundamental tasks in distributed computing, including: leader election, aggregate and threshold functions on the population, such as majority computation, and plurality consensus. For the first time, we show that solutions to all of these problems can be obtained \\emph{quickly} using finite-state protocols. For any input, the designed finite-state pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06872","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:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oF7HPyxiCqO3nCGrTbDHM83oJJjCa5pydn1GJidXUIzXX+pzKEBbYJOF10C5m14nRanDw/qHylTHY1EeKWLdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T17:33:43.688940Z"},"content_sha256":"ee97728b169ae2ff6be2082957ebb2c94c81c42425cefd4d50b83c5c82f97d4d","schema_version":"1.0","event_id":"sha256:ee97728b169ae2ff6be2082957ebb2c94c81c42425cefd4d50b83c5c82f97d4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/bundle.json","state_url":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/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-21T17:33:43Z","links":{"resolver":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47","bundle":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/bundle.json","state":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7MAYVCUWRPWQLUCJXXKCI2OG47","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":"c2584c5280ca5aa3041c8afb8dc1af58098d097a59b7272d53cb645eea9a0e80","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:49:01Z","title_canon_sha256":"f074c80553c946ca967a96bc782fc4623003f151a9d042bbc60e6d1609dde320"},"schema_version":"1.0","source":{"id":"1802.06872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06872","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06872v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06872","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"7MAYVCUWRPWQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7MAYVCUWRPWQLUCJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7MAYVCUW","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:ee97728b169ae2ff6be2082957ebb2c94c81c42425cefd4d50b83c5c82f97d4d","target":"graph","created_at":"2026-05-18T00:18:09Z","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":"A population protocol describes a set of state change rules for a population of $n$ indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a number of fundamental tasks in distributed computing, including: leader election, aggregate and threshold functions on the population, such as majority computation, and plurality consensus. For the first time, we show that solutions to all of these problems can be obtained \\emph{quickly} using finite-state protocols. For any input, the designed finite-state pro","authors_text":"Adrian Kosowski, Przemys{\\l}aw Uzna\\'nski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:49:01Z","title":"Population Protocols Are Fast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06872","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:b6a5527a806e53827693b47a1b930209dc349d45975dd10eb4846b8f70f6fd75","target":"record","created_at":"2026-05-18T00:18:09Z","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":"c2584c5280ca5aa3041c8afb8dc1af58098d097a59b7272d53cb645eea9a0e80","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:49:01Z","title_canon_sha256":"f074c80553c946ca967a96bc782fc4623003f151a9d042bbc60e6d1609dde320"},"schema_version":"1.0","source":{"id":"1802.06872","kind":"arxiv","version":2}},"canonical_sha256":"fb018a8a968bed05d049bdd42469c6e7f111f6153762ca8af3fe43b9d399984e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb018a8a968bed05d049bdd42469c6e7f111f6153762ca8af3fe43b9d399984e","first_computed_at":"2026-05-18T00:18:09.076850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:09.076850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71FaJOFdgHHf+WBXHWUS6M9lNn0aLWdnyGk3Az5LxM1vb4QHDYBFq2urDFP3thmebQVZYkuPY9WnPm5br5LFCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:09.077412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6a5527a806e53827693b47a1b930209dc349d45975dd10eb4846b8f70f6fd75","sha256:ee97728b169ae2ff6be2082957ebb2c94c81c42425cefd4d50b83c5c82f97d4d"],"state_sha256":"302bf73408554aaa0849027db22b4f9da762e709821d83321068806e553028a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svEMrgof1eKad9DedV/hS5Y6bFLrkVw/wDczmpEhITv7oxPR89IEgMHvAn8lRrIee73cIH1PMdCteTuwa0NMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T17:33:43.690908Z","bundle_sha256":"cfde3630650c4c1dab7d5462d62e9410f662e90196483c0a9f7c08789f3360ab"}}