{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E3Z5YFXYXZDRY733WFQCMYAOHS","short_pith_number":"pith:E3Z5YFXY","schema_version":"1.0","canonical_sha256":"26f3dc16f8be471c7f7bb16026600e3c911f25c084c854d295904f5648df0473","source":{"kind":"arxiv","id":"1602.08032","version":7},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.08032","created_at":"2026-05-18T00:46:21.099696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08032v7","created_at":"2026-05-18T00:46:21.099696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08032","created_at":"2026-05-18T00:46:21.099696+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3Z5YFXYXZDR","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3Z5YFXYXZDRY733","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3Z5YFXY","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS","json":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS.json","graph_json":"https://pith.science/api/pith-number/E3Z5YFXYXZDRY733WFQCMYAOHS/graph.json","events_json":"https://pith.science/api/pith-number/E3Z5YFXYXZDRY733WFQCMYAOHS/events.json","paper":"https://pith.science/paper/E3Z5YFXY"},"agent_actions":{"view_html":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS","download_json":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS.json","view_paper":"https://pith.science/paper/E3Z5YFXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08032&json=true","fetch_graph":"https://pith.science/api/pith-number/E3Z5YFXYXZDRY733WFQCMYAOHS/graph.json","fetch_events":"https://pith.science/api/pith-number/E3Z5YFXYXZDRY733WFQCMYAOHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/action/storage_attestation","attest_author":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/action/author_attestation","sign_citation":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/action/citation_signature","submit_replication":"https://pith.science/pith/E3Z5YFXYXZDRY733WFQCMYAOHS/action/replication_record"}},"created_at":"2026-05-18T00:46:21.099696+00:00","updated_at":"2026-05-18T00:46:21.099696+00:00"}