{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TORFDM6IPIC2O3J5P5Q2I2EAYJ","short_pith_number":"pith:TORFDM6I","schema_version":"1.0","canonical_sha256":"9ba251b3c87a05a76d3d7f61a46880c264458cb75e1de275dad96ae3cb249a41","source":{"kind":"arxiv","id":"1812.02402","version":3},"attestation_state":"computed","paper":{"title":"Trained Rank Pruning for Efficient Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Botao Wang, Hongkai Xiong, Shuai Zhang, Wei Wen, Weiyao Lin, Yingyong Qi, Yiran Chen, Yuhui Xu, Yuxi Li","submitted_at":"2018-12-06T08:37:54Z","abstract_excerpt":"The performance of Deep Neural Networks (DNNs) keeps elevating in recent years with increasing network depth and width. To enable DNNs on edge devices like mobile phones, researchers proposed several network compression methods including pruning, quantization and factorization. Among the factorization-based approaches, low-rank approximation has been widely adopted because of its solid theoretical rationale and efficient implementations. Several previous works attempted to directly approximate a pre-trained model by low-rank decomposition; however, small approximation errors in parameters can "},"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":"1812.02402","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-12-06T08:37:54Z","cross_cats_sorted":[],"title_canon_sha256":"d8a6eb18d9a7cfe7567702cec40222f6ddf01392028de7e4c709585968bf0350","abstract_canon_sha256":"3af50a65321724344d2fe44841600f4a2291a69b69b067d75f7e34a8ac56e8ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:24.808185Z","signature_b64":"klzX+Xn0FLXJPFgfW5MxbxfW4xEgFAB+6UtZ8VJiVgssooJ/OR9LznwH8y5pZ2aPzAA+gLTKzkybeGR0nmxvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ba251b3c87a05a76d3d7f61a46880c264458cb75e1de275dad96ae3cb249a41","last_reissued_at":"2026-07-05T00:35:24.807780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:24.807780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trained Rank Pruning for Efficient Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Botao Wang, Hongkai Xiong, Shuai Zhang, Wei Wen, Weiyao Lin, Yingyong Qi, Yiran Chen, Yuhui Xu, Yuxi Li","submitted_at":"2018-12-06T08:37:54Z","abstract_excerpt":"The performance of Deep Neural Networks (DNNs) keeps elevating in recent years with increasing network depth and width. To enable DNNs on edge devices like mobile phones, researchers proposed several network compression methods including pruning, quantization and factorization. Among the factorization-based approaches, low-rank approximation has been widely adopted because of its solid theoretical rationale and efficient implementations. Several previous works attempted to directly approximate a pre-trained model by low-rank decomposition; however, small approximation errors in parameters can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02402","kind":"arxiv","version":3},"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/1812.02402/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":"1812.02402","created_at":"2026-07-05T00:35:24.807844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02402v3","created_at":"2026-07-05T00:35:24.807844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02402","created_at":"2026-07-05T00:35:24.807844+00:00"},{"alias_kind":"pith_short_12","alias_value":"TORFDM6IPIC2","created_at":"2026-07-05T00:35:24.807844+00:00"},{"alias_kind":"pith_short_16","alias_value":"TORFDM6IPIC2O3J5","created_at":"2026-07-05T00:35:24.807844+00:00"},{"alias_kind":"pith_short_8","alias_value":"TORFDM6I","created_at":"2026-07-05T00:35:24.807844+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/TORFDM6IPIC2O3J5P5Q2I2EAYJ","json":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ.json","graph_json":"https://pith.science/api/pith-number/TORFDM6IPIC2O3J5P5Q2I2EAYJ/graph.json","events_json":"https://pith.science/api/pith-number/TORFDM6IPIC2O3J5P5Q2I2EAYJ/events.json","paper":"https://pith.science/paper/TORFDM6I"},"agent_actions":{"view_html":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ","download_json":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ.json","view_paper":"https://pith.science/paper/TORFDM6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02402&json=true","fetch_graph":"https://pith.science/api/pith-number/TORFDM6IPIC2O3J5P5Q2I2EAYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TORFDM6IPIC2O3J5P5Q2I2EAYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ/action/storage_attestation","attest_author":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ/action/author_attestation","sign_citation":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ/action/citation_signature","submit_replication":"https://pith.science/pith/TORFDM6IPIC2O3J5P5Q2I2EAYJ/action/replication_record"}},"created_at":"2026-07-05T00:35:24.807844+00:00","updated_at":"2026-07-05T00:35:24.807844+00:00"}