{"_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_7df9aa6afc2823c9b482be8aa38d3e0523de952e9a53299222c23921660912e3","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_7df9aa6afc2823c9b482be8aa38d3e0523de952e9a53299222c23921660912e3","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"a61fdead9f2f8b3129b8eefeb66d815c241006b0e8d42c0ae225aa7696f6656b","published":"Thu, 09 Jul 2026 00:00:00 -0400","receipt_hash":"a61fdead9f2f8b3129b8eefeb66d815c241006b0e8d42c0ae225aa7696f6656b","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":"a61fdead9f2f8b3129b8eefeb66d815c241006b0e8d42c0ae225aa7696f6656b","observed_at":"2026-07-09T04:43:38.345231Z","parent_run_hash":"3e22c7c40abc4d94232acf1766a43492b8b8d51d10a58f1109535988a16554e6","published":"Thu, 09 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.06133v3 Announce Type: replace-cross \nAbstract: TLA+ is a formal specification language for verifying distributed systems and safety-critical protocols. Large language models (LLMs) frequently produce TLA+ specifications that fail the TLC model checker for semantic reasons. Across 25 LLMs, the best public baseline is 26.6% syntactic parse and 8.6% semantic model-check. We present TLA-Prover, a 20-billion-parameter model for TLA+ specification synthesis. Training combines supervised fine-tuning (SFT) on verified examples with repair-based group-relative policy optimization (GRPO). In the GRPO stage, the model learns to fix its own rejected specifications. We also train a direct preference optimization (DPO) variant from the same SFT checkpoint as an ablation. TLC provides the reward signal directly, with no learned reward model. Four tiers grade each output: Bronze (parses), Silver (no warnings), Gold (passes TLC), and Diamond. To reach Diamond, the model's correctness proper","title":"TLA-Prover: Verifiable TLA+ Specification Synthesis via Preference-Optimized Low-Rank Adaptation","url":"https://arxiv.org/abs/2606.06133","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.06133v3 Announce Type: replace-cross \nAbstract: TLA+ is a formal specification language for verifying distributed systems and safety-critical protocols. Large language models (LLMs) frequently produce TLA+ specifications that fail the TLC model checker for semantic reasons. Across 25 LLMs, the best public baseline is 26.6% syntactic parse and 8.6% semantic model-check. We present TLA-Prover, a 20-billion-parameter model for TLA+ specification synthesis. Training combines supervised fine-tuning (SFT) on verified examples with repair-based group-relative policy optimization (GRPO). In the GRPO stage, the model learns to fix its own rejected specifications. We also train a direct preference optimization (DPO) variant from the same SFT checkpoint as an ablation. TLC provides the reward signal directly, with no learned reward model. Four tiers grade each output: Bronze (parses), Silver (no warnings), Gold (passes TLC), and Diamond. To reach Diamond, the model's correctness proper","title":"TLA-Prover: Verifiable TLA+ Specification Synthesis via Preference-Optimized Low-Rank Adaptation","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-09T04: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/2606.06133"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:a9bf9d4d3df505fe30f64b37a22b2239623b0e44c174ae27c0f6e2d0040203266a44e4bb31a6ce6f9c4b54d2514374efa5b2136463e42c214afe3dd46ea09809","signer":"crovia.substrate","subject":{"observed_at":"2026-07-09T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.06133"},"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":"412a2ce8b3be65fb22a225c4014e0e53a52747d15530263d84218bdc16d99e44","leaf_index":296221,"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":"9a72bac57ffec334572d95c2937ed6c6bdf9c13a17442a8309599ee11d12b339","side":"left"},{"sibling":"e6bdb5212539c179d3daeb38a155a39a391be732ce20a51c2c58aae1edddf930","side":"right"},{"sibling":"59c8d3ef4fe81088c81337bb543517d0b23118355105c9476a909a3397c1a954","side":"left"},{"sibling":"30c8be3ae00624494da2ed705e81aeb8544098aa5fcf1b3e54e5ad8402034d45","side":"left"},{"sibling":"5c9fbc19fe892d8ad69e3c5688f0e00359ed28a51ca96d7af8ac68a46b4611e6","side":"left"},{"sibling":"ace5a3f2050e78da7dd2955ab530824f2a9340695d4197907b0a394fdec55cff","side":"right"},{"sibling":"c1193f457d0e7dce4ce89a015613466e62a77899d32cead956eebabef151ea39","side":"right"},{"sibling":"eecf5c0fb9ff7f19cf2016a2e611cc319e1bc910d0ece4f3db0063057b173a3a","side":"right"},{"sibling":"5bce7a29b5c407f5c9394caba7039b9f154bb72c56823211779a518e91e5dca7","side":"left"},{"sibling":"92bb57de69c78fd32ac7108b10d81676c184265a5a53de3c4b22d8cf3b54b499","side":"right"},{"sibling":"85a226efd14acc17835b04bc26706fa44595edbd531f194faf59f60ab72d4bb8","side":"left"},{"sibling":"da38b05536b12aee196b6ac988739211c257d32da790faccf5ac4b0cbc1bb15c","side":"right"},{"sibling":"d438dc3eddb0b14dc8b97cd021a4f44545ce5a8e827f3ea4044fd32b1877475e","side":"right"},{"sibling":"f73ad10346837ae47f59f0647f79b9416e1d499bf2b90af44448e7f09372200a","side":"right"},{"sibling":"bdc09902fcd434c0f7d3e680bf550e560777228c0b085ce80c637ce97fc4104c","side":"right"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"ba603dffe985ef518e3a72793a3eaca83a7f1a79e5491fd0f62f421339f2d137","side":"right"},{"sibling":"be20b90931f0a14e3558ea4387537200fcbd14e019b3c5ed07a2ae4c62fc7c42","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":296360,"merkle_root":"64af62f723a5bc02adfa98b77e2006fc634de4ebf68626694f052342a200bea2","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260709T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-09T05:38:18Z","sig_algorithm":"ed25519","signature":"92ece7411e0d82898aac164e7d6573a6d0f7a595aad0780d710d873e548a061d2a8678cef4d237d3bf0eabe0a5f766b41cbc0b4bada2801e7532026291b4a309","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_7df9aa6afc2823c9b482be8aa38d3e0523de952e9a53299222c23921660912e3"}}