pith. sign in
Pith Number

pith:GBKMD32N

pith:2026:GBKMD32N5573SYBZZXLWDOFXJG
not attested not anchored not stored refs resolved

A Constraint Programming Approach for $n$-Day Lookahead Playoff Clinching

Gili Rosenberg, J. Kyle Brubaker, Kyle E. C. Booth, Ruben S. Andrist

An algorithm identifies the exact sequences of upcoming game results that clinch NHL playoff spots n days in advance.

arxiv:2605.13142 v1 · 2026-05-13 · cs.AI · math.OC

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{GBKMD32N5573SYBZZXLWDOFXJG}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We present an algorithm that determines under which combinations of game outcomes in the next n days a team will clinch the playoffs (i.e., 'n-day lookahead clinching').

C2weakest assumption

The constraint programming subroutine correctly encodes the NHL's full set of qualification rules and tie-breakers so that failure to find an elimination counter-example truly means the team has clinched.

C3one line summary

A custom tree search with constraint programming computes n-day lookahead playoff clinching conditions for NHL teams while handling tie-breakers.

References

25 extracted · 25 resolved · 0 Pith anchors

[1] Mathematically clinching a playoff spot in the 2008
[2] Logic-based methods for optimization: combining optimization and constraint satisfaction , author=. 2011 , publisher= 2011
[3] Perron, Laurent and Didier, Fr\'
[4] Discrete Optimization , volume= 2004
[5] A computational study of problems in sports , author=. 2010 , school= 2010
Receipt and verification
First computed 2026-05-18T03:08:57.389966Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

3054c1ef4def7fb96039cdd761b8b749af156f6ba24f7901629f290f0937a06e

Aliases

arxiv: 2605.13142 · arxiv_version: 2605.13142v1 · doi: 10.48550/arxiv.2605.13142 · pith_short_12: GBKMD32N5573 · pith_short_16: GBKMD32N5573SYBZ · pith_short_8: GBKMD32N
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/GBKMD32N5573SYBZZXLWDOFXJG \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 3054c1ef4def7fb96039cdd761b8b749af156f6ba24f7901629f290f0937a06e
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "c88fce45bde2bb30287f5579783f6242841d010e3170933b3aa84e2327d380e0",
    "cross_cats_sorted": [
      "math.OC"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.AI",
    "submitted_at": "2026-05-13T08:09:58Z",
    "title_canon_sha256": "9ad5a739a4c1f56628686ba38ba81bf263bbdd367c3f6be7f832e2cd4a5854e1"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13142",
    "kind": "arxiv",
    "version": 1
  }
}