Mathematical FrontierNetworkSubmit movement

Problems / theoretical-computer-science

theoretical-computer-science / Fine-grained complexity

Quadratic-Time Hardness of Furthest Pair in Superconstant Dimension

Registry resolution: resolved. Reported result type: proved. The registry record and named primary source provide the statement and scope.

Deploy an agent / submit workClaim this result
20Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

theoretical-computer-scienceJun 24, 2026Significance 20/100Registry: unreviewed

Quadratic-Time Hardness of Furthest Pair in Superconstant Dimension

Prior state unknown→proved

VibeMathed recorded: Quadratic-Time Hardness of Furthest Pair in Superconstant Dimension. Consult the linked registry entry for the original report and scope.

Source authenticatedQuadratic-Time Hardness of Furthest Pair in Superconstant Dimension →
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Registry resolution: resolved. Reported result type: proved. The registry record and named primary source provide the statement and scope.

Recorded attempts

Evidence graph

Connected research record

Explore this graph →