{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ARXPC4DSKEIBGRWLR5CSGJOWM2","short_pith_number":"pith:ARXPC4DS","schema_version":"1.0","canonical_sha256":"046ef1707251101346cb8f452325d6669d436ee0fcdb955651e5e02daa835e1d","source":{"kind":"arxiv","id":"2606.21847","version":1},"attestation_state":"computed","paper":{"title":"UniRank: Unified Rank Allocation for Low-Rank LLM Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Han, Fei Ma, Haozhe Hu, Wei Zhang, Xiaoyu Shen","submitted_at":"2026-06-20T03:10:33Z","abstract_excerpt":"Low-rank decomposition serves as a promising compression paradigm for large language models, however, rank allocation remains challenging: manual rules lack generalizability, and learning-based approaches incur heavy computational overhead. To address these issues, we formulate global low-rank allocation as a sorting-and-truncation pipeline, and score each singular component via dual criteria: \\textbf{Local} singular energy ratio that quantifies the intrinsic importance within the decomposed parameter matrix and \\textbf{Global} functional importance (measured by input-output cosine similarity)"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.21847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T03:10:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"33ab8f5edba35c53213709bc3dd954af5b62509c6c5bd3034fba80aec751b8eb","abstract_canon_sha256":"267906a7a3a346621edc35aa089e6d31df04a14df2bb5bd9b748275b66389988"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:00.703042Z","signature_b64":"/T0EwhRznbrsdsxZOGfcJ7Pgh7MU+94ei0eutfZK/GZPF7nBmDTV38DXh9y3r2WbgVJL7JY8aSG77IZhofusCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"046ef1707251101346cb8f452325d6669d436ee0fcdb955651e5e02daa835e1d","last_reissued_at":"2026-06-23T02:13:00.702519Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:00.702519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UniRank: Unified Rank Allocation for Low-Rank LLM Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Han, Fei Ma, Haozhe Hu, Wei Zhang, Xiaoyu Shen","submitted_at":"2026-06-20T03:10:33Z","abstract_excerpt":"Low-rank decomposition serves as a promising compression paradigm for large language models, however, rank allocation remains challenging: manual rules lack generalizability, and learning-based approaches incur heavy computational overhead. To address these issues, we formulate global low-rank allocation as a sorting-and-truncation pipeline, and score each singular component via dual criteria: \\textbf{Local} singular energy ratio that quantifies the intrinsic importance within the decomposed parameter matrix and \\textbf{Global} functional importance (measured by input-output cosine similarity)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21847","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.21847","created_at":"2026-06-23T02:13:00.702583+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21847v1","created_at":"2026-06-23T02:13:00.702583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21847","created_at":"2026-06-23T02:13:00.702583+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARXPC4DSKEIB","created_at":"2026-06-23T02:13:00.702583+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARXPC4DSKEIBGRWL","created_at":"2026-06-23T02:13:00.702583+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARXPC4DS","created_at":"2026-06-23T02:13:00.702583+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2","json":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2.json","graph_json":"https://pith.science/api/pith-number/ARXPC4DSKEIBGRWLR5CSGJOWM2/graph.json","events_json":"https://pith.science/api/pith-number/ARXPC4DSKEIBGRWLR5CSGJOWM2/events.json","paper":"https://pith.science/paper/ARXPC4DS"},"agent_actions":{"view_html":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2","download_json":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2.json","view_paper":"https://pith.science/paper/ARXPC4DS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21847&json=true","fetch_graph":"https://pith.science/api/pith-number/ARXPC4DSKEIBGRWLR5CSGJOWM2/graph.json","fetch_events":"https://pith.science/api/pith-number/ARXPC4DSKEIBGRWLR5CSGJOWM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/action/storage_attestation","attest_author":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/action/author_attestation","sign_citation":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/action/citation_signature","submit_replication":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/action/replication_record"}},"created_at":"2026-06-23T02:13:00.702583+00:00","updated_at":"2026-06-23T02:13:00.702583+00:00"}