{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E3Z5YFXYXZDRY733WFQCMYAOHS","short_pith_number":"pith:E3Z5YFXY","canonical_record":{"source":{"id":"1602.08032","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-25T18:54:50Z","cross_cats_sorted":[],"title_canon_sha256":"c917450a7b2573e6c2b624d14bd12345b79ce1601e4c0415cd0e309b328748cd","abstract_canon_sha256":"81199e6f20ce1ebb68b22d90dfaf6aa5abd0ddf590453ef1f5b4e411a9006a12"},"schema_version":"1.0"},"canonical_sha256":"26f3dc16f8be471c7f7bb16026600e3c911f25c084c854d295904f5648df0473","source":{"kind":"arxiv","id":"1602.08032","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08032","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08032v7","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08032","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"E3Z5YFXYXZDR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3Z5YFXYXZDRY733","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3Z5YFXY","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E3Z5YFXYXZDRY733WFQCMYAOHS","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08032","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-25T18:54:50Z","cross_cats_sorted":[],"title_canon_sha256":"c917450a7b2573e6c2b624d14bd12345b79ce1601e4c0415cd0e309b328748cd","abstract_canon_sha256":"81199e6f20ce1ebb68b22d90dfaf6aa5abd0ddf590453ef1f5b4e411a9006a12"},"schema_version":"1.0"},"canonical_sha256":"26f3dc16f8be471c7f7bb16026600e3c911f25c084c854d295904f5648df0473","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:21.100093Z","signature_b64":"UoKFWNoHAR1eXsRd4JYmRIAMXhbc86cRFspypBHE2Fp4D/pGXdhZG5WbmhXf6rq99nNR0hfeIe3da9u6sxpABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26f3dc16f8be471c7f7bb16026600e3c911f25c084c854d295904f5648df0473","last_reissued_at":"2026-05-18T00:46:21.099624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:21.099624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08032","source_version":7,"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:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLhXjVJpRoPUnWcn5qWCrj2ipWopnQQUtACrChC9Db0/7Rh2daJDf9ubGt1+HUpyDAfPfIwI2m4I+JwT2CWKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:49:41.113002Z"},"content_sha256":"747f7bbcb169bdcd70206902f347e7eca72e07b6e41b43e5889c8d1f452f38dc","schema_version":"1.0","event_id":"sha256:747f7bbcb169bdcd70206902f347e7eca72e07b6e41b43e5889c8d1f452f38dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E3Z5YFXYXZDRY733WFQCMYAOHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Space Trade-offs in Population Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dan Alistarh, David Eisenstat, James Aspnes, Rati Gelashvili, Ronald L. Rivest","submitted_at":"2016-02-25T18:54:50Z","abstract_excerpt":"Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires stabilization to a single agent in a special \"leader\" state), and majority (in which agents must stabilize to a decision as to which of two possible initial states had hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08032","kind":"arxiv","version":7},"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:46:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0x70sDjrcFXxN5lmxnkypKhTUNT8XizE6q/FBxsM9pjyBBQPjCIBuJmN5R3mjXLU6zu8dvaNodmom2bWPsrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:49:41.113831Z"},"content_sha256":"b6e34a9843a055d81e13da07611aae9f2cde445505adcbaaa4d80cda1bbec377","schema_version":"1.0","event_id":"sha256:b6e34a9843a055d81e13da07611aae9f2cde445505adcbaaa4d80cda1bbec377"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/bundle.json","state_url":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/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-11T08:49:41Z","links":{"resolver":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS","bundle":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/bundle.json","state":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E3Z5YFXYXZDRY733WFQCMYAOHS","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":"81199e6f20ce1ebb68b22d90dfaf6aa5abd0ddf590453ef1f5b4e411a9006a12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-25T18:54:50Z","title_canon_sha256":"c917450a7b2573e6c2b624d14bd12345b79ce1601e4c0415cd0e309b328748cd"},"schema_version":"1.0","source":{"id":"1602.08032","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08032","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08032v7","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08032","created_at":"2026-05-18T00:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"E3Z5YFXYXZDR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3Z5YFXYXZDRY733","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3Z5YFXY","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:b6e34a9843a055d81e13da07611aae9f2cde445505adcbaaa4d80cda1bbec377","target":"graph","created_at":"2026-05-18T00:46:21Z","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":"Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires stabilization to a single agent in a special \"leader\" state), and majority (in which agents must stabilize to a decision as to which of two possible initial states had hig","authors_text":"Dan Alistarh, David Eisenstat, James Aspnes, Rati Gelashvili, Ronald L. Rivest","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-25T18:54:50Z","title":"Time-Space Trade-offs in Population Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08032","kind":"arxiv","version":7},"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:747f7bbcb169bdcd70206902f347e7eca72e07b6e41b43e5889c8d1f452f38dc","target":"record","created_at":"2026-05-18T00:46:21Z","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":"81199e6f20ce1ebb68b22d90dfaf6aa5abd0ddf590453ef1f5b4e411a9006a12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-25T18:54:50Z","title_canon_sha256":"c917450a7b2573e6c2b624d14bd12345b79ce1601e4c0415cd0e309b328748cd"},"schema_version":"1.0","source":{"id":"1602.08032","kind":"arxiv","version":7}},"canonical_sha256":"26f3dc16f8be471c7f7bb16026600e3c911f25c084c854d295904f5648df0473","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26f3dc16f8be471c7f7bb16026600e3c911f25c084c854d295904f5648df0473","first_computed_at":"2026-05-18T00:46:21.099624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:21.099624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UoKFWNoHAR1eXsRd4JYmRIAMXhbc86cRFspypBHE2Fp4D/pGXdhZG5WbmhXf6rq99nNR0hfeIe3da9u6sxpABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:21.100093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08032","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:747f7bbcb169bdcd70206902f347e7eca72e07b6e41b43e5889c8d1f452f38dc","sha256:b6e34a9843a055d81e13da07611aae9f2cde445505adcbaaa4d80cda1bbec377"],"state_sha256":"cdbe94fabe370301353f70c2f50b2e9904f8da93b79d20870c263a0eeb6bff74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuOVkX+Lxt82w6zYrKz7DLM8j2GEbKMA9ExcmjdZoNY1T1TjzIGQSTdpPRPimDzbkL1ZAhA0V9bHFq+8XUt2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:49:41.118645Z","bundle_sha256":"661bfb62a450486fcd4e05843d0fdb5fe6b41148d5916a89bf923dd6d3c7657d"}}