{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LAIOI7XYL3JJC6NOS4QXCLPRPG","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":"b3925a754cf8a158313d446422c278b126fb8e9f35e8b92cb10b3d3ab5fb846d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-07T04:11:47Z","title_canon_sha256":"6a76998fe2f1445e8bd5e37714a710e3666efadcd81c81a31018cf1e13b68ac9"},"schema_version":"1.0","source":{"id":"1901.01659","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01659","created_at":"2026-07-05T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01659v4","created_at":"2026-07-05T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01659","created_at":"2026-07-05T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"LAIOI7XYL3JJ","created_at":"2026-07-05T02:18:02Z"},{"alias_kind":"pith_short_16","alias_value":"LAIOI7XYL3JJC6NO","created_at":"2026-07-05T02:18:02Z"},{"alias_kind":"pith_short_8","alias_value":"LAIOI7XY","created_at":"2026-07-05T02:18:02Z"}],"graph_snapshots":[{"event_id":"sha256:95ebbbf2269b02e503731bbc1bb60b68a665b7fd95f21e82fcc63b2316a3656d","target":"graph","created_at":"2026-07-05T02:18:02Z","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/1901.01659/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, under a general cost function $C$, we present a dynamic programming (DP) method to obtain an optimal sequential deterministic quantizer (SDQ) for $q$-ary input discrete memoryless channel (DMC). The DP method has complexity $O(q (N-M)^2 M)$, where $N$ and $M$ are the alphabet sizes of the DMC output and quantizer output, respectively. Then, starting from the quadrangle inequality, two techniques are applied to reduce the DP method's complexity. One technique makes use of the Shor-Moran-Aggarwal-Wilber-Klawe (SMAWK) algorithm and achieves complexity $O(q (N-M) M)$. The other tech","authors_text":"Kui Cai, Wentu Song, Xuan He, Zhen Mei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-07T04:11:47Z","title":"Dynamic Programming for Sequential Deterministic Quantization of Discrete Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01659","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:8ff27c100203925d502d3923d9de29cef6c35e9e0f58c26d62fc5b0332c25783","target":"record","created_at":"2026-07-05T02:18:02Z","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":"b3925a754cf8a158313d446422c278b126fb8e9f35e8b92cb10b3d3ab5fb846d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-07T04:11:47Z","title_canon_sha256":"6a76998fe2f1445e8bd5e37714a710e3666efadcd81c81a31018cf1e13b68ac9"},"schema_version":"1.0","source":{"id":"1901.01659","kind":"arxiv","version":4}},"canonical_sha256":"5810e47ef85ed29179ae9721712df179a4f9d4b2cc5ee1b3506676a1f8fd98e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5810e47ef85ed29179ae9721712df179a4f9d4b2cc5ee1b3506676a1f8fd98e7","first_computed_at":"2026-07-05T02:18:02.427708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:02.427708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tyaGs4NRVXz/GDAumx+yuOiFu9DmJ0RH4Ee+8SRq0mZPC7rrB6NubKToBLGb5WcKL8mkfecCpN3RQrLeJnCBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:02.428169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01659","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ff27c100203925d502d3923d9de29cef6c35e9e0f58c26d62fc5b0332c25783","sha256:95ebbbf2269b02e503731bbc1bb60b68a665b7fd95f21e82fcc63b2316a3656d"],"state_sha256":"a08a086ff6dce54773c7be813091153404b6023142d95c8d7b8206b6a85cc2fb"}