Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT

Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT | Signal Canvas | ScienceToStartup

Page Freshness

Signal Canvas proof surface

Canonical route: /signal-canvas/solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat

stale

Proof freshness: stale
Proof status: unverified
Display score: 4/10
Last proof check: 2026-04-03
Score updated: 2026-04-03
Score fresh until: 2026-05-03
References: 0
Source count: 0
Coverage: 33%

This page is showing the last landed evidence receipt and score bundle because the latest proof data is outside the freshness window.

Agent Handoff

Canonical ID solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat | Route /signal-canvas/solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat

REST example

curl https://sciencetostartup.com/api/v1/agent-handoff/signal-canvas/solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat

MCP example

{
  "tool": "search_signal_canvas",
  "arguments": {
    "mode": "paper",
    "paper_ref": "solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat",
    "query_text": "Summarize Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT"
  }
}

source_context

{
  "surface": "signal_canvas",
  "mode": "paper",
  "query": "Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT",
  "normalized_query": "2604.01732",
  "route": "/signal-canvas/solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat",
  "paper_ref": "solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat",
  "topic_slug": null,
  "benchmark_ref": null,
  "dataset_ref": null
}

Evidence Receipt

Route status: building

Claims: 7

References: Pending verification

Proof: Verification pending

Freshness state: computing

Source paper: Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT

PDF: https://arxiv.org/pdf/2604.01732v1

Source count: Pending verification

Coverage: 33%

Last proof check: 2026-04-03T20:50:40.820Z

Signal Canvas receipt window

Not build-ready: Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT

/buildability/solving-the-two-dimensional-single-stock-size-cuting-stock-problem-with-sat-and-maxsat

Ignoreblocked

Subject: Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT

Verdict

Ignore

Verdict is Ignore because current viability and proof state do not clear the buildability gate.

Preparing verified analysis

GitHub Code Pulse

No public code linked for this paper yet.

Claim map

Strong 7Mixed 0Weak 0

Evidencepartial
We present a SAT-based framework where item types are expanded by demand, each copy has a sheet-assignment variable and non-overlap constraints are activated only for copies assigned to the same sheet.
Implicationpartial
Directly stated in the abstract describing the core method
Verificationpartial
partial
Evidencepartial
We also introduce an infeasible-orientation elimination rule that fixes rotation variables when only one orientation can fit the sheet.
Implicationpartial
Directly stated in the abstract as a specific technical contribution
Verificationpartial
partial
Evidencepartial
For minimizing the number of sheets, we compare three approaches: non-incremental SAT with binary search, incremental SAT with clause reuse across iterations and weighted partial MaxSAT.
Implicationpartial
Directly stated in the abstract with clear enumeration of methods
Verificationpartial
partial
Evidencepartial
On the Cui--Zhao benchmark suite, our best SAT configurations certify two to three times more instances as provably optimal and achieve lower optimality gaps than OR-Tools, CPLEX and Gurobi.
Implicationpartial
Directly stated in abstract with comparative performance metric
Verificationpartial
partial
Evidencepartial
The relative ranking among SAT approaches depends on rotation: incremental SAT is strongest without rotation, while non-incremental SAT is more effective when rotation increases formula size.
Implicationpartial
Directly stated in abstract as a key finding about method performance
Verificationpartial
partial
Evidencepartial
The Two-Dimensional Single Stock Size Cutting Stock Problem (2D-CSSP) generalizes bin packing by requiring multiple copies of each item type, which causes a strong combinatorial blow-up.
Implicationpartial
Directly stated in abstract as problem characterization
Verificationpartial
partial
Evidencepartial
On the Cui--Zhao benchmark suite, our best SAT configurations certify two to three times more instances as provably optimal and achieve lower optimality gaps than OR-Tools, CPLEX and Gurobi.
Implicationpartial
Directly stated in abstract as comparative performance result
Verificationpartial
partial

Author intelligence and commercialization panels stay hidden until the proof receipt is verified, cites at least 3 references, includes at least 2 sources, and clears 50% coverage. The paper narrative and citation surfaces remain public while verification is pending.

Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT

Use Signal Canvas as the narrative proof surface

Use this Signal Canvas via API or MCP

Signal Canvas proof surface