{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6AMI5LN2BDCRLMTM5AGJXCSTRH","short_pith_number":"pith:6AMI5LN2","canonical_record":{"source":{"id":"1412.6553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-19T23:02:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3bf0278a3a67e05ad2e0c724dfcb10ef8aa48f3bb5c1bda34e4407fceb24c1f8","abstract_canon_sha256":"31cbbf26c49bb37cd7522604938c7dfc076fdf59e3637ab12f0e3baf474e54ef"},"schema_version":"1.0"},"canonical_sha256":"f0188eadba08c515b26ce80c9b8a5389df97ce49dcab1bdd13c3aebb560f3aa8","source":{"kind":"arxiv","id":"1412.6553","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6553","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6553v3","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6553","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"6AMI5LN2BDCR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6AMI5LN2BDCRLMTM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6AMI5LN2","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6AMI5LN2BDCRLMTM5AGJXCSTRH","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-19T23:02:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3bf0278a3a67e05ad2e0c724dfcb10ef8aa48f3bb5c1bda34e4407fceb24c1f8","abstract_canon_sha256":"31cbbf26c49bb37cd7522604938c7dfc076fdf59e3637ab12f0e3baf474e54ef"},"schema_version":"1.0"},"canonical_sha256":"f0188eadba08c515b26ce80c9b8a5389df97ce49dcab1bdd13c3aebb560f3aa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:54.329197Z","signature_b64":"r4J8Qv/WH9apI3h75F2Z5wvcyzd60Mze/2rh8OOVwdNbv9ffEtGzvdlSyLSWHJ/vJ5lP4AqCTLEcSpsQBcIvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0188eadba08c515b26ce80c9b8a5389df97ce49dcab1bdd13c3aebb560f3aa8","last_reissued_at":"2026-05-18T02:17:54.328583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:54.328583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6553","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-18T02:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZtGrRc5MYYHBIYLx5U3udrsEhC+i8HnZm/BYIc0Jrx/72ZpMG0q2/Ajari4upTOUY+n+MJ3f/o6BOsCBnVUbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:41.359676Z"},"content_sha256":"dc541f5880a6af1c88978bc8f36768719645a22b3b0745aea76d8ac102ba7456","schema_version":"1.0","event_id":"sha256:dc541f5880a6af1c88978bc8f36768719645a22b3b0745aea76d8ac102ba7456"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6AMI5LN2BDCRLMTM5AGJXCSTRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Ivan Oseledets, Maksim Rakhuba, Vadim Lebedev, Victor Lempitsky, Yaroslav Ganin","submitted_at":"2014-12-19T23:02:43Z","abstract_excerpt":"We propose a simple two-step approach for speeding up convolution layers within large convolutional neural networks based on tensor decomposition and discriminative fine-tuning. Given a layer, we use non-linear least squares to compute a low-rank CP-decomposition of the 4D convolution kernel tensor into a sum of a small number of rank-one tensors. At the second step, this decomposition is used to replace the original convolutional layer with a sequence of four convolutional layers with small kernels. After such replacement, the entire network is fine-tuned on the training data using standard b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6553","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-18T02:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUtBbtvTsVCFqx8FKq+pFBGWpy4XKWtylrYRMNHbRKwkidt2WEtcDQM9BoT7VMurhusyJbwJ9IfjUlanYbi3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:41.360032Z"},"content_sha256":"5bbd545d8196250137acd6fd21c847d4e3c272cd63e42c3fb53728492d1571bd","schema_version":"1.0","event_id":"sha256:5bbd545d8196250137acd6fd21c847d4e3c272cd63e42c3fb53728492d1571bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/bundle.json","state_url":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/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-06-02T17:34:41Z","links":{"resolver":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH","bundle":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/bundle.json","state":"https://pith.science/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AMI5LN2BDCRLMTM5AGJXCSTRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6AMI5LN2BDCRLMTM5AGJXCSTRH","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":"31cbbf26c49bb37cd7522604938c7dfc076fdf59e3637ab12f0e3baf474e54ef","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-19T23:02:43Z","title_canon_sha256":"3bf0278a3a67e05ad2e0c724dfcb10ef8aa48f3bb5c1bda34e4407fceb24c1f8"},"schema_version":"1.0","source":{"id":"1412.6553","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6553","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6553v3","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6553","created_at":"2026-05-18T02:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"6AMI5LN2BDCR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6AMI5LN2BDCRLMTM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6AMI5LN2","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:5bbd545d8196250137acd6fd21c847d4e3c272cd63e42c3fb53728492d1571bd","target":"graph","created_at":"2026-05-18T02:17:54Z","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":"We propose a simple two-step approach for speeding up convolution layers within large convolutional neural networks based on tensor decomposition and discriminative fine-tuning. Given a layer, we use non-linear least squares to compute a low-rank CP-decomposition of the 4D convolution kernel tensor into a sum of a small number of rank-one tensors. At the second step, this decomposition is used to replace the original convolutional layer with a sequence of four convolutional layers with small kernels. After such replacement, the entire network is fine-tuned on the training data using standard b","authors_text":"Ivan Oseledets, Maksim Rakhuba, Vadim Lebedev, Victor Lempitsky, Yaroslav Ganin","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-19T23:02:43Z","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6553","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:dc541f5880a6af1c88978bc8f36768719645a22b3b0745aea76d8ac102ba7456","target":"record","created_at":"2026-05-18T02:17:54Z","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":"31cbbf26c49bb37cd7522604938c7dfc076fdf59e3637ab12f0e3baf474e54ef","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-19T23:02:43Z","title_canon_sha256":"3bf0278a3a67e05ad2e0c724dfcb10ef8aa48f3bb5c1bda34e4407fceb24c1f8"},"schema_version":"1.0","source":{"id":"1412.6553","kind":"arxiv","version":3}},"canonical_sha256":"f0188eadba08c515b26ce80c9b8a5389df97ce49dcab1bdd13c3aebb560f3aa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0188eadba08c515b26ce80c9b8a5389df97ce49dcab1bdd13c3aebb560f3aa8","first_computed_at":"2026-05-18T02:17:54.328583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:54.328583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r4J8Qv/WH9apI3h75F2Z5wvcyzd60Mze/2rh8OOVwdNbv9ffEtGzvdlSyLSWHJ/vJ5lP4AqCTLEcSpsQBcIvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:54.329197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6553","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc541f5880a6af1c88978bc8f36768719645a22b3b0745aea76d8ac102ba7456","sha256:5bbd545d8196250137acd6fd21c847d4e3c272cd63e42c3fb53728492d1571bd"],"state_sha256":"3d99e76610c9c636490c5d55b952841b4896b01f47dd8971ec76b11979faaa60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8G/R7LGk0g5Cgch48IlPzBkBC/uiNK9uUxsG2ibo3dWMAodQaVt93B4bPRF6ITWKt3MmOCM72OoirL8rqUACDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:34:41.362244Z","bundle_sha256":"6d1963c883a30eaa4e6e1197b79aebba798ed9dc90a98f30b8138bed8f52b1aa"}}