{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3NRIAEVCDDTMQ27QIORNXL3NOD","short_pith_number":"pith:3NRIAEVC","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"},"canonical_sha256":"db628012a218e6c86bf043a2dbaf6d70e071da098b26b14570ca66cab6088bd7","source":{"kind":"arxiv","id":"1903.09973","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09973","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09973v4","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09973","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"3NRIAEVCDDTM","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"pith_short_16","alias_value":"3NRIAEVCDDTMQ27Q","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"pith_short_8","alias_value":"3NRIAEVC","created_at":"2026-07-05T00:19:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3NRIAEVCDDTMQ27QIORNXL3NOD","target":"record","payload":{"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"},"canonical_sha256":"db628012a218e6c86bf043a2dbaf6d70e071da098b26b14570ca66cab6088bd7","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"},"source_kind":"arxiv","source_id":"1903.09973","source_version":4,"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-05T00:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3aLxMWAMkfNqjLDeDkcwpx4nzQ1peSf+uxZ00A4NNOWbC64D8tqE9mJUrnZpnDcc+d/bE9YGzjXiKK1qronAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T02:17:37.929680Z"},"content_sha256":"f8760907b23f7953a141e5c83427e75a0bd46eb757c90413d829c756e96eb8ee","schema_version":"1.0","event_id":"sha256:f8760907b23f7953a141e5c83427e75a0bd46eb757c90413d829c756e96eb8ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3NRIAEVCDDTMQ27QIORNXL3NOD","target":"graph","payload":{"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"},"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-05T00:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XePkCx1lAJ9ZIxOCzVH4JO0QhlssLW6sInlCiynUPVdLIjULMwIOPuftpii4SnQzhSuTbwcMtjQsXAuIY428CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T02:17:37.930248Z"},"content_sha256":"6d81ce146b05f93ef8f7d92acb845f73f7d18651222f6f813f00b1d2869bf311","schema_version":"1.0","event_id":"sha256:6d81ce146b05f93ef8f7d92acb845f73f7d18651222f6f813f00b1d2869bf311"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/bundle.json","state_url":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/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-17T02:17:37Z","links":{"resolver":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD","bundle":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/bundle.json","state":"https://pith.science/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NRIAEVCDDTMQ27QIORNXL3NOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3NRIAEVCDDTMQ27QIORNXL3NOD","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":"17102b4e2057ff49c2a117577aded4eecd99b09b3c4c430f047d4803dd387c72","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-24T11:40:18Z","title_canon_sha256":"a7646ac18ddd9258bd9a89d3ba7190d2c32faf9ccb58c0b08046c8765c8c271b"},"schema_version":"1.0","source":{"id":"1903.09973","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09973","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09973v4","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09973","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"3NRIAEVCDDTM","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"pith_short_16","alias_value":"3NRIAEVCDDTMQ27Q","created_at":"2026-07-05T00:19:19Z"},{"alias_kind":"pith_short_8","alias_value":"3NRIAEVC","created_at":"2026-07-05T00:19:19Z"}],"graph_snapshots":[{"event_id":"sha256:6d81ce146b05f93ef8f7d92acb845f73f7d18651222f6f813f00b1d2869bf311","target":"graph","created_at":"2026-07-05T00:19:19Z","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/1903.09973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Andrzej Cichocki, Evgeny Ponomarev, Ivan Oseledets, Julia Gusak, Larisa Markeeva, Maksym Kholiavchenko","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-24T11:40:18Z","title":"MUSCO: Multi-Stage Compression of neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09973","kind":"arxiv","version":4},"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:f8760907b23f7953a141e5c83427e75a0bd46eb757c90413d829c756e96eb8ee","target":"record","created_at":"2026-07-05T00:19:19Z","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":"17102b4e2057ff49c2a117577aded4eecd99b09b3c4c430f047d4803dd387c72","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-24T11:40:18Z","title_canon_sha256":"a7646ac18ddd9258bd9a89d3ba7190d2c32faf9ccb58c0b08046c8765c8c271b"},"schema_version":"1.0","source":{"id":"1903.09973","kind":"arxiv","version":4}},"canonical_sha256":"db628012a218e6c86bf043a2dbaf6d70e071da098b26b14570ca66cab6088bd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db628012a218e6c86bf043a2dbaf6d70e071da098b26b14570ca66cab6088bd7","first_computed_at":"2026-07-05T00:19:19.594035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:19.594035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8IzjoEUJSdnceAbbAU8vfSavHz6unx5dxjQwKr/9J5Hdk2Ce59br5YOM6Q+TR3Hb8sdUncjwhiCHYLM9ItqGBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:19.594464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09973","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8760907b23f7953a141e5c83427e75a0bd46eb757c90413d829c756e96eb8ee","sha256:6d81ce146b05f93ef8f7d92acb845f73f7d18651222f6f813f00b1d2869bf311"],"state_sha256":"aba53582425f6ff2e3955f1c56a964d80bedab762db5f30b3af97f70f51934e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F7UJe5Gmm5jlh43pcbwfb80bz5CJZkzV+ZXF+R+G6Y7ab332wgB0HLZ/c18iyx8Cp7IwbT5aAkWMzWNx8HK3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T02:17:37.934050Z","bundle_sha256":"a5432fe09e6f6fbd3104346fbeade1fe07527545f7f12fd214304226b84c93ff"}}