{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LBLZ5JPH2QL6EV7FH7PLZ5X4S5","short_pith_number":"pith:LBLZ5JPH","canonical_record":{"source":{"id":"1901.08455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-24T15:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"5b4dd38646e94e2433e9b89ed9afd14383c7637807042e8ff3b27b5a061792da","abstract_canon_sha256":"5e5ed18544a66a85ab6a5742b7560fbac2ade2a1b8c72109376de799af3c070f"},"schema_version":"1.0"},"canonical_sha256":"58579ea5e7d417e257e53fdebcf6fc974dcd1ed860272363aae8dfaea1ffc46d","source":{"kind":"arxiv","id":"1901.08455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08455","created_at":"2026-05-17T23:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08455v1","created_at":"2026-05-17T23:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08455","created_at":"2026-05-17T23:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"LBLZ5JPH2QL6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LBLZ5JPH2QL6EV7F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LBLZ5JPH","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LBLZ5JPH2QL6EV7FH7PLZ5X4S5","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-24T15:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"5b4dd38646e94e2433e9b89ed9afd14383c7637807042e8ff3b27b5a061792da","abstract_canon_sha256":"5e5ed18544a66a85ab6a5742b7560fbac2ade2a1b8c72109376de799af3c070f"},"schema_version":"1.0"},"canonical_sha256":"58579ea5e7d417e257e53fdebcf6fc974dcd1ed860272363aae8dfaea1ffc46d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:35.395677Z","signature_b64":"98MiySftP/Xn64bYI5WKJTQIgsGQf9x3L9BuTqrEqTwWred5YYBkDWZwZ71QElnC++9jxzc6myzXnLgdU60FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58579ea5e7d417e257e53fdebcf6fc974dcd1ed860272363aae8dfaea1ffc46d","last_reissued_at":"2026-05-17T23:55:35.395056Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:35.395056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08455","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:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lI+QaNGLViPwOmzUS96gApEKnZGgSDJuXqfSbCHxGv/yS/oIWKehHK0mi3r+zY1guA3fLatzDNnVBip1YBNMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:24:32.118753Z"},"content_sha256":"59cc806b5c0ea6a011900d01be0d7ca802a1bad47ef9de0a7ce2dab704049cf4","schema_version":"1.0","event_id":"sha256:59cc806b5c0ea6a011900d01be0d7ca802a1bad47ef9de0a7ce2dab704049cf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LBLZ5JPH2QL6EV7FH7PLZ5X4S5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Really should we pruning after model be totally trained? Pruning based on a small amount of training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Li Yue, Shang Lin, Zhao Weibin","submitted_at":"2019-01-24T15:30:54Z","abstract_excerpt":"Pre-training of models in pruning algorithms plays an important role in pruning decision-making. We find that excessive pre-training is not necessary for pruning algorithms. According to this idea, we propose a pruning algorithm---Incremental pruning based on less training (IPLT). Compared with the traditional pruning algorithm based on a large number of pre-training, IPLT has competitive compression effect than the traditional pruning algorithm under the same simple pruning strategy. On the premise of ensuring accuracy, IPLT can achieve 8x-9x compression for VGG-19 on CIFAR-10 and only needs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08455","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:55:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQGmp95qPqzauyd5iH/W9obQQqhi988ucbzRnoZrytiTLJbsNmBXCPAs9A2dBUMK3MHXbbzQFbUcImHLrr3DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:24:32.119095Z"},"content_sha256":"67418096164b8687c103eaebab8611c5b2f27e5f3b3db587c220bd7912588752","schema_version":"1.0","event_id":"sha256:67418096164b8687c103eaebab8611c5b2f27e5f3b3db587c220bd7912588752"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBLZ5JPH2QL6EV7FH7PLZ5X4S5/bundle.json","state_url":"https://pith.science/pith/LBLZ5JPH2QL6EV7FH7PLZ5X4S5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBLZ5JPH2QL6EV7FH7PLZ5X4S5/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-28T10:24:32Z","links":{"resolver":"https://pith.science/pith/LBLZ5JPH2QL6EV7FH7PLZ5X4S5","bundle":"https://pith.science/pith/LBLZ5JPH2QL6EV7FH7PLZ5X4S5/bundle.json","state":"https://pith.science/pith/LBLZ5JPH2QL6EV7FH7PLZ5X4S5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBLZ5JPH2QL6EV7FH7PLZ5X4S5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LBLZ5JPH2QL6EV7FH7PLZ5X4S5","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":"5e5ed18544a66a85ab6a5742b7560fbac2ade2a1b8c72109376de799af3c070f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-24T15:30:54Z","title_canon_sha256":"5b4dd38646e94e2433e9b89ed9afd14383c7637807042e8ff3b27b5a061792da"},"schema_version":"1.0","source":{"id":"1901.08455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08455","created_at":"2026-05-17T23:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08455v1","created_at":"2026-05-17T23:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08455","created_at":"2026-05-17T23:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"LBLZ5JPH2QL6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LBLZ5JPH2QL6EV7F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LBLZ5JPH","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:67418096164b8687c103eaebab8611c5b2f27e5f3b3db587c220bd7912588752","target":"graph","created_at":"2026-05-17T23:55:35Z","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":"Pre-training of models in pruning algorithms plays an important role in pruning decision-making. We find that excessive pre-training is not necessary for pruning algorithms. According to this idea, we propose a pruning algorithm---Incremental pruning based on less training (IPLT). Compared with the traditional pruning algorithm based on a large number of pre-training, IPLT has competitive compression effect than the traditional pruning algorithm under the same simple pruning strategy. On the premise of ensuring accuracy, IPLT can achieve 8x-9x compression for VGG-19 on CIFAR-10 and only needs ","authors_text":"Li Yue, Shang Lin, Zhao Weibin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-24T15:30:54Z","title":"Really should we pruning after model be totally trained? Pruning based on a small amount of training"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08455","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:59cc806b5c0ea6a011900d01be0d7ca802a1bad47ef9de0a7ce2dab704049cf4","target":"record","created_at":"2026-05-17T23:55:35Z","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":"5e5ed18544a66a85ab6a5742b7560fbac2ade2a1b8c72109376de799af3c070f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-24T15:30:54Z","title_canon_sha256":"5b4dd38646e94e2433e9b89ed9afd14383c7637807042e8ff3b27b5a061792da"},"schema_version":"1.0","source":{"id":"1901.08455","kind":"arxiv","version":1}},"canonical_sha256":"58579ea5e7d417e257e53fdebcf6fc974dcd1ed860272363aae8dfaea1ffc46d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58579ea5e7d417e257e53fdebcf6fc974dcd1ed860272363aae8dfaea1ffc46d","first_computed_at":"2026-05-17T23:55:35.395056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:35.395056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"98MiySftP/Xn64bYI5WKJTQIgsGQf9x3L9BuTqrEqTwWred5YYBkDWZwZ71QElnC++9jxzc6myzXnLgdU60FAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:35.395677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59cc806b5c0ea6a011900d01be0d7ca802a1bad47ef9de0a7ce2dab704049cf4","sha256:67418096164b8687c103eaebab8611c5b2f27e5f3b3db587c220bd7912588752"],"state_sha256":"f1dd5c2fe698358edc17a5f28639e04533f025fc66368d60a0390dc12e7e85d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMiUo3qBrsm67l8BU65jSumPTTnNg0wDtLz0Tb7f42fMhxfxq+6pyGnx5akCh6sfkRIkF0SHZZXJHay/s38zCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:24:32.121016Z","bundle_sha256":"817f1fc32698e236e5a439974dd3074497a26968c7fddaaefcb118bce787d943"}}