Sublate pilot brief

Email: seongjukim@remorser.com
Please send a problem description first. Confirm data permissions and the approved
transfer method before sharing private datasets, credentials or customer records.

Team and contact:
Problem and existing solver:
Scorer and objective direction:
Validity criteria:
Authorized, replayable example instances:
Development, holdout and stress splits:
Current objective and runtime measurements:
Acceptance criteria and runtime budget:
Known failure cases:
Data-access and external-model permissions:
Compute budget and preferred schedule:

Offers
Evaluate: free local CSV comparison. No solver execution or independent validation.
Feasibility review: from KRW 800,000, up to 6 delivery hours.
Improvement pilot: from KRW 3,500,000 total including the feasibility review;
one solver/problem and up to 40 delivery hours.
Scope, taxes, compute budget and schedule are confirmed in a written quote.
Improvement is not guaranteed. A no-gain outcome includes baseline reproduction
and the experiment record.

Reproducible local example
https://remorser.com/downloads/sublate-packing-reference.zip
Includes source, tests, 18 synthetic one-dimensional capacity-packing cases,
independent placement checks, measured runs, and input/source/output hashes.
Run the included first-fit and best-fit-decreasing algorithms locally with Node,
then open evaluation.csv in https://remorser.com/evaluate/.
This example does not execute customer code or call Claude. All input partitions
are visible; holdout-labelled cases are not independent evidence. Sub-millisecond
timings are illustrative. The example establishes no customer performance claim.