Pith. sign in

REVIEW 1 cited by

Gerrymandering and Compactness: Implementation Flexibility and Abuse

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 1803.02857 v2 pith:AVD5UGEL submitted 2018-03-07 cs.CY cs.CG

classification cs.CYcs.CG
keywords compactnessmeasurementsaffecteddistrictsimplementationmeasurespoliticalabuse
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Political districts may be drawn to favor one group or political party over another, or gerrymandered. A number of measurements have been suggested as ways to detect and prevent such behavior. These measures give concrete axes along which districts and districting plans can be compared. However, measurement values are affected by both noise and the compounding effects of seemingly innocuous implementation decisions. Such issues will arise for any measure. As a case study demonstrating the effect, we show that commonly-used measures of geometric compactness for district boundaries are affected by several factors irrelevant to fairness or compliance with civil rights law. We further show that an adversary could manipulate measurements to affect the assessment of a given plan. This instability complicates using these measurements as legislative or judicial standards to counteract unfair redistricting practices. This paper accompanies the release of packages in C++, Python, and R that correctly, efficiently, and reproducibly calculate a variety of compactness scores.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Complexity and Geometry of Sampling Connected Graph Partitions

    cs.CC 2019-08 accept novelty 7.0 of 10

    Uniform and balanced sampling of connected planar graph partitions is hard unless RP=NP, the flip walk mixes exponentially slowly on explicit triangulation families, and tractable cases include series-parallel and bou...

Pith tools