{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BHYWEVMK2A2TG4LSIGRBYSGQC5","short_pith_number":"pith:BHYWEVMK","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"},"canonical_sha256":"09f162558ad03533717241a21c48d017671347d9aed759bc22c0adcd982694ba","source":{"kind":"arxiv","id":"2309.14021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14021","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14021v1","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14021","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"pith_short_12","alias_value":"BHYWEVMK2A2T","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"pith_short_16","alias_value":"BHYWEVMK2A2TG4LS","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"pith_short_8","alias_value":"BHYWEVMK","created_at":"2026-07-05T06:54:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BHYWEVMK2A2TG4LSIGRBYSGQC5","target":"record","payload":{"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"},"canonical_sha256":"09f162558ad03533717241a21c48d017671347d9aed759bc22c0adcd982694ba","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"},"source_kind":"arxiv","source_id":"2309.14021","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:54:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFOCiMzMkmYxi+WWZhyJhatIfzI2B4jg7gNHeeTnzu5Qb6pL/jDg03rEKDwy8XqNYktI3TwpMbdmyd/prRt0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:36:28.725980Z"},"content_sha256":"b3fb59a0c8f874dcdd4e39ef170b4d198537a5b0e7e116652e9f9a9a4fda208e","schema_version":"1.0","event_id":"sha256:b3fb59a0c8f874dcdd4e39ef170b4d198537a5b0e7e116652e9f9a9a4fda208e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BHYWEVMK2A2TG4LSIGRBYSGQC5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:54:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyHwFFfuUPsxHXvXCoLT48yLrObjfeAaMv47gcLTZqe5my2/6kgRqaWKRHqkYEnb6Hs1412RzoxfkOrqkxcIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:36:28.726844Z"},"content_sha256":"785e6ac32f951fa90d123d70d3aadf2acb597c174ed34520afdf96003d2f224f","schema_version":"1.0","event_id":"sha256:785e6ac32f951fa90d123d70d3aadf2acb597c174ed34520afdf96003d2f224f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/bundle.json","state_url":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T05:36:28Z","links":{"resolver":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5","bundle":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/bundle.json","state":"https://pith.science/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHYWEVMK2A2TG4LSIGRBYSGQC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BHYWEVMK2A2TG4LSIGRBYSGQC5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d24b4c36786778b376d6ff686f1b70d29b8a50701c2a912311ea316c3e46fdfa","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-09-25T10:35:17Z","title_canon_sha256":"cc7f6b47c107c33e4883407cfa4197f5a769de70c3d7be2869c123a46aac34d8"},"schema_version":"1.0","source":{"id":"2309.14021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14021","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14021v1","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14021","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"pith_short_12","alias_value":"BHYWEVMK2A2T","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"pith_short_16","alias_value":"BHYWEVMK2A2TG4LS","created_at":"2026-07-05T06:54:00Z"},{"alias_kind":"pith_short_8","alias_value":"BHYWEVMK","created_at":"2026-07-05T06:54:00Z"}],"graph_snapshots":[{"event_id":"sha256:785e6ac32f951fa90d123d70d3aadf2acb597c174ed34520afdf96003d2f224f","target":"graph","created_at":"2026-07-05T06:54:00Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.14021/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ayush Kaushal, Irina Rish, Tejas Vaidhya","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-09-25T10:35:17Z","title":"LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14021","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3fb59a0c8f874dcdd4e39ef170b4d198537a5b0e7e116652e9f9a9a4fda208e","target":"record","created_at":"2026-07-05T06:54:00Z","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":"d24b4c36786778b376d6ff686f1b70d29b8a50701c2a912311ea316c3e46fdfa","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-09-25T10:35:17Z","title_canon_sha256":"cc7f6b47c107c33e4883407cfa4197f5a769de70c3d7be2869c123a46aac34d8"},"schema_version":"1.0","source":{"id":"2309.14021","kind":"arxiv","version":1}},"canonical_sha256":"09f162558ad03533717241a21c48d017671347d9aed759bc22c0adcd982694ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09f162558ad03533717241a21c48d017671347d9aed759bc22c0adcd982694ba","first_computed_at":"2026-07-05T06:54:00.634472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:54:00.634472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hXYf4VvRHYnOhln96dCPjo1Yhr7M0TCiNPNPQqAZ1kQZawYqaJ1lCclZm7iMmu7N9GeobTkCPwV1yrf69ga0Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:54:00.634886Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.14021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3fb59a0c8f874dcdd4e39ef170b4d198537a5b0e7e116652e9f9a9a4fda208e","sha256:785e6ac32f951fa90d123d70d3aadf2acb597c174ed34520afdf96003d2f224f"],"state_sha256":"2a508633f4a8b824ab6b038639b09a1deb5a75c0a2c647ad6507c6a13327d102"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anDc0iHHqpGaT7pAMPQ63NVJ5RBcpegEqwXtKxv6ZAJivdtQYfvjlIt3G5WVPgClH1p8c6X8V9xedriMEiogCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:36:28.735828Z","bundle_sha256":"5d029dbdada123c322effb0c1c9184253b63073664a5cb2ca3dbe5f481b25479"}}