{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ADQCKKFXH5YYWX6FZY2QRJ6HSJ","short_pith_number":"pith:ADQCKKFX","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"},"canonical_sha256":"00e02528b73f718b5fc5ce3508a7c79248b482a26482de045c3aaec89b4abc89","source":{"kind":"arxiv","id":"1401.6219","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6219","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6219v3","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6219","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"ADQCKKFXH5YY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADQCKKFXH5YYWX6F","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADQCKKFX","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ADQCKKFXH5YYWX6FZY2QRJ6HSJ","target":"record","payload":{"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"},"canonical_sha256":"00e02528b73f718b5fc5ce3508a7c79248b482a26482de045c3aaec89b4abc89","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"},"source_kind":"arxiv","source_id":"1401.6219","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-18T01:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PbcmzLY/0UUQ2UZq+8sI/RGc8iV6HSEQDbKHgPphTM2mYxy7q6A6z5qJEEglWPE/D15cWzaWd8rMxCbvMp1JCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:12:15.392069Z"},"content_sha256":"a7f797cdab85b564b9e1a6b230a05e9d5167e6e3a221204ddf708d7ff3a5b6e0","schema_version":"1.0","event_id":"sha256:a7f797cdab85b564b9e1a6b230a05e9d5167e6e3a221204ddf708d7ff3a5b6e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ADQCKKFXH5YYWX6FZY2QRJ6HSJ","target":"graph","payload":{"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"},"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:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JuAfPJNH57f2NT/lwKyOoY/34gLnp7NdtvJm69SJYeMY1clGtIBLol40lK1NNfvX8FuMXWQoX0wfX6wgwPV4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:12:15.392470Z"},"content_sha256":"8cf3a4e0dc1f2ec138a74f9fb1174ccff9006735ebe1aa9b0b23b8799c850338","schema_version":"1.0","event_id":"sha256:8cf3a4e0dc1f2ec138a74f9fb1174ccff9006735ebe1aa9b0b23b8799c850338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/bundle.json","state_url":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/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-05-26T18:12:15Z","links":{"resolver":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ","bundle":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/bundle.json","state":"https://pith.science/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADQCKKFXH5YYWX6FZY2QRJ6HSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ADQCKKFXH5YYWX6FZY2QRJ6HSJ","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":"51a84df02034e72d8a014c14dc14604f821e3ef1872c7c6dd250757c000d940f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T23:47:29Z","title_canon_sha256":"2c1bedea02606e5bb7cc6242cea17a7e04de23062587070124bd553c1e9c20cf"},"schema_version":"1.0","source":{"id":"1401.6219","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6219","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6219v3","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6219","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"ADQCKKFXH5YY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADQCKKFXH5YYWX6F","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADQCKKFX","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:8cf3a4e0dc1f2ec138a74f9fb1174ccff9006735ebe1aa9b0b23b8799c850338","target":"graph","created_at":"2026-05-18T01:20:26Z","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 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","authors_text":"Mich\\`ele Wigger, Youlong Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T23:47:29Z","title":"Coding Schemes with Rate-Limited Feedback that Improve over the Nofeedback Capacity for a Large Class of Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6219","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:a7f797cdab85b564b9e1a6b230a05e9d5167e6e3a221204ddf708d7ff3a5b6e0","target":"record","created_at":"2026-05-18T01:20:26Z","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":"51a84df02034e72d8a014c14dc14604f821e3ef1872c7c6dd250757c000d940f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T23:47:29Z","title_canon_sha256":"2c1bedea02606e5bb7cc6242cea17a7e04de23062587070124bd553c1e9c20cf"},"schema_version":"1.0","source":{"id":"1401.6219","kind":"arxiv","version":3}},"canonical_sha256":"00e02528b73f718b5fc5ce3508a7c79248b482a26482de045c3aaec89b4abc89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00e02528b73f718b5fc5ce3508a7c79248b482a26482de045c3aaec89b4abc89","first_computed_at":"2026-05-18T01:20:26.596369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:26.596369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pXJgJ7f0D1OZfQ2ErKVmssw89Xzn0IBv9LZj0Awt+UKcgxg0vipXh9RFYM9XfiS2KCtEF0X102QzD0y254LjCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:26.596935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6219","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7f797cdab85b564b9e1a6b230a05e9d5167e6e3a221204ddf708d7ff3a5b6e0","sha256:8cf3a4e0dc1f2ec138a74f9fb1174ccff9006735ebe1aa9b0b23b8799c850338"],"state_sha256":"bccd2c6edfc9c009e887acef653434cc959a8f687bb70a1b84d5a8657b405dff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0O/qvJnbuICDQGt9QISrDLY8rVKROm8GENEcH4ee6m/nUbgUW+6hJvaJzeFwuwJbCE98XvWLOxHc/dPosdfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:12:15.395180Z","bundle_sha256":"37d8202850516f66ec7af4be4d07b6d8ebed810821b6aa869cf5d384fa49873b"}}