{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BCVOZA4J7EIO2JGQ6ITZD65CWC","short_pith_number":"pith:BCVOZA4J","canonical_record":{"source":{"id":"1407.7629","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-29T04:34:30Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ae3a498b11e32d910efcaac55ed102cc9da0ce2e21f5a5c3543e369c560fc2c3","abstract_canon_sha256":"be64c122548134c61fda249294b3f1188dd430ff7c0f6fe0d0ebaccd4710541b"},"schema_version":"1.0"},"canonical_sha256":"08aaec8389f910ed24d0f22791fba2b0ae08f09507bad5c84d59e3c433c154ae","source":{"kind":"arxiv","id":"1407.7629","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7629v3","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"BCVOZA4J7EIO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BCVOZA4J7EIO2JGQ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BCVOZA4J","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BCVOZA4J7EIO2JGQ6ITZD65CWC","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7629","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-29T04:34:30Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ae3a498b11e32d910efcaac55ed102cc9da0ce2e21f5a5c3543e369c560fc2c3","abstract_canon_sha256":"be64c122548134c61fda249294b3f1188dd430ff7c0f6fe0d0ebaccd4710541b"},"schema_version":"1.0"},"canonical_sha256":"08aaec8389f910ed24d0f22791fba2b0ae08f09507bad5c84d59e3c433c154ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:42.603620Z","signature_b64":"1j/4aEOgcDQ1MHer4zDaB3tF6T4q/JgW6vrIiHoWI+FUcl83MH9jyW/bvGWLxbA7EAPd7eE9o6zcgkdl0TF2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08aaec8389f910ed24d0f22791fba2b0ae08f09507bad5c84d59e3c433c154ae","last_reissued_at":"2026-05-18T02:19:42.603150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:42.603150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7629","source_version":3,"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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTDhBYG85gApVpfjee44Q5YskMTxNiWv42utDshWf7ID0FjrM6fCxHJYpPFCV7oZj5CXSBg3IMpE0F0/J9ShDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:46:14.250489Z"},"content_sha256":"071511247b9938f72eaca070241e7908a16d829e4f03ba8a6d5a3fa6a2e67060","schema_version":"1.0","event_id":"sha256:071511247b9938f72eaca070241e7908a16d829e4f03ba8a6d5a3fa6a2e67060"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BCVOZA4J7EIO2JGQ6ITZD65CWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Approximation of Channel Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"David Sutter, John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter","submitted_at":"2014-07-29T04:34:30Z","abstract_excerpt":"We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. The presented method requires $O(M^2 N \\sqrt{\\log N}/\\varepsilon)$ to provide an estimate of the capacity to within $\\varepsilon$, where $N$ and $M$ denote the input and output alphabet size; a single iteration has a complexity $O(M N)$. We also show how to approximately compute the capacity of memoryless channels having a bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7629","kind":"arxiv","version":3},"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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stzF1yrr+jnzcQ9FFbGAug1E3wM2EGSRlxrKGMbG9XuH5jIK+SukiLBp+v7GGPw+ht3V0/B0cTbrO+7k06eeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:46:14.250833Z"},"content_sha256":"d324ad3a6cc99489af2f1f6f19d43586ccee7ab657b789f270b7e1f9b3408c4d","schema_version":"1.0","event_id":"sha256:d324ad3a6cc99489af2f1f6f19d43586ccee7ab657b789f270b7e1f9b3408c4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCVOZA4J7EIO2JGQ6ITZD65CWC/bundle.json","state_url":"https://pith.science/pith/BCVOZA4J7EIO2JGQ6ITZD65CWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCVOZA4J7EIO2JGQ6ITZD65CWC/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-07-03T20:46:14Z","links":{"resolver":"https://pith.science/pith/BCVOZA4J7EIO2JGQ6ITZD65CWC","bundle":"https://pith.science/pith/BCVOZA4J7EIO2JGQ6ITZD65CWC/bundle.json","state":"https://pith.science/pith/BCVOZA4J7EIO2JGQ6ITZD65CWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCVOZA4J7EIO2JGQ6ITZD65CWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BCVOZA4J7EIO2JGQ6ITZD65CWC","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":"be64c122548134c61fda249294b3f1188dd430ff7c0f6fe0d0ebaccd4710541b","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-29T04:34:30Z","title_canon_sha256":"ae3a498b11e32d910efcaac55ed102cc9da0ce2e21f5a5c3543e369c560fc2c3"},"schema_version":"1.0","source":{"id":"1407.7629","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7629v3","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7629","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"BCVOZA4J7EIO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BCVOZA4J7EIO2JGQ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BCVOZA4J","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d324ad3a6cc99489af2f1f6f19d43586ccee7ab657b789f270b7e1f9b3408c4d","target":"graph","created_at":"2026-05-18T02:19:42Z","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 propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. The presented method requires $O(M^2 N \\sqrt{\\log N}/\\varepsilon)$ to provide an estimate of the capacity to within $\\varepsilon$, where $N$ and $M$ denote the input and output alphabet size; a single iteration has a complexity $O(M N)$. We also show how to approximately compute the capacity of memoryless channels having a bound","authors_text":"David Sutter, John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-29T04:34:30Z","title":"Efficient Approximation of Channel Capacities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7629","kind":"arxiv","version":3},"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:071511247b9938f72eaca070241e7908a16d829e4f03ba8a6d5a3fa6a2e67060","target":"record","created_at":"2026-05-18T02:19:42Z","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":"be64c122548134c61fda249294b3f1188dd430ff7c0f6fe0d0ebaccd4710541b","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-29T04:34:30Z","title_canon_sha256":"ae3a498b11e32d910efcaac55ed102cc9da0ce2e21f5a5c3543e369c560fc2c3"},"schema_version":"1.0","source":{"id":"1407.7629","kind":"arxiv","version":3}},"canonical_sha256":"08aaec8389f910ed24d0f22791fba2b0ae08f09507bad5c84d59e3c433c154ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08aaec8389f910ed24d0f22791fba2b0ae08f09507bad5c84d59e3c433c154ae","first_computed_at":"2026-05-18T02:19:42.603150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:42.603150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1j/4aEOgcDQ1MHer4zDaB3tF6T4q/JgW6vrIiHoWI+FUcl83MH9jyW/bvGWLxbA7EAPd7eE9o6zcgkdl0TF2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:42.603620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7629","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:071511247b9938f72eaca070241e7908a16d829e4f03ba8a6d5a3fa6a2e67060","sha256:d324ad3a6cc99489af2f1f6f19d43586ccee7ab657b789f270b7e1f9b3408c4d"],"state_sha256":"f41805a115affeae40eecc06b57bbf0b6ef892dd4b598baa899d4ccba2d06a13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m71zPu5H+usqNXZ4chcPWItifCii6WoW7AZGOhMTQT4YH6pe1fMSDrl022hVL1lEOh/oK04FMJkHqi6kTt/kAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T20:46:14.253008Z","bundle_sha256":"388f989c471f87c7340eb6da9b6df50dd141b806e9518c8cfaf78095b4719eda"}}