{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NM5M5FIKU25PFXFOWDVXZJS2YU","short_pith_number":"pith:NM5M5FIK","canonical_record":{"source":{"id":"2408.16772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-14T17:19:56Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"930fad8915c96c52f30703f1612d0c87a4f64f9820d82d54fe294d6d6671032d","abstract_canon_sha256":"8a593982726ccfe72f90747d626377de371f04748c63258fdb1cc458098f55f3"},"schema_version":"1.0"},"canonical_sha256":"6b3ace950aa6baf2dcaeb0eb7ca65ac508bcf34562557b51286ce466e551334a","source":{"kind":"arxiv","id":"2408.16772","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16772","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16772v2","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16772","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"NM5M5FIKU25P","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"pith_short_16","alias_value":"NM5M5FIKU25PFXFO","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"pith_short_8","alias_value":"NM5M5FIK","created_at":"2026-07-05T09:02:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NM5M5FIKU25PFXFOWDVXZJS2YU","target":"record","payload":{"canonical_record":{"source":{"id":"2408.16772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-14T17:19:56Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"930fad8915c96c52f30703f1612d0c87a4f64f9820d82d54fe294d6d6671032d","abstract_canon_sha256":"8a593982726ccfe72f90747d626377de371f04748c63258fdb1cc458098f55f3"},"schema_version":"1.0"},"canonical_sha256":"6b3ace950aa6baf2dcaeb0eb7ca65ac508bcf34562557b51286ce466e551334a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:25.446302Z","signature_b64":"xm5zyQub01i7luDW/1+FcNLbrpbqxv0ez5EPcqSq9lsRI7zw7aNBl5gGZC6pPslZtEqynzv5qlKejA5SdhQVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b3ace950aa6baf2dcaeb0eb7ca65ac508bcf34562557b51286ce466e551334a","last_reissued_at":"2026-07-05T09:02:25.445794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:25.445794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.16772","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-07-05T09:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"389TgVnhh3fytGqedINNuP1/bhJBIRCSlZraJcTs7z0i4Rpiu8r+LoZ8eFR3K94xo0R2pcbrRulj/9axAhgICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:31:11.065059Z"},"content_sha256":"0b2822c4f99b85a9bd28d6052f198579113203249bee769f9be4b2facbd1abed","schema_version":"1.0","event_id":"sha256:0b2822c4f99b85a9bd28d6052f198579113203249bee769f9be4b2facbd1abed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NM5M5FIKU25PFXFOWDVXZJS2YU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Effective Information Theoretic Framework for Channel Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Yihao Chen, Zefang Wang","submitted_at":"2024-08-14T17:19:56Z","abstract_excerpt":"Channel pruning is a promising method for accelerating and compressing convolutional neural networks. However, current pruning algorithms still remain unsolved problems that how to assign layer-wise pruning ratios properly and discard the least important channels with a convincing criterion. In this paper, we present a novel channel pruning approach via information theory and interpretability of neural networks. Specifically, we regard information entropy as the expected amount of information for convolutional layers. In addition, if we suppose a matrix as a system of linear equations, a highe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16772","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.16772/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/w4cdLO/Heri3aM0zOaNzSM8pVmj0G238RztEkygMgrtsd6HfwsGlwc1Q0aYB3cJ7xYjdxiYx1+BSQqVozdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:31:11.065628Z"},"content_sha256":"6a856dc6f5ab12dd21a874a0fd960d9a99cac120e4a17ea675aff92a8910f221","schema_version":"1.0","event_id":"sha256:6a856dc6f5ab12dd21a874a0fd960d9a99cac120e4a17ea675aff92a8910f221"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NM5M5FIKU25PFXFOWDVXZJS2YU/bundle.json","state_url":"https://pith.science/pith/NM5M5FIKU25PFXFOWDVXZJS2YU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NM5M5FIKU25PFXFOWDVXZJS2YU/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-08-07T22:31:11Z","links":{"resolver":"https://pith.science/pith/NM5M5FIKU25PFXFOWDVXZJS2YU","bundle":"https://pith.science/pith/NM5M5FIKU25PFXFOWDVXZJS2YU/bundle.json","state":"https://pith.science/pith/NM5M5FIKU25PFXFOWDVXZJS2YU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NM5M5FIKU25PFXFOWDVXZJS2YU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NM5M5FIKU25PFXFOWDVXZJS2YU","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":"8a593982726ccfe72f90747d626377de371f04748c63258fdb1cc458098f55f3","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-14T17:19:56Z","title_canon_sha256":"930fad8915c96c52f30703f1612d0c87a4f64f9820d82d54fe294d6d6671032d"},"schema_version":"1.0","source":{"id":"2408.16772","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16772","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16772v2","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16772","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"NM5M5FIKU25P","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"pith_short_16","alias_value":"NM5M5FIKU25PFXFO","created_at":"2026-07-05T09:02:25Z"},{"alias_kind":"pith_short_8","alias_value":"NM5M5FIK","created_at":"2026-07-05T09:02:25Z"}],"graph_snapshots":[{"event_id":"sha256:6a856dc6f5ab12dd21a874a0fd960d9a99cac120e4a17ea675aff92a8910f221","target":"graph","created_at":"2026-07-05T09:02:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.16772/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Channel pruning is a promising method for accelerating and compressing convolutional neural networks. However, current pruning algorithms still remain unsolved problems that how to assign layer-wise pruning ratios properly and discard the least important channels with a convincing criterion. In this paper, we present a novel channel pruning approach via information theory and interpretability of neural networks. Specifically, we regard information entropy as the expected amount of information for convolutional layers. In addition, if we suppose a matrix as a system of linear equations, a highe","authors_text":"Yihao Chen, Zefang Wang","cross_cats":["cs.AI","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-14T17:19:56Z","title":"An Effective Information Theoretic Framework for Channel Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16772","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:0b2822c4f99b85a9bd28d6052f198579113203249bee769f9be4b2facbd1abed","target":"record","created_at":"2026-07-05T09:02:25Z","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":"8a593982726ccfe72f90747d626377de371f04748c63258fdb1cc458098f55f3","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-08-14T17:19:56Z","title_canon_sha256":"930fad8915c96c52f30703f1612d0c87a4f64f9820d82d54fe294d6d6671032d"},"schema_version":"1.0","source":{"id":"2408.16772","kind":"arxiv","version":2}},"canonical_sha256":"6b3ace950aa6baf2dcaeb0eb7ca65ac508bcf34562557b51286ce466e551334a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b3ace950aa6baf2dcaeb0eb7ca65ac508bcf34562557b51286ce466e551334a","first_computed_at":"2026-07-05T09:02:25.445794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:02:25.445794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xm5zyQub01i7luDW/1+FcNLbrpbqxv0ez5EPcqSq9lsRI7zw7aNBl5gGZC6pPslZtEqynzv5qlKejA5SdhQVCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:02:25.446302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.16772","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b2822c4f99b85a9bd28d6052f198579113203249bee769f9be4b2facbd1abed","sha256:6a856dc6f5ab12dd21a874a0fd960d9a99cac120e4a17ea675aff92a8910f221"],"state_sha256":"9e217ca1ef24a60564a034dd8216d9ef86469e24690219cd130edb00c77d66e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKC7cC/sdwe6bpgAhNLM6CYJoPhhAMzCztWQA1+IUSnT13EUCPZGBnIUYlQZB1VAwHfINLgEPOcIas46a5T7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:31:11.073015Z","bundle_sha256":"6dedb2c476a94bc8ed4969d7e8cf1ce07f129cd9cdd63ef519e67b27cc1cfed9"}}