{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T62POGPUAIEYZSIQ3ARUGXFC3H","short_pith_number":"pith:T62POGPU","schema_version":"1.0","canonical_sha256":"9fb4f719f402098cc910d823435ca2d9e794c268beddb1852b7d67a6f8877db3","source":{"kind":"arxiv","id":"2403.14379","version":2},"attestation_state":"computed","paper":{"title":"Tensor network compressibility of convolutional models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","quant-ph"],"primary_cat":"cs.CV","authors_text":"Roman Orus, Saeed S. Jahromi, Sukhbinder Singh","submitted_at":"2024-03-21T13:12:33Z","abstract_excerpt":"Convolutional neural networks (CNNs) are one of the most widely used neural network architectures, showcasing state-of-the-art performance in computer vision tasks. Although larger CNNs generally exhibit higher accuracy, their size can be effectively reduced by ``tensorization'' while maintaining accuracy, namely, replacing the convolution kernels with compact decompositions such as Tucker, Canonical Polyadic decompositions, or quantum-inspired decompositions such as matrix product states, and directly training the factors in the decompositions to bias the learning towards low-rank decompositi"},"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":"2403.14379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-03-21T13:12:33Z","cross_cats_sorted":["cs.LG","quant-ph"],"title_canon_sha256":"30af3d341d3bb95d95318a65301f7711a764eafdf4c7c53c9e56b24be40e195e","abstract_canon_sha256":"ebc55351c9540dafae93a9ccdf53f8c333691a5ff5b38526b003be690c330074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:46.918191Z","signature_b64":"J6aiCf0CpM6ZRroKJsqMuXOmyKiln8g5Z/rH11puBQB08JRo9Ti+ymu5z3dL3krP58WIde4RUXDxLobj8RBHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb4f719f402098cc910d823435ca2d9e794c268beddb1852b7d67a6f8877db3","last_reissued_at":"2026-07-05T08:56:46.917748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:46.917748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor network compressibility of convolutional models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","quant-ph"],"primary_cat":"cs.CV","authors_text":"Roman Orus, Saeed S. Jahromi, Sukhbinder Singh","submitted_at":"2024-03-21T13:12:33Z","abstract_excerpt":"Convolutional neural networks (CNNs) are one of the most widely used neural network architectures, showcasing state-of-the-art performance in computer vision tasks. Although larger CNNs generally exhibit higher accuracy, their size can be effectively reduced by ``tensorization'' while maintaining accuracy, namely, replacing the convolution kernels with compact decompositions such as Tucker, Canonical Polyadic decompositions, or quantum-inspired decompositions such as matrix product states, and directly training the factors in the decompositions to bias the learning towards low-rank decompositi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14379","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.14379/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":"2403.14379","created_at":"2026-07-05T08:56:46.917813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14379v2","created_at":"2026-07-05T08:56:46.917813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14379","created_at":"2026-07-05T08:56:46.917813+00:00"},{"alias_kind":"pith_short_12","alias_value":"T62POGPUAIEY","created_at":"2026-07-05T08:56:46.917813+00:00"},{"alias_kind":"pith_short_16","alias_value":"T62POGPUAIEYZSIQ","created_at":"2026-07-05T08:56:46.917813+00:00"},{"alias_kind":"pith_short_8","alias_value":"T62POGPU","created_at":"2026-07-05T08:56:46.917813+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.06577","citing_title":"Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19842","citing_title":"Fast Tensorization of Neural Networks via Slice-wise Feature Distillation","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H","json":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H.json","graph_json":"https://pith.science/api/pith-number/T62POGPUAIEYZSIQ3ARUGXFC3H/graph.json","events_json":"https://pith.science/api/pith-number/T62POGPUAIEYZSIQ3ARUGXFC3H/events.json","paper":"https://pith.science/paper/T62POGPU"},"agent_actions":{"view_html":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H","download_json":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H.json","view_paper":"https://pith.science/paper/T62POGPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14379&json=true","fetch_graph":"https://pith.science/api/pith-number/T62POGPUAIEYZSIQ3ARUGXFC3H/graph.json","fetch_events":"https://pith.science/api/pith-number/T62POGPUAIEYZSIQ3ARUGXFC3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H/action/storage_attestation","attest_author":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H/action/author_attestation","sign_citation":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H/action/citation_signature","submit_replication":"https://pith.science/pith/T62POGPUAIEYZSIQ3ARUGXFC3H/action/replication_record"}},"created_at":"2026-07-05T08:56:46.917813+00:00","updated_at":"2026-07-05T08:56:46.917813+00:00"}