{"_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_b74f99e83e1b14ce3702670468645dcd4af4edc969a5bada675a18408b745e07","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_b74f99e83e1b14ce3702670468645dcd4af4edc969a5bada675a18408b745e07","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"85b8906fa6c8349391ef08adc3d0e0ed0d79ba38b3e9832129e6d8561b6baccb","published":"Tue, 02 Jun 2026 00:00:00 -0400","receipt_hash":"85b8906fa6c8349391ef08adc3d0e0ed0d79ba38b3e9832129e6d8561b6baccb","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":"85b8906fa6c8349391ef08adc3d0e0ed0d79ba38b3e9832129e6d8561b6baccb","observed_at":"2026-06-02T04:43:38.825628Z","parent_run_hash":"c2a9665c814770d56765bb764e6a6c7e4fa7d4e9708e157ca0f7440c89927d54","published":"Tue, 02 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.02418v1 Announce Type: cross \nAbstract: Quantum LDPC code discovery requires searching large algebraic design spaces while reliably certifying the parameters and equivalence classes of any candidates found. We introduce an LLM-guided evolutionary workflow in which language models mutate Python programs that generate bivariate-bicycle and perturbed bivariate-bicycle code ans\\\"atze. Across five campaigns, the system performed approximately 1{,}650 evolutionary iterations, screened about $2 \\times 10^5$ candidate codes, and required ${\\sim}140$ hours of computation and ${\\sim}$US\\$400 in LLM inference cost. Candidate codes are evaluated through a staged validation pipeline combining $\\mathrm{GF}(2)$ rank computation, distance estimation and certification, mixed-integer linear programming, BLISS Tanner-graph deduplication, decomposability analysis, and local-Clifford equivalence checks. At block length $n \\leq 360$, the workflow identifies 465 distinct candidate codes: 97 CSS bi","title":"Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search","url":"https://arxiv.org/abs/2606.02418","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.02418v1 Announce Type: cross \nAbstract: Quantum LDPC code discovery requires searching large algebraic design spaces while reliably certifying the parameters and equivalence classes of any candidates found. We introduce an LLM-guided evolutionary workflow in which language models mutate Python programs that generate bivariate-bicycle and perturbed bivariate-bicycle code ans\\\"atze. Across five campaigns, the system performed approximately 1{,}650 evolutionary iterations, screened about $2 \\times 10^5$ candidate codes, and required ${\\sim}140$ hours of computation and ${\\sim}$US\\$400 in LLM inference cost. Candidate codes are evaluated through a staged validation pipeline combining $\\mathrm{GF}(2)$ rank computation, distance estimation and certification, mixed-integer linear programming, BLISS Tanner-graph deduplication, decomposability analysis, and local-Clifford equivalence checks. At block length $n \\leq 360$, the workflow identifies 465 distinct candidate codes: 97 CSS bi","title":"Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-02T04: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.02418"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:f09552872cdc706ac5ff3de20758878e59ac3cfe3ffcd61bf784a17bc448042a52f35b4510dd0d41687f7caf5fb7a2b19733b0479f44286bb3b227f2d2e32902","signer":"crovia.substrate","subject":{"observed_at":"2026-06-02T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.02418"},"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":"34201413b20b8b22be2d85f51442751436a1a9b020b677ddf89688a4dd5cd2c4","leaf_index":205720,"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":"6bbd877969af7128b0ab611a9e609f0685a2a0a48239a107e988d3f01bc8924c","side":"right"},{"sibling":"434df7a92703a6fc5df76b13ae8d3c7a7e7e2f26482c7c6f713edea8dd8c1a8a","side":"right"},{"sibling":"47af30440dd4468b2eb9ca0a7b64267325b9e2cb6303e284c8719ea05bd3e782","side":"right"},{"sibling":"9c2c641a961c27328a5486fe6cab97f86806749a3905093c371e29f8576d1630","side":"left"},{"sibling":"f949d460161b5cf4a7fca3457460b6d28d5fc72b5035a83311ccc1608344050b","side":"left"},{"sibling":"45e96947d55f3ddd608538d4be659c6bd714d45eaf11a93f587621b5b7a74755","side":"right"},{"sibling":"661512f011e490d7c936201daf8d427ec94e97cd697634378345b42e508534c4","side":"right"},{"sibling":"f90a21898085db59f0f27c56200706376a54d0bca343ed9e47ede5df384cd547","side":"left"},{"sibling":"21332ee1c3955bf1803955bf945ab0966ce5e0aa48d8642320cdbc044a72b935","side":"left"},{"sibling":"6620a5008acf732cd3e57b0f2d1437293e88366c2e5b175ebeb7d796fc1e0c62","side":"left"},{"sibling":"a82575bfb494af7afcc13aaae718afa6f74030f09d71b02819ea25efd4186fc4","side":"right"},{"sibling":"e6adead8216db4cae92f0a036d53baebf30eed95a99c0d10758aa75bb7780f2f","side":"right"},{"sibling":"1acc2b7ff453ffd8c97b80ae4db5358780f0c6796874fd75403791dbe99f8cd7","side":"right"},{"sibling":"24d1bb4b13e0e46131b27b70a48e65fcf4e2e14b95e3bb83ade821e9df530f6b","side":"left"},{"sibling":"5f86f58c28b1a86ae06dfff4666bb9fba8866021a81fd4f1d200aa9af4722dfb","side":"right"},{"sibling":"f6cc6f94f6944ae21390afc65ac9e91dc31f84ee6e060681bba5ae08058294bd","side":"right"},{"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":206226,"merkle_root":"d2a6d32b13cbf343fb143b21a756d0533864ae6577a376ee84ba867b949207ec","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260602T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-02T05:37:46Z","sig_algorithm":"ed25519","signature":"abd9956cfb19dd1fb8142c46a220bac2514848c6abb0e79b8b0940206cc3ebb00894d4daaf9f786427f82a7cc12482e7fda79054ebb06bceaa9b4b97e23fb30e","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_b74f99e83e1b14ce3702670468645dcd4af4edc969a5bada675a18408b745e07"}}