{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BW6T2SUDNH4XRGGBWDFJRERDGX","short_pith_number":"pith:BW6T2SUD","schema_version":"1.0","canonical_sha256":"0dbd3d4a8369f97898c1b0ca98922335db3f743839774b8a66082bd1abf50049","source":{"kind":"arxiv","id":"2006.08878","version":1},"attestation_state":"computed","paper":{"title":"CNN Acceleration by Low-rank Approximation with Quantized Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CV","authors_text":"Anh-Huy Phan, Nikolay Kozyrskiy","submitted_at":"2020-06-16T02:28:05Z","abstract_excerpt":"The modern convolutional neural networks although achieve great results in solving complex computer vision tasks still cannot be effectively used in mobile and embedded devices due to the strict requirements for computational complexity, memory and power consumption. The CNNs have to be compressed and accelerated before deployment. In order to solve this problem the novel approach combining two known methods, low-rank tensor approximation in Tucker format and quantization of weights and feature maps (activations), is proposed. The greedy one-step and multi-step algorithms for the task of multi"},"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":"2006.08878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-16T02:28:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0cf75e7f8e834f6aae7134e0d11fc52a488b2ed3ac5b18115558b8267c929aad","abstract_canon_sha256":"4f0d84047f3b12964a88e6d40df63276d313d68e197033cbe4a7a9903f9c313b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:43.954776Z","signature_b64":"tgwVJq0FsGMukscUvBUndHjHD8jOy7Dl6Mutz9EKMTdoY0zbrJu56ZbS3SG3EHyI171PEn62QjBQO5MaZqPdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dbd3d4a8369f97898c1b0ca98922335db3f743839774b8a66082bd1abf50049","last_reissued_at":"2026-07-05T01:10:43.954373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:43.954373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CNN Acceleration by Low-rank Approximation with Quantized Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CV","authors_text":"Anh-Huy Phan, Nikolay Kozyrskiy","submitted_at":"2020-06-16T02:28:05Z","abstract_excerpt":"The modern convolutional neural networks although achieve great results in solving complex computer vision tasks still cannot be effectively used in mobile and embedded devices due to the strict requirements for computational complexity, memory and power consumption. The CNNs have to be compressed and accelerated before deployment. In order to solve this problem the novel approach combining two known methods, low-rank tensor approximation in Tucker format and quantization of weights and feature maps (activations), is proposed. The greedy one-step and multi-step algorithms for the task of multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08878","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/2006.08878/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":"2006.08878","created_at":"2026-07-05T01:10:43.954428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08878v1","created_at":"2026-07-05T01:10:43.954428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08878","created_at":"2026-07-05T01:10:43.954428+00:00"},{"alias_kind":"pith_short_12","alias_value":"BW6T2SUDNH4X","created_at":"2026-07-05T01:10:43.954428+00:00"},{"alias_kind":"pith_short_16","alias_value":"BW6T2SUDNH4XRGGB","created_at":"2026-07-05T01:10:43.954428+00:00"},{"alias_kind":"pith_short_8","alias_value":"BW6T2SUD","created_at":"2026-07-05T01:10:43.954428+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02085","citing_title":"Fast Monte-Carlo","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX","json":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX.json","graph_json":"https://pith.science/api/pith-number/BW6T2SUDNH4XRGGBWDFJRERDGX/graph.json","events_json":"https://pith.science/api/pith-number/BW6T2SUDNH4XRGGBWDFJRERDGX/events.json","paper":"https://pith.science/paper/BW6T2SUD"},"agent_actions":{"view_html":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX","download_json":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX.json","view_paper":"https://pith.science/paper/BW6T2SUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08878&json=true","fetch_graph":"https://pith.science/api/pith-number/BW6T2SUDNH4XRGGBWDFJRERDGX/graph.json","fetch_events":"https://pith.science/api/pith-number/BW6T2SUDNH4XRGGBWDFJRERDGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX/action/storage_attestation","attest_author":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX/action/author_attestation","sign_citation":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX/action/citation_signature","submit_replication":"https://pith.science/pith/BW6T2SUDNH4XRGGBWDFJRERDGX/action/replication_record"}},"created_at":"2026-07-05T01:10:43.954428+00:00","updated_at":"2026-07-05T01:10:43.954428+00:00"}