{"_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_abcb95dd481b5717e32644e869234dec4082391e480f7b2867cd988feb41bdae","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_abcb95dd481b5717e32644e869234dec4082391e480f7b2867cd988feb41bdae","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"2a7aaefa470fcb157cccbb5c7c69d73889bbc9815504d2be01d73ab071e1d6aa","published":"Mon, 25 May 2026 00:00:00 -0400","receipt_hash":"2a7aaefa470fcb157cccbb5c7c69d73889bbc9815504d2be01d73ab071e1d6aa","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":"2a7aaefa470fcb157cccbb5c7c69d73889bbc9815504d2be01d73ab071e1d6aa","observed_at":"2026-05-25T04:43:48.841018Z","parent_run_hash":"56713422f06ad87427cd8cdcdb1ed341feb016b33c37198d9b168328d1df15fb","published":"Mon, 25 May 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:2512.12677v2 Announce Type: replace-cross \nAbstract: We explore efficient strategies to fine-tune decoder-only Large Language Models (LLMs) for downstream text classification under resource constraints. Two approaches are investigated: (1) attaching a classification head to a pre-trained causal LLM and fine-tuning on the task using the LLM's final-token embedding as a sequence representation, and (2) instruction-tuning the LLM in a prompt-to-response format for classification. To enable single-GPU fine-tuning of models up to 8B parameters, we combine 4-bit model quantization with Low-Rank Adaptation (LoRA) for parameter-efficient training. Experiments on two patent benchmarks, a proprietary 5-class single-label corpus and the public WIPO-Alpha multi-label dataset with 14 categories, show that the embedding-based method matches or exceeds the instruction-tuned method on single-label classification while training 10 to 30 times fewer parameters. Instruction-tuning is competitive on","title":"Fine-Tuning Causal LLMs for Text Classification: Embedding-Based vs. Instruction-Based Approaches","url":"https://arxiv.org/abs/2512.12677","vendor":"arxiv_cs_ai"},"summary":"arXiv:2512.12677v2 Announce Type: replace-cross \nAbstract: We explore efficient strategies to fine-tune decoder-only Large Language Models (LLMs) for downstream text classification under resource constraints. Two approaches are investigated: (1) attaching a classification head to a pre-trained causal LLM and fine-tuning on the task using the LLM's final-token embedding as a sequence representation, and (2) instruction-tuning the LLM in a prompt-to-response format for classification. To enable single-GPU fine-tuning of models up to 8B parameters, we combine 4-bit model quantization with Low-Rank Adaptation (LoRA) for parameter-efficient training. Experiments on two patent benchmarks, a proprietary 5-class single-label corpus and the public WIPO-Alpha multi-label dataset with 14 categories, show that the embedding-based method matches or exceeds the instruction-tuned method on single-label classification while training 10 to 30 times fewer parameters. Instruction-tuning is competitive on","title":"Fine-Tuning Causal LLMs for Text Classification: Embedding-Based vs. Instruction-Based Approaches","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-25T04:43:48Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2512.12677"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:eb45574aea53dcd5eec1e9ca0d7b42b6a8f7b125735877f2937cd444b88f0d904ab3fd6bc69041aa890f5deece4f63ea7544dbc47c604bc7805129c6f5f17b0d","signer":"crovia.substrate","subject":{"observed_at":"2026-05-25T04:43:48Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2512.12677"},"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":"be15ffe63e17741e130c8c20711de07d34937990c195385d12061a4a2ebf8791","leaf_index":149713,"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":"5462aad398b976550530472a0a93e54b747f044d7ba884a71686316d19656929","side":"left"},{"sibling":"f7e4297e7742a6117771d7a675488e5a880fd9ad2d5b2f77bd8d92ef7a3f17a0","side":"right"},{"sibling":"abd693001c6502383f3e03917adbbc5ac599d4690a0cbce6b031d109e337bead","side":"right"},{"sibling":"ff3a8a5760373d38c65db26727a8e8c3e13444eb26f295caa23d47781b7855ff","side":"right"},{"sibling":"f37ede63d69322e373080e08eec32185e5627db081893f5e7c4dbaffde7d6166","side":"left"},{"sibling":"71332b767201373a22f07734e56c280aca2f5c4843249e6b798501f1aaebcd42","side":"right"},{"sibling":"9a9dec70c246f07136fd93efad0647d42e469fcfca31c6741dcb1d715bd9ce45","side":"left"},{"sibling":"cb71a04113e54ec457f452a34b2778696e1747afe98ba9da255ce1f5fd8619d7","side":"left"},{"sibling":"e044acc52c31efe134c902c984299ea3452b42df993d096ed61ad8be9d530bbc","side":"right"},{"sibling":"6be461ecf12dedf98a31921aa7b5c32d4a32df6897e0f697b8bf1a4ba3e2d324","side":"right"},{"sibling":"c2861a8cef3eb66bf2726aa377c24a6bf6e8b7489dcd0e870b61d62a35ccadfb","side":"right"},{"sibling":"134949308b15cffd6792ee2cf678119af34d69a64764d7c89cd47573c94e1cda","side":"left"},{"sibling":"debbc1a6232ea7970009b91bdc2345041b2de5ac59551f955855d579001e512c","side":"right"},{"sibling":"216869846f40bd905626884f58cb67b9019e488b3656946a7808c436ab7339ac","side":"right"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"e734b0c6d6d13acb5f4cf00367b3913e5bbf1aa717377aa4e4820c6de24b7673","side":"right"},{"sibling":"4bbb7f78e96179bb9cdd06d7207b66b3503ab68e4880438263025b04ebe8f7ec","side":"right"},{"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":149835,"merkle_root":"51484a548bc0cf3d178eec868e98935c87f0aa83369143b7c96b048585e5ba01","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260525T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-25T05:37:33Z","sig_algorithm":"ed25519","signature":"99a657e53a015ace0bade5d7fbb3f60f950b6d1e1128251a63afcc454a492422cae5efdc0c18503b4f7e62f371bd48f2889be78d9048c4681d6c1e73f754d705","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_abcb95dd481b5717e32644e869234dec4082391e480f7b2867cd988feb41bdae"}}