{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:52JYUCGICM23E66RMERBEG4G4T","short_pith_number":"pith:52JYUCGI","canonical_record":{"source":{"id":"2404.08010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T03:22:58Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"b980baa94b2a023ff58c9c8a03af132f74009b142ffa4494f5b2723049eef652","abstract_canon_sha256":"115ba32a96bf8cf5e75a810c96c4944b0624d272b781f9b4af87f82eadfdcd6a"},"schema_version":"1.0"},"canonical_sha256":"ee938a08c81335b27bd16122121b86e4dac964572f6586844d4891f19f4d9a81","source":{"kind":"arxiv","id":"2404.08010","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.08010","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"2404.08010v2","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08010","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"52JYUCGICM23","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"pith_short_16","alias_value":"52JYUCGICM23E66R","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"pith_short_8","alias_value":"52JYUCGI","created_at":"2026-07-05T08:08:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:52JYUCGICM23E66RMERBEG4G4T","target":"record","payload":{"canonical_record":{"source":{"id":"2404.08010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T03:22:58Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"b980baa94b2a023ff58c9c8a03af132f74009b142ffa4494f5b2723049eef652","abstract_canon_sha256":"115ba32a96bf8cf5e75a810c96c4944b0624d272b781f9b4af87f82eadfdcd6a"},"schema_version":"1.0"},"canonical_sha256":"ee938a08c81335b27bd16122121b86e4dac964572f6586844d4891f19f4d9a81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:04.184276Z","signature_b64":"bCQA0IwQLOJdI4zJvctxFRLAK4ZCl8i7NO9LSA+lGUeUOr7gyucqcxzN1Dt9646v5FuSa7rncfPVF/3TEYIsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee938a08c81335b27bd16122121b86e4dac964572f6586844d4891f19f4d9a81","last_reissued_at":"2026-07-05T08:08:04.183841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:04.183841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.08010","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-05T08:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7vZQOUwEQMkGzjdAwGEuDyWFjbSgji3IbnQ+lFPvuopoCnTRF/9Sxoxjl357f2hxsRNx7QpizCplvc+jqb4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:29:57.968462Z"},"content_sha256":"5db5444f35b7d63702e3977aedb681210a437c559321c0939a180f1fb0bdacad","schema_version":"1.0","event_id":"sha256:5db5444f35b7d63702e3977aedb681210a437c559321c0939a180f1fb0bdacad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:52JYUCGICM23E66RMERBEG4G4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentiable Search for Finding Optimal Quantization Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.LG","authors_text":"Chenqian Yan, Lianqiang Li, Yefei Chen","submitted_at":"2024-04-10T03:22:58Z","abstract_excerpt":"To accelerate and compress deep neural networks (DNNs), many network quantization algorithms have been proposed. Although the quantization strategy of any algorithm from the state-of-the-arts may outperform others in some network architectures, it is hard to prove the strategy is always better than others, and even cannot judge that the strategy is always the best choice for all layers in a network. In other words, existing quantization algorithms are suboptimal as they ignore the different characteristics of different layers and quantize all layers by a uniform quantization strategy. To solve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08010","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/2404.08010/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-05T08:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YT1BUWCPVBcspEKXrQID6ekSjafcdKON6dILVGKXXNNsj1i6mkYMIyMJh8wOqi/BDgZSVsWdFxsj11Pmwl6GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:29:57.969400Z"},"content_sha256":"256d9da4f3b2403b43832473d085c42b53ec6bc389b8a83838362bfda2246612","schema_version":"1.0","event_id":"sha256:256d9da4f3b2403b43832473d085c42b53ec6bc389b8a83838362bfda2246612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52JYUCGICM23E66RMERBEG4G4T/bundle.json","state_url":"https://pith.science/pith/52JYUCGICM23E66RMERBEG4G4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52JYUCGICM23E66RMERBEG4G4T/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-20T06:29:57Z","links":{"resolver":"https://pith.science/pith/52JYUCGICM23E66RMERBEG4G4T","bundle":"https://pith.science/pith/52JYUCGICM23E66RMERBEG4G4T/bundle.json","state":"https://pith.science/pith/52JYUCGICM23E66RMERBEG4G4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52JYUCGICM23E66RMERBEG4G4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:52JYUCGICM23E66RMERBEG4G4T","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":"115ba32a96bf8cf5e75a810c96c4944b0624d272b781f9b4af87f82eadfdcd6a","cross_cats_sorted":["eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T03:22:58Z","title_canon_sha256":"b980baa94b2a023ff58c9c8a03af132f74009b142ffa4494f5b2723049eef652"},"schema_version":"1.0","source":{"id":"2404.08010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.08010","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"2404.08010v2","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08010","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"52JYUCGICM23","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"pith_short_16","alias_value":"52JYUCGICM23E66R","created_at":"2026-07-05T08:08:04Z"},{"alias_kind":"pith_short_8","alias_value":"52JYUCGI","created_at":"2026-07-05T08:08:04Z"}],"graph_snapshots":[{"event_id":"sha256:256d9da4f3b2403b43832473d085c42b53ec6bc389b8a83838362bfda2246612","target":"graph","created_at":"2026-07-05T08:08:04Z","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/2404.08010/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To accelerate and compress deep neural networks (DNNs), many network quantization algorithms have been proposed. Although the quantization strategy of any algorithm from the state-of-the-arts may outperform others in some network architectures, it is hard to prove the strategy is always better than others, and even cannot judge that the strategy is always the best choice for all layers in a network. In other words, existing quantization algorithms are suboptimal as they ignore the different characteristics of different layers and quantize all layers by a uniform quantization strategy. To solve","authors_text":"Chenqian Yan, Lianqiang Li, Yefei Chen","cross_cats":["eess.IV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T03:22:58Z","title":"Differentiable Search for Finding Optimal Quantization Strategy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08010","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:5db5444f35b7d63702e3977aedb681210a437c559321c0939a180f1fb0bdacad","target":"record","created_at":"2026-07-05T08:08:04Z","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":"115ba32a96bf8cf5e75a810c96c4944b0624d272b781f9b4af87f82eadfdcd6a","cross_cats_sorted":["eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T03:22:58Z","title_canon_sha256":"b980baa94b2a023ff58c9c8a03af132f74009b142ffa4494f5b2723049eef652"},"schema_version":"1.0","source":{"id":"2404.08010","kind":"arxiv","version":2}},"canonical_sha256":"ee938a08c81335b27bd16122121b86e4dac964572f6586844d4891f19f4d9a81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee938a08c81335b27bd16122121b86e4dac964572f6586844d4891f19f4d9a81","first_computed_at":"2026-07-05T08:08:04.183841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:08:04.183841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCQA0IwQLOJdI4zJvctxFRLAK4ZCl8i7NO9LSA+lGUeUOr7gyucqcxzN1Dt9646v5FuSa7rncfPVF/3TEYIsCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:08:04.184276Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.08010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5db5444f35b7d63702e3977aedb681210a437c559321c0939a180f1fb0bdacad","sha256:256d9da4f3b2403b43832473d085c42b53ec6bc389b8a83838362bfda2246612"],"state_sha256":"ed95cdfb1776e34ce0eba869dacd5ab38be05708e1ad8208c7617f44317ff971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+i/6gCwxaZLhPoaRW4+DRg0ne79G8OSU4KGZ6vY/bktAXQ6OUM0NcycTOXqgOazpHXmLTx6b9DMNok1dK2rAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T06:29:57.976402Z","bundle_sha256":"a4e464e0483addd795b1d6fe6097e69a86b33886453fe61ad6846ce8f5ad9b07"}}