{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:X2JYNWFRYFMCLXUJIMEAYMIX3W","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8031b6665235fc680f95632ca5c87887a17cce1bf392d2648f25b94fa12c2a2e","cross_cats_sorted":["cs.AI","cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T16:59:08Z","title_canon_sha256":"e0277699b7816b67d0ceeee250c51ad2c286bd506f299ad6c65f04ba607113ea"},"schema_version":"1.0","source":{"id":"2605.13779","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13779","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13779v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13779","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"X2JYNWFRYFMC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"X2JYNWFRYFMCLXUJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"X2JYNWFR","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:9dbcdc09199340e01b648e3a1dcb60a9aab4805e2b7f63a4849918d70b984dfa","target":"graph","created_at":"2026-05-18T02:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"MinT thus manages million-scale LoRA policy catalogs while training and serving selected adapter revisions over shared 1T-class base models."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the distributed training, serving, scheduling, and data movement can be effectively hidden behind a service interface without introducing unacceptable latency or resource contention at the claimed scales of 1T parameters and million-scale catalogs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MinT enables efficient management of million-scale LoRA-adapted LLM policies over shared 1T-parameter base models by moving only small adapters through training and serving pipelines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MinT manages million-scale LoRA policy catalogs by training and serving only small adapter revisions over shared 1T-class base models."}],"snapshot_sha256":"bb050f1857f7640a11d9ce695b1627fbaa6e4e1c6c0951889101a605a0742723"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"795302ce20aa07e683ffd3bfa66bf9dd0ebf49c7eff128f2f1863017a7641bb2"},"paper":{"abstract_excerpt":"We present MindLab Toolkit (MinT), a managed infrastructure system for Low-Rank Adaptation (LoRA) post-training and online serving. MinT targets a setting where many trained policies are produced over a small number of expensive base-model deployments. Instead of materializing each policy as a merged full checkpoint, MinT keeps the base model resident and moves exported LoRA adapter revisions through rollout, update, export, evaluation, serving, and rollback, hiding distributed training, serving, scheduling, and data movement behind a service interface. MinT scales this path along three axes. ","authors_text":"Aaron Guan, Ada Zhou, Alexy Li, Andrew Chen, Andrew Lei, Anson Qiu, Anya Zhang, Arthur Fu, Carrie Ye, Changhai Zhou, Charles Huang, Cleon Cheng, Danney Zeng, Di Zhang, Fancy Kong, Hailee Hou, Hera Feng, Hongquan Gu, Huan Feng, Irvine Lu, Jiayi Lin, Josh Ying, Jun Gao, Kaijie Chen, Kairus Liu, Kaixuan Fan, Kieran Liu, Kyrie Lei, Logan Liu, Lucian Li, Maeve Luo, Maxwell Yao, Miles Jiang, Mind Lab: Song Cao, Murphy Zhuang, Mutian Hong, Nolan Ho, Nora Jiang, Peixuan Hua, Pony Ma, Qiuyu Jin, Ray Li, Regis Ye, Rio Yang, Ruijia Zhang, Runze Lv, Steven Chiang, Sueky Zhang, Theo Li, Verity Niu, Vic Cao, Vincent Wang, Wei Zhao, Wenlin Ye, Xiang Liu, Xinyue Zhu, Ya Zhang, Yuhan Zhan, Yuhua Zhou, Yuyi Jiang, Zhihui Li","cross_cats":["cs.AI","cs.DC"],"headline":"MinT manages million-scale LoRA policy catalogs by training and serving only small adapter revisions over shared 1T-class base models.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T16:59:08Z","title":"MinT: Managed Infrastructure for Training and Serving Millions of LLMs"},"references":{"count":35,"internal_anchors":12,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Accessed 2026-05. Anthropic. Measuring AI agent autonomy in practice. Anthropic research,","work_id":"c8b3ecf3-dde9-4b27-85f8-cfb99d0eb856","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Asyncflow: An asynchronous streaming rl framework for efficient llm post-training.arXiv preprint arXiv:2507.01663","work_id":"c78dd69f-0c92-450b-8e2b-dec1ded07146","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Punica: Multi-tenant lora serving","work_id":"386bb921-3eb0-430c-ac00-52caf69c39f5","year":2026},{"cited_arxiv_id":"2305.14314","doi":"","is_internal_anchor":true,"ref_index":4,"title":"QLoRA: Efficient Finetuning of Quantized LLMs","work_id":"d3fdf68e-3a5e-48b5-8a18-7a9137479c55","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Lawbench: Benchmarking legal knowledge of large language models","work_id":"fed58630-7041-41f3-801d-daf80d1ddc46","year":null}],"snapshot_sha256":"36014f7ba0dc86d7e687f314b72f6ad9168589c1b1e465b9bbccb67dcab961c8"},"source":{"id":"2605.13779","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:21:06.133261Z","id":"c2088492-9fa8-4236-ab31-0018e00c0f4a","model_set":{"reader":"grok-4.3"},"one_line_summary":"MinT enables efficient management of million-scale LoRA-adapted LLM policies over shared 1T-parameter base models by moving only small adapters through training and serving pipelines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"MinT manages million-scale LoRA policy catalogs by training and serving only small adapter revisions over shared 1T-class base models.","strongest_claim":"MinT thus manages million-scale LoRA policy catalogs while training and serving selected adapter revisions over shared 1T-class base models.","weakest_assumption":"That the distributed training, serving, scheduling, and data movement can be effectively hidden behind a service interface without introducing unacceptable latency or resource contention at the claimed scales of 1T parameters and million-scale catalogs."}},"verdict_id":"c2088492-9fa8-4236-ab31-0018e00c0f4a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d047c352b11525975eb18c2cd0521e122d8ba344cf974f9267496eefe394f8a","target":"record","created_at":"2026-05-18T02:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8031b6665235fc680f95632ca5c87887a17cce1bf392d2648f25b94fa12c2a2e","cross_cats_sorted":["cs.AI","cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T16:59:08Z","title_canon_sha256":"e0277699b7816b67d0ceeee250c51ad2c286bd506f299ad6c65f04ba607113ea"},"schema_version":"1.0","source":{"id":"2605.13779","kind":"arxiv","version":1}},"canonical_sha256":"be9386d8b1c15825de8943080c3117ddb7e3bce73527482991a0a31f4980b8a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be9386d8b1c15825de8943080c3117ddb7e3bce73527482991a0a31f4980b8a2","first_computed_at":"2026-05-18T02:44:15.837240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.837240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oDU7fyWHulTwKCQBVn83X/AKDYS0lZ9p0Sc3U54xT2xW3A60UwfXaNi28fFGZOE/YZMdIwXSCimYnL65cMIvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.837728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13779","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:a4068d0dbce18931b4db8bebc58c720494e5d68c49777dc8396c87cdacc05c93","sha256:b1d225717c25af28ec76edf897ef293e3288588885c1b2aec706809c472b4f3f"]}],"invalid_events":[],"applied_event_ids":["sha256:9d047c352b11525975eb18c2cd0521e122d8ba344cf974f9267496eefe394f8a","sha256:9dbcdc09199340e01b648e3a1dcb60a9aab4805e2b7f63a4849918d70b984dfa"],"state_sha256":"cb68b16479903d7d1461fe20f59f439ff123c261835efa933e808a4fcea158d2"}