{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3QR4NASEJJJT2RAXQE4AUEFZCH","short_pith_number":"pith:3QR4NASE","canonical_record":{"source":{"id":"2302.14623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-28T15:03:18Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"be59d5bc9bd44c5a02deebad500df6d0ddbfc4bed5b7c92bb1a0187272512f51","abstract_canon_sha256":"b41feac4735cb69bfcdce4d924d349f4c8f61f9171d045f262901c9114ce763a"},"schema_version":"1.0"},"canonical_sha256":"dc23c682444a533d441781380a10b911deabef678e12ea82af1ef4f92e14b39e","source":{"kind":"arxiv","id":"2302.14623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.14623","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"arxiv_version","alias_value":"2302.14623v1","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14623","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"pith_short_12","alias_value":"3QR4NASEJJJT","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"pith_short_16","alias_value":"3QR4NASEJJJT2RAX","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"pith_short_8","alias_value":"3QR4NASE","created_at":"2026-07-05T05:46:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3QR4NASEJJJT2RAXQE4AUEFZCH","target":"record","payload":{"canonical_record":{"source":{"id":"2302.14623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-28T15:03:18Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"be59d5bc9bd44c5a02deebad500df6d0ddbfc4bed5b7c92bb1a0187272512f51","abstract_canon_sha256":"b41feac4735cb69bfcdce4d924d349f4c8f61f9171d045f262901c9114ce763a"},"schema_version":"1.0"},"canonical_sha256":"dc23c682444a533d441781380a10b911deabef678e12ea82af1ef4f92e14b39e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:46:47.417398Z","signature_b64":"kBwExu2ZAd3S2aUbSp5aJSleCXqHy6cxq/Wj4wyaimBXhP3LpeCftRyrt1Su1qQzyILtdQMTDfDAgdfLZ6ozDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc23c682444a533d441781380a10b911deabef678e12ea82af1ef4f92e14b39e","last_reissued_at":"2026-07-05T05:46:47.416944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:46:47.416944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.14623","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-07-05T05:46:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7Tmu8bKQFdn9JC+8yor1z4njwaux1a7w89IIrLes7xmy4UfnET51qh4yzutL4KZfGSUkyglEZtGldQsrqFPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:49:12.110679Z"},"content_sha256":"9b33ac7868811c254ac1ea700cc7d6fedbac8dd61bc0d116738da31842a9fccc","schema_version":"1.0","event_id":"sha256:9b33ac7868811c254ac1ea700cc7d6fedbac8dd61bc0d116738da31842a9fccc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3QR4NASEJJJT2RAXQE4AUEFZCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"cs.LG","authors_text":"Hussein Hazimeh, Natalia Ponomareva, Rahul Mazumder, Riade Benbaki, Wenyu Chen, Xiang Meng, Zhe Zhao","submitted_at":"2023-02-28T15:03:18Z","abstract_excerpt":"The sheer size of modern neural networks makes model serving a serious computational challenge. A popular class of compression techniques overcomes this challenge by pruning or sparsifying the weights of pretrained networks. While useful, these techniques often face serious tradeoffs between computational requirements and compression quality. In this work, we propose a novel optimization-based pruning framework that considers the combined effect of pruning (and updating) multiple weights subject to a sparsity constraint. Our approach, CHITA, extends the classical Optimal Brain Surgeon framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14623","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.14623/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-05T05:46:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjVWapBcNXWHGuk5EzTBp+XX8jYshJhcwy0dnfHY9c/p15hR4+Gw19TZz0muuNIJi16kHuUwJ/ufFbGdMI7qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:49:12.111200Z"},"content_sha256":"1d27d45c375c6744ae0f6ab64929bf8ef308a624fd3694cea5fa66f96465490c","schema_version":"1.0","event_id":"sha256:1d27d45c375c6744ae0f6ab64929bf8ef308a624fd3694cea5fa66f96465490c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QR4NASEJJJT2RAXQE4AUEFZCH/bundle.json","state_url":"https://pith.science/pith/3QR4NASEJJJT2RAXQE4AUEFZCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QR4NASEJJJT2RAXQE4AUEFZCH/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-08T21:49:12Z","links":{"resolver":"https://pith.science/pith/3QR4NASEJJJT2RAXQE4AUEFZCH","bundle":"https://pith.science/pith/3QR4NASEJJJT2RAXQE4AUEFZCH/bundle.json","state":"https://pith.science/pith/3QR4NASEJJJT2RAXQE4AUEFZCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QR4NASEJJJT2RAXQE4AUEFZCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3QR4NASEJJJT2RAXQE4AUEFZCH","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":"b41feac4735cb69bfcdce4d924d349f4c8f61f9171d045f262901c9114ce763a","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-28T15:03:18Z","title_canon_sha256":"be59d5bc9bd44c5a02deebad500df6d0ddbfc4bed5b7c92bb1a0187272512f51"},"schema_version":"1.0","source":{"id":"2302.14623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.14623","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"arxiv_version","alias_value":"2302.14623v1","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14623","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"pith_short_12","alias_value":"3QR4NASEJJJT","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"pith_short_16","alias_value":"3QR4NASEJJJT2RAX","created_at":"2026-07-05T05:46:47Z"},{"alias_kind":"pith_short_8","alias_value":"3QR4NASE","created_at":"2026-07-05T05:46:47Z"}],"graph_snapshots":[{"event_id":"sha256:1d27d45c375c6744ae0f6ab64929bf8ef308a624fd3694cea5fa66f96465490c","target":"graph","created_at":"2026-07-05T05:46:47Z","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/2302.14623/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The sheer size of modern neural networks makes model serving a serious computational challenge. A popular class of compression techniques overcomes this challenge by pruning or sparsifying the weights of pretrained networks. While useful, these techniques often face serious tradeoffs between computational requirements and compression quality. In this work, we propose a novel optimization-based pruning framework that considers the combined effect of pruning (and updating) multiple weights subject to a sparsity constraint. Our approach, CHITA, extends the classical Optimal Brain Surgeon framewor","authors_text":"Hussein Hazimeh, Natalia Ponomareva, Rahul Mazumder, Riade Benbaki, Wenyu Chen, Xiang Meng, Zhe Zhao","cross_cats":["cs.CV","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-28T15:03:18Z","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14623","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:9b33ac7868811c254ac1ea700cc7d6fedbac8dd61bc0d116738da31842a9fccc","target":"record","created_at":"2026-07-05T05:46:47Z","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":"b41feac4735cb69bfcdce4d924d349f4c8f61f9171d045f262901c9114ce763a","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-28T15:03:18Z","title_canon_sha256":"be59d5bc9bd44c5a02deebad500df6d0ddbfc4bed5b7c92bb1a0187272512f51"},"schema_version":"1.0","source":{"id":"2302.14623","kind":"arxiv","version":1}},"canonical_sha256":"dc23c682444a533d441781380a10b911deabef678e12ea82af1ef4f92e14b39e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc23c682444a533d441781380a10b911deabef678e12ea82af1ef4f92e14b39e","first_computed_at":"2026-07-05T05:46:47.416944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:46:47.416944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kBwExu2ZAd3S2aUbSp5aJSleCXqHy6cxq/Wj4wyaimBXhP3LpeCftRyrt1Su1qQzyILtdQMTDfDAgdfLZ6ozDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:46:47.417398Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.14623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b33ac7868811c254ac1ea700cc7d6fedbac8dd61bc0d116738da31842a9fccc","sha256:1d27d45c375c6744ae0f6ab64929bf8ef308a624fd3694cea5fa66f96465490c"],"state_sha256":"f441f4714cfbd30f38fb55a2a3d0e1f8a5c16d4598e863d95a187cdbf64fd179"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zD/RvYkLDpuZyh1lF9Kw6HCBIGimhf1W9jTzDv+DjccKrtNBVvIoN/wELXEmnVtlvko2D7FE+W4oF44BGCxLBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:49:12.114939Z","bundle_sha256":"613b692889cbf2153b5912365cace674c1c10391404e8c4fb029f0c52691070f"}}