{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VO4GHZWGX5LEYXRV5257UW3HES","short_pith_number":"pith:VO4GHZWG","canonical_record":{"source":{"id":"2101.04935","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-13T08:28:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1be8bdf19694a8a2f8b7686733d3eb0c785370d3fe7838c3940ecbd3ed8d411","abstract_canon_sha256":"53c886a439481d535873ae5f46170ca6f204e6eadd0e06e23d225e4208704960"},"schema_version":"1.0"},"canonical_sha256":"abb863e6c6bf564c5e35eebbfa5b6724b4367c4fd913eb782dc41af480e58861","source":{"kind":"arxiv","id":"2101.04935","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.04935","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"2101.04935v4","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.04935","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"VO4GHZWGX5LE","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"pith_short_16","alias_value":"VO4GHZWGX5LEYXRV","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"pith_short_8","alias_value":"VO4GHZWG","created_at":"2026-07-05T06:06:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VO4GHZWGX5LEYXRV5257UW3HES","target":"record","payload":{"canonical_record":{"source":{"id":"2101.04935","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-13T08:28:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1be8bdf19694a8a2f8b7686733d3eb0c785370d3fe7838c3940ecbd3ed8d411","abstract_canon_sha256":"53c886a439481d535873ae5f46170ca6f204e6eadd0e06e23d225e4208704960"},"schema_version":"1.0"},"canonical_sha256":"abb863e6c6bf564c5e35eebbfa5b6724b4367c4fd913eb782dc41af480e58861","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:51.272223Z","signature_b64":"bOY4m5fevkaJ1LQtSxjRjao4l+Mcj1VgwLhDkWb9ZquswGsJLrKrs8+7pMln5QvAvP8tdlcBrLggNwH32MCsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abb863e6c6bf564c5e35eebbfa5b6724b4367c4fd913eb782dc41af480e58861","last_reissued_at":"2026-07-05T06:06:51.271547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:51.271547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.04935","source_version":4,"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-05T06:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rh5/vYRHZRf6PKkOKBl36wwBlP6DDlA+LUyrN2Wt1r/6ADdLh5Jngt23UocRKj/M0WBYrQmsqI1fq/pX9iMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:41:23.442498Z"},"content_sha256":"aa425440dd767ffb5ca30f27e1fd7484c2b03e8552d8139a5ee245ab4a1aaa50","schema_version":"1.0","event_id":"sha256:aa425440dd767ffb5ca30f27e1fd7484c2b03e8552d8139a5ee245ab4a1aaa50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VO4GHZWGX5LEYXRV5257UW3HES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single-path Bit Sharing for Automatic Loss-aware Model Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bohan Zhuang, Chunhua Shen, Jianfei Cai, Jing Liu, Mingkui Tan, Peng Chen","submitted_at":"2021-01-13T08:28:21Z","abstract_excerpt":"Network pruning and quantization are proven to be effective ways for deep model compression. To obtain a highly compact model, most methods first perform network pruning and then conduct network quantization based on the pruned model. However, this strategy may ignore that they would affect each other and thus performing them separately may lead to sub-optimal performance. To address this, performing pruning and quantization jointly is essential. Nevertheless, how to make a trade-off between pruning and quantization is non-trivial. Moreover, existing compression methods often rely on some pre-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.04935","kind":"arxiv","version":4},"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/2101.04935/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-05T06:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKd3Ps1pgQHwolkte6m2ofDDnj79zFLAi7nqjd4C6sb6MrHI4KauIituCFU79T3QWvSB5uDfePZCus0nBSABCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:41:23.443009Z"},"content_sha256":"60455e613df0dfcaf32984b1c5105b85a710d959a73af3c4a2dd086245fdfc69","schema_version":"1.0","event_id":"sha256:60455e613df0dfcaf32984b1c5105b85a710d959a73af3c4a2dd086245fdfc69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VO4GHZWGX5LEYXRV5257UW3HES/bundle.json","state_url":"https://pith.science/pith/VO4GHZWGX5LEYXRV5257UW3HES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VO4GHZWGX5LEYXRV5257UW3HES/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-15T02:41:23Z","links":{"resolver":"https://pith.science/pith/VO4GHZWGX5LEYXRV5257UW3HES","bundle":"https://pith.science/pith/VO4GHZWGX5LEYXRV5257UW3HES/bundle.json","state":"https://pith.science/pith/VO4GHZWGX5LEYXRV5257UW3HES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VO4GHZWGX5LEYXRV5257UW3HES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VO4GHZWGX5LEYXRV5257UW3HES","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":"53c886a439481d535873ae5f46170ca6f204e6eadd0e06e23d225e4208704960","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-13T08:28:21Z","title_canon_sha256":"b1be8bdf19694a8a2f8b7686733d3eb0c785370d3fe7838c3940ecbd3ed8d411"},"schema_version":"1.0","source":{"id":"2101.04935","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.04935","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"2101.04935v4","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.04935","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"VO4GHZWGX5LE","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"pith_short_16","alias_value":"VO4GHZWGX5LEYXRV","created_at":"2026-07-05T06:06:51Z"},{"alias_kind":"pith_short_8","alias_value":"VO4GHZWG","created_at":"2026-07-05T06:06:51Z"}],"graph_snapshots":[{"event_id":"sha256:60455e613df0dfcaf32984b1c5105b85a710d959a73af3c4a2dd086245fdfc69","target":"graph","created_at":"2026-07-05T06:06:51Z","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/2101.04935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network pruning and quantization are proven to be effective ways for deep model compression. To obtain a highly compact model, most methods first perform network pruning and then conduct network quantization based on the pruned model. However, this strategy may ignore that they would affect each other and thus performing them separately may lead to sub-optimal performance. To address this, performing pruning and quantization jointly is essential. Nevertheless, how to make a trade-off between pruning and quantization is non-trivial. Moreover, existing compression methods often rely on some pre-","authors_text":"Bohan Zhuang, Chunhua Shen, Jianfei Cai, Jing Liu, Mingkui Tan, Peng Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-13T08:28:21Z","title":"Single-path Bit Sharing for Automatic Loss-aware Model Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.04935","kind":"arxiv","version":4},"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:aa425440dd767ffb5ca30f27e1fd7484c2b03e8552d8139a5ee245ab4a1aaa50","target":"record","created_at":"2026-07-05T06:06:51Z","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":"53c886a439481d535873ae5f46170ca6f204e6eadd0e06e23d225e4208704960","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-13T08:28:21Z","title_canon_sha256":"b1be8bdf19694a8a2f8b7686733d3eb0c785370d3fe7838c3940ecbd3ed8d411"},"schema_version":"1.0","source":{"id":"2101.04935","kind":"arxiv","version":4}},"canonical_sha256":"abb863e6c6bf564c5e35eebbfa5b6724b4367c4fd913eb782dc41af480e58861","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abb863e6c6bf564c5e35eebbfa5b6724b4367c4fd913eb782dc41af480e58861","first_computed_at":"2026-07-05T06:06:51.271547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:06:51.271547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bOY4m5fevkaJ1LQtSxjRjao4l+Mcj1VgwLhDkWb9ZquswGsJLrKrs8+7pMln5QvAvP8tdlcBrLggNwH32MCsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:06:51.272223Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.04935","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa425440dd767ffb5ca30f27e1fd7484c2b03e8552d8139a5ee245ab4a1aaa50","sha256:60455e613df0dfcaf32984b1c5105b85a710d959a73af3c4a2dd086245fdfc69"],"state_sha256":"4e1b16ed9b663f915dfbc281876c794620dd9a73e3d73c987d65f08e79e88468"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNGYsFgObJRV1eDgx8mqgnEumjweuVWyNowd8Bd7KhvuU4VSOARKRCfj51LoFqpHPZr99hnajrYlfFGsPhKTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T02:41:23.448307Z","bundle_sha256":"9d9769d10383a510d9353cc1c0aa2dd9e6e5f7cdafbec0bf2fe85c4862c28c6c"}}