Sharp order-preserving integer models for short additive equalities

We ask how small an increasing integer model of a finite real set can be while preserving all equalities between equal-length sums of at most $q$ elements, with repetitions allowed. The increasing correspondence must preserve exactly which sums are equal; the signs of unequal comparisons may change.