REVIEW 1 cited by
Discrete geometry for electoral geography
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
read the original abstract
"Compactness," or the use of shape as a proxy for fairness, has been a long-running theme in the scrutiny of electoral districts; badly-shaped districts are often flagged as examples of the abuse of power known as gerrymandering. The most popular compactness metrics in the redistricting literature belong to a class of scores that we call contour-based, making heavy use of area and perimeter. This entire class of district scores has some common drawbacks, outlined here. We make the case for discrete shape scores and offer two promising ideas: a cut score and a spanning tree score. We use recent United States redistricting history as a source of examples. No shape metric can work alone as a seal of fairness, but we argue that discrete metrics are better aligned both with the grounding of the redistricting problem in geography and with the computational tools that have recently gained significant traction in the courtroom.
Forward citations
Cited by 1 Pith paper
-
Census Dual Graphs: Properties and Random Graph Models
Census dual graphs are characterized as nearly planar and nearly triangulated, with perturbed-grid and Delaunay-based random models providing the closest matches among those tested.
Discussion (0). Sign in to comment.