{"_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_00679ae7bdd2be89aaae8b824820855c0ce8331e06a7958e3e43d4f819ca816f","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_00679ae7bdd2be89aaae8b824820855c0ce8331e06a7958e3e43d4f819ca816f","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"bbc93077932cd74fa97c934b2a2c64f0d858ec32855f9ef257caf27485cc70c9","published":"Thu, 25 Jun 2026 00:00:00 -0400","receipt_hash":"bbc93077932cd74fa97c934b2a2c64f0d858ec32855f9ef257caf27485cc70c9","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":"bbc93077932cd74fa97c934b2a2c64f0d858ec32855f9ef257caf27485cc70c9","observed_at":"2026-06-25T04:43:18.326769Z","parent_run_hash":"e8910cfae99fbdf5440a4f98691981c67edafcd7a0c47d48b244550cbfb5df92","published":"Thu, 25 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.23758v2 Announce Type: cross \nAbstract: Domain generalization learns from multiple source domains to generalize to unseen target domains. However, it often neglects the realistic case of label mismatch between source and target. Open set domain generalization is then proposed to recognize unseen classes in unseen domains. A simple approach trains one-vs-all classifiers to separate each class and detect outliers as unknown. Yet, the imbalance between few positive samples and many negative samples skews the decision boundary towards the positive ones, leading the model to over-reject out-of-distribution data, even from known classes in unseen domains. In this paper, we propose a novel meta-learning stategy called dualistic MEta-learning with joint DomaIn-Class matching (MEDIC), which considers implicit gradient matching towards inter-domain and inter-class task splits simultaneously to find optimal boundaries balanced for both domains and classes. Experimental results show tha","title":"Exploring Dualistic Meta-Learning to Enhance Domain Generalization in Open Set Scenarios","url":"https://arxiv.org/abs/2606.23758","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.23758v2 Announce Type: cross \nAbstract: Domain generalization learns from multiple source domains to generalize to unseen target domains. However, it often neglects the realistic case of label mismatch between source and target. Open set domain generalization is then proposed to recognize unseen classes in unseen domains. A simple approach trains one-vs-all classifiers to separate each class and detect outliers as unknown. Yet, the imbalance between few positive samples and many negative samples skews the decision boundary towards the positive ones, leading the model to over-reject out-of-distribution data, even from known classes in unseen domains. In this paper, we propose a novel meta-learning stategy called dualistic MEta-learning with joint DomaIn-Class matching (MEDIC), which considers implicit gradient matching towards inter-domain and inter-class task splits simultaneously to find optimal boundaries balanced for both domains and classes. Experimental results show tha","title":"Exploring Dualistic Meta-Learning to Enhance Domain Generalization in Open Set Scenarios","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-25T04: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/2606.23758"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:01ac16155eb98d4d8f84ee4a5183f101c015c57b899b95179a4c912129e9d95a537054379bd5bb723a10e155e0be75f1595e65d84138cf078bedfe930a8bec09","signer":"crovia.substrate","subject":{"observed_at":"2026-06-25T04:43:18Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.23758"},"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":"87a83f90a1327cd8d38bc9516f544d022dae0b5026cdb3b69eda54e0bb053696","leaf_index":247843,"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":"ba9315078f3441ca520b196106b20d6890e0065cd85a3303b567a84d32cde28a","side":"left"},{"sibling":"796f3534314b284cdc8a7767c1efea48a7639dd96ebdfff920159aac8b7a6bf2","side":"left"},{"sibling":"3bd32002bd67e01d26b5bc169acb05126729632287df3de3f6ae1a4862b1e6f6","side":"right"},{"sibling":"03ecebee352f245ab299f985b210c8c2c270d6840180865304f1c57a4eaaf87d","side":"right"},{"sibling":"9bcc1176e8d06ce6b48b92c7d8ac044a262c3ee8330592f466f39ee83f2b0db3","side":"right"},{"sibling":"d33d18ee6cc0c0a6a7604d918ab58d8868ed3e15a04c09d43e2f848c868f5e10","side":"left"},{"sibling":"04a5c087236178759d3641ae7a1f98c0237df27d3d245fa7f71cf83152e32896","side":"right"},{"sibling":"fd34dc262155fc820e683457e43a9a6ac4780d0d7acb55f8d250d6e34aac8216","side":"right"},{"sibling":"f1c209527e17fd1779db287808faab24759e4b119a0e00ac51b324128a47a586","side":"right"},{"sibling":"226eeefd4cac26b47f78a3ae7a84464ec61c8205c66c49d5a9780b83bb825fd9","side":"right"},{"sibling":"e3ba8de06c3c9f3ea70673a489a43265543dfe39b4f01afe43d581595abd7e34","side":"right"},{"sibling":"9a57f22647669db8e28640321fc83b219f5cc05f2a0fcee88bab0d42e2faddb0","side":"left"},{"sibling":"6219fab7afd19931e9188a852632b1af418f54d61e1a6fe0cb9d97b90c14bf46","side":"right"},{"sibling":"97afca3ebbdf205d326753e72068db4b0374a2039fe0e70ff3c5117bce4ab7c8","side":"right"},{"sibling":"f29798d8bb6aa9900eab878992d9ff0c53266debd87472f31ab26a6a3fb55880","side":"left"},{"sibling":"a04392fb9f2a3a620840e3b3fecd93d12e6d224e481c162389d8ae64e7194599","side":"left"},{"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":247965,"merkle_root":"299142d480db2505acbf846802bce5a37d0de0218cf8f6a5483cf3ea85b97b86","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260625T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-25T05:37:55Z","sig_algorithm":"ed25519","signature":"05cc2e29ee1d5a741ff8f5b8ada11d63dfd94be9656249e36743f9add842801fc5051869e97eb7850ca7dd0c6d01cdd65410cc153fe65978b6f6da99ad19c60b","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_00679ae7bdd2be89aaae8b824820855c0ce8331e06a7958e3e43d4f819ca816f"}}