{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GGBLDV5MRUYKVEFBPIHM2M64FH","short_pith_number":"pith:GGBLDV5M","schema_version":"1.0","canonical_sha256":"3182b1d7ac8d30aa90a17a0ecd33dc29f163e15f69023ea7c79b08988d9a8373","source":{"kind":"arxiv","id":"2403.00221","version":1},"attestation_state":"computed","paper":{"title":"Mode Consensus Algorithms With Finite Convergence Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Brian D. O. Anderson, Chao Huang, Hyungbo Shim, Siliang Yu","submitted_at":"2024-03-01T01:39:52Z","abstract_excerpt":"This paper studies the distributed mode consensus problem in a multi-agent system, in which the agents each possess a certain attribute and they aim to agree upon the mode (the most frequent attribute owned by the agents) via distributed computation. Three algorithms are proposed. The first one directly calculates the frequency of all attributes at every agent, with protocols based on blended dynamics, and then returns the most frequent attribute as the mode. Assuming knowledge at each agent of a lower bound of the mode frequency as a priori information, the second algorithm is able to reduce "},"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":"2403.00221","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-03-01T01:39:52Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7c00d750944113c5281782d4f30eeffed067bcc409812b7cebcf0c4535b28fd5","abstract_canon_sha256":"3fa5fd2a1a376d1702901593702018ced64de218cd9266ee954e40392a6056b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:00.845988Z","signature_b64":"1+p/JNuJ+exp7WXjlMqIhoGsI2hTsGvw3H6Qmu+JXA69bKsgqUr29K7xZltg9M9+pqmsbGAVefuM1c13KSCYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3182b1d7ac8d30aa90a17a0ecd33dc29f163e15f69023ea7c79b08988d9a8373","last_reissued_at":"2026-07-05T07:51:00.845520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:00.845520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mode Consensus Algorithms With Finite Convergence Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Brian D. O. Anderson, Chao Huang, Hyungbo Shim, Siliang Yu","submitted_at":"2024-03-01T01:39:52Z","abstract_excerpt":"This paper studies the distributed mode consensus problem in a multi-agent system, in which the agents each possess a certain attribute and they aim to agree upon the mode (the most frequent attribute owned by the agents) via distributed computation. Three algorithms are proposed. The first one directly calculates the frequency of all attributes at every agent, with protocols based on blended dynamics, and then returns the most frequent attribute as the mode. Assuming knowledge at each agent of a lower bound of the mode frequency as a priori information, the second algorithm is able to reduce "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00221","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.00221/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.00221","created_at":"2026-07-05T07:51:00.845575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.00221v1","created_at":"2026-07-05T07:51:00.845575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00221","created_at":"2026-07-05T07:51:00.845575+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGBLDV5MRUYK","created_at":"2026-07-05T07:51:00.845575+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGBLDV5MRUYKVEFB","created_at":"2026-07-05T07:51:00.845575+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGBLDV5M","created_at":"2026-07-05T07:51:00.845575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08211","citing_title":"Standard LSParameter Estimators Ensure Finite Convergence Time for Linear Regression Equations Under an Interval Excitation Assumption","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH","json":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH.json","graph_json":"https://pith.science/api/pith-number/GGBLDV5MRUYKVEFBPIHM2M64FH/graph.json","events_json":"https://pith.science/api/pith-number/GGBLDV5MRUYKVEFBPIHM2M64FH/events.json","paper":"https://pith.science/paper/GGBLDV5M"},"agent_actions":{"view_html":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH","download_json":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH.json","view_paper":"https://pith.science/paper/GGBLDV5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.00221&json=true","fetch_graph":"https://pith.science/api/pith-number/GGBLDV5MRUYKVEFBPIHM2M64FH/graph.json","fetch_events":"https://pith.science/api/pith-number/GGBLDV5MRUYKVEFBPIHM2M64FH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH/action/storage_attestation","attest_author":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH/action/author_attestation","sign_citation":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH/action/citation_signature","submit_replication":"https://pith.science/pith/GGBLDV5MRUYKVEFBPIHM2M64FH/action/replication_record"}},"created_at":"2026-07-05T07:51:00.845575+00:00","updated_at":"2026-07-05T07:51:00.845575+00:00"}