{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JBDRJLY3PWIQC4Y4J4K7KZJHJ4","short_pith_number":"pith:JBDRJLY3","canonical_record":{"source":{"id":"1902.06385","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-02-18T03:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"ac99fc8580b35970424366a3c7e5b42b0eb89460f7980d173d8c59b741321eed","abstract_canon_sha256":"2342a4c2e67d190cae0f9560f266d3e0012a6c74b391e9047eae21e2f028a525"},"schema_version":"1.0"},"canonical_sha256":"484714af1b7d9101731c4f15f565274f1d0290c0f2187fea860665615ff2f03d","source":{"kind":"arxiv","id":"1902.06385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06385","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06385v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06385","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"JBDRJLY3PWIQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JBDRJLY3PWIQC4Y4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JBDRJLY3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JBDRJLY3PWIQC4Y4J4K7KZJHJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06385","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-02-18T03:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"ac99fc8580b35970424366a3c7e5b42b0eb89460f7980d173d8c59b741321eed","abstract_canon_sha256":"2342a4c2e67d190cae0f9560f266d3e0012a6c74b391e9047eae21e2f028a525"},"schema_version":"1.0"},"canonical_sha256":"484714af1b7d9101731c4f15f565274f1d0290c0f2187fea860665615ff2f03d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:45.684031Z","signature_b64":"2IFYGvD1DHsSF+hqgKuvrGRUz+kiqb++LQklpWezyxrqalCmVhL6dCrYR0wcDfbXtQnHxbG39NAi87XGqMXYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"484714af1b7d9101731c4f15f565274f1d0290c0f2187fea860665615ff2f03d","last_reissued_at":"2026-05-17T23:53:45.682815Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:45.682815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06385","source_version":1,"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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3N67Pd4YsJzhzyNou0b8iD185dF83c9NyB4BQ3dFTAI4YWRbqGrf/IfsM8BB2FJ4N61ywBGvxxjZnlPd/I9CCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:44:01.259774Z"},"content_sha256":"72de3547cd9280b9360e5771517f64a8b4a1535cbf6d008d1039b814f31ee921","schema_version":"1.0","event_id":"sha256:72de3547cd9280b9360e5771517f64a8b4a1535cbf6d008d1039b814f31ee921"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JBDRJLY3PWIQC4Y4J4K7KZJHJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding up convolutional networks pruning with coarse ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chengcheng Li, Dali Wang, Hairong Qi, Xiangyang Wang, Zi Wang","submitted_at":"2019-02-18T03:13:16Z","abstract_excerpt":"Channel-based pruning has achieved significant successes in accelerating deep convolutional neural network, whose pipeline is an iterative three-step procedure: ranking, pruning and fine-tuning. However, this iterative procedure is computationally expensive. In this study, we present a novel computationally efficient channel pruning approach based on the coarse ranking that utilizes the intermediate results during fine-tuning to rank the importance of filters, built upon state-of-the-art works with data-driven ranking criteria. The goal of this work is not to propose a single improved approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06385","kind":"arxiv","version":1},"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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsZ8QrVpeoUmWZ7pj2UQ8vXCeprAkDZ9etdLRsprQhUVOlZhBVh2IFyrWAnhuroI1sMxbWyXYqOGu7S9OQ+MBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:44:01.260519Z"},"content_sha256":"e4cd20de50978e096e63ca024796271f12d8173a98ebb78f1cd9039b80d8bbfc","schema_version":"1.0","event_id":"sha256:e4cd20de50978e096e63ca024796271f12d8173a98ebb78f1cd9039b80d8bbfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBDRJLY3PWIQC4Y4J4K7KZJHJ4/bundle.json","state_url":"https://pith.science/pith/JBDRJLY3PWIQC4Y4J4K7KZJHJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBDRJLY3PWIQC4Y4J4K7KZJHJ4/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-25T23:44:01Z","links":{"resolver":"https://pith.science/pith/JBDRJLY3PWIQC4Y4J4K7KZJHJ4","bundle":"https://pith.science/pith/JBDRJLY3PWIQC4Y4J4K7KZJHJ4/bundle.json","state":"https://pith.science/pith/JBDRJLY3PWIQC4Y4J4K7KZJHJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBDRJLY3PWIQC4Y4J4K7KZJHJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JBDRJLY3PWIQC4Y4J4K7KZJHJ4","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":"2342a4c2e67d190cae0f9560f266d3e0012a6c74b391e9047eae21e2f028a525","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-02-18T03:13:16Z","title_canon_sha256":"ac99fc8580b35970424366a3c7e5b42b0eb89460f7980d173d8c59b741321eed"},"schema_version":"1.0","source":{"id":"1902.06385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06385","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06385v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06385","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"JBDRJLY3PWIQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JBDRJLY3PWIQC4Y4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JBDRJLY3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:e4cd20de50978e096e63ca024796271f12d8173a98ebb78f1cd9039b80d8bbfc","target":"graph","created_at":"2026-05-17T23:53:45Z","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":"Channel-based pruning has achieved significant successes in accelerating deep convolutional neural network, whose pipeline is an iterative three-step procedure: ranking, pruning and fine-tuning. However, this iterative procedure is computationally expensive. In this study, we present a novel computationally efficient channel pruning approach based on the coarse ranking that utilizes the intermediate results during fine-tuning to rank the importance of filters, built upon state-of-the-art works with data-driven ranking criteria. The goal of this work is not to propose a single improved approach","authors_text":"Chengcheng Li, Dali Wang, Hairong Qi, Xiangyang Wang, Zi Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-02-18T03:13:16Z","title":"Speeding up convolutional networks pruning with coarse ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06385","kind":"arxiv","version":1},"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:72de3547cd9280b9360e5771517f64a8b4a1535cbf6d008d1039b814f31ee921","target":"record","created_at":"2026-05-17T23:53:45Z","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":"2342a4c2e67d190cae0f9560f266d3e0012a6c74b391e9047eae21e2f028a525","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2019-02-18T03:13:16Z","title_canon_sha256":"ac99fc8580b35970424366a3c7e5b42b0eb89460f7980d173d8c59b741321eed"},"schema_version":"1.0","source":{"id":"1902.06385","kind":"arxiv","version":1}},"canonical_sha256":"484714af1b7d9101731c4f15f565274f1d0290c0f2187fea860665615ff2f03d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"484714af1b7d9101731c4f15f565274f1d0290c0f2187fea860665615ff2f03d","first_computed_at":"2026-05-17T23:53:45.682815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:45.682815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2IFYGvD1DHsSF+hqgKuvrGRUz+kiqb++LQklpWezyxrqalCmVhL6dCrYR0wcDfbXtQnHxbG39NAi87XGqMXYAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:45.684031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72de3547cd9280b9360e5771517f64a8b4a1535cbf6d008d1039b814f31ee921","sha256:e4cd20de50978e096e63ca024796271f12d8173a98ebb78f1cd9039b80d8bbfc"],"state_sha256":"3da739d0553bb098abb40ab359b1495a31402b3102507673422fdbe38de4a04d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfZjyC13IyOtApPluGR86H1+/KiVREcwLxd8UDcS9ktn1d4ryJ3TeiSr4hcX3k41DocKZQXSvDaYaVlgghuOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:44:01.263771Z","bundle_sha256":"a41d3345be1bf846f8c6a7a1788f9ec8a2a873dac5cc2b68a9d360434799de46"}}