{"_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_8564e3b5a1bd680861ec94c74434935199220ffd3a5329d5c3026de29316ac75","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_8564e3b5a1bd680861ec94c74434935199220ffd3a5329d5c3026de29316ac75","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"8201e54dfbd3fce135c2c1224c92e14a7c27c4b1207f6a1591d1f3d3703151cd","published":"Mon, 08 Jun 2026 00:00:00 -0400","receipt_hash":"8201e54dfbd3fce135c2c1224c92e14a7c27c4b1207f6a1591d1f3d3703151cd","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":"8201e54dfbd3fce135c2c1224c92e14a7c27c4b1207f6a1591d1f3d3703151cd","observed_at":"2026-06-08T04:44:02.392073Z","parent_run_hash":"4b9e67a023632e16a32d228bb97fee209911f388e0a8dbf20b5a4ec02729c20f","published":"Mon, 08 Jun 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:2606.06518v1 Announce Type: new \nAbstract: Sudoku is a representative constraint satisfaction problem that requires global structural reasoning under strict discrete constraints. The existing works of solving Sudoku mainly focus on two dominant approaches, i.e., traditional heuristic and deep learning solver. However, they suffer from two complementary limitations: learning-based solvers lack hard correctness guarantees, while complete symbolic solvers are still prone to long-tail search. To address these shortcomings, we propose a novel diffusion model-guided approach, termed as DiBS, for the branch selection search process. Specifically, DiBS keeps the symbolic solver complete and uses the diffusion model as a branch-ordering guide. The core method is ranking candidate values under the current partial assignment and lightweight consistency signal. Furthermore, we provide an in-depth theoretical proof to reveal how it works and why it works. Experiments on the challenging Royle ","title":"DiBS: Diffusion-Informed Branch Selection","url":"https://arxiv.org/abs/2606.06518","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.06518v1 Announce Type: new \nAbstract: Sudoku is a representative constraint satisfaction problem that requires global structural reasoning under strict discrete constraints. The existing works of solving Sudoku mainly focus on two dominant approaches, i.e., traditional heuristic and deep learning solver. However, they suffer from two complementary limitations: learning-based solvers lack hard correctness guarantees, while complete symbolic solvers are still prone to long-tail search. To address these shortcomings, we propose a novel diffusion model-guided approach, termed as DiBS, for the branch selection search process. Specifically, DiBS keeps the symbolic solver complete and uses the diffusion model as a branch-ordering guide. The core method is ranking candidate values under the current partial assignment and lightweight consistency signal. Furthermore, we provide an in-depth theoretical proof to reveal how it works and why it works. Experiments on the challenging Royle ","title":"DiBS: Diffusion-Informed Branch Selection","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-08T04:44:02Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.06518"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:50ed30faa44548183c1393085caf8c1d7f9efbb4db4567d74e29d48f83e573e156a605b0b2a143aeaf3b3f8dcca36b0a507607564c4d98b03b3eb67bd40b5e06","signer":"crovia.substrate","subject":{"observed_at":"2026-06-08T04:44:02Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.06518"},"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":"4f4e3d6f2e1f96e53f52680e9c47e74211c5ac045822d88787820267a3eb4372","leaf_index":223638,"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":"24498919e348e14efe012ae81b01c9781f70440e449eddaf83ec8cd0355beb12","side":"right"},{"sibling":"e59b8d40f323f00bbe825a1485649b4cfdc5cf343d733a489dc0d6d9ac08bd4c","side":"left"},{"sibling":"09a369e5fe07042d4ee3a5efb22210c37f1dbae090f83c0e449d4764aca5b458","side":"left"},{"sibling":"00c4e56d69a2a0fdd4d2bb87dac8ae464357cf2e85226e6150e7dc2b10c7605a","side":"right"},{"sibling":"1a40cf7cdf40ae099179f1f4947c4721eee8d1fec562b05901c81cdd160cb652","side":"left"},{"sibling":"384214aa99bea659f99dc4c147e549443bc5cf0fbfca8299af147feeb8463630","side":"right"},{"sibling":"60fb6338c1398b60f2495d29f49c8dd6efd167badd0ad0f69e5eaf6aa895db59","side":"right"},{"sibling":"f52e49855e10c1db333480ff9b611c4795fd9e2f84430900141c99330582a520","side":"left"},{"sibling":"5f83c2a81d932eed327e06ff2498f8ed85199cdf7d5f3cd3565fb2a9003a8b8f","side":"left"},{"sibling":"06e9be95ebfd6e5cffbe9db8fc8fd32e8c20d38b7d7f0df3dc7dc5e76bb1848c","side":"right"},{"sibling":"5480e1ea31f4744f9bd7c4261771fe51f2cdb01e705cc17320bfc202d935ca12","side":"right"},{"sibling":"24fdc29d461691aedb6fa920758206b5bb43851f477ef7a04c34aaed84b8971b","side":"left"},{"sibling":"036922da4e1e2c46d948f070454bfad299b7406fb00735ea9d8bd1e687f5f445","side":"right"},{"sibling":"533d82482604463aa4a281b9d8b85917b383b7c5f924b2b494039524c55e8797","side":"left"},{"sibling":"b2590791b920ca2a4ed39de126d2c0b1a10d9e7e62f572f12425f214e767b6e1","side":"left"},{"sibling":"87c6b850dfec08ac35a693d9db3a3315250a68adb1cfab9b1015f212b63b15bd","side":"right"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"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":224761,"merkle_root":"e9f7b49b652e869ab97ffba9c5a31356b2d0e3dc5d00bb28944adf737c46b1e7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260609T103805Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-09T14:15:34Z","sig_algorithm":"ed25519","signature":"8ad8076fb12c8e486ae1d1559a9a7ba8e2ee996a9ad3d8ba7bcdbdbd88ab3a15bcb429707aca6d3e9d8b97e2ba755b3dcc77b1abb6601ccb829842719a6fb30d","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_8564e3b5a1bd680861ec94c74434935199220ffd3a5329d5c3026de29316ac75"}}