{"_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_43df79b268baf5acd1cdd67daaa8e0c73289b4a53175ad055ddfc60fad208a75","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_43df79b268baf5acd1cdd67daaa8e0c73289b4a53175ad055ddfc60fad208a75","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"39f78229f1c4ea19a3f2ed0addf6c51dd85980505a376e9f9eec750b5ee82e2d","published":"Wed, 15 Jul 2026 00:00:00 -0400","receipt_hash":"39f78229f1c4ea19a3f2ed0addf6c51dd85980505a376e9f9eec750b5ee82e2d","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":"39f78229f1c4ea19a3f2ed0addf6c51dd85980505a376e9f9eec750b5ee82e2d","observed_at":"2026-07-15T04:44:03.592429Z","parent_run_hash":"d49a6cf532e74153266f377b7760fc948d950d80ed41fc3e3eb82b58f5597ead","published":"Wed, 15 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:2606.10829v2 Announce Type: replace-cross \nAbstract: Masked diffusion language models can reduce inference steps by revealing multiple tokens per denoising iteration, but this parallelism is fragile: positions that are individually confident may be unsafe to commit together when their predictions are coupled. Existing training-free samplers such as Top-\\(k\\), Fast-dLLM, and EB-Sampler mainly control how many tokens to reveal, while often ranking candidates by token-wise scores that ignore interactions within the selected set. We propose ADAS, a training-free reranking rule for parallel masked diffusion decoding. ADAS leaves the base sampler's stopping rule unchanged and modifies only subset construction: it greedily discounts a candidate when it attends strongly to already selected positions whose predictions remain uncertain. Unlike graph-constrained methods that turn attention into hard compatibility constraints, ADAS keeps attention continuous and uses it as a soft marginal pe","title":"Attention-Discounted Adaptive Sampler for Masked Diffusion Language Models","url":"https://arxiv.org/abs/2606.10829","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.10829v2 Announce Type: replace-cross \nAbstract: Masked diffusion language models can reduce inference steps by revealing multiple tokens per denoising iteration, but this parallelism is fragile: positions that are individually confident may be unsafe to commit together when their predictions are coupled. Existing training-free samplers such as Top-\\(k\\), Fast-dLLM, and EB-Sampler mainly control how many tokens to reveal, while often ranking candidates by token-wise scores that ignore interactions within the selected set. We propose ADAS, a training-free reranking rule for parallel masked diffusion decoding. ADAS leaves the base sampler's stopping rule unchanged and modifies only subset construction: it greedily discounts a candidate when it attends strongly to already selected positions whose predictions remain uncertain. Unlike graph-constrained methods that turn attention into hard compatibility constraints, ADAS keeps attention continuous and uses it as a soft marginal pe","title":"Attention-Discounted Adaptive Sampler for Masked Diffusion Language Models","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-15T04:44:03Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.10829"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:413457526fd753d0f11cea001ea35b19ccc06c501c7d52c6579e01d28ff02e842b81b0180e8570277db28c0a8890e44f60250947bb750d69f8d5d65ab11c9a0d","signer":"crovia.substrate","subject":{"observed_at":"2026-07-15T04:44:03Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.10829"},"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":"0511b6cbe41658a2a336ffc725b9942ba4d4398b16758632c0a70147774fb7b0","leaf_index":316582,"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":"4780a9d6344660201b788d3ce87878bfac13f2cb4787c171df48adfbd2d030ec","side":"right"},{"sibling":"439f31ce3c059c07ef6ca1964930f2dea63f19b8ed947761e32490e638b33e14","side":"left"},{"sibling":"8cc3fc5f1db370bd5eae0f98a90f1e371521cf92d608c7627cb200f2d5c51576","side":"left"},{"sibling":"a60a5c5af4197669cf795600cc3953e5d68d69f008128bac5f47de2c8b9795c9","side":"right"},{"sibling":"8a5d8846572d862e34028b57089bd7381aeabdaccd632e8e4a8e118f5129fa7d","side":"right"},{"sibling":"fc5fe414d03440bed7aa3c8fdd956b2cb0a844eb7ddc3f58126f36dc3900245e","side":"left"},{"sibling":"33661ca420513ca9092e711309245c4602733fe2714484fedf48cb9c8664fd0e","side":"right"},{"sibling":"af39fefe9ccf50e1288b21fab97d8bc62d8495b7dbe9a55a9ffa363740e34285","side":"left"},{"sibling":"1c7f1bf97993e3a126824f8350788b168c4c13264fb03a73b3ede312035d3527","side":"right"},{"sibling":"84a7590e6b24dd07ed46597f19deb75d9ad247b4227b17f30857ec7cc0fc5c21","side":"right"},{"sibling":"c8d3d8cb0183b912107f9781ad2a1b6c0c9424906c5907c09deeb5bea9d7b571","side":"left"},{"sibling":"0cb62c0ada57a2406a6bcb100889d3e8b29a15efeed07adaff5bb90a5e80612a","side":"right"},{"sibling":"0b69289b25462ddd6166f6f49004cfc8ada0ab4f10adafe188347817bdd46e37","side":"left"},{"sibling":"1418b281cd985b5ed411ef25f2017a1826cc14919b6fad3934e6ceeec693699b","side":"right"},{"sibling":"f302542c38ba7c3aab7c9280dd60259ecec777dca6e6f71b6f0729b0b8791b72","side":"left"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"abe4a8c706e530484d1e96a8988cb09eab85928b2050985500ab289753fe3eec","side":"right"},{"sibling":"f436dccf82aa2c1eb7bfa3eb84316e116aaf64dc55cd9592597118f6cb0648f6","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":316730,"merkle_root":"a8e6e5be81ea6f5b5f2227422459bf39455fe9f0b6602b4d1ce6977dbfd78bc7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260715T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-15T05:38:24Z","sig_algorithm":"ed25519","signature":"df1678d268b5a07413e2ca6e748c3f40b6cfedea930a18d843489a4ab513da791bf0a886caab1b918d0989f8ebaaf3d0035ca2aa777913b1ad29979f1deb9a0c","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_43df79b268baf5acd1cdd67daaa8e0c73289b4a53175ad055ddfc60fad208a75"}}