{"_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_417175717acbecb9fb54426e1ca3380c998fa92dca08c794c305a4ec1d06f70d","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_417175717acbecb9fb54426e1ca3380c998fa92dca08c794c305a4ec1d06f70d","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"a8bc3554939f2c9d9c8397f2e6fd8711c6136e62538d15bd9f30d933927be621","published":"Wed, 27 May 2026 00:00:00 -0400","receipt_hash":"a8bc3554939f2c9d9c8397f2e6fd8711c6136e62538d15bd9f30d933927be621","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":"a8bc3554939f2c9d9c8397f2e6fd8711c6136e62538d15bd9f30d933927be621","observed_at":"2026-05-27T04:43:18.926230Z","parent_run_hash":"6f581915edab4326e2b95fed7c82c2ee149e978d6d7c2443439442a927c31dfa","published":"Wed, 27 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.27013v1 Announce Type: new \nAbstract: Mathematical optimization is a powerful tool for structured decision-making across domains such as resource allocation and planning. Formulating optimization models faithful to reality, though, remains a significant bottleneck as it typically demands both domain expertise and optimization knowledge that are often scarce. Recent advances in large language models (LLMs) promise to bridge this gap, enabling the generation of candidate optimization models from natural language descriptions. However, there is no guarantee that any single LLM-generated model is reliable, and existing approaches that output only one model are therefore risky. In this work, we propose a novel algorithm that generates a portfolio of optimization models, designed to be robust to the limitations of LLMs. Our method exploits the observation that a single LLM can play two distinct roles $\\unicode{x2014}$ as a stochastic generator and as a reasoning evaluator $\\unicod","title":"Generating Robust Portfolios of Optimization Models using Large Language Models","url":"https://arxiv.org/abs/2605.27013","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.27013v1 Announce Type: new \nAbstract: Mathematical optimization is a powerful tool for structured decision-making across domains such as resource allocation and planning. Formulating optimization models faithful to reality, though, remains a significant bottleneck as it typically demands both domain expertise and optimization knowledge that are often scarce. Recent advances in large language models (LLMs) promise to bridge this gap, enabling the generation of candidate optimization models from natural language descriptions. However, there is no guarantee that any single LLM-generated model is reliable, and existing approaches that output only one model are therefore risky. In this work, we propose a novel algorithm that generates a portfolio of optimization models, designed to be robust to the limitations of LLMs. Our method exploits the observation that a single LLM can play two distinct roles $\\unicode{x2014}$ as a stochastic generator and as a reasoning evaluator $\\unicod","title":"Generating Robust Portfolios of Optimization Models using Large Language Models","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-27T04:43:18Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.27013"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:038f70cc8beb58463419b67080c8d13f984cb3b72e19a9f35062cbb0842d007fe2f2564c27334ecfd057c69a49e6c379f70fb9735796e1002b935e86f79cc50a","signer":"crovia.substrate","subject":{"observed_at":"2026-05-27T04:43:18Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.27013"},"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":"0d8d5f1e2298e1a2ab0cb1b9919a7e64942081df874264e2e2e923fec3bb2c0d","leaf_index":153599,"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":"a414a85c9a5a37fa8b713cb16f5fcf7846d7fab9cf6e785257e571fb9c25a365","side":"left"},{"sibling":"ab52a2057e35bfb49a13a857de7dd6293d57228a8fbdcaf62f2e2f87a3199ead","side":"left"},{"sibling":"0f4d196dbfe9a49508cfc275d0481586fedc93acc5c3eeb43f3728483544f7cb","side":"left"},{"sibling":"3fb01bd085da950e71601da41d379cbefa276df49da4ce49c404455f09d45a06","side":"left"},{"sibling":"23c44442bcf3b94001198d3edd077fba4efd3d957ab2a88fc3838d9938cce78c","side":"left"},{"sibling":"31d6424910a8cf4c515fbc6a09bdc25637640c854094c78ee9441c26e20f3e7b","side":"left"},{"sibling":"7e29d20bc58bb43ef3f6cdd944eb9f9025decb57a8f63cc2a0d59200f1d77bef","side":"left"},{"sibling":"dcc303c972d90ed3630aef0a6c2a3edd8c5b29cb2cc61805abaf9ddf885832e7","side":"left"},{"sibling":"94a845c78066cc7024ea52be995e0288a46b35a3430ba66fe7b939b2ddeb255c","side":"left"},{"sibling":"083e753237e7e2c337ddece20acebeca13943581cb5f796fe3e86bdba2ead0ed","side":"left"},{"sibling":"b1f51950a0c51a4dd0cca928c048f5b59153bd52927ad638066a0cf61b44365d","side":"left"},{"sibling":"64f0cee43abfb8301986ce9f1637f992794ecd7ee43659e68b16aea49363c2d0","side":"right"},{"sibling":"d415e6939aee710631f5062799379b547d2c3e3d9a68f263bbb5a693285ab2ca","side":"left"},{"sibling":"374c02d15fb12bd356c179c94766043a982052c6132af8bfc15361b431ffa9f7","side":"right"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"990705096edf483cc877217308f731dc42d6f6d99f82880167bbdbbfef32560a","side":"right"},{"sibling":"dd265753d95fa2e2fb4f5768e37fab6f691ccff09ad60d0910ff7dc23bac9226","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":154065,"merkle_root":"4993cfdc172e7880b60667f16789dc2e831ff000f81bb1ecba248e73f1510eca","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260527T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-27T05:37:36Z","sig_algorithm":"ed25519","signature":"76ecf118011540405e96506e6219752df04a2850632f2903dc6f10e08b98bc5a42c8d9e1cb5b7c5bf714479806a403df5f34399afa40c23fbb71493a1f77bd0c","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_417175717acbecb9fb54426e1ca3380c998fa92dca08c794c305a4ec1d06f70d"}}