{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N4B3SQXXQOFW2B6T6Z7EZI2KYD","short_pith_number":"pith:N4B3SQXX","canonical_record":{"source":{"id":"1511.06067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T06:13:55Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"997d81cdcf390eab02ef0e4d6c17f3a50b687b915f64e28681f036acf655703e","abstract_canon_sha256":"d8c22f8f3f8c7952028ce8b9099e9cc67d394c948e4ec3ad65bfb24afcaae4c0"},"schema_version":"1.0"},"canonical_sha256":"6f03b942f7838b6d07d3f67e4ca34ac0f66f52712a083c5eed608c02317759b2","source":{"kind":"arxiv","id":"1511.06067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06067","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06067v3","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06067","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"N4B3SQXXQOFW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N4B3SQXXQOFW2B6T","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N4B3SQXX","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N4B3SQXXQOFW2B6T6Z7EZI2KYD","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T06:13:55Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"997d81cdcf390eab02ef0e4d6c17f3a50b687b915f64e28681f036acf655703e","abstract_canon_sha256":"d8c22f8f3f8c7952028ce8b9099e9cc67d394c948e4ec3ad65bfb24afcaae4c0"},"schema_version":"1.0"},"canonical_sha256":"6f03b942f7838b6d07d3f67e4ca34ac0f66f52712a083c5eed608c02317759b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:51.806131Z","signature_b64":"DwQds+wrz3gyqxlg4rtkU+6c0h6S3IvxEA6un4MYv3mx6YoaEEH0l5BfK0YnjIegwDMIxlJJLF7nkEMOdX3sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f03b942f7838b6d07d3f67e4ca34ac0f66f52712a083c5eed608c02317759b2","last_reissued_at":"2026-05-18T01:20:51.805456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:51.805456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06067","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uxw1uyy0jGEiBbJNJJv4AnGPVeBZovBXlvjqAY8v/7wnYbH4hlXFNzTVPEQRuEfRGnqvDIuqT1YzbrkAkPlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:18:27.271877Z"},"content_sha256":"08f6a28eb65026f29feb36b3c79bdf5f6096b7925a4cbd5f993ede41a94fa424","schema_version":"1.0","event_id":"sha256:08f6a28eb65026f29feb36b3c79bdf5f6096b7925a4cbd5f993ede41a94fa424"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N4B3SQXXQOFW2B6T6Z7EZI2KYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional neural networks with low-rank regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cheng Tai, Tong Xiao, Weinan E, Xiaogang Wang, Yi Zhang","submitted_at":"2015-11-19T06:13:55Z","abstract_excerpt":"Large CNNs have delivered impressive performance in various computer vision applications. But the storage and computation requirements make it problematic for deploying these models on mobile devices. Recently, tensor decompositions have been used for speeding up CNNs. In this paper, we further develop the tensor decomposition technique. We propose a new algorithm for computing the low-rank tensor decomposition for removing the redundancy in the convolution kernels. The algorithm finds the exact global optimizer of the decomposition and is more effective than iterative methods. Based on the de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06067","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgLZ5pXWIC4Asw6IKHemLM++3Ggcpxu3VMR8bMW3OT2yzO6owynbOIs45qIfu7z19D5wR1+3plFBW9Hum7SbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:18:27.272501Z"},"content_sha256":"5ac505d3e11f600f630f649c3c1aa40b5b6f1fa2c19500d81e063616659a777e","schema_version":"1.0","event_id":"sha256:5ac505d3e11f600f630f649c3c1aa40b5b6f1fa2c19500d81e063616659a777e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4B3SQXXQOFW2B6T6Z7EZI2KYD/bundle.json","state_url":"https://pith.science/pith/N4B3SQXXQOFW2B6T6Z7EZI2KYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4B3SQXXQOFW2B6T6Z7EZI2KYD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T14:18:27Z","links":{"resolver":"https://pith.science/pith/N4B3SQXXQOFW2B6T6Z7EZI2KYD","bundle":"https://pith.science/pith/N4B3SQXXQOFW2B6T6Z7EZI2KYD/bundle.json","state":"https://pith.science/pith/N4B3SQXXQOFW2B6T6Z7EZI2KYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4B3SQXXQOFW2B6T6Z7EZI2KYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N4B3SQXXQOFW2B6T6Z7EZI2KYD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d8c22f8f3f8c7952028ce8b9099e9cc67d394c948e4ec3ad65bfb24afcaae4c0","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T06:13:55Z","title_canon_sha256":"997d81cdcf390eab02ef0e4d6c17f3a50b687b915f64e28681f036acf655703e"},"schema_version":"1.0","source":{"id":"1511.06067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06067","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06067v3","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06067","created_at":"2026-05-18T01:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"N4B3SQXXQOFW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N4B3SQXXQOFW2B6T","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N4B3SQXX","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:5ac505d3e11f600f630f649c3c1aa40b5b6f1fa2c19500d81e063616659a777e","target":"graph","created_at":"2026-05-18T01:20:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Large CNNs have delivered impressive performance in various computer vision applications. But the storage and computation requirements make it problematic for deploying these models on mobile devices. Recently, tensor decompositions have been used for speeding up CNNs. In this paper, we further develop the tensor decomposition technique. We propose a new algorithm for computing the low-rank tensor decomposition for removing the redundancy in the convolution kernels. The algorithm finds the exact global optimizer of the decomposition and is more effective than iterative methods. Based on the de","authors_text":"Cheng Tai, Tong Xiao, Weinan E, Xiaogang Wang, Yi Zhang","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T06:13:55Z","title":"Convolutional neural networks with low-rank regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06067","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:08f6a28eb65026f29feb36b3c79bdf5f6096b7925a4cbd5f993ede41a94fa424","target":"record","created_at":"2026-05-18T01:20:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d8c22f8f3f8c7952028ce8b9099e9cc67d394c948e4ec3ad65bfb24afcaae4c0","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T06:13:55Z","title_canon_sha256":"997d81cdcf390eab02ef0e4d6c17f3a50b687b915f64e28681f036acf655703e"},"schema_version":"1.0","source":{"id":"1511.06067","kind":"arxiv","version":3}},"canonical_sha256":"6f03b942f7838b6d07d3f67e4ca34ac0f66f52712a083c5eed608c02317759b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f03b942f7838b6d07d3f67e4ca34ac0f66f52712a083c5eed608c02317759b2","first_computed_at":"2026-05-18T01:20:51.805456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:51.805456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DwQds+wrz3gyqxlg4rtkU+6c0h6S3IvxEA6un4MYv3mx6YoaEEH0l5BfK0YnjIegwDMIxlJJLF7nkEMOdX3sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:51.806131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08f6a28eb65026f29feb36b3c79bdf5f6096b7925a4cbd5f993ede41a94fa424","sha256:5ac505d3e11f600f630f649c3c1aa40b5b6f1fa2c19500d81e063616659a777e"],"state_sha256":"c5ead5baf0e9a953bd862f44da862c9ec671613a71cbaea3e1740486b96b1332"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbEPxO9ZXTn0tRcviihh/XSBY4zLQBub62Tooqeo2rbmPocNqyfQMLzgqyi7N4QzJ26pzUBdW/+n859+2FDWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:18:27.275277Z","bundle_sha256":"ef9bcc3732fcd4c84a34f5945307d9383add3cb65cde0762c78458a774373130"}}