{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EM52TR3P44SQVH25BTAAWRBYRX","short_pith_number":"pith:EM52TR3P","schema_version":"1.0","canonical_sha256":"233ba9c76fe7250a9f5d0cc00b44388dea8492b929977ea3e704a951d86bcb88","source":{"kind":"arxiv","id":"1509.06569","version":2},"attestation_state":"computed","paper":{"title":"Tensorizing Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Alexander Novikov, Anton Osokin, Dmitry Podoprikhin, Dmitry Vetrov","submitted_at":"2015-09-22T12:31:03Z","abstract_excerpt":"Deep neural networks currently demonstrate state-of-the-art performance in several domains. At the same time, models of this class are very demanding in terms of computational resources. In particular, a large amount of memory is required by commonly used fully-connected layers, making it hard to use the models on low-end devices and stopping the further increase of the model size. In this paper we convert the dense weight matrices of the fully-connected layers to the Tensor Train format such that the number of parameters is reduced by a huge factor and at the same time the expressive power of"},"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":"1509.06569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-22T12:31:03Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"8b16af44cfb3754694124194a421747bd76827f4e0f629c3f94cb860f2f92cea","abstract_canon_sha256":"84b00f666b6f62f1fa6b5f86df8ff45b2fa650eda8775ac1c052c16342052a2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:03.230263Z","signature_b64":"lZ+nsbSrmy+EcNC5yp1uK/sxBgNZsbOjapxvj0kJk6+GNmzCX0rZVgw7ud7Qa9PAixegwuCnESIQEU/kv8wLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"233ba9c76fe7250a9f5d0cc00b44388dea8492b929977ea3e704a951d86bcb88","last_reissued_at":"2026-05-18T01:24:03.229469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:03.229469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensorizing Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Alexander Novikov, Anton Osokin, Dmitry Podoprikhin, Dmitry Vetrov","submitted_at":"2015-09-22T12:31:03Z","abstract_excerpt":"Deep neural networks currently demonstrate state-of-the-art performance in several domains. At the same time, models of this class are very demanding in terms of computational resources. In particular, a large amount of memory is required by commonly used fully-connected layers, making it hard to use the models on low-end devices and stopping the further increase of the model size. In this paper we convert the dense weight matrices of the fully-connected layers to the Tensor Train format such that the number of parameters is reduced by a huge factor and at the same time the expressive power of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06569","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1509.06569","created_at":"2026-05-18T01:24:03.229609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06569v2","created_at":"2026-05-18T01:24:03.229609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06569","created_at":"2026-05-18T01:24:03.229609+00:00"},{"alias_kind":"pith_short_12","alias_value":"EM52TR3P44SQ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EM52TR3P44SQVH25","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EM52TR3P","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2309.06577","citing_title":"Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20353","citing_title":"Synchronous and Asynchronous Parallelism Approaches for Generalized Canonical Polyadic Tensor Decomposition with GenTen","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2510.09696","citing_title":"Vanishing Contributions: A Unified Framework for Smooth and Iterative Model Compression","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX","json":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX.json","graph_json":"https://pith.science/api/pith-number/EM52TR3P44SQVH25BTAAWRBYRX/graph.json","events_json":"https://pith.science/api/pith-number/EM52TR3P44SQVH25BTAAWRBYRX/events.json","paper":"https://pith.science/paper/EM52TR3P"},"agent_actions":{"view_html":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX","download_json":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX.json","view_paper":"https://pith.science/paper/EM52TR3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06569&json=true","fetch_graph":"https://pith.science/api/pith-number/EM52TR3P44SQVH25BTAAWRBYRX/graph.json","fetch_events":"https://pith.science/api/pith-number/EM52TR3P44SQVH25BTAAWRBYRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX/action/storage_attestation","attest_author":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX/action/author_attestation","sign_citation":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX/action/citation_signature","submit_replication":"https://pith.science/pith/EM52TR3P44SQVH25BTAAWRBYRX/action/replication_record"}},"created_at":"2026-05-18T01:24:03.229609+00:00","updated_at":"2026-05-18T01:24:03.229609+00:00"}