{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5PGNRQ3UCWNFZU6M662HZKDY26","short_pith_number":"pith:5PGNRQ3U","canonical_record":{"source":{"id":"1811.11102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-07T19:19:58Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"1e6890490547d29d2b0c7128d17e06907980e7ff2ee2632ac6faf25bd1ba37a1","abstract_canon_sha256":"09bdbcd64fdb67f54198b6a3393e67c34e9881a5fd2fe5980559c2b8bd580e80"},"schema_version":"1.0"},"canonical_sha256":"ebccd8c374159a5cd3ccf7b47ca878d79a76b094691f6d1745cd5e32a1e1a11a","source":{"kind":"arxiv","id":"1811.11102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11102","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11102v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11102","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"5PGNRQ3UCWNF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5PGNRQ3UCWNFZU6M","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5PGNRQ3U","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5PGNRQ3UCWNFZU6M662HZKDY26","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-07T19:19:58Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"1e6890490547d29d2b0c7128d17e06907980e7ff2ee2632ac6faf25bd1ba37a1","abstract_canon_sha256":"09bdbcd64fdb67f54198b6a3393e67c34e9881a5fd2fe5980559c2b8bd580e80"},"schema_version":"1.0"},"canonical_sha256":"ebccd8c374159a5cd3ccf7b47ca878d79a76b094691f6d1745cd5e32a1e1a11a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:45.256008Z","signature_b64":"/JE+2BWrPRQBueSAFoQqzSu/Vod8/p4QWCZeTZkpz1Rrfrb8k5SVlx4W++xYwOQfu1obGxIwh2pd29nsBVJRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebccd8c374159a5cd3ccf7b47ca878d79a76b094691f6d1745cd5e32a1e1a11a","last_reissued_at":"2026-05-17T23:59:45.255454Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:45.255454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11102","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-05-17T23:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzhYvJqzr/c+VPrI0aTzvk4JIvrj+wkzefoa4j1yNu6sByO2UdDzciNlEtM7q0rOi5/t1K+XXWNpBtD0PqABAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:04:26.128098Z"},"content_sha256":"b8b4d15c9b39b0820f7902a05383582f4e35daaf342a27f993df258f90bc72b8","schema_version":"1.0","event_id":"sha256:b8b4d15c9b39b0820f7902a05383582f4e35daaf342a27f993df258f90bc72b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5PGNRQ3UCWNFZU6M662HZKDY26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal Entropy Reduction Algorithm for SAR ADC Clock Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"eess.SP","authors_text":"Arkady Molev-Shteiman, Xiao-Feng Qi","submitted_at":"2018-11-07T19:19:58Z","abstract_excerpt":"Reduction of comparison cycles leads to power savings of a successive-approximation-register (SAR) analog-to-digital converters (ADC). We establish that the lowest average number of comparison cycles of a SAR ADC approaches the entropy of the ADC output, and proposed a simple adaptive algorithm that approaches this lower bound. Today's SAR ADC uses binary search, which consumes more power than necessary for non-uniform input distributions commonly found in practice. We refer to a SAR ADC employing such algorithm the maximal entropy reduction (MER) ADC."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11102","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":""},"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-05-17T23:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLvNsHj6kBsF/LkU3JXCKghnfMuQtv0GkCjfwbrbgRrkqImihYtfBy09lHYV6W5UiiRgjXvcQibYgXiH1b7UAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:04:26.128454Z"},"content_sha256":"1818c521f0ace66bc4de8f16d753e0efde6182d5d4b14913d69183bbbcdf52c5","schema_version":"1.0","event_id":"sha256:1818c521f0ace66bc4de8f16d753e0efde6182d5d4b14913d69183bbbcdf52c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/bundle.json","state_url":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PGNRQ3UCWNFZU6M662HZKDY26/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-06-24T06:04:26Z","links":{"resolver":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26","bundle":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/bundle.json","state":"https://pith.science/pith/5PGNRQ3UCWNFZU6M662HZKDY26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PGNRQ3UCWNFZU6M662HZKDY26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5PGNRQ3UCWNFZU6M662HZKDY26","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":"09bdbcd64fdb67f54198b6a3393e67c34e9881a5fd2fe5980559c2b8bd580e80","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-07T19:19:58Z","title_canon_sha256":"1e6890490547d29d2b0c7128d17e06907980e7ff2ee2632ac6faf25bd1ba37a1"},"schema_version":"1.0","source":{"id":"1811.11102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11102","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11102v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11102","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"5PGNRQ3UCWNF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5PGNRQ3UCWNFZU6M","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5PGNRQ3U","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:1818c521f0ace66bc4de8f16d753e0efde6182d5d4b14913d69183bbbcdf52c5","target":"graph","created_at":"2026-05-17T23:59:45Z","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"},"paper":{"abstract_excerpt":"Reduction of comparison cycles leads to power savings of a successive-approximation-register (SAR) analog-to-digital converters (ADC). We establish that the lowest average number of comparison cycles of a SAR ADC approaches the entropy of the ADC output, and proposed a simple adaptive algorithm that approaches this lower bound. Today's SAR ADC uses binary search, which consumes more power than necessary for non-uniform input distributions commonly found in practice. We refer to a SAR ADC employing such algorithm the maximal entropy reduction (MER) ADC.","authors_text":"Arkady Molev-Shteiman, Xiao-Feng Qi","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-07T19:19:58Z","title":"Maximal Entropy Reduction Algorithm for SAR ADC Clock Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11102","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:b8b4d15c9b39b0820f7902a05383582f4e35daaf342a27f993df258f90bc72b8","target":"record","created_at":"2026-05-17T23:59:45Z","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":"09bdbcd64fdb67f54198b6a3393e67c34e9881a5fd2fe5980559c2b8bd580e80","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-07T19:19:58Z","title_canon_sha256":"1e6890490547d29d2b0c7128d17e06907980e7ff2ee2632ac6faf25bd1ba37a1"},"schema_version":"1.0","source":{"id":"1811.11102","kind":"arxiv","version":1}},"canonical_sha256":"ebccd8c374159a5cd3ccf7b47ca878d79a76b094691f6d1745cd5e32a1e1a11a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebccd8c374159a5cd3ccf7b47ca878d79a76b094691f6d1745cd5e32a1e1a11a","first_computed_at":"2026-05-17T23:59:45.255454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:45.255454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/JE+2BWrPRQBueSAFoQqzSu/Vod8/p4QWCZeTZkpz1Rrfrb8k5SVlx4W++xYwOQfu1obGxIwh2pd29nsBVJRCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:45.256008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8b4d15c9b39b0820f7902a05383582f4e35daaf342a27f993df258f90bc72b8","sha256:1818c521f0ace66bc4de8f16d753e0efde6182d5d4b14913d69183bbbcdf52c5"],"state_sha256":"03d1d316fdbd611ce7004d04f47def00203c9df33f5a8c201e9b0526d4cf5989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5b0ziAlPs1JQgYGGfxhlIy9yB0R770Fab9bVre4C9Ni9ua1xx1JKh2CkTnWjhUBMOI13nhr4LwY46JSLaX5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:04:26.130726Z","bundle_sha256":"629e5200b7a3611149231ed967dc1644ad4862f862878aca4ad36289e878dbc2"}}