{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JGRVUYII5SWOS3CBT5ZOEUEWWL","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":"50c5e029205180154783121fcf58357c620a24a75e71bf53e490862fe8dc4ad3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:01:11Z","title_canon_sha256":"04111a10ef59d4af5bdadc5f8070c80b0b25a0ab7f542cbae369f7f9098aa218"},"schema_version":"1.0","source":{"id":"1602.00878","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00878","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00878v2","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00878","created_at":"2026-05-18T00:30:28Z"},{"alias_kind":"pith_short_12","alias_value":"JGRVUYII5SWO","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JGRVUYII5SWOS3CB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JGRVUYII","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:96cffae1bc463c859b8543e7a6203f85b5f3f72905b0dc65372d84b411587ba0","target":"graph","created_at":"2026-05-18T00:30:28Z","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 classical problem of characterizing the channel capacity and its achieving distribution in a generic fashion. We derive a simple relation between three parameters: the input-output function, the input cost function and the noise probability density function, one which dictates the type of the optimal input. In Layman terms we prove that the support of the optimal input is bounded whenever the cost grows faster than a cut-off rate equal to the logarithm of the noise PDF evaluated at the input-output function. Furthermore, we prove a converse statement that says whenever the cost gr","authors_text":"Ibrahim Abou-Faycal, Jihad Fahs","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:01:11Z","title":"On Properties of the Support of Capacity-Achieving Distributions for Additive Noise Channel Models with Input Cost Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00878","kind":"arxiv","version":2},"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:cd81d129dcb2a3d30844b6af9978fa479f517110ba1acb43784fcbe678c0f10b","target":"record","created_at":"2026-05-18T00:30:28Z","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":"50c5e029205180154783121fcf58357c620a24a75e71bf53e490862fe8dc4ad3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:01:11Z","title_canon_sha256":"04111a10ef59d4af5bdadc5f8070c80b0b25a0ab7f542cbae369f7f9098aa218"},"schema_version":"1.0","source":{"id":"1602.00878","kind":"arxiv","version":2}},"canonical_sha256":"49a35a6108ecace96c419f72e25096b2dcdb186f720ba2ad2abb723ff1f5dbb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49a35a6108ecace96c419f72e25096b2dcdb186f720ba2ad2abb723ff1f5dbb8","first_computed_at":"2026-05-18T00:30:28.865941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:28.865941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zdBjPN6gI+4EINzP/Sd+4cH4qMnwuAe9Sy2qWdO5xf7ckhek6BjjjvSKzXoeWqWSH6u6xc+v3VGL9kq3A5tfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:28.866600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00878","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd81d129dcb2a3d30844b6af9978fa479f517110ba1acb43784fcbe678c0f10b","sha256:96cffae1bc463c859b8543e7a6203f85b5f3f72905b0dc65372d84b411587ba0"],"state_sha256":"8e9f0e75ffbec6829faff0ef177af17c5349ebdae40b56690b8674b768708983"}