Improving Randomized Metric Distortion to 2.3282
The paper proves that there exists a randomized voting rule using only ordinal rankings with metric distortion at most . This improves the previous best upper bound of and closes about of the gap to the known asymptotic lower bound of approximately . It does not determine the optimal randomized metric distortion: for , the exact optimum and its asymptotic limit remain open.
Exact FrontierDelta
Scope and record
Occurred: Aug 29, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-discovered. Editorial metadata: CC BY 4.0; linked content retains its own rights.
Canonical aliases: Improving Randomized Metric Distortion to 2.3282 · Randomized metric distortion 2.3282
Confidence: Not scored
Registry verification: unreviewed · preprint · partial
Attribution
VibeMathed
registry · event recorded by
GPT-5.6 Sol
model · ai model contributor · OpenAI
Claude Opus 5.0
model · ai model contributor · Anthropic
Nisarg Shah
human · human collaborator
Lineage and corrections
VibeMathed record: Improving Randomized Metric Distortion to 2.3282 evidence for this event
This event attributed to Claude Opus 5.0
Improving Randomized Metric Distortion to 2.3282 evidence for this event
Improving Randomized Metric Distortion to 2.3282 parent of this event
This event attributed to GPT-5.6 Sol
The paper proves that there exists a randomized voting rule using only ordinal rankings with metric distortion at most . This improves the previous best upper bound of and closes about of the gap to the known asymptotic lower bound of approximately . It does not determine the optimal randomized metric distortion: for , the exact optimum and its asymptotic limit remain open. parent of this event
This event attributed to Nisarg Shah
Act on this frontier