{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3J2YOWMAQK3BSAOWURVD3UAAWD","short_pith_number":"pith:3J2YOWMA","canonical_record":{"source":{"id":"1902.04224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-12T03:21:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ffa12a213c379a2b57e1d834da6d57d808eea72778d1c8932f7b4c7c8c4fc5ed","abstract_canon_sha256":"a0b61b68c3bc0fd9764254ed08a98f90c4bbe44b1f17a662d223479924a79d1d"},"schema_version":"1.0"},"canonical_sha256":"da7587598082b61901d6a46a3dd000b0e6e585e3c625e2407bc1fe14d89f2dfb","source":{"kind":"arxiv","id":"1902.04224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04224","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04224v1","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04224","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"3J2YOWMAQK3B","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3J2YOWMAQK3BSAOW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3J2YOWMA","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3J2YOWMAQK3BSAOWURVD3UAAWD","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-12T03:21:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ffa12a213c379a2b57e1d834da6d57d808eea72778d1c8932f7b4c7c8c4fc5ed","abstract_canon_sha256":"a0b61b68c3bc0fd9764254ed08a98f90c4bbe44b1f17a662d223479924a79d1d"},"schema_version":"1.0"},"canonical_sha256":"da7587598082b61901d6a46a3dd000b0e6e585e3c625e2407bc1fe14d89f2dfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:12.805551Z","signature_b64":"DYf6ym9D18y49MX0F7CMBB7vkRa13lHRkMhOZb2xXAnAIztlVcbLIDmk89FYYP67YY09VGJfy24Y5veEvMp+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da7587598082b61901d6a46a3dd000b0e6e585e3c625e2407bc1fe14d89f2dfb","last_reissued_at":"2026-05-17T23:54:12.805112Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:12.805112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04224","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:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVyjoL+PxYx9PqKyIwViwKftB/uGKrEzbG3QAMgsazDy7OUPjKm19TZMK5tJO3cyOnAgd7knhqPTPbFxigmeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:17:38.184154Z"},"content_sha256":"f107f9acc554e7e1a7c393cd8d8d295b36ad701f1ef87cf96bec875c91ca5807","schema_version":"1.0","event_id":"sha256:f107f9acc554e7e1a7c393cd8d8d295b36ad701f1ef87cf96bec875c91ca5807"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3J2YOWMAQK3BSAOWURVD3UAAWD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Network Compression Using Simulation-Guided Iterative Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dae-Woong Jeong, Jaehun Kim, Myungsu Chae, Tae-Ho Kim, Youngseok Kim","submitted_at":"2019-02-12T03:21:44Z","abstract_excerpt":"Existing high-performance deep learning models require very intensive computing. For this reason, it is difficult to embed a deep learning model into a system with limited resources. In this paper, we propose the novel idea of the network compression as a method to solve this limitation. The principle of this idea is to make iterative pruning more effective and sophisticated by simulating the reduced network. A simple experiment was conducted to evaluate the method; the results showed that the proposed method achieved higher performance than existing methods at the same pruning level."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04224","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:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFTtIrd/aZCXHvJeYw7tyJfJ3w8fUipn2rhEYYkZmuiP46QwnZU0j5YP/fODqQkMxMrFw+bI6EPcC7rwVPTKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:17:38.184982Z"},"content_sha256":"16ac4addb6dead4065f4b44c7caf20235c4ac84494f56c58d02d81e9da69891d","schema_version":"1.0","event_id":"sha256:16ac4addb6dead4065f4b44c7caf20235c4ac84494f56c58d02d81e9da69891d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3J2YOWMAQK3BSAOWURVD3UAAWD/bundle.json","state_url":"https://pith.science/pith/3J2YOWMAQK3BSAOWURVD3UAAWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3J2YOWMAQK3BSAOWURVD3UAAWD/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-08T21:17:38Z","links":{"resolver":"https://pith.science/pith/3J2YOWMAQK3BSAOWURVD3UAAWD","bundle":"https://pith.science/pith/3J2YOWMAQK3BSAOWURVD3UAAWD/bundle.json","state":"https://pith.science/pith/3J2YOWMAQK3BSAOWURVD3UAAWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3J2YOWMAQK3BSAOWURVD3UAAWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3J2YOWMAQK3BSAOWURVD3UAAWD","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":"a0b61b68c3bc0fd9764254ed08a98f90c4bbe44b1f17a662d223479924a79d1d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-12T03:21:44Z","title_canon_sha256":"ffa12a213c379a2b57e1d834da6d57d808eea72778d1c8932f7b4c7c8c4fc5ed"},"schema_version":"1.0","source":{"id":"1902.04224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04224","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04224v1","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04224","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"3J2YOWMAQK3B","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3J2YOWMAQK3BSAOW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3J2YOWMA","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:16ac4addb6dead4065f4b44c7caf20235c4ac84494f56c58d02d81e9da69891d","target":"graph","created_at":"2026-05-17T23:54:12Z","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":"Existing high-performance deep learning models require very intensive computing. For this reason, it is difficult to embed a deep learning model into a system with limited resources. In this paper, we propose the novel idea of the network compression as a method to solve this limitation. The principle of this idea is to make iterative pruning more effective and sophisticated by simulating the reduced network. A simple experiment was conducted to evaluate the method; the results showed that the proposed method achieved higher performance than existing methods at the same pruning level.","authors_text":"Dae-Woong Jeong, Jaehun Kim, Myungsu Chae, Tae-Ho Kim, Youngseok Kim","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-12T03:21:44Z","title":"Effective Network Compression Using Simulation-Guided Iterative Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04224","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:f107f9acc554e7e1a7c393cd8d8d295b36ad701f1ef87cf96bec875c91ca5807","target":"record","created_at":"2026-05-17T23:54:12Z","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":"a0b61b68c3bc0fd9764254ed08a98f90c4bbe44b1f17a662d223479924a79d1d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-12T03:21:44Z","title_canon_sha256":"ffa12a213c379a2b57e1d834da6d57d808eea72778d1c8932f7b4c7c8c4fc5ed"},"schema_version":"1.0","source":{"id":"1902.04224","kind":"arxiv","version":1}},"canonical_sha256":"da7587598082b61901d6a46a3dd000b0e6e585e3c625e2407bc1fe14d89f2dfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da7587598082b61901d6a46a3dd000b0e6e585e3c625e2407bc1fe14d89f2dfb","first_computed_at":"2026-05-17T23:54:12.805112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:12.805112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DYf6ym9D18y49MX0F7CMBB7vkRa13lHRkMhOZb2xXAnAIztlVcbLIDmk89FYYP67YY09VGJfy24Y5veEvMp+AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:12.805551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f107f9acc554e7e1a7c393cd8d8d295b36ad701f1ef87cf96bec875c91ca5807","sha256:16ac4addb6dead4065f4b44c7caf20235c4ac84494f56c58d02d81e9da69891d"],"state_sha256":"3f725c8927cf7decc41ab45da783b0b920f0d826492e08f3f9f40fcc8fa9d6e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbTxLJ6/uBMJ5t6JdPoYMfTf/8jE+TpNKMGq20rh225L4biUSpCAn+AG34A5KGDqLjXQZwQ95HEu56fV34dmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:17:38.188449Z","bundle_sha256":"7a8eaa61a7f4d02085a097243e99ec13ebe96c2b7444df9d454cd49505e95781"}}