{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_df1d5a0c70a3fb37b6aa6ab4f105e334bd05d0c33ebee50701b138bd799aaad3","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_df1d5a0c70a3fb37b6aa6ab4f105e334bd05d0c33ebee50701b138bd799aaad3","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"cf40f69dc8fb559e2fa38cc007c2251f39b7de36d611af72d92cba797622c128","published":"Thu, 14 May 2026 00:00:00 -0400","receipt_hash":"cf40f69dc8fb559e2fa38cc007c2251f39b7de36d611af72d92cba797622c128","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"cf40f69dc8fb559e2fa38cc007c2251f39b7de36d611af72d92cba797622c128","observed_at":"2026-05-14T04:43:36.462865Z","parent_run_hash":"eb105e641aec4518c665fb1a0f748c2a8c8189675990bd4092425661eb7af1d8","published":"Thu, 14 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2605.13142v1 Announce Type: new \nAbstract: 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 in the next $n$ days a team will clinch the playoffs (i.e., \"$n$-day lookahead clinching\"). Our approach is a custom tree search which employs various preprocessing techniques, pruning strategies, and node ordering heuristics to efficiently explore the space of possible outcomes. The tree search leverages a constraint programming (CP)-based subrout","title":"A Constraint Programming Approach for $n$-Day Lookahead Playoff Clinching","url":"https://arxiv.org/abs/2605.13142","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.13142v1 Announce Type: new \nAbstract: 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 in the next $n$ days a team will clinch the playoffs (i.e., \"$n$-day lookahead clinching\"). Our approach is a custom tree search which employs various preprocessing techniques, pruning strategies, and node ordering heuristics to efficiently explore the space of possible outcomes. The tree search leverages a constraint programming (CP)-based subrout","title":"A Constraint Programming Approach for $n$-Day Lookahead Playoff Clinching","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-14T04:43:36Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.13142"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:ec8ad00003808371ddb7ec1a8eb16c9956c8cd7ebac215d80b40c8cad69717a11c645ddd50a4698fb7b5c462fdc3a338a2fd308882e40cda62e684473a2aaa01","signer":"crovia.substrate","subject":{"observed_at":"2026-05-14T04:43:36Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.13142"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"ad84991290d10b73e9790652ae64c05ae2326bc806386773f51bd1e838ced732","leaf_index":132443,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"ac1a6f94931319ac62653c76ce414401c6f0a125d30a380a84610340f04dabed","side":"left"},{"sibling":"259269af32dab88124123768a4a8cf6b7f640d043b5b9cd65570863ae7428c17","side":"left"},{"sibling":"60402517dcafa3d3d804f3dbdae24d2bd6760c28eb027fe03221207f2b652310","side":"right"},{"sibling":"152f7cfb9df25156db468db4e5f12802ae8131d08889b62807563ecaabf73c5f","side":"left"},{"sibling":"e1c5763f8ba91a453c376db4ba875e4e774ed2407841d3759d717ba1b84bf895","side":"left"},{"sibling":"274514099e39f2c823d48fa8895351268781be237d131c3f5c3043c9445192cb","side":"right"},{"sibling":"965877ab5caa989082deef399831bd46e3fe38968c16c9d08422d8ee79575daf","side":"left"},{"sibling":"0cd70adc3a7c14d2d9551d77d79bf364f954d70b2b229f9fe6f7f99125fe8f09","side":"right"},{"sibling":"ed110cac74740161e005dcd47c35637ac99ecf93121b3961837570c3af56caa0","side":"left"},{"sibling":"2270188e7d95b52d2bade0ab7da2d0816592f30757dcf71636f21b8f46eb1317","side":"right"},{"sibling":"c03f0a468f574a08ffe8b17e1a17bd88216e1359f0e33a54447e160cd8675da0","side":"left"},{"sibling":"038ff12da6f55509125ef0d96e1e57dda29a2fe63bf03fba2af4cf7cbcd88b36","side":"right"},{"sibling":"b0419206fe62ef216df3900ca93cffd44df267435a4643dda354c1310079cf91","side":"right"},{"sibling":"0d4a9c03674f9d0ce64df15c15e9f656a54b41f93c428aac8e615fda26291956","side":"right"},{"sibling":"7856d920f3f1f1d2194c1ed7351bf0d674440df3cb423a6911f89cb3e9578c0b","side":"right"},{"sibling":"6ac6396bdd2e9df315427a46155531476e7f9012b4bd962e0d2d6d1209b11723","side":"right"},{"sibling":"7c8dc85cbfe43e19ac759ad176cfa11dba2467ae17927c471d5c55663c4f490d","side":"right"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_df1d5a0c70a3fb37b6aa6ab4f105e334bd05d0c33ebee50701b138bd799aaad3"}}