Four-Terminal Planar Case of the Dinitz-Garg-Goemans Cost Conjecture

restricted planar four-terminal case

Exact FrontierDelta

disproved→disproved

Scope and record

Occurred: Sep 4, 2026

Delta type: REGISTRY REVISION

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Four-Terminal Planar Case of the Dinitz-Garg-Goemans Cost Conjecture · Four-terminal planar DGG

Confidence: Not scored

Registry verification: unreviewed · preprint · variant

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-5.6 Pro
model · ai model contributor · OpenAI

Matthew Protti
human · human collaborator

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record: Four-Terminal Planar Case of the Dinitz-Garg-Goemans Cost Conjecture

specialist registry · passed

The immutable v0.1.0 public disclosure ships a manuscript, exact data, an exhaustive verifier over all 16 routings and all 13 arcs, mutation tests, deterministic hashes and a separate AI-assisted computational cross-check. The attained certificate is $335/294$ ; the package also proves the limiting lower bound $(299 - 41sqrt{41})/32$ , with sharpness only in the stated fixed-topology, equal-full-cost, two-cheap-choice model. Released 2026-07-23, one day after the first public disproof of the general conjecture, and developed independently of it.