{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:XRYVAZFO7HAUN7A54E4RJ5YVK3","short_pith_number":"pith:XRYVAZFO","canonical_record":{"source":{"id":"2309.03824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-07T16:33:42Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"f06e0c5f54613e413a5302990c449475a11b74cb551efdeebf0d3ff864c1197b","abstract_canon_sha256":"41ecb3d9b25da15b14a3e2737fc6d6de229fd9853e95924e33730547faba6ed4"},"schema_version":"1.0"},"canonical_sha256":"bc715064aef9c146fc1de13914f71556e241960c828b81ac0cdca5ad160aca50","source":{"kind":"arxiv","id":"2309.03824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.03824","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"2309.03824v1","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.03824","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"XRYVAZFO7HAU","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"pith_short_16","alias_value":"XRYVAZFO7HAUN7A5","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"pith_short_8","alias_value":"XRYVAZFO","created_at":"2026-07-05T11:08:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:XRYVAZFO7HAUN7A54E4RJ5YVK3","target":"record","payload":{"canonical_record":{"source":{"id":"2309.03824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-07T16:33:42Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"f06e0c5f54613e413a5302990c449475a11b74cb551efdeebf0d3ff864c1197b","abstract_canon_sha256":"41ecb3d9b25da15b14a3e2737fc6d6de229fd9853e95924e33730547faba6ed4"},"schema_version":"1.0"},"canonical_sha256":"bc715064aef9c146fc1de13914f71556e241960c828b81ac0cdca5ad160aca50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:55.021905Z","signature_b64":"GmcUGHUDg9SSs2EKujmZgJlIN8/BaQpjOwH5Yu9O9ZbZfA/vzGuKcVQNv5zb2ZYabMNZvYHfx5b2wRdaAyj8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc715064aef9c146fc1de13914f71556e241960c828b81ac0cdca5ad160aca50","last_reissued_at":"2026-07-05T11:08:55.021438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:55.021438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.03824","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-05T11:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSjlnN9ibx0dgzSbhERNNSdJmRabcXRwKVjZzqtlUjQpqySlr6G+hQqlMsGOoGLWQZQTd2UITjeoAPi89SJnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:38:12.025925Z"},"content_sha256":"ad61191f73ffdb8e975eb204744f2ca9caca094abe9fc1c7e9d72a889d54aca5","schema_version":"1.0","event_id":"sha256:ad61191f73ffdb8e975eb204744f2ca9caca094abe9fc1c7e9d72a889d54aca5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:XRYVAZFO7HAUN7A54E4RJ5YVK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training Acceleration of Low-Rank Decomposed Networks using Sequential Freezing and Rank Quantization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Habib Hajimolahoseini, Walid Ahmed, Yang Liu","submitted_at":"2023-09-07T16:33:42Z","abstract_excerpt":"Low Rank Decomposition (LRD) is a model compression technique applied to the weight tensors of deep learning models in order to reduce the number of trainable parameters and computational complexity. However, due to high number of new layers added to the architecture after applying LRD, it may not lead to a high training/inference acceleration if the decomposition ranks are not small enough. The issue is that using small ranks increases the risk of significant accuracy drop after decomposition. In this paper, we propose two techniques for accelerating low rank decomposed models without requiri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.03824","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.03824/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-05T11:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2rIz20K/rWFUZccbWjBxkeCYPoHfRQcSLhSv2hqVqmNSoGwvv0Gm3PEYiFemaTq+8jpg8UmHVZEgYgSbl9rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:38:12.026311Z"},"content_sha256":"6c8359e1aeae29ca679a78e0e50bed459ee59a05a87e8162786c586487b5aa63","schema_version":"1.0","event_id":"sha256:6c8359e1aeae29ca679a78e0e50bed459ee59a05a87e8162786c586487b5aa63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRYVAZFO7HAUN7A54E4RJ5YVK3/bundle.json","state_url":"https://pith.science/pith/XRYVAZFO7HAUN7A54E4RJ5YVK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRYVAZFO7HAUN7A54E4RJ5YVK3/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-19T08:38:12Z","links":{"resolver":"https://pith.science/pith/XRYVAZFO7HAUN7A54E4RJ5YVK3","bundle":"https://pith.science/pith/XRYVAZFO7HAUN7A54E4RJ5YVK3/bundle.json","state":"https://pith.science/pith/XRYVAZFO7HAUN7A54E4RJ5YVK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRYVAZFO7HAUN7A54E4RJ5YVK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XRYVAZFO7HAUN7A54E4RJ5YVK3","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":"41ecb3d9b25da15b14a3e2737fc6d6de229fd9853e95924e33730547faba6ed4","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-07T16:33:42Z","title_canon_sha256":"f06e0c5f54613e413a5302990c449475a11b74cb551efdeebf0d3ff864c1197b"},"schema_version":"1.0","source":{"id":"2309.03824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.03824","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"2309.03824v1","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.03824","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"XRYVAZFO7HAU","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"pith_short_16","alias_value":"XRYVAZFO7HAUN7A5","created_at":"2026-07-05T11:08:55Z"},{"alias_kind":"pith_short_8","alias_value":"XRYVAZFO","created_at":"2026-07-05T11:08:55Z"}],"graph_snapshots":[{"event_id":"sha256:6c8359e1aeae29ca679a78e0e50bed459ee59a05a87e8162786c586487b5aa63","target":"graph","created_at":"2026-07-05T11:08:55Z","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.03824/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low Rank Decomposition (LRD) is a model compression technique applied to the weight tensors of deep learning models in order to reduce the number of trainable parameters and computational complexity. However, due to high number of new layers added to the architecture after applying LRD, it may not lead to a high training/inference acceleration if the decomposition ranks are not small enough. The issue is that using small ranks increases the risk of significant accuracy drop after decomposition. In this paper, we propose two techniques for accelerating low rank decomposed models without requiri","authors_text":"Habib Hajimolahoseini, Walid Ahmed, Yang Liu","cross_cats":["cs.AI","cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-07T16:33:42Z","title":"Training Acceleration of Low-Rank Decomposed Networks using Sequential Freezing and Rank Quantization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.03824","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:ad61191f73ffdb8e975eb204744f2ca9caca094abe9fc1c7e9d72a889d54aca5","target":"record","created_at":"2026-07-05T11:08:55Z","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":"41ecb3d9b25da15b14a3e2737fc6d6de229fd9853e95924e33730547faba6ed4","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-07T16:33:42Z","title_canon_sha256":"f06e0c5f54613e413a5302990c449475a11b74cb551efdeebf0d3ff864c1197b"},"schema_version":"1.0","source":{"id":"2309.03824","kind":"arxiv","version":1}},"canonical_sha256":"bc715064aef9c146fc1de13914f71556e241960c828b81ac0cdca5ad160aca50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc715064aef9c146fc1de13914f71556e241960c828b81ac0cdca5ad160aca50","first_computed_at":"2026-07-05T11:08:55.021438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:55.021438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GmcUGHUDg9SSs2EKujmZgJlIN8/BaQpjOwH5Yu9O9ZbZfA/vzGuKcVQNv5zb2ZYabMNZvYHfx5b2wRdaAyj8Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:55.021905Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.03824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad61191f73ffdb8e975eb204744f2ca9caca094abe9fc1c7e9d72a889d54aca5","sha256:6c8359e1aeae29ca679a78e0e50bed459ee59a05a87e8162786c586487b5aa63"],"state_sha256":"118ee46620874b2f90d233893168165ee1b5dc1fa741cee8bc68a2dc8b038e9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLNxppnERjsjERfLc24CQ3/Bd8tyEK4/6JV2EeY6RIzkVlZXVdaZgtLIB0LJtpcRB95v6OQ4ofbp3tPWJN5ODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T08:38:12.028735Z","bundle_sha256":"3a221fd40babbee203754ebe5ef4b4e8a9e18b2345794859b9e2bf0e5352e48c"}}