{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XVIOG6IKFZBH6MZDB76M4ARTWI","short_pith_number":"pith:XVIOG6IK","canonical_record":{"source":{"id":"1901.07827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:29:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3d6ea8807857b624b6233bdce472a108d65e097a5c75e42960aa5a361468829","abstract_canon_sha256":"e8812f166560c7aa129acf3f1a2929a1970423a5f08404daf96aba5b6ff7dd37"},"schema_version":"1.0"},"canonical_sha256":"bd50e3790a2e427f33230ffcce0233b232dc3fc5a30e70ad6d7d95999e1e4f06","source":{"kind":"arxiv","id":"1901.07827","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07827","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07827v2","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07827","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"XVIOG6IKFZBH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XVIOG6IKFZBH6MZD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XVIOG6IK","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XVIOG6IKFZBH6MZDB76M4ARTWI","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:29:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3d6ea8807857b624b6233bdce472a108d65e097a5c75e42960aa5a361468829","abstract_canon_sha256":"e8812f166560c7aa129acf3f1a2929a1970423a5f08404daf96aba5b6ff7dd37"},"schema_version":"1.0"},"canonical_sha256":"bd50e3790a2e427f33230ffcce0233b232dc3fc5a30e70ad6d7d95999e1e4f06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:40.709177Z","signature_b64":"dgMEMvPYAnmZPoxavEslVmy5p0yuE4//HwkHpcZmlw8nnAqvUbAHXFrq47L4VLPyVpGVnqgRfzLdNDWxksorDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd50e3790a2e427f33230ffcce0233b232dc3fc5a30e70ad6d7d95999e1e4f06","last_reissued_at":"2026-05-17T23:50:40.708758Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:40.708758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07827","source_version":2,"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-17T23:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZwyG6QkQmW13GCVXk+M3KVvIcVGfWDsYRnEvO2/EvYBbq8emh5Ym0jASIRvRj6/VAx4ofib+YKXmXwXDZEEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:56.572190Z"},"content_sha256":"204af8fc4a8f3922d42e02b086cf717fb486301dd43aad0b328a746f0f4fec16","schema_version":"1.0","event_id":"sha256:204af8fc4a8f3922d42e02b086cf717fb486301dd43aad0b328a746f0f4fec16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XVIOG6IKFZBH6MZDB76M4ARTWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Compact ConvNets via Structure-Sparsity Regularized Filter Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Cheng Deng, Rongrong Ji, Shaohui Lin, Xuelong Li, Yuchao Li","submitted_at":"2019-01-23T11:29:39Z","abstract_excerpt":"The success of convolutional neural networks (CNNs) in computer vision applications has been accompanied by a significant increase of computation and memory costs, which prohibits its usage on resource-limited environments such as mobile or embedded devices. To this end, the research of CNN compression has recently become emerging. In this paper, we propose a novel filter pruning scheme, termed structured sparsity regularization (SSR), to simultaneously speedup the computation and reduce the memory overhead of CNNs, which can be well supported by various off-the-shelf deep learning libraries. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07827","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"},"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-17T23:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXgl3XXwZuo+898gYuxXP9WYWRIiaKBov2sJ9DSUTsMqrujt/xbmRn6dAX5XQwJ3gCF14PpirdvH6v6/KSGbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:56.572551Z"},"content_sha256":"91b1ecaf18294d30be45b75b4f01e9d933e2fe69d3f0ae0f34e59f951f89da5f","schema_version":"1.0","event_id":"sha256:91b1ecaf18294d30be45b75b4f01e9d933e2fe69d3f0ae0f34e59f951f89da5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVIOG6IKFZBH6MZDB76M4ARTWI/bundle.json","state_url":"https://pith.science/pith/XVIOG6IKFZBH6MZDB76M4ARTWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVIOG6IKFZBH6MZDB76M4ARTWI/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-02T19:26:56Z","links":{"resolver":"https://pith.science/pith/XVIOG6IKFZBH6MZDB76M4ARTWI","bundle":"https://pith.science/pith/XVIOG6IKFZBH6MZDB76M4ARTWI/bundle.json","state":"https://pith.science/pith/XVIOG6IKFZBH6MZDB76M4ARTWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVIOG6IKFZBH6MZDB76M4ARTWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XVIOG6IKFZBH6MZDB76M4ARTWI","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":"e8812f166560c7aa129acf3f1a2929a1970423a5f08404daf96aba5b6ff7dd37","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:29:39Z","title_canon_sha256":"d3d6ea8807857b624b6233bdce472a108d65e097a5c75e42960aa5a361468829"},"schema_version":"1.0","source":{"id":"1901.07827","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07827","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07827v2","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07827","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"XVIOG6IKFZBH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XVIOG6IKFZBH6MZD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XVIOG6IK","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:91b1ecaf18294d30be45b75b4f01e9d933e2fe69d3f0ae0f34e59f951f89da5f","target":"graph","created_at":"2026-05-17T23:50:40Z","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":"The success of convolutional neural networks (CNNs) in computer vision applications has been accompanied by a significant increase of computation and memory costs, which prohibits its usage on resource-limited environments such as mobile or embedded devices. To this end, the research of CNN compression has recently become emerging. In this paper, we propose a novel filter pruning scheme, termed structured sparsity regularization (SSR), to simultaneously speedup the computation and reduce the memory overhead of CNNs, which can be well supported by various off-the-shelf deep learning libraries. ","authors_text":"Cheng Deng, Rongrong Ji, Shaohui Lin, Xuelong Li, Yuchao Li","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:29:39Z","title":"Towards Compact ConvNets via Structure-Sparsity Regularized Filter Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07827","kind":"arxiv","version":2},"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:204af8fc4a8f3922d42e02b086cf717fb486301dd43aad0b328a746f0f4fec16","target":"record","created_at":"2026-05-17T23:50:40Z","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":"e8812f166560c7aa129acf3f1a2929a1970423a5f08404daf96aba5b6ff7dd37","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T11:29:39Z","title_canon_sha256":"d3d6ea8807857b624b6233bdce472a108d65e097a5c75e42960aa5a361468829"},"schema_version":"1.0","source":{"id":"1901.07827","kind":"arxiv","version":2}},"canonical_sha256":"bd50e3790a2e427f33230ffcce0233b232dc3fc5a30e70ad6d7d95999e1e4f06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd50e3790a2e427f33230ffcce0233b232dc3fc5a30e70ad6d7d95999e1e4f06","first_computed_at":"2026-05-17T23:50:40.708758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:40.708758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dgMEMvPYAnmZPoxavEslVmy5p0yuE4//HwkHpcZmlw8nnAqvUbAHXFrq47L4VLPyVpGVnqgRfzLdNDWxksorDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:40.709177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07827","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:204af8fc4a8f3922d42e02b086cf717fb486301dd43aad0b328a746f0f4fec16","sha256:91b1ecaf18294d30be45b75b4f01e9d933e2fe69d3f0ae0f34e59f951f89da5f"],"state_sha256":"447bb6015f100463a6340fd60f369abb33c1cd04b0008092bd4a32095279c665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGG2thKUK4h+4mLBlobyZGzXAoMhh9SPbLWdZA/rMMUZv6wu6Y4hQJSrtxfNCZbYmM4b57d0bgPHRkGxhZ0fBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:26:56.574470Z","bundle_sha256":"b6185e5d7657ece5ebae067846da6aa19531dab0a21ec5d7dc038918c7426434"}}