PitForge: “exact” is a checkable claim, so check it
Published:
PitForge: “exact” is a checkable claim, so check it
PitForge solves the ultimate pit limit exactly, as a maximum-weight closure of the block-precedence graph reduced to a minimum cut (Picard’s 1976 reduction) on a Dinic max-flow engine, live in the browser, and derives the nested Whittle pit shells from it.
“Exact” is the kind of word that should cost something to say, so it is tied to numbers somebody else published:
newman1 (1,060 blocks, 5.2 ms), zuck_small (9,400 blocks, 237 ms), kd (14,153 blocks and 219,778 precedences, 259 ms median).
Two further instances are excluded, with the reasons committed rather than omitted. Every solve also asserts the max-flow duality identity, pitValue = sum(positive) - maxflow, so a wrong answer cannot pass quietly.
The learned layer is scoped by the same rule. A grade neural net reaches R2 0.9613 against ordinary kriging at 0.958, which is a tie, and the app says so: it is offered as a fast approximation, never as something that beats the exact result. The CPIT LP relaxation that gives a certified NPV upper bound publishes its 10.46 percent integrality gap rather than hiding it, and it is an artifact rendered from JSON, never a live claim.
That last point is where PhaseFlow picks the problem up: PitForge answers which blocks are worth mining, PhaseFlow answers when. Live · source.