From 2138a0ea6b2f8693bee839a32fbfc383e5ba59cd Mon Sep 17 00:00:00 2001 From: "Thomas (Tom) C. Gorordo" Date: Fri, 22 May 2026 04:22:18 -0700 Subject: [PATCH] clarify some cgi form text --- src/cgi/form.html | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/src/cgi/form.html b/src/cgi/form.html index d274864..681876d 100644 --- a/src/cgi/form.html +++ b/src/cgi/form.html @@ -45,7 +45,8 @@

This is an upload form for the smithy RCV Ballot counter for identifying the Smith set (majority winners) in small elections, mainly to help with UO Physics Grad student elections of various flavors. This form uses the UO pages.uoregon.edu CGI Capability, so the implementation of smithy being invoked can be inspected here -and you may also inspect the source of this page to verify that this script is called to invoke it. +and you may also inspect the source of this page to verify that this script is called to invoke it - though +you have to trust it to be responding with its own contents faithfully.

The Smith set is the minimal set of candidates which can beat all others pairwise (by majority ranking) @@ -57,7 +58,7 @@ and you may also inspect the source of this page to verify that test_ballot.csv: +

test_ballot.csv @@ -85,7 +86,8 @@ e.g.:

Alice 2
-(which has, as its Smith set a tie between "Alice" and "Bob")

+where this reads that the first voter had preferences "Alice" over "Bob" over "Charlie", the second voter "Bob" over "Alice" over "Charlie", etc. +(This example is constructed to demonstrate a situation without a singular majority winner - its Smith set a tie between "Alice" and "Bob")

Output: Smith Set Format

The form will return a list of the Smith-set winners sorted lexicographically (they are all equally good majority winners).