{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EXMS2QRDV35N566W5ZBGVW5QK7","short_pith_number":"pith:EXMS2QRD","canonical_record":{"source":{"id":"1403.0957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-04T21:38:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e99d6fb9ebdc330c9c232980e156468233d2ec248951e0ffa0588ee1319606f","abstract_canon_sha256":"27274655a9fa830f6ccf5b09d18d6fc68611b9d5ec5e513c5c9e2dafc25798da"},"schema_version":"1.0"},"canonical_sha256":"25d92d4223aefadefbd6ee426adbb057dba84cc011f474ac367cd42f0349559c","source":{"kind":"arxiv","id":"1403.0957","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0957","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0957v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0957","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"EXMS2QRDV35N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXMS2QRDV35N566W","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXMS2QRD","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EXMS2QRDV35N566W5ZBGVW5QK7","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-04T21:38:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e99d6fb9ebdc330c9c232980e156468233d2ec248951e0ffa0588ee1319606f","abstract_canon_sha256":"27274655a9fa830f6ccf5b09d18d6fc68611b9d5ec5e513c5c9e2dafc25798da"},"schema_version":"1.0"},"canonical_sha256":"25d92d4223aefadefbd6ee426adbb057dba84cc011f474ac367cd42f0349559c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.325911Z","signature_b64":"PyaUMipgams2G44S17guqNd4aEFubFKnCZFX04wHx32HNKrklJhfU9qo3VJ2FLBXw0sxM12lQXJOyE9ofRuVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25d92d4223aefadefbd6ee426adbb057dba84cc011f474ac367cd42f0349559c","last_reissued_at":"2026-05-18T00:38:44.325408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.325408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0957","source_version":2,"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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/yhiiwt5IuI73p4EKYbTTWYj188SQ+n+R63qNhcy/KGWCsy400Gs0SzbxlS725B7+F4N4PZo0a42Odut/WCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:34:30.182013Z"},"content_sha256":"bc72d891989e237349e6c84ba1fbe3651e078488ee0edf0e95ff65b9923b28c2","schema_version":"1.0","event_id":"sha256:bc72d891989e237349e6c84ba1fbe3651e078488ee0edf0e95ff65b9923b28c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EXMS2QRDV35N566W5ZBGVW5QK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Symmetric $K$-user Interference Channels with Limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mehdi Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang","submitted_at":"2014-03-04T21:38:32Z","abstract_excerpt":"In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the linear deterministic model, and the Gaussian model. For the deterministic model, the proposed scheme achieves a symmetric rate that is the minimum of the symmetric capacity with infinite feedback, and the sum of the symmetric capacity without feedback and the symmetric amount of feedback. For the Gaussian interference channel, we use lattice codes to propose a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0957","kind":"arxiv","version":2},"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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ix7sT2gXpoOVnCr+vyhyC+I/D60TRSv3HxjuYc3kGd/ClKWAnqgePeG00pz+Nc65cBTkf8h/xngZWCTgpULeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:34:30.182739Z"},"content_sha256":"09483e7b2b47c2cfab871fe7127d54e5227670a3ca25222b8a54845b2d9c8245","schema_version":"1.0","event_id":"sha256:09483e7b2b47c2cfab871fe7127d54e5227670a3ca25222b8a54845b2d9c8245"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXMS2QRDV35N566W5ZBGVW5QK7/bundle.json","state_url":"https://pith.science/pith/EXMS2QRDV35N566W5ZBGVW5QK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXMS2QRDV35N566W5ZBGVW5QK7/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-06T21:34:30Z","links":{"resolver":"https://pith.science/pith/EXMS2QRDV35N566W5ZBGVW5QK7","bundle":"https://pith.science/pith/EXMS2QRDV35N566W5ZBGVW5QK7/bundle.json","state":"https://pith.science/pith/EXMS2QRDV35N566W5ZBGVW5QK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXMS2QRDV35N566W5ZBGVW5QK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EXMS2QRDV35N566W5ZBGVW5QK7","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":"27274655a9fa830f6ccf5b09d18d6fc68611b9d5ec5e513c5c9e2dafc25798da","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-04T21:38:32Z","title_canon_sha256":"9e99d6fb9ebdc330c9c232980e156468233d2ec248951e0ffa0588ee1319606f"},"schema_version":"1.0","source":{"id":"1403.0957","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0957","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0957v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0957","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"EXMS2QRDV35N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXMS2QRDV35N566W","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXMS2QRD","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:09483e7b2b47c2cfab871fe7127d54e5227670a3ca25222b8a54845b2d9c8245","target":"graph","created_at":"2026-05-18T00:38:44Z","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":"In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the linear deterministic model, and the Gaussian model. For the deterministic model, the proposed scheme achieves a symmetric rate that is the minimum of the symmetric capacity with infinite feedback, and the sum of the symmetric capacity without feedback and the symmetric amount of feedback. For the Gaussian interference channel, we use lattice codes to propose a ","authors_text":"Mehdi Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-04T21:38:32Z","title":"On the Symmetric $K$-user Interference Channels with Limited Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0957","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:bc72d891989e237349e6c84ba1fbe3651e078488ee0edf0e95ff65b9923b28c2","target":"record","created_at":"2026-05-18T00:38:44Z","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":"27274655a9fa830f6ccf5b09d18d6fc68611b9d5ec5e513c5c9e2dafc25798da","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-04T21:38:32Z","title_canon_sha256":"9e99d6fb9ebdc330c9c232980e156468233d2ec248951e0ffa0588ee1319606f"},"schema_version":"1.0","source":{"id":"1403.0957","kind":"arxiv","version":2}},"canonical_sha256":"25d92d4223aefadefbd6ee426adbb057dba84cc011f474ac367cd42f0349559c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25d92d4223aefadefbd6ee426adbb057dba84cc011f474ac367cd42f0349559c","first_computed_at":"2026-05-18T00:38:44.325408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.325408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PyaUMipgams2G44S17guqNd4aEFubFKnCZFX04wHx32HNKrklJhfU9qo3VJ2FLBXw0sxM12lQXJOyE9ofRuVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.325911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0957","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc72d891989e237349e6c84ba1fbe3651e078488ee0edf0e95ff65b9923b28c2","sha256:09483e7b2b47c2cfab871fe7127d54e5227670a3ca25222b8a54845b2d9c8245"],"state_sha256":"b2dbfa88f97b4a89b7ce8f821ff486d57f1b4962990cc60f0bdab50f2d5c39ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dteevERkHzXDcO5rgbZH8cFfZMLIdIkwZysZJXhcqOdDrwhd+N7LKMwJFIByxKseDH7UeLogRvkSgpcbJ1T/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:34:30.186396Z","bundle_sha256":"508f9e140948f624196469ba6196515b417620abcecdb74a8ba230f3dd3938b1"}}