{"_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_2bf450234f1be62e7248c225a941ab4f39dff99ea83be29911044b12209f2174","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_2bf450234f1be62e7248c225a941ab4f39dff99ea83be29911044b12209f2174","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"91277482a01f05b6431cd711e74ccc3af41b4ab868d4a6062a8be36caa8b5969","published":"Mon, 29 Jun 2026 00:00:00 -0400","receipt_hash":"91277482a01f05b6431cd711e74ccc3af41b4ab868d4a6062a8be36caa8b5969","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":"91277482a01f05b6431cd711e74ccc3af41b4ab868d4a6062a8be36caa8b5969","observed_at":"2026-06-29T04:44:03.414425Z","parent_run_hash":"36b5ab5c57ae76dc9e1a863501c4d38f172868cfae31b4ba5baf3caffaafb2c4","published":"Mon, 29 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.27939v1 Announce Type: cross \nAbstract: Protein language models are standard priors for biological sequence generation, but steering them toward explicit distributional design targets remains largely unexplored. We study a constrained protein generation problem in which sequences must match a desired amino-acid (AA) composition profile while preserving plausible sequence statistics and diversity. The motivating application is synthetic feed protein design, where the AA composition of dietary proteins directly determines their nutritional value. We propose a two-stage pipeline in which domain-adaptive fine-tuning (FT) on an in-domain protein dataset is followed by iterative reward-weighted FT via reinforcement learning (RL) anchored against the FT model as a frozen reference. We evaluate the pipeline on two AA compositions and find that FT brings the average composition close to the target, while the subsequent RL enforces specific sequence constraints that FT alone cannot sa","title":"Two-Stage Fine-Tuning for Protein Sequence Generation with Targeted Amino-Acid Composition","url":"https://arxiv.org/abs/2606.27939","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.27939v1 Announce Type: cross \nAbstract: Protein language models are standard priors for biological sequence generation, but steering them toward explicit distributional design targets remains largely unexplored. We study a constrained protein generation problem in which sequences must match a desired amino-acid (AA) composition profile while preserving plausible sequence statistics and diversity. The motivating application is synthetic feed protein design, where the AA composition of dietary proteins directly determines their nutritional value. We propose a two-stage pipeline in which domain-adaptive fine-tuning (FT) on an in-domain protein dataset is followed by iterative reward-weighted FT via reinforcement learning (RL) anchored against the FT model as a frozen reference. We evaluate the pipeline on two AA compositions and find that FT brings the average composition close to the target, while the subsequent RL enforces specific sequence constraints that FT alone cannot sa","title":"Two-Stage Fine-Tuning for Protein Sequence Generation with Targeted Amino-Acid Composition","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-29T04: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.27939"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:636f1c1d5b83937e5eb1cc6161c28592747bfc203f35aa073f59fc9997f1d067964521ff23e72eb87f10a32d21c44a875b010b34f1c7020d3b9486a066da5b0f","signer":"crovia.substrate","subject":{"observed_at":"2026-06-29T04:44:03Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.27939"},"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":"4b173f90cc232da54418e8f975a04cb7cab20c268653124cfde582ede61aeb93","leaf_index":261406,"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":"cda595577b85da422563e6481d38ab3b5ecb2dc532df74d1445fbe6dc5fd8b8d","side":"right"},{"sibling":"52a52824440c8dbd12132c2fe4884d3f6b0e4b086f5ac89eea37b55a1f32fad9","side":"left"},{"sibling":"56c54bdb9007c46f0aee77697a8a9bd44e770430e3457062a884f3fbd223f090","side":"left"},{"sibling":"d2f14df0219c0ce92f2e7488c923865359c2896d2e7282aa96fe840d2e037de6","side":"left"},{"sibling":"e67971211d8fb4d42082e567d811e52c51a123210399c1f44052196149b09167","side":"left"},{"sibling":"387418df4d0fbb0c1d5a9c5d2f863bae723a6196cfb15782c9a0d7d4c7874571","side":"right"},{"sibling":"f598b90b37d7f9301fa045df6c69e9936b54d84361d68c339f86d13ecd08335e","side":"right"},{"sibling":"4b4bda5fa1fb23989b8f6f192c36dadc8266c378c69d42945af35c9d6ab81a10","side":"right"},{"sibling":"6d1df65d14253ed3a13c03e25aa9adcd9a091d8062a82e8586bcaee74013b90e","side":"left"},{"sibling":"9f9daa9d12e65b219f34c92aec45450536b79a42b8892050d66961432ae28ed1","side":"right"},{"sibling":"b5725d7b0807dc6da32d9788f20057fa8726be38d30a9ebdabc605ae92739122","side":"left"},{"sibling":"e321b2cac14cbe28f76ccb7938249a40ff60cd5d2128b5634be046ea10e984b8","side":"left"},{"sibling":"5900dc6c7d13855af9d0385baf1691ec386df33e450c422af1cabe0a36e40ad8","side":"left"},{"sibling":"ae636ddee98c71ab7a7dc55ddfab70c7f710a2b6abfdf7a8b5d16a4017d1c0d1","side":"left"},{"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":261662,"merkle_root":"aa8865c239aa2eb6c8aa7c6250f56b3cd5709854a8a07f6a29eb4ddd8802cb6f","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260629T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-29T05:38:02Z","sig_algorithm":"ed25519","signature":"476329233e82fb35fba2552ddc5d1d75b2bdd8513bbd281e9c40a0b8e475df374a62dcd8b456b0c5e8815984f5b4bf0983ae95d2cf4d7412ebb13a433b933c0a","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_2bf450234f1be62e7248c225a941ab4f39dff99ea83be29911044b12209f2174"}}