{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LJ5O6L63TDWGCMET2TB3FV7SDM","short_pith_number":"pith:LJ5O6L63","schema_version":"1.0","canonical_sha256":"5a7aef2fdb98ec613093d4c3b2d7f21b1a09edf2d5b37ddb32309f65b851e89d","source":{"kind":"arxiv","id":"1706.05889","version":1},"attestation_state":"computed","paper":{"title":"Computing the channel capacity of a communication system affected by uncertain transition probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Aharon Ben-Tal, Krzysztof Postek","submitted_at":"2017-06-19T11:39:40Z","abstract_excerpt":"We study the problem of computing the capacity of a discrete memoryless channel under uncertainty affecting the channel law matrix, and possibly with a constraint on the average cost of the input distribution. The problem has been formulated in the literature as a max-min problem. We use the robust optimization methodology to convert the max-min problem to a standard convex optimization problem. For small-sized problems, and for many types of uncertainty, such a problem can be solved in principle using interior point methods (IPM). However, for large-scale problems, IPM are not practical. Here"},"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":"1706.05889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-19T11:39:40Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"345d79f6377d11571e77414418f280dc6b254cda5323e339c89836997376028c","abstract_canon_sha256":"a7af310aa99fc34f7b5e8c0f097c051918f0f87ffbe98c9a143eacf1f1e3ae95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:00.033159Z","signature_b64":"XMoIkFV2cQVe7ZST3Mkm0zrd15tpYgxaqXjDiINzd4uTGK9FPo55N4h2aodoY4ayG/sRszY8bcWeLffnFjNQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7aef2fdb98ec613093d4c3b2d7f21b1a09edf2d5b37ddb32309f65b851e89d","last_reissued_at":"2026-05-18T00:15:00.032414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:00.032414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the channel capacity of a communication system affected by uncertain transition probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Aharon Ben-Tal, Krzysztof Postek","submitted_at":"2017-06-19T11:39:40Z","abstract_excerpt":"We study the problem of computing the capacity of a discrete memoryless channel under uncertainty affecting the channel law matrix, and possibly with a constraint on the average cost of the input distribution. The problem has been formulated in the literature as a max-min problem. We use the robust optimization methodology to convert the max-min problem to a standard convex optimization problem. For small-sized problems, and for many types of uncertainty, such a problem can be solved in principle using interior point methods (IPM). However, for large-scale problems, IPM are not practical. Here"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05889","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.05889","created_at":"2026-05-18T00:15:00.032524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05889v1","created_at":"2026-05-18T00:15:00.032524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05889","created_at":"2026-05-18T00:15:00.032524+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ5O6L63TDWG","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ5O6L63TDWGCMET","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ5O6L63","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM","json":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM.json","graph_json":"https://pith.science/api/pith-number/LJ5O6L63TDWGCMET2TB3FV7SDM/graph.json","events_json":"https://pith.science/api/pith-number/LJ5O6L63TDWGCMET2TB3FV7SDM/events.json","paper":"https://pith.science/paper/LJ5O6L63"},"agent_actions":{"view_html":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM","download_json":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM.json","view_paper":"https://pith.science/paper/LJ5O6L63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05889&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ5O6L63TDWGCMET2TB3FV7SDM/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ5O6L63TDWGCMET2TB3FV7SDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/action/storage_attestation","attest_author":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/action/author_attestation","sign_citation":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/action/citation_signature","submit_replication":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/action/replication_record"}},"created_at":"2026-05-18T00:15:00.032524+00:00","updated_at":"2026-05-18T00:15:00.032524+00:00"}