{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZZP6ZBGG7HZ4D6B44HJ2GS35MG","short_pith_number":"pith:ZZP6ZBGG","schema_version":"1.0","canonical_sha256":"ce5fec84c6f9f3c1f83ce1d3a34b7d61986babae3fd9cb8448fdb474b1577759","source":{"kind":"arxiv","id":"2401.10341","version":1},"attestation_state":"computed","paper":{"title":"ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Bo Yuan, Huy Phan, Jinqi Xiao, Miao Yin, Yang Sui, Yu Gong","submitted_at":"2024-01-18T19:09:47Z","abstract_excerpt":"Low-rank compression, a popular model compression technique that produces compact convolutional neural networks (CNNs) with low rankness, has been well-studied in the literature. On the other hand, low-rank training, as an alternative way to train low-rank CNNs from scratch, has been exploited little yet. Unlike low-rank compression, low-rank training does not need pre-trained full-rank models, and the entire training phase is always performed on the low-rank structure, bringing attractive benefits for practical applications. However, the existing low-rank training solutions still face several"},"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":"2401.10341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-01-18T19:09:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"afc23e645a2b7c90712d13ea9f9cc0b5647c4a6b358a45f500d34c665454c3d1","abstract_canon_sha256":"94dadad8c3cad4011dd3890956d80864969892438f055cb0b193c9ae1f9db898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:10.424870Z","signature_b64":"xTtW7XgAOWWYCeqePY6hE4ogdPOByiXvLszBx/3m0F1Lg5gBgNwrsm7YA4g7AWGMqWYnlqJ7wXYVcF3seJHLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce5fec84c6f9f3c1f83ce1d3a34b7d61986babae3fd9cb8448fdb474b1577759","last_reissued_at":"2026-07-05T07:35:10.424401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:10.424401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Bo Yuan, Huy Phan, Jinqi Xiao, Miao Yin, Yang Sui, Yu Gong","submitted_at":"2024-01-18T19:09:47Z","abstract_excerpt":"Low-rank compression, a popular model compression technique that produces compact convolutional neural networks (CNNs) with low rankness, has been well-studied in the literature. On the other hand, low-rank training, as an alternative way to train low-rank CNNs from scratch, has been exploited little yet. Unlike low-rank compression, low-rank training does not need pre-trained full-rank models, and the entire training phase is always performed on the low-rank structure, bringing attractive benefits for practical applications. However, the existing low-rank training solutions still face several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.10341","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/2401.10341/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":"2401.10341","created_at":"2026-07-05T07:35:10.424461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.10341v1","created_at":"2026-07-05T07:35:10.424461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.10341","created_at":"2026-07-05T07:35:10.424461+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZP6ZBGG7HZ4","created_at":"2026-07-05T07:35:10.424461+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZP6ZBGG7HZ4D6B4","created_at":"2026-07-05T07:35:10.424461+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZP6ZBGG","created_at":"2026-07-05T07:35:10.424461+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.00733","citing_title":"Spectral Compact Training: Pre-Training Large Language Models via Permanent Truncated SVD and Stiefel QR Retraction","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG","json":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG.json","graph_json":"https://pith.science/api/pith-number/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/graph.json","events_json":"https://pith.science/api/pith-number/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/events.json","paper":"https://pith.science/paper/ZZP6ZBGG"},"agent_actions":{"view_html":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG","download_json":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG.json","view_paper":"https://pith.science/paper/ZZP6ZBGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.10341&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/action/storage_attestation","attest_author":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/action/author_attestation","sign_citation":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/action/citation_signature","submit_replication":"https://pith.science/pith/ZZP6ZBGG7HZ4D6B44HJ2GS35MG/action/replication_record"}},"created_at":"2026-07-05T07:35:10.424461+00:00","updated_at":"2026-07-05T07:35:10.424461+00:00"}