{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LAIOI7XYL3JJC6NOS4QXCLPRPG","short_pith_number":"pith:LAIOI7XY","schema_version":"1.0","canonical_sha256":"5810e47ef85ed29179ae9721712df179a4f9d4b2cc5ee1b3506676a1f8fd98e7","source":{"kind":"arxiv","id":"1901.01659","version":4},"attestation_state":"computed","paper":{"title":"Dynamic Programming for Sequential Deterministic Quantization of Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kui Cai, Wentu Song, Xuan He, Zhen Mei","submitted_at":"2019-01-07T04:11:47Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.01659","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-07T04:11:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a76998fe2f1445e8bd5e37714a710e3666efadcd81c81a31018cf1e13b68ac9","abstract_canon_sha256":"b3925a754cf8a158313d446422c278b126fb8e9f35e8b92cb10b3d3ab5fb846d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:02.428169Z","signature_b64":"3tyaGs4NRVXz/GDAumx+yuOiFu9DmJ0RH4Ee+8SRq0mZPC7rrB6NubKToBLGb5WcKL8mkfecCpN3RQrLeJnCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5810e47ef85ed29179ae9721712df179a4f9d4b2cc5ee1b3506676a1f8fd98e7","last_reissued_at":"2026-07-05T02:18:02.427708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:02.427708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Programming for Sequential Deterministic Quantization of Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kui Cai, Wentu Song, Xuan He, Zhen Mei","submitted_at":"2019-01-07T04:11:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01659","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/1901.01659/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.01659","created_at":"2026-07-05T02:18:02.427779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01659v4","created_at":"2026-07-05T02:18:02.427779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01659","created_at":"2026-07-05T02:18:02.427779+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAIOI7XYL3JJ","created_at":"2026-07-05T02:18:02.427779+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAIOI7XYL3JJC6NO","created_at":"2026-07-05T02:18:02.427779+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAIOI7XY","created_at":"2026-07-05T02:18:02.427779+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.03938","citing_title":"Deep Learning-Aided Dynamic Read Thresholds Design For Multi-Level-Cell Flash Memories","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG","json":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG.json","graph_json":"https://pith.science/api/pith-number/LAIOI7XYL3JJC6NOS4QXCLPRPG/graph.json","events_json":"https://pith.science/api/pith-number/LAIOI7XYL3JJC6NOS4QXCLPRPG/events.json","paper":"https://pith.science/paper/LAIOI7XY"},"agent_actions":{"view_html":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG","download_json":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG.json","view_paper":"https://pith.science/paper/LAIOI7XY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01659&json=true","fetch_graph":"https://pith.science/api/pith-number/LAIOI7XYL3JJC6NOS4QXCLPRPG/graph.json","fetch_events":"https://pith.science/api/pith-number/LAIOI7XYL3JJC6NOS4QXCLPRPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG/action/storage_attestation","attest_author":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG/action/author_attestation","sign_citation":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG/action/citation_signature","submit_replication":"https://pith.science/pith/LAIOI7XYL3JJC6NOS4QXCLPRPG/action/replication_record"}},"created_at":"2026-07-05T02:18:02.427779+00:00","updated_at":"2026-07-05T02:18:02.427779+00:00"}