{"_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_70566e0b870b39031964702010f055d29424ee79538c44a66024b4bd34972dd1","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_70566e0b870b39031964702010f055d29424ee79538c44a66024b4bd34972dd1","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"59d348a84b033dacd9bca4d36073a814819aaf06361181b7776ffb8d8283aa7f","published":"Thu, 07 May 2026 00:00:00 -0400","receipt_hash":"59d348a84b033dacd9bca4d36073a814819aaf06361181b7776ffb8d8283aa7f","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":"59d348a84b033dacd9bca4d36073a814819aaf06361181b7776ffb8d8283aa7f","observed_at":"2026-05-07T04:43:30.601849Z","parent_run_hash":"b20b3beeadde500bb99eda3b869d50b00c5259b2c78c650d83e786ac81b85801","published":"Thu, 07 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.03339v1 Announce Type: new \nAbstract: Solving large-scale CVRP (LSCVRP) with hundreds to thousands of nodes remains difficult for even state-of-the-art solvers. Divide-and-conquer can scale by decomposing the instance into size-reduced subproblems, but designing decomposition logic and configuring sub-solvers is highly expertise- and labor-intensive. Large Language Models (LLMs) have emerged as promising tools for automated algorithm design. However, existing LLM-driven approaches struggle with LSCVRP primarily due to the difficulty in generating sophisticated search strategies within a limited context window. To bridge this gap, we propose the LLM-assisted Flexible Monte Carlo Tree Search (LaF-MCTS), a novel framework that automates the design of high-performance LSCVRP solvers. We develop a three-tier decision hierarchy to enable incremental design of decomposition policies and sub-solvers for LSCVRP. To enable efficient search within the algorithmic hypothesis space, we i","title":"Automated Large-scale CVRP Solver Design via LLM-assisted Flexible MCTS","url":"https://arxiv.org/abs/2605.03339","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.03339v1 Announce Type: new \nAbstract: Solving large-scale CVRP (LSCVRP) with hundreds to thousands of nodes remains difficult for even state-of-the-art solvers. Divide-and-conquer can scale by decomposing the instance into size-reduced subproblems, but designing decomposition logic and configuring sub-solvers is highly expertise- and labor-intensive. Large Language Models (LLMs) have emerged as promising tools for automated algorithm design. However, existing LLM-driven approaches struggle with LSCVRP primarily due to the difficulty in generating sophisticated search strategies within a limited context window. To bridge this gap, we propose the LLM-assisted Flexible Monte Carlo Tree Search (LaF-MCTS), a novel framework that automates the design of high-performance LSCVRP solvers. We develop a three-tier decision hierarchy to enable incremental design of decomposition policies and sub-solvers for LSCVRP. To enable efficient search within the algorithmic hypothesis space, we i","title":"Automated Large-scale CVRP Solver Design via LLM-assisted Flexible MCTS","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-07T04:43:30Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.03339"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:5bc2c2d0138948c42012419c1b2b4668d79816d5fe8d5afcb80bf62599feab31b5d2729066c74158ec77d47e0e7c4b6760a7d9f06b81f35984a8be102e645b02","signer":"crovia.substrate","subject":{"observed_at":"2026-05-07T04:43:30Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.03339"},"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":"ac4abbc103c509a4b559bc62eeef3fec34d25507266b2e36f031d8975c805109","leaf_index":118175,"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":"f8cef50f7c85772fb16772d5657546075f178acdd36d3760a5368491a4ad8699","side":"left"},{"sibling":"0360f654bdb2c90f3e391f7b9522f26519357389237bed8d38222f35c91c542c","side":"left"},{"sibling":"ad8e16e1d5631e12c6b29888d117ae82f8fe190be798448771b10280c8d763eb","side":"left"},{"sibling":"836821b766d152089a06e2a5f18e466740180ec5159f3b8fbe06ef4d26337682","side":"left"},{"sibling":"21c980eafb7201d6e40abd17bdc2a3c54aae82eb5a146225bbad45a6f5928fd8","side":"left"},{"sibling":"fed33cbdc3506d8272a9f00063500ce0d0ad9f3590d1a4b306fdb2da209943e9","side":"right"},{"sibling":"4aefceab5196e926996a3979b3a94f90233fbe9691395f8aa956637ca951fe4f","side":"right"},{"sibling":"c25c853cb3dd8c7f1b99fc80fd602c044932de34c1b34bd69ab1d5b8c94e42b1","side":"left"},{"sibling":"3d3124224341dac361f0e93f24f70795342ba216dc1c0065e7fa7592d943b488","side":"left"},{"sibling":"438bef084db8613e8143527769e3c677e12a59f8a6e2dea114f88afab0446a43","side":"right"},{"sibling":"8e758a4477dfc0838d2e8ea2bdbd583bc3192683e75fd9cde217ee6a3b2f3ac8","side":"left"},{"sibling":"4219f746e463e594ccd6447debdf736a57e77319b12bcb74d8ece2b5860064c6","side":"left"},{"sibling":"05f89b32c00462e60adf95c1fe4579cdc2791b36e8b17573d8f3b5fd5da95a0b","side":"right"},{"sibling":"8ccd9937a2c0d5c04044d07d1557791b7d07bb31eac41a39a675608d44b38f23","side":"right"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"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_70566e0b870b39031964702010f055d29424ee79538c44a66024b4bd34972dd1"}}