{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ADQCKKFXH5YYWX6FZY2QRJ6HSJ","short_pith_number":"pith:ADQCKKFX","schema_version":"1.0","canonical_sha256":"00e02528b73f718b5fc5ce3508a7c79248b482a26482de045c3aaec89b4abc89","source":{"kind":"arxiv","id":"1401.6219","version":3},"attestation_state":"computed","paper":{"title":"Coding Schemes with Rate-Limited Feedback that Improve over the Nofeedback Capacity for a Large Class of Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mich\\`ele Wigger, Youlong Wu","submitted_at":"2014-01-23T23:47:29Z","abstract_excerpt":"We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including the class of \\emph{strictly essentially less-noisy BCs} that we introduce in this article. Examples of strictly essentially less-noisy BCs are the binary symmetric BC (BSBC) or the binary erasure BC (BEBC) with unequal cross-over or erasure probabilities at the two receivers. When the feedback rates are sufficiently large, our schemes recover all previously k"},"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":"1401.6219","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T23:47:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c1bedea02606e5bb7cc6242cea17a7e04de23062587070124bd553c1e9c20cf","abstract_canon_sha256":"51a84df02034e72d8a014c14dc14604f821e3ef1872c7c6dd250757c000d940f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:26.596935Z","signature_b64":"pXJgJ7f0D1OZfQ2ErKVmssw89Xzn0IBv9LZj0Awt+UKcgxg0vipXh9RFYM9XfiS2KCtEF0X102QzD0y254LjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00e02528b73f718b5fc5ce3508a7c79248b482a26482de045c3aaec89b4abc89","last_reissued_at":"2026-05-18T01:20:26.596369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:26.596369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding Schemes with Rate-Limited Feedback that Improve over the Nofeedback Capacity for a Large Class of Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mich\\`ele Wigger, Youlong Wu","submitted_at":"2014-01-23T23:47:29Z","abstract_excerpt":"We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including the class of \\emph{strictly essentially less-noisy BCs} that we introduce in this article. Examples of strictly essentially less-noisy BCs are the binary symmetric BC (BSBC) or the binary erasure BC (BEBC) with unequal cross-over or erasure probabilities at the two receivers. When the feedback rates are sufficiently large, our schemes recover all previously k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6219","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.6219","created_at":"2026-05-18T01:20:26.596473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6219v3","created_at":"2026-05-18T01:20:26.596473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6219","created_at":"2026-05-18T01:20:26.596473+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADQCKKFXH5YY","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADQCKKFXH5YYWX6F","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADQCKKFX","created_at":"2026-05-18T12:28:19.803747+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/ADQCKKFXH5YYWX6FZY2QRJ6HSJ","json":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ.json","graph_json":"https://pith.science/api/pith-number/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/graph.json","events_json":"https://pith.science/api/pith-number/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/events.json","paper":"https://pith.science/paper/ADQCKKFX"},"agent_actions":{"view_html":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ","download_json":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ.json","view_paper":"https://pith.science/paper/ADQCKKFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6219&json=true","fetch_graph":"https://pith.science/api/pith-number/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/action/storage_attestation","attest_author":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/action/author_attestation","sign_citation":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/action/citation_signature","submit_replication":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/action/replication_record"}},"created_at":"2026-05-18T01:20:26.596473+00:00","updated_at":"2026-05-18T01:20:26.596473+00:00"}