{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BHYWEVMK2A2TG4LSIGRBYSGQC5","short_pith_number":"pith:BHYWEVMK","schema_version":"1.0","canonical_sha256":"09f162558ad03533717241a21c48d017671347d9aed759bc22c0adcd982694ba","source":{"kind":"arxiv","id":"2309.14021","version":1},"attestation_state":"computed","paper":{"title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ayush Kaushal, Irina Rish, Tejas Vaidhya","submitted_at":"2023-09-25T10:35:17Z","abstract_excerpt":"Low Rank Decomposition of matrix - splitting a large matrix into a product of two smaller matrix offers a means for compression that reduces the parameters of a model without sparsification, and hence delivering more speedup on modern hardware. Moreover, unlike quantization, the compressed linear layers remain fully differentiable and all the parameters trainable, while being able to leverage the existing highly efficient kernels over floating point matrices. We study the potential to compress Large Language Models (LLMs) for monolingual Code generation via Low Rank Decomposition (LoRD) and ob"},"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":"2309.14021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-09-25T10:35:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cc7f6b47c107c33e4883407cfa4197f5a769de70c3d7be2869c123a46aac34d8","abstract_canon_sha256":"d24b4c36786778b376d6ff686f1b70d29b8a50701c2a912311ea316c3e46fdfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:00.634886Z","signature_b64":"hXYf4VvRHYnOhln96dCPjo1Yhr7M0TCiNPNPQqAZ1kQZawYqaJ1lCclZm7iMmu7N9GeobTkCPwV1yrf69ga0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09f162558ad03533717241a21c48d017671347d9aed759bc22c0adcd982694ba","last_reissued_at":"2026-07-05T06:54:00.634472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:00.634472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ayush Kaushal, Irina Rish, Tejas Vaidhya","submitted_at":"2023-09-25T10:35:17Z","abstract_excerpt":"Low Rank Decomposition of matrix - splitting a large matrix into a product of two smaller matrix offers a means for compression that reduces the parameters of a model without sparsification, and hence delivering more speedup on modern hardware. Moreover, unlike quantization, the compressed linear layers remain fully differentiable and all the parameters trainable, while being able to leverage the existing highly efficient kernels over floating point matrices. We study the potential to compress Large Language Models (LLMs) for monolingual Code generation via Low Rank Decomposition (LoRD) and ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14021","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/2309.14021/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":"2309.14021","created_at":"2026-07-05T06:54:00.634532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14021v1","created_at":"2026-07-05T06:54:00.634532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14021","created_at":"2026-07-05T06:54:00.634532+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHYWEVMK2A2T","created_at":"2026-07-05T06:54:00.634532+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHYWEVMK2A2TG4LS","created_at":"2026-07-05T06:54:00.634532+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHYWEVMK","created_at":"2026-07-05T06:54:00.634532+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.14294","citing_title":"A Survey on Efficient Inference for Large Language Models","ref_index":143,"is_internal_anchor":false},{"citing_arxiv_id":"2603.29813","citing_title":"Compiling Code LLMs into Lightweight Executables","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06216","citing_title":"TIDE: Every Layer Knows the Token Beneath the Context","ref_index":91,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5","json":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5.json","graph_json":"https://pith.science/api/pith-number/BHYWEVMK2A2TG4LSIGRBYSGQC5/graph.json","events_json":"https://pith.science/api/pith-number/BHYWEVMK2A2TG4LSIGRBYSGQC5/events.json","paper":"https://pith.science/paper/BHYWEVMK"},"agent_actions":{"view_html":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5","download_json":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5.json","view_paper":"https://pith.science/paper/BHYWEVMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14021&json=true","fetch_graph":"https://pith.science/api/pith-number/BHYWEVMK2A2TG4LSIGRBYSGQC5/graph.json","fetch_events":"https://pith.science/api/pith-number/BHYWEVMK2A2TG4LSIGRBYSGQC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/action/storage_attestation","attest_author":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/action/author_attestation","sign_citation":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/action/citation_signature","submit_replication":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/action/replication_record"}},"created_at":"2026-07-05T06:54:00.634532+00:00","updated_at":"2026-07-05T06:54:00.634532+00:00"}