{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:USOPUFFLSV4MXM3R2FR2ZRBIHW","short_pith_number":"pith:USOPUFFL","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"},"canonical_sha256":"a49cfa14ab9578cbb371d163acc4283d8dffff691734f04c41996e450d639fc8","source":{"kind":"arxiv","id":"1601.05880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05880","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05880v1","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05880","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"USOPUFFLSV4M","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"USOPUFFLSV4MXM3R","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"USOPUFFL","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:USOPUFFLSV4MXM3R2FR2ZRBIHW","target":"record","payload":{"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"},"canonical_sha256":"a49cfa14ab9578cbb371d163acc4283d8dffff691734f04c41996e450d639fc8","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"},"source_kind":"arxiv","source_id":"1601.05880","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-18T01:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mx9PXTXFk29SNQ8NrVZdtEd5Mf96xQfx8FNErwJYox6J+4G1IHpJBMe4zHuPBcWWSSvmKRVu3XJzqgdh15OtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:51:33.007576Z"},"content_sha256":"6830566315958ea150b5a57780d9310307b5e588b54aec797ec319ce299df0a7","schema_version":"1.0","event_id":"sha256:6830566315958ea150b5a57780d9310307b5e588b54aec797ec319ce299df0a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:USOPUFFLSV4MXM3R2FR2ZRBIHW","target":"graph","payload":{"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"},"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-18T01:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXUgugGL5EPwWjlmymK4SkEF2WVbIo60y29gir/u8RX07SKMWTje83E3n8MLF7Efdrqs9XEQI3Gj2Zdbar1ABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:51:33.007921Z"},"content_sha256":"34e7c933542e3e66eaea3f880a0ffe0c8ba93e870d37e4a69472660ec773e7de","schema_version":"1.0","event_id":"sha256:34e7c933542e3e66eaea3f880a0ffe0c8ba93e870d37e4a69472660ec773e7de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/bundle.json","state_url":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/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-06-05T12:51:33Z","links":{"resolver":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW","bundle":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/bundle.json","state":"https://pith.science/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USOPUFFLSV4MXM3R2FR2ZRBIHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:USOPUFFLSV4MXM3R2FR2ZRBIHW","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":"e5f4333c2bdcfec90f0b2707d6c3ca92faf2381ec413ef84c33472ea05ea68f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T05:42:35Z","title_canon_sha256":"6111b7c5f17070a8988c27e01ac0b4f4e458409ef949d18948c3c3166e8c067b"},"schema_version":"1.0","source":{"id":"1601.05880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05880","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05880v1","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05880","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"USOPUFFLSV4M","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"USOPUFFLSV4MXM3R","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"USOPUFFL","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:34e7c933542e3e66eaea3f880a0ffe0c8ba93e870d37e4a69472660ec773e7de","target":"graph","created_at":"2026-05-18T01:22:09Z","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":"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","authors_text":"Austin Collins, Giuseppe Durisi, H. Vincent Poor, Wei Yang, Yury Polyanskiy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T05:42:35Z","title":"A Beta-Beta Achievability Bound with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05880","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:6830566315958ea150b5a57780d9310307b5e588b54aec797ec319ce299df0a7","target":"record","created_at":"2026-05-18T01:22:09Z","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":"e5f4333c2bdcfec90f0b2707d6c3ca92faf2381ec413ef84c33472ea05ea68f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T05:42:35Z","title_canon_sha256":"6111b7c5f17070a8988c27e01ac0b4f4e458409ef949d18948c3c3166e8c067b"},"schema_version":"1.0","source":{"id":"1601.05880","kind":"arxiv","version":1}},"canonical_sha256":"a49cfa14ab9578cbb371d163acc4283d8dffff691734f04c41996e450d639fc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a49cfa14ab9578cbb371d163acc4283d8dffff691734f04c41996e450d639fc8","first_computed_at":"2026-05-18T01:22:09.909410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:09.909410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Akm9PfU7eGqKuicj/gaV7VIIJH9OLeIZoLncJeAPE7jU7cfAxpWh2mH3wXlDBecUuJGyjoSXoUDiBvXk1kUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:09.910051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6830566315958ea150b5a57780d9310307b5e588b54aec797ec319ce299df0a7","sha256:34e7c933542e3e66eaea3f880a0ffe0c8ba93e870d37e4a69472660ec773e7de"],"state_sha256":"6bc2b47d46f0beffc7a0d0e165d3970093e9b94694e5f8601dc0323c7de35cb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VlD52DtS2vqtIg27aTERU8hIBxh6Pm+XciR0+mSb8huwPIjxLNujfJlPo5tOXJczo/gikk8gj/8NSbUtltEZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:51:33.010010Z","bundle_sha256":"9de6ef6a4d60c12efae3186ed61572945ecb3971f943ecd22ebb1271950d52b5"}}