{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LAMPFUB43M3BQN7CXW2AA4TIZM","short_pith_number":"pith:LAMPFUB4","canonical_record":{"source":{"id":"2002.08127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-02-19T12:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"f6aa217d992398d5f8b6552115b0bbb99a06ad0cd6e3c7c302bd377a2f687ee6","abstract_canon_sha256":"8d31f93ff2a9c53bbca30e425fbb5ea56686c2d6f9ba5b67fecdfa71e6ca4de8"},"schema_version":"1.0"},"canonical_sha256":"5818f2d03cdb361837e2bdb4007268cb015fe5fb37d526c79db4fdf55caea9dc","source":{"kind":"arxiv","id":"2002.08127","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.08127","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"arxiv_version","alias_value":"2002.08127v2","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.08127","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"pith_short_12","alias_value":"LAMPFUB43M3B","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"pith_short_16","alias_value":"LAMPFUB43M3BQN7C","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"pith_short_8","alias_value":"LAMPFUB4","created_at":"2026-07-05T02:40:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LAMPFUB43M3BQN7CXW2AA4TIZM","target":"record","payload":{"canonical_record":{"source":{"id":"2002.08127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-02-19T12:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"f6aa217d992398d5f8b6552115b0bbb99a06ad0cd6e3c7c302bd377a2f687ee6","abstract_canon_sha256":"8d31f93ff2a9c53bbca30e425fbb5ea56686c2d6f9ba5b67fecdfa71e6ca4de8"},"schema_version":"1.0"},"canonical_sha256":"5818f2d03cdb361837e2bdb4007268cb015fe5fb37d526c79db4fdf55caea9dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:08.560355Z","signature_b64":"E165wrfWvwsEnY5hCrelLDkrAmpvAMZqIPJkISTodw32ABv+3EEww3fpeGdITBAXiD2dkxtKbgRwtMlqrFFrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5818f2d03cdb361837e2bdb4007268cb015fe5fb37d526c79db4fdf55caea9dc","last_reissued_at":"2026-07-05T02:40:08.559880Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:08.559880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.08127","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-05T02:40:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICtcWX2UxlbO5Rgtwy2G7OQS5ZHahVCEZbajJ6YF9TrB4z52xJyOpTO8B4xhfuJGAOKSUZJkBv6hRTvj0pMLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:28:23.174403Z"},"content_sha256":"35002397d92b918c9a2c3f9de256cbfb63afec3cccf26e29f3a1e8ebd5a86c8f","schema_version":"1.0","event_id":"sha256:35002397d92b918c9a2c3f9de256cbfb63afec3cccf26e29f3a1e8ebd5a86c8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LAMPFUB43M3BQN7CXW2AA4TIZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Sparsification with Joint Optimization of Group Convolution and Channel Shuffle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kai Zhao, Ming-Hsuan Yang, Ming-Ming Cheng, Taihong Xiao, Xin-Yu Zhang","submitted_at":"2020-02-19T12:03:10Z","abstract_excerpt":"Recent advances in convolutional neural networks(CNNs) usually come with the expense of excessive computational overhead and memory footprint. Network compression aims to alleviate this issue by training compact models with comparable performance. However, existing compression techniques either entail dedicated expert design or compromise with a moderate performance drop. In this paper, we propose a novel structured sparsification method for efficient network compression. The proposed method automatically induces structured sparsity on the convolutional weights, thereby facilitating the implem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.08127","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/2002.08127/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-05T02:40:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uh92Hrb5Kt5ZzaYZu/IcRd5JOTQp/Tk3DbsOQnedF6/5BtFAxAD3SHoc7BPfU0fNwwacYEtP9++b7uyHFerSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:28:23.174792Z"},"content_sha256":"5230503b902fe344c2cb4d856fc02f62cf6ac396ad9b9aac77c05f1531dac398","schema_version":"1.0","event_id":"sha256:5230503b902fe344c2cb4d856fc02f62cf6ac396ad9b9aac77c05f1531dac398"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAMPFUB43M3BQN7CXW2AA4TIZM/bundle.json","state_url":"https://pith.science/pith/LAMPFUB43M3BQN7CXW2AA4TIZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAMPFUB43M3BQN7CXW2AA4TIZM/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-07-07T08:28:23Z","links":{"resolver":"https://pith.science/pith/LAMPFUB43M3BQN7CXW2AA4TIZM","bundle":"https://pith.science/pith/LAMPFUB43M3BQN7CXW2AA4TIZM/bundle.json","state":"https://pith.science/pith/LAMPFUB43M3BQN7CXW2AA4TIZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAMPFUB43M3BQN7CXW2AA4TIZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LAMPFUB43M3BQN7CXW2AA4TIZM","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":"8d31f93ff2a9c53bbca30e425fbb5ea56686c2d6f9ba5b67fecdfa71e6ca4de8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-02-19T12:03:10Z","title_canon_sha256":"f6aa217d992398d5f8b6552115b0bbb99a06ad0cd6e3c7c302bd377a2f687ee6"},"schema_version":"1.0","source":{"id":"2002.08127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.08127","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"arxiv_version","alias_value":"2002.08127v2","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.08127","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"pith_short_12","alias_value":"LAMPFUB43M3B","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"pith_short_16","alias_value":"LAMPFUB43M3BQN7C","created_at":"2026-07-05T02:40:08Z"},{"alias_kind":"pith_short_8","alias_value":"LAMPFUB4","created_at":"2026-07-05T02:40:08Z"}],"graph_snapshots":[{"event_id":"sha256:5230503b902fe344c2cb4d856fc02f62cf6ac396ad9b9aac77c05f1531dac398","target":"graph","created_at":"2026-07-05T02:40:08Z","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/2002.08127/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent advances in convolutional neural networks(CNNs) usually come with the expense of excessive computational overhead and memory footprint. Network compression aims to alleviate this issue by training compact models with comparable performance. However, existing compression techniques either entail dedicated expert design or compromise with a moderate performance drop. In this paper, we propose a novel structured sparsification method for efficient network compression. The proposed method automatically induces structured sparsity on the convolutional weights, thereby facilitating the implem","authors_text":"Kai Zhao, Ming-Hsuan Yang, Ming-Ming Cheng, Taihong Xiao, Xin-Yu Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-02-19T12:03:10Z","title":"Structured Sparsification with Joint Optimization of Group Convolution and Channel Shuffle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.08127","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:35002397d92b918c9a2c3f9de256cbfb63afec3cccf26e29f3a1e8ebd5a86c8f","target":"record","created_at":"2026-07-05T02:40:08Z","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":"8d31f93ff2a9c53bbca30e425fbb5ea56686c2d6f9ba5b67fecdfa71e6ca4de8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-02-19T12:03:10Z","title_canon_sha256":"f6aa217d992398d5f8b6552115b0bbb99a06ad0cd6e3c7c302bd377a2f687ee6"},"schema_version":"1.0","source":{"id":"2002.08127","kind":"arxiv","version":2}},"canonical_sha256":"5818f2d03cdb361837e2bdb4007268cb015fe5fb37d526c79db4fdf55caea9dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5818f2d03cdb361837e2bdb4007268cb015fe5fb37d526c79db4fdf55caea9dc","first_computed_at":"2026-07-05T02:40:08.559880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:40:08.559880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E165wrfWvwsEnY5hCrelLDkrAmpvAMZqIPJkISTodw32ABv+3EEww3fpeGdITBAXiD2dkxtKbgRwtMlqrFFrCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:40:08.560355Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.08127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35002397d92b918c9a2c3f9de256cbfb63afec3cccf26e29f3a1e8ebd5a86c8f","sha256:5230503b902fe344c2cb4d856fc02f62cf6ac396ad9b9aac77c05f1531dac398"],"state_sha256":"2000c2ca41801680c67d91f62cf9edcf8a1465c9fbbf11561566e56ebfd7af3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3e93L9Vo5dpv3AO16sMfLrBvzPrat1plCtHFLhuxKsKEilBvmL9ce9+D3LXr5m/RPODIIY0NZQPF0UHTD1OAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:28:23.176716Z","bundle_sha256":"4d10ff487bf79501d251208b3c12655655bf2fd179b8f2ca1e48a3516fedd723"}}