{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:USOPUFFLSV4MXM3R2FR2ZRBIHW","short_pith_number":"pith:USOPUFFL","schema_version":"1.0","canonical_sha256":"a49cfa14ab9578cbb371d163acc4283d8dffff691734f04c41996e450d639fc8","source":{"kind":"arxiv","id":"1601.05880","version":1},"attestation_state":"computed","paper":{"title":"A Beta-Beta Achievability Bound with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Austin Collins, Giuseppe Durisi, H. Vincent Poor, Wei Yang, Yury Polyanskiy","submitted_at":"2016-01-22T05:42:35Z","abstract_excerpt":"A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson $\\beta$ functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verd\\'{u} (2014). The new bound turns out to simplify considerably the analysis in situations where the channel output distribution is not a product distribution, for example due to a cost constraint or a structural constraint (such as orthogonality or constant composition) on the channel inputs. Connections to existing bounds in the literature are discussed. The bound is then used to deri"},"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":"1601.05880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T05:42:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6111b7c5f17070a8988c27e01ac0b4f4e458409ef949d18948c3c3166e8c067b","abstract_canon_sha256":"e5f4333c2bdcfec90f0b2707d6c3ca92faf2381ec413ef84c33472ea05ea68f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:09.910051Z","signature_b64":"3Akm9PfU7eGqKuicj/gaV7VIIJH9OLeIZoLncJeAPE7jU7cfAxpWh2mH3wXlDBecUuJGyjoSXoUDiBvXk1kUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a49cfa14ab9578cbb371d163acc4283d8dffff691734f04c41996e450d639fc8","last_reissued_at":"2026-05-18T01:22:09.909410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:09.909410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Beta-Beta Achievability Bound with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Austin Collins, Giuseppe Durisi, H. Vincent Poor, Wei Yang, Yury Polyanskiy","submitted_at":"2016-01-22T05:42:35Z","abstract_excerpt":"A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson $\\beta$ functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verd\\'{u} (2014). The new bound turns out to simplify considerably the analysis in situations where the channel output distribution is not a product distribution, for example due to a cost constraint or a structural constraint (such as orthogonality or constant composition) on the channel inputs. Connections to existing bounds in the literature are discussed. The bound is then used to deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05880","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":"1601.05880","created_at":"2026-05-18T01:22:09.909518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05880v1","created_at":"2026-05-18T01:22:09.909518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05880","created_at":"2026-05-18T01:22:09.909518+00:00"},{"alias_kind":"pith_short_12","alias_value":"USOPUFFLSV4M","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"USOPUFFLSV4MXM3R","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"USOPUFFL","created_at":"2026-05-18T12:30:46.583412+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/USOPUFFLSV4MXM3R2FR2ZRBIHW","json":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW.json","graph_json":"https://pith.science/api/pith-number/USOPUFFLSV4MXM3R2FR2ZRBIHW/graph.json","events_json":"https://pith.science/api/pith-number/USOPUFFLSV4MXM3R2FR2ZRBIHW/events.json","paper":"https://pith.science/paper/USOPUFFL"},"agent_actions":{"view_html":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW","download_json":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW.json","view_paper":"https://pith.science/paper/USOPUFFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05880&json=true","fetch_graph":"https://pith.science/api/pith-number/USOPUFFLSV4MXM3R2FR2ZRBIHW/graph.json","fetch_events":"https://pith.science/api/pith-number/USOPUFFLSV4MXM3R2FR2ZRBIHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/action/storage_attestation","attest_author":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/action/author_attestation","sign_citation":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/action/citation_signature","submit_replication":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/action/replication_record"}},"created_at":"2026-05-18T01:22:09.909518+00:00","updated_at":"2026-05-18T01:22:09.909518+00:00"}