{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6TT5FX7IBO5Z35XNDARRDS7EVN","short_pith_number":"pith:6TT5FX7I","schema_version":"1.0","canonical_sha256":"f4e7d2dfe80bbb9df6ed182311cbe4ab4b644ec18291f0c9d0723487920aab9f","source":{"kind":"arxiv","id":"2005.07786","version":1},"attestation_state":"computed","paper":{"title":"A flexible, extensible software framework for model compression based on the LC algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Yerlan Idelbayev","submitted_at":"2020-05-15T21:14:48Z","abstract_excerpt":"We propose a software framework based on the ideas of the Learning-Compression (LC) algorithm, that allows a user to compress a neural network or other machine learning model using different compression schemes with minimal effort. Currently, the supported compressions include pruning, quantization, low-rank methods (including automatically learning the layer ranks), and combinations of those, and the user can choose different compression types for different parts of a neural network.\n  The LC algorithm alternates two types of steps until convergence: a learning (L) step, which trains a model "},"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":"2005.07786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-15T21:14:48Z","cross_cats_sorted":["cs.NE","math.OC","stat.ML"],"title_canon_sha256":"699886345bb6714ebf8ddf2f06adc413d523682a4f0c6d7dc3a1f5d815d5d76e","abstract_canon_sha256":"3643ba980922994d0db9e374d8558e9c15bcfa2cec205c3ad20af950b6011d84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:09.727551Z","signature_b64":"EozBFrRzZfBDwjradR8vFpL1BMGKtU2LI4jvbNaov4lCI8L51jO3J8I9cHi5PNlYSkEPbEnfp2kj57G+3XzWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e7d2dfe80bbb9df6ed182311cbe4ab4b644ec18291f0c9d0723487920aab9f","last_reissued_at":"2026-07-05T01:03:09.727137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:09.727137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A flexible, extensible software framework for model compression based on the LC algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Yerlan Idelbayev","submitted_at":"2020-05-15T21:14:48Z","abstract_excerpt":"We propose a software framework based on the ideas of the Learning-Compression (LC) algorithm, that allows a user to compress a neural network or other machine learning model using different compression schemes with minimal effort. Currently, the supported compressions include pruning, quantization, low-rank methods (including automatically learning the layer ranks), and combinations of those, and the user can choose different compression types for different parts of a neural network.\n  The LC algorithm alternates two types of steps until convergence: a learning (L) step, which trains a model "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07786","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/2005.07786/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":"2005.07786","created_at":"2026-07-05T01:03:09.727200+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07786v1","created_at":"2026-07-05T01:03:09.727200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07786","created_at":"2026-07-05T01:03:09.727200+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TT5FX7IBO5Z","created_at":"2026-07-05T01:03:09.727200+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TT5FX7IBO5Z35XN","created_at":"2026-07-05T01:03:09.727200+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TT5FX7I","created_at":"2026-07-05T01:03:09.727200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN","json":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN.json","graph_json":"https://pith.science/api/pith-number/6TT5FX7IBO5Z35XNDARRDS7EVN/graph.json","events_json":"https://pith.science/api/pith-number/6TT5FX7IBO5Z35XNDARRDS7EVN/events.json","paper":"https://pith.science/paper/6TT5FX7I"},"agent_actions":{"view_html":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN","download_json":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN.json","view_paper":"https://pith.science/paper/6TT5FX7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07786&json=true","fetch_graph":"https://pith.science/api/pith-number/6TT5FX7IBO5Z35XNDARRDS7EVN/graph.json","fetch_events":"https://pith.science/api/pith-number/6TT5FX7IBO5Z35XNDARRDS7EVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN/action/storage_attestation","attest_author":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN/action/author_attestation","sign_citation":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN/action/citation_signature","submit_replication":"https://pith.science/pith/6TT5FX7IBO5Z35XNDARRDS7EVN/action/replication_record"}},"created_at":"2026-07-05T01:03:09.727200+00:00","updated_at":"2026-07-05T01:03:09.727200+00:00"}