{"_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_f7dcc20482de27cafceaf2887c79828f657001212c227a075c289c94e4c30164","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_f7dcc20482de27cafceaf2887c79828f657001212c227a075c289c94e4c30164","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"1f1b6af5429c3885ad19596c14863d4c9a45cd27ceaac7d21fe78d5951f0bfaa","published":"Mon, 11 May 2026 00:00:00 -0400","receipt_hash":"1f1b6af5429c3885ad19596c14863d4c9a45cd27ceaac7d21fe78d5951f0bfaa","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":"1f1b6af5429c3885ad19596c14863d4c9a45cd27ceaac7d21fe78d5951f0bfaa","observed_at":"2026-05-11T04:43:50.688999Z","parent_run_hash":"8244cc3d66edb4604be5ded19e92c0b47893b228a258432a9c53a5796a870982","published":"Mon, 11 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:2512.14263v2 Announce Type: replace-cross \nAbstract: Preferential Bayesian Optimization (PBO) aims to find a decision-maker's most preferred solution in as few pairwise comparisons as possible. Existing approaches rely on Gaussian Process (GP) surrogates, which provide strong performance but limited interpretability. This limits real-world usability in high-stakes domains, such as healthcare, where interpretability and trust are essential. We propose DT-PBO, a novel tree-based surrogate model for PBO that is inherently interpretable while capturing preference uncertainty. Specifically, we introduce a novel splitting heuristic that constructs interpretable shallow decision trees directly from pairwise comparison data, and use Laplace approximation to obtain probabilistic estimates for each leaf. This enables efficient preference modeling without sacrificing interpretability. Across eight benchmark functions, our method achieves competitive convergence to GP-based PBO, particularly","title":"DT-PBO: an Interpretable Tree-based Surrogate Model for Preferential Bayesian Optimization","url":"https://arxiv.org/abs/2512.14263","vendor":"arxiv_cs_ai"},"summary":"arXiv:2512.14263v2 Announce Type: replace-cross \nAbstract: Preferential Bayesian Optimization (PBO) aims to find a decision-maker's most preferred solution in as few pairwise comparisons as possible. Existing approaches rely on Gaussian Process (GP) surrogates, which provide strong performance but limited interpretability. This limits real-world usability in high-stakes domains, such as healthcare, where interpretability and trust are essential. We propose DT-PBO, a novel tree-based surrogate model for PBO that is inherently interpretable while capturing preference uncertainty. Specifically, we introduce a novel splitting heuristic that constructs interpretable shallow decision trees directly from pairwise comparison data, and use Laplace approximation to obtain probabilistic estimates for each leaf. This enables efficient preference modeling without sacrificing interpretability. Across eight benchmark functions, our method achieves competitive convergence to GP-based PBO, particularly","title":"DT-PBO: an Interpretable Tree-based Surrogate Model for Preferential Bayesian Optimization","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-11T04:43:50Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2512.14263"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:74582aed1ef11c4d7c0313895570cc5c3dd08dc5ffc1c7b2a7319d609431bc31f284204eabaa2a4346473ab343f983c23add01ec931c88ccf64fac05a8827c00","signer":"crovia.substrate","subject":{"observed_at":"2026-05-11T04:43:50Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2512.14263"},"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":"233fb0d3a74d7ef0368681b2ac45f7a252dc95100b63af09241433734930ab32","leaf_index":126656,"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":"08f83b97f790b34bc041932aa81ed60d13f0b7860c27ba5919088d8ce8f2cab4","side":"right"},{"sibling":"91427b6ad7be8085be6ab76c08a55d19d783e5134d59c193c6d56a1b5a7ca3bb","side":"right"},{"sibling":"21ea6dac399e3aa856b964a1d30c08ea43df52c7d8a0563b92b3e2564cb97924","side":"right"},{"sibling":"6abf8923ab1f5e3a7d190054f85875c35decc1fccd1f44a6c26ee24ff7b901b8","side":"right"},{"sibling":"e068a68e8f6b044a9ff48e5d78dff874c769a46e9b104a09322b5f0e04bb89ab","side":"right"},{"sibling":"58aef9591856eb641810d1e156d62e1ae8389c7e9daea4da7a099e8ba39f5bcb","side":"right"},{"sibling":"c884a55932d4cceaac120743551423b0f7bfb9297f0d9ef494f83a195d0b3724","side":"left"},{"sibling":"8145236c073312ace1276c28162c95dcc0d2fd49b8c636293fac87efad823f12","side":"left"},{"sibling":"62d48549e4d4466089a57a96bd9bea15741d62a7cb314f0f9c37c4c22ac650fa","side":"right"},{"sibling":"a2c696699a233359c7b4b418ebd356db453d4b886f4bd076ef34b15ee86144a3","side":"left"},{"sibling":"1a581be91236d1f25e8d47fe5efa0e2b51b7f0f6d706ef76a9093067688e5d56","side":"left"},{"sibling":"878cc30108509c9fa1fc52705a216f519d73b647916fcbdfc30a389934d3364b","side":"left"},{"sibling":"ae7dfff36ba07d9f48c36c28a341482ef244ee13cd0efd49aee2bbef2fd65f87","side":"right"},{"sibling":"62ac6554017807bd83187f5a3e5f4f72d6c482616429c2780e9fff1f4845fa04","side":"left"},{"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_f7dcc20482de27cafceaf2887c79828f657001212c227a075c289c94e4c30164"}}