{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LJ5O6L63TDWGCMET2TB3FV7SDM","short_pith_number":"pith:LJ5O6L63","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"},"canonical_sha256":"5a7aef2fdb98ec613093d4c3b2d7f21b1a09edf2d5b37ddb32309f65b851e89d","source":{"kind":"arxiv","id":"1706.05889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05889","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05889v1","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05889","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"LJ5O6L63TDWG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LJ5O6L63TDWGCMET","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LJ5O6L63","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LJ5O6L63TDWGCMET2TB3FV7SDM","target":"record","payload":{"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"},"canonical_sha256":"5a7aef2fdb98ec613093d4c3b2d7f21b1a09edf2d5b37ddb32309f65b851e89d","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"},"source_kind":"arxiv","source_id":"1706.05889","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-18T00:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2w+0kKrTMnydw/AfuL3MXuuAIQquVXfTr3VlqW6p0C9hYva+UuEt+cBXiwEjgVLZNsUB2BKwTLEsmRrDqx8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:55:09.438984Z"},"content_sha256":"bb6035f03caab78ca352c94c55ae1b03455ddf9d98c41de0199157887f9d33dc","schema_version":"1.0","event_id":"sha256:bb6035f03caab78ca352c94c55ae1b03455ddf9d98c41de0199157887f9d33dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LJ5O6L63TDWGCMET2TB3FV7SDM","target":"graph","payload":{"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"},"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-18T00:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ha/G/vbJht2mBByJ7VZuF41eoGOoljF8lnYl0dq1Yn9yUQoGVjyjp3/dsPTppagksGElhZbC9LPmfWkPZbMjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:55:09.439671Z"},"content_sha256":"c5d59a69883381c38d20bedc2f9bab8bc0aa13c9e925a840e80e48aa687f4b8f","schema_version":"1.0","event_id":"sha256:c5d59a69883381c38d20bedc2f9bab8bc0aa13c9e925a840e80e48aa687f4b8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/bundle.json","state_url":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/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-05-31T07:55:09Z","links":{"resolver":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM","bundle":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/bundle.json","state":"https://pith.science/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJ5O6L63TDWGCMET2TB3FV7SDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LJ5O6L63TDWGCMET2TB3FV7SDM","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":"a7af310aa99fc34f7b5e8c0f097c051918f0f87ffbe98c9a143eacf1f1e3ae95","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-19T11:39:40Z","title_canon_sha256":"345d79f6377d11571e77414418f280dc6b254cda5323e339c89836997376028c"},"schema_version":"1.0","source":{"id":"1706.05889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05889","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05889v1","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05889","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"LJ5O6L63TDWG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LJ5O6L63TDWGCMET","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LJ5O6L63","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:c5d59a69883381c38d20bedc2f9bab8bc0aa13c9e925a840e80e48aa687f4b8f","target":"graph","created_at":"2026-05-18T00:15:00Z","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":"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","authors_text":"Aharon Ben-Tal, Krzysztof Postek","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-19T11:39:40Z","title":"Computing the channel capacity of a communication system affected by uncertain transition probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05889","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:bb6035f03caab78ca352c94c55ae1b03455ddf9d98c41de0199157887f9d33dc","target":"record","created_at":"2026-05-18T00:15:00Z","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":"a7af310aa99fc34f7b5e8c0f097c051918f0f87ffbe98c9a143eacf1f1e3ae95","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-19T11:39:40Z","title_canon_sha256":"345d79f6377d11571e77414418f280dc6b254cda5323e339c89836997376028c"},"schema_version":"1.0","source":{"id":"1706.05889","kind":"arxiv","version":1}},"canonical_sha256":"5a7aef2fdb98ec613093d4c3b2d7f21b1a09edf2d5b37ddb32309f65b851e89d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a7aef2fdb98ec613093d4c3b2d7f21b1a09edf2d5b37ddb32309f65b851e89d","first_computed_at":"2026-05-18T00:15:00.032414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:00.032414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XMoIkFV2cQVe7ZST3Mkm0zrd15tpYgxaqXjDiINzd4uTGK9FPo55N4h2aodoY4ayG/sRszY8bcWeLffnFjNQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:00.033159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb6035f03caab78ca352c94c55ae1b03455ddf9d98c41de0199157887f9d33dc","sha256:c5d59a69883381c38d20bedc2f9bab8bc0aa13c9e925a840e80e48aa687f4b8f"],"state_sha256":"97eb1fec77fcf980a488a14e2d660c5d9f685e0e9e0b46e78e45d799632babca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Xufe8BBB0B/5reo/g+84CsMcCC5LX6Lx6pGC5aodFvTXt9sHhwKYmkkURTGiSNrZnt+nNJvjJvvDZP43NcJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:55:09.443823Z","bundle_sha256":"6347303b84c5ee5f655444ee1050e8d6613e11fd9ad2e637fa90e16770c2e622"}}