{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3NRIAEVCDDTMQ27QIORNXL3NOD","short_pith_number":"pith:3NRIAEVC","schema_version":"1.0","canonical_sha256":"db628012a218e6c86bf043a2dbaf6d70e071da098b26b14570ca66cab6088bd7","source":{"kind":"arxiv","id":"1903.09973","version":4},"attestation_state":"computed","paper":{"title":"MUSCO: Multi-Stage Compression of neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrzej Cichocki, Evgeny Ponomarev, Ivan Oseledets, Julia Gusak, Larisa Markeeva, Maksym Kholiavchenko","submitted_at":"2019-03-24T11:40:18Z","abstract_excerpt":"The low-rank tensor approximation is very promising for the compression of deep neural networks. We propose a new simple and efficient iterative approach, which alternates low-rank factorization with a smart rank selection and fine-tuning. We demonstrate the efficiency of our method comparing to non-iterative ones. Our approach improves the compression rate while maintaining the accuracy for a variety of tasks."},"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":"1903.09973","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-24T11:40:18Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"a7646ac18ddd9258bd9a89d3ba7190d2c32faf9ccb58c0b08046c8765c8c271b","abstract_canon_sha256":"17102b4e2057ff49c2a117577aded4eecd99b09b3c4c430f047d4803dd387c72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:19.594464Z","signature_b64":"8IzjoEUJSdnceAbbAU8vfSavHz6unx5dxjQwKr/9J5Hdk2Ce59br5YOM6Q+TR3Hb8sdUncjwhiCHYLM9ItqGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db628012a218e6c86bf043a2dbaf6d70e071da098b26b14570ca66cab6088bd7","last_reissued_at":"2026-07-05T00:19:19.594035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:19.594035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MUSCO: Multi-Stage Compression of neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrzej Cichocki, Evgeny Ponomarev, Ivan Oseledets, Julia Gusak, Larisa Markeeva, Maksym Kholiavchenko","submitted_at":"2019-03-24T11:40:18Z","abstract_excerpt":"The low-rank tensor approximation is very promising for the compression of deep neural networks. We propose a new simple and efficient iterative approach, which alternates low-rank factorization with a smart rank selection and fine-tuning. We demonstrate the efficiency of our method comparing to non-iterative ones. Our approach improves the compression rate while maintaining the accuracy for a variety of tasks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09973","kind":"arxiv","version":4},"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/1903.09973/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":"1903.09973","created_at":"2026-07-05T00:19:19.594087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09973v4","created_at":"2026-07-05T00:19:19.594087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09973","created_at":"2026-07-05T00:19:19.594087+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NRIAEVCDDTM","created_at":"2026-07-05T00:19:19.594087+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NRIAEVCDDTMQ27Q","created_at":"2026-07-05T00:19:19.594087+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NRIAEVC","created_at":"2026-07-05T00:19:19.594087+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07699","citing_title":"Tensor Methods for Generating Compact Uncertainty Quantification and Deep Learning Models","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD","json":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD.json","graph_json":"https://pith.science/api/pith-number/3NRIAEVCDDTMQ27QIORNXL3NOD/graph.json","events_json":"https://pith.science/api/pith-number/3NRIAEVCDDTMQ27QIORNXL3NOD/events.json","paper":"https://pith.science/paper/3NRIAEVC"},"agent_actions":{"view_html":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD","download_json":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD.json","view_paper":"https://pith.science/paper/3NRIAEVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09973&json=true","fetch_graph":"https://pith.science/api/pith-number/3NRIAEVCDDTMQ27QIORNXL3NOD/graph.json","fetch_events":"https://pith.science/api/pith-number/3NRIAEVCDDTMQ27QIORNXL3NOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/action/storage_attestation","attest_author":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/action/author_attestation","sign_citation":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/action/citation_signature","submit_replication":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/action/replication_record"}},"created_at":"2026-07-05T00:19:19.594087+00:00","updated_at":"2026-07-05T00:19:19.594087+00:00"}