{"_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_2f4efcf0917623e1ab92e726d8f055fb7464a688d27b0c1b2df019a9c2664b04","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_2f4efcf0917623e1ab92e726d8f055fb7464a688d27b0c1b2df019a9c2664b04","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"793e20ae019b7743fe1554ade58aeb393a0dc2050a82a953cd0c3e3eb89b195c","published":"Fri, 03 Jul 2026 00:00:00 -0400","receipt_hash":"793e20ae019b7743fe1554ade58aeb393a0dc2050a82a953cd0c3e3eb89b195c","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":"793e20ae019b7743fe1554ade58aeb393a0dc2050a82a953cd0c3e3eb89b195c","observed_at":"2026-07-03T04:43:38.241623Z","parent_run_hash":"f0e30469786257a5e74170498cacb4c028623bf32d6d06d4dbadc488960545be","published":"Fri, 03 Jul 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:2603.29466v2 Announce Type: replace-cross \nAbstract: Existing methods for quantifying predictive uncertainty in neural networks are either computationally intractable for large language models or require access to training data that is typically unavailable. We derive a lightweight alternative through two approximations: a first-order Taylor expansion that expresses uncertainty in terms of the gradient of the prediction and the parameter covariance, and an isotropy assumption on the parameter covariance. Together, these yield epistemic uncertainty as the squared gradient norm and aleatoric uncertainty as the Bernoulli variance of the point prediction, from a single forward-backward pass through an unmodified pretrained model. We justify the isotropy assumption by showing that covariance estimates built from non-training data introduce structured distortions that isotropic covariance avoids, and that theoretical results on the spectral properties of large networks support the appr","title":"An Isotropic Approach to Efficient Uncertainty Quantification with Gradient Norms","url":"https://arxiv.org/abs/2603.29466","vendor":"arxiv_cs_ai"},"summary":"arXiv:2603.29466v2 Announce Type: replace-cross \nAbstract: Existing methods for quantifying predictive uncertainty in neural networks are either computationally intractable for large language models or require access to training data that is typically unavailable. We derive a lightweight alternative through two approximations: a first-order Taylor expansion that expresses uncertainty in terms of the gradient of the prediction and the parameter covariance, and an isotropy assumption on the parameter covariance. Together, these yield epistemic uncertainty as the squared gradient norm and aleatoric uncertainty as the Bernoulli variance of the point prediction, from a single forward-backward pass through an unmodified pretrained model. We justify the isotropy assumption by showing that covariance estimates built from non-training data introduce structured distortions that isotropic covariance avoids, and that theoretical results on the spectral properties of large networks support the appr","title":"An Isotropic Approach to Efficient Uncertainty Quantification with Gradient Norms","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-03T04:43:38Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2603.29466"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:e7c36d774c9a7b25fd793d7fb5fd3b1ff5edd50e11c50c2781c3089dc917696e8713f064d36366af39a684bc577bf1c61231bb5f7a3c4076ce293de7b335e80f","signer":"crovia.substrate","subject":{"observed_at":"2026-07-03T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2603.29466"},"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":"7d1059740a8725e5f0b9cfd0914fd036fe9c5e7cb476f716f73739cbb05bab12","leaf_index":275641,"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":"1f60455f116eb45d69faa9d3fed398407757b425ea0e5ade2d763bae9ee9ef08","side":"left"},{"sibling":"bf3f1ad452fe2aa0abbcd92413d96ca85cf6915df98bdc5a0f37d6cfaa1f707e","side":"right"},{"sibling":"bea47d126eb65f69c6ce61559dbde99b2fd87d4cddf2bb95292a9a99a44532aa","side":"right"},{"sibling":"4aa0e7c9734c9b17722ea4b499e19be5d9b7e5630d65cb03c55b4bb2887c0ad2","side":"left"},{"sibling":"a1414f5d3ab48b4b4335b66eb85c697fbd101b54a531efc0e848acc15df892f2","side":"left"},{"sibling":"70311759d2897e01a75ede5f18a94359cd6c4874c1f0ab122df71f10f93803ed","side":"left"},{"sibling":"f6a5a8b52c3636e3fd86258ae07a123a1b57c4c71568f8f17e2a762f7d9ee809","side":"right"},{"sibling":"afd7390845185d24208014fda1eda02563e823c07b9f4ce03d1011344ff5e6f8","side":"left"},{"sibling":"da9343635b180d3ddf07636b2a7814fcbf809adc1979958fa092ef6d16ef0db5","side":"right"},{"sibling":"1685b068d9bba0447845c97429c2a9ba728526abe2dc9d9522fed7b13d6620e4","side":"right"},{"sibling":"cf1e47b22a12b71fda307cbe1b98bc247fa4226ac8691ca8d99e6cc72a905b34","side":"left"},{"sibling":"4dbd8247ba08a5432c7d6540711da9acb2f59e6189865aa8552dee37f69286a9","side":"right"},{"sibling":"41cd1885dc3fcb51e49eeb887d6d22ec2cfa58df0e4f8d7c7dddf3a1b0ce8249","side":"left"},{"sibling":"8a09562f6b247c1c3cd1fea36cb3b8f1cf5c575479dd514573856a380a964bf5","side":"left"},{"sibling":"723981908169653ca6d835aa9b8381a8c7ad3e3e3830d0792bc32032cda615ee","side":"right"},{"sibling":"c0594fa1ee81d5f019cccc7b5e51af603c6d7e43995498c451012060c7d06165","side":"right"},{"sibling":"4de6a2fb22efbb50c84dc62abeb0f2cbc8c663a9540aeba9e758ebfdfe3e86dd","side":"right"},{"sibling":"fdbb3519f8dc411a4043dfb5abdbfea5441e130326183ac2247c42584033f152","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","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":275799,"merkle_root":"2581d0d6e5fa345cdf2e8ab3b191ace76d6b14189901ab0e4c2291ca1d1ae1e6","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260703T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-03T05:38:09Z","sig_algorithm":"ed25519","signature":"e44a386a5ae00c0e7fc67b1179bb9060bf0fefc006e454fec70e27668182ff497d1e2faf0c3b22de0917beefb7c80e880dae925a3f67e1b16aa0eb44bf947407","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_2f4efcf0917623e1ab92e726d8f055fb7464a688d27b0c1b2df019a9c2664b04"}}