{"_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_cd5e2dd4ff0bfb8bef10b3c92562eefb6bf21d06986c90495e368fc1d10f0221","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_cd5e2dd4ff0bfb8bef10b3c92562eefb6bf21d06986c90495e368fc1d10f0221","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"1bf8397d85c9b4b8da0433f86ee7d2aa990abf22f0f5a90851e7a09419c74d24","published":"Tue, 12 May 2026 00:00:00 -0400","receipt_hash":"1bf8397d85c9b4b8da0433f86ee7d2aa990abf22f0f5a90851e7a09419c74d24","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":"1bf8397d85c9b4b8da0433f86ee7d2aa990abf22f0f5a90851e7a09419c74d24","observed_at":"2026-05-12T04:43:42.564879Z","parent_run_hash":"4cc5aca0c1b8116c9ab92405e0260204f01cf7ce2e49dea9d7e123236f5dc13b","published":"Tue, 12 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.09112v1 Announce Type: cross \nAbstract: Selecting a coherent sequence or subset of elements is a fundamental problem in structured prediction, arising in tasks such as detection, trajectory forecasting, and representative subset selection. In many such settings, the target is inherently ambiguous: each input admits multiple valid outputs, while supervision provides only a single sampled instance. This induces a mismatch between the underlying multi-modal target distribution and the observed training signal. We propose Contextual Plackett-Luce (CPL), a structured probabilistic model for sequence selection that extends the classical Plackett-Luce model to a context-dependent setting following an Ising-style parameterization with unary and pairwise interaction terms. CPL can be viewed as a hybrid between fully autoregressive prediction and parallel sequence selection: autoregressive models effectively capture uncertainty but are computationally expensive on modern parallel hard","title":"Contextual Plackett-Luce: An Efficient Neural Model for Probabilistic Sequence Selection under Ambiguity","url":"https://arxiv.org/abs/2605.09112","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.09112v1 Announce Type: cross \nAbstract: Selecting a coherent sequence or subset of elements is a fundamental problem in structured prediction, arising in tasks such as detection, trajectory forecasting, and representative subset selection. In many such settings, the target is inherently ambiguous: each input admits multiple valid outputs, while supervision provides only a single sampled instance. This induces a mismatch between the underlying multi-modal target distribution and the observed training signal. We propose Contextual Plackett-Luce (CPL), a structured probabilistic model for sequence selection that extends the classical Plackett-Luce model to a context-dependent setting following an Ising-style parameterization with unary and pairwise interaction terms. CPL can be viewed as a hybrid between fully autoregressive prediction and parallel sequence selection: autoregressive models effectively capture uncertainty but are computationally expensive on modern parallel hard","title":"Contextual Plackett-Luce: An Efficient Neural Model for Probabilistic Sequence Selection under Ambiguity","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-12T04:43:42Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.09112"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:83f17c7a8406e315fbab4217a206e3371196fc303cb7acdb005b3217fc33b1795b77b4244cd5b49632979e7ea318950ab3fee3e0bba6c4614d7f95baeb59040c","signer":"crovia.substrate","subject":{"observed_at":"2026-05-12T04:43:42Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.09112"},"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":"57fe954525465dc95121c4fd1e223bc245a2cb94c04e22c4243ab3f91d7f6158","leaf_index":128664,"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":"7773090ef51876bfc4dddf6289c979aeea120425852a5e19ec261a2998825d76","side":"right"},{"sibling":"4107fc3f9a473dc1b40950eb5700a65823f855e01873cae91206234398ab2f1e","side":"right"},{"sibling":"b6db8a3ebf3112ddf60d52d8a9a2ecf7f964d5f647aeed48c81a3c81eb7d9ee1","side":"right"},{"sibling":"036caf6c679cd629eaac902b31c18fd02eacfee5efc08be0b62bcbdb1b7142ed","side":"left"},{"sibling":"a1842cf7cd3c953a3af97fc90847ef6b6316f39a9173e1038f37ef4544bc4bc7","side":"left"},{"sibling":"dbdc02c17276708d1b8cff713eb66242173fe7727a86c139ab2f58346efa6ad6","side":"right"},{"sibling":"0b6591633a3212977257746858166dde4a12c0138f81b09c09f3ff243f23f3ca","side":"right"},{"sibling":"66ed9d27919b2830cd6c07ec62488d62635d76aad26e26435c6ebbcd12730198","side":"left"},{"sibling":"831b04b4dcc29bcff4577c406291bc4f644057b650a55f064d46d1cab5185326","side":"right"},{"sibling":"1d74b0fb79eace68949b4d82b0e430b1d9eb122c125f67f5be7d50c074c228e7","side":"left"},{"sibling":"c6eaf7a4fcab2db96e9e9423acb6922c80f64882d0f3f50d09e53a4807d23084","side":"left"},{"sibling":"df12eaabc0a370aff5d0488478f48d2b3f90d025c903643f98ea804b017688ec","side":"right"},{"sibling":"ffc4d51379293bc3e1910c7d612f409dc610fd9acf8241793fb89f82e1bad4ef","side":"left"},{"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_cd5e2dd4ff0bfb8bef10b3c92562eefb6bf21d06986c90495e368fc1d10f0221"}}