{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QDATKPI3NIUXPYKTWZ44ANJVGK","short_pith_number":"pith:QDATKPI3","schema_version":"1.0","canonical_sha256":"80c1353d1b6a2977e153b679c0353532856df542f5c50b68499ec4fc51e16db4","source":{"kind":"arxiv","id":"1901.06549","version":1},"attestation_state":"computed","paper":{"title":"On the Necessary Memory to Compute the Plurality in Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Emanuele Natale, Iliad Ramezani","submitted_at":"2019-01-19T16:25:55Z","abstract_excerpt":"We consider the Relative-Majority Problem (also known as Plurality), in which, given a multi-agent system where each agent is initially provided an input value out of a set of $k$ possible ones, each agent is required to eventually compute the input value with the highest frequency in the initial configuration. We consider the problem in the general Population Protocols model in which, given an underlying undirected connected graph whose nodes represent the agents, edges are selected by a globally fair scheduler.\n  The state complexity that is required for solving the Plurality Problem (i.e., "},"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":"1901.06549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-19T16:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"c3629c22006cdb2a1c7cb19bdc2da2a7e992fae5df48ea784327c326a01b30d5","abstract_canon_sha256":"a645744a177a568e2caaaae1e5147aa726667317109983ff5d4aaa9c8e530e5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:49.888751Z","signature_b64":"6LvXIgic85JrAKq3MshUwmbnJETl57Nd20l5iGdze4+eoW/uL9MbhuHLiym3skxIz8fY54B5J4vfLZkrIpOgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80c1353d1b6a2977e153b679c0353532856df542f5c50b68499ec4fc51e16db4","last_reissued_at":"2026-05-17T23:55:49.887948Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:49.887948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Necessary Memory to Compute the Plurality in Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Emanuele Natale, Iliad Ramezani","submitted_at":"2019-01-19T16:25:55Z","abstract_excerpt":"We consider the Relative-Majority Problem (also known as Plurality), in which, given a multi-agent system where each agent is initially provided an input value out of a set of $k$ possible ones, each agent is required to eventually compute the input value with the highest frequency in the initial configuration. We consider the problem in the general Population Protocols model in which, given an underlying undirected connected graph whose nodes represent the agents, edges are selected by a globally fair scheduler.\n  The state complexity that is required for solving the Plurality Problem (i.e., "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06549","kind":"arxiv","version":1},"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":"1901.06549","created_at":"2026-05-17T23:55:49.888098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06549v1","created_at":"2026-05-17T23:55:49.888098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06549","created_at":"2026-05-17T23:55:49.888098+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDATKPI3NIUX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDATKPI3NIUXPYKT","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDATKPI3","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18707","citing_title":"Ranking Opinions with Few States in Population Protocols","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK","json":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK.json","graph_json":"https://pith.science/api/pith-number/QDATKPI3NIUXPYKTWZ44ANJVGK/graph.json","events_json":"https://pith.science/api/pith-number/QDATKPI3NIUXPYKTWZ44ANJVGK/events.json","paper":"https://pith.science/paper/QDATKPI3"},"agent_actions":{"view_html":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK","download_json":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK.json","view_paper":"https://pith.science/paper/QDATKPI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06549&json=true","fetch_graph":"https://pith.science/api/pith-number/QDATKPI3NIUXPYKTWZ44ANJVGK/graph.json","fetch_events":"https://pith.science/api/pith-number/QDATKPI3NIUXPYKTWZ44ANJVGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK/action/storage_attestation","attest_author":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK/action/author_attestation","sign_citation":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK/action/citation_signature","submit_replication":"https://pith.science/pith/QDATKPI3NIUXPYKTWZ44ANJVGK/action/replication_record"}},"created_at":"2026-05-17T23:55:49.888098+00:00","updated_at":"2026-05-17T23:55:49.888098+00:00"}