Pith. sign in

REVIEW 2 cited by

Federated Assemblies

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.19129 v1 pith:DF5J4X3T submitted 2024-05-29 cs.GT cs.DC

classification cs.GTcs.DC
keywords assembliesalgorithmsassemblyfederatedrepresentationselectedstructureanalyze
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A citizens' assembly is a group of people who are randomly selected to represent a larger population in a deliberation. While this approach has successfully strengthened democracy, it has certain limitations that suggest the need for assemblies to form and associate more organically. In response, we propose federated assemblies, where assemblies are interconnected, and each parent assembly is selected from members of its child assemblies. The main technical challenge is to develop random selection algorithms that meet new representation constraints inherent in this hierarchical structure. We design and analyze several algorithms that provide different representation guarantees under various assumptions on the structure of the underlying graph.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Volition-Guarded Multiagent Atomic Transactions: Describing People and their Machines

    cs.DC 2026-04 unverdicted novelty 7.0 of 10

    Volition-guarded multiagent atomic transactions decompose agents into person volitions plus machine state, enabling formal specs and proofs that social networks and coins/bonds are volitionally grassroots under a new ...

  2. GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language for AI

    cs.PL 2026-07 conditional novelty 5.0 of 10

    GLP is a single-assignment concurrent logic language whose multiagent semantics is claimed to guarantee that any program using cold-calls yields a grassroots platform, with the proof deferred to the full paper.

Pith tools