{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GBKMD32N5573SYBZZXLWDOFXJG","short_pith_number":"pith:GBKMD32N","canonical_record":{"source":{"id":"2605.13142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T08:09:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9ad5a739a4c1f56628686ba38ba81bf263bbdd367c3f6be7f832e2cd4a5854e1","abstract_canon_sha256":"c88fce45bde2bb30287f5579783f6242841d010e3170933b3aa84e2327d380e0"},"schema_version":"1.0"},"canonical_sha256":"3054c1ef4def7fb96039cdd761b8b749af156f6ba24f7901629f290f0937a06e","source":{"kind":"arxiv","id":"2605.13142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13142","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13142v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13142","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"GBKMD32N5573","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GBKMD32N5573SYBZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GBKMD32N","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GBKMD32N5573SYBZZXLWDOFXJG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T08:09:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9ad5a739a4c1f56628686ba38ba81bf263bbdd367c3f6be7f832e2cd4a5854e1","abstract_canon_sha256":"c88fce45bde2bb30287f5579783f6242841d010e3170933b3aa84e2327d380e0"},"schema_version":"1.0"},"canonical_sha256":"3054c1ef4def7fb96039cdd761b8b749af156f6ba24f7901629f290f0937a06e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:57.390692Z","signature_b64":"IprUBteLDyQPo3eVymnj8lhAzPtSrVeO2apgNNU0LUKakvX3J3qjGPHW6JStHMSzclzF0wluMJQhFRcVrpOiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3054c1ef4def7fb96039cdd761b8b749af156f6ba24f7901629f290f0937a06e","last_reissued_at":"2026-05-18T03:08:57.389966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:57.389966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13142","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLhWyKF0q5CBPYt+5MwN0gf7BGheCH8NvuZNainbSh6UyrT1REYIX/rIZUir8JSDDIukk0omurvI8SJgbRptAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:42:50.419420Z"},"content_sha256":"b4ec06779c4af4216d7de70a55a0f3430e9518776d321008ceed372397f612f2","schema_version":"1.0","event_id":"sha256:b4ec06779c4af4216d7de70a55a0f3430e9518776d321008ceed372397f612f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GBKMD32N5573SYBZZXLWDOFXJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constraint Programming Approach for $n$-Day Lookahead Playoff Clinching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An algorithm identifies the exact sequences of upcoming game results that clinch NHL playoff spots n days in advance.","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Gili Rosenberg, J. Kyle Brubaker, Kyle E. C. Booth, Ruben S. Andrist","submitted_at":"2026-05-13T08:09:58Z","abstract_excerpt":"In professional sports, a team has clinched the playoffs if they are guaranteed a postseason spot, regardless of the outcomes of any remaining games. As the season progresses, sports fans and other stakeholders are interested in precisely when, and under what conditions, their team will clinch the playoffs. In this paper, we investigate playoff clinching in the context of the National Hockey League (NHL), where it is computationally challenging to produce clinching scenarios due, in part, to complex tie-breakers. We present an algorithm that determines under which combinations of game outcomes"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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').","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A custom tree search with constraint programming computes n-day lookahead playoff clinching conditions for NHL teams while handling tie-breakers.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An algorithm identifies the exact sequences of upcoming game results that clinch NHL playoff spots n days in advance.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"738e7ff8814b01782a5fe5c6e7110ae5256ab4f858fdc7eb2b3b94d0bb372a27"},"source":{"id":"2605.13142","kind":"arxiv","version":1},"verdict":{"id":"c261e793-5957-4a16-ae49-2ff717ca6db9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:26:24.394900Z","strongest_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').","one_line_summary":"A custom tree search with constraint programming computes n-day lookahead playoff clinching conditions for NHL teams while handling tie-breakers.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":"An algorithm identifies the exact sequences of upcoming game results that clinch NHL playoff spots n days in advance."},"references":{"count":25,"sample":[{"doi":"","year":2008,"title":"Mathematically clinching a playoff spot in the","work_id":"86c3d44b-9b82-40ec-99ef-a81dddc097ad","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"Logic-based methods for optimization: combining optimization and constraint satisfaction , author=. 2011 , publisher=","work_id":"5ca431a1-6b91-4e5b-a587-daadcd00da30","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Perron, Laurent and Didier, Fr\\'","work_id":"cfd70838-aefb-4296-90d2-b452b4bbed11","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Discrete Optimization , volume=","work_id":"95b9a232-7227-45f0-9160-eb0620f9a3c0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"A computational study of problems in sports , author=. 2010 , school=","work_id":"bb44dd8d-b77c-4b24-9d10-668c14bfc1b7","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"f587db40132c33ea13bbab1128899c0de4523f1ab78fe326c6243ab6be981524","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"c261e793-5957-4a16-ae49-2ff717ca6db9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RwdP9YmsCesS7wvF6QPftk8XEzi4kslQgsiR3R/S4kmnTV8jYXLlsuy3OlACTCxjQz8fdq2CCNM/wSVDewsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:42:50.419931Z"},"content_sha256":"748a99bd0bbad321dc3d7eb86a3134f75ea2e07724d0c76093662c49da0e91eb","schema_version":"1.0","event_id":"sha256:748a99bd0bbad321dc3d7eb86a3134f75ea2e07724d0c76093662c49da0e91eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBKMD32N5573SYBZZXLWDOFXJG/bundle.json","state_url":"https://pith.science/pith/GBKMD32N5573SYBZZXLWDOFXJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBKMD32N5573SYBZZXLWDOFXJG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T21:42:50Z","links":{"resolver":"https://pith.science/pith/GBKMD32N5573SYBZZXLWDOFXJG","bundle":"https://pith.science/pith/GBKMD32N5573SYBZZXLWDOFXJG/bundle.json","state":"https://pith.science/pith/GBKMD32N5573SYBZZXLWDOFXJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBKMD32N5573SYBZZXLWDOFXJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GBKMD32N5573SYBZZXLWDOFXJG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13142","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13142v1","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13142","created_at":"2026-05-18T03:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"GBKMD32N5573","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GBKMD32N5573SYBZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GBKMD32N","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:748a99bd0bbad321dc3d7eb86a3134f75ea2e07724d0c76093662c49da0e91eb","target":"graph","created_at":"2026-05-18T03:08:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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')."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A custom tree search with constraint programming computes n-day lookahead playoff clinching conditions for NHL teams while handling tie-breakers."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An algorithm identifies the exact sequences of upcoming game results that clinch NHL playoff spots n days in advance."}],"snapshot_sha256":"738e7ff8814b01782a5fe5c6e7110ae5256ab4f858fdc7eb2b3b94d0bb372a27"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In professional sports, a team has clinched the playoffs if they are guaranteed a postseason spot, regardless of the outcomes of any remaining games. As the season progresses, sports fans and other stakeholders are interested in precisely when, and under what conditions, their team will clinch the playoffs. In this paper, we investigate playoff clinching in the context of the National Hockey League (NHL), where it is computationally challenging to produce clinching scenarios due, in part, to complex tie-breakers. We present an algorithm that determines under which combinations of game outcomes","authors_text":"Gili Rosenberg, J. Kyle Brubaker, Kyle E. C. Booth, Ruben S. Andrist","cross_cats":["math.OC"],"headline":"An algorithm identifies the exact sequences of upcoming game results that clinch NHL playoff spots n days in advance.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T08:09:58Z","title":"A Constraint Programming Approach for $n$-Day Lookahead Playoff Clinching"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Mathematically clinching a playoff spot in the","work_id":"86c3d44b-9b82-40ec-99ef-a81dddc097ad","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Logic-based methods for optimization: combining optimization and constraint satisfaction , author=. 2011 , publisher=","work_id":"5ca431a1-6b91-4e5b-a587-daadcd00da30","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Perron, Laurent and Didier, Fr\\'","work_id":"cfd70838-aefb-4296-90d2-b452b4bbed11","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Discrete Optimization , volume=","work_id":"95b9a232-7227-45f0-9160-eb0620f9a3c0","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A computational study of problems in sports , author=. 2010 , school=","work_id":"bb44dd8d-b77c-4b24-9d10-668c14bfc1b7","year":2010}],"snapshot_sha256":"f587db40132c33ea13bbab1128899c0de4523f1ab78fe326c6243ab6be981524"},"source":{"id":"2605.13142","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:26:24.394900Z","id":"c261e793-5957-4a16-ae49-2ff717ca6db9","model_set":{"reader":"grok-4.3"},"one_line_summary":"A custom tree search with constraint programming computes n-day lookahead playoff clinching conditions for NHL teams while handling tie-breakers.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An algorithm identifies the exact sequences of upcoming game results that clinch NHL playoff spots n days in advance.","strongest_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').","weakest_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."}},"verdict_id":"c261e793-5957-4a16-ae49-2ff717ca6db9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4ec06779c4af4216d7de70a55a0f3430e9518776d321008ceed372397f612f2","target":"record","created_at":"2026-05-18T03:08:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"3054c1ef4def7fb96039cdd761b8b749af156f6ba24f7901629f290f0937a06e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3054c1ef4def7fb96039cdd761b8b749af156f6ba24f7901629f290f0937a06e","first_computed_at":"2026-05-18T03:08:57.389966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:57.389966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IprUBteLDyQPo3eVymnj8lhAzPtSrVeO2apgNNU0LUKakvX3J3qjGPHW6JStHMSzclzF0wluMJQhFRcVrpOiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:57.390692Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4ec06779c4af4216d7de70a55a0f3430e9518776d321008ceed372397f612f2","sha256:748a99bd0bbad321dc3d7eb86a3134f75ea2e07724d0c76093662c49da0e91eb"],"state_sha256":"4185f339bcb1184243ce5c1a21f9f8388aee1cbf90bf1af8e4c9b69840216ec8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dJALGOoaR2Q2G7SB19A4KZpWSsYV2hO6cykngd6+3MlZh1g+IEnM374bUfZ09PThWc5cnNR6ENLpABmbP6yBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:42:50.422215Z","bundle_sha256":"cff75f24db339e614f424980aa1a4c18822924126be348eea8419370ea61ca1f"}}