{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NVBHQTVRSBFLO2GT2FGBHEXZIQ","short_pith_number":"pith:NVBHQTVR","schema_version":"1.0","canonical_sha256":"6d42784eb1904ab768d3d14c1392f944346890d296d029cab3aaadc3138e84b3","source":{"kind":"arxiv","id":"1004.5132","version":1},"attestation_state":"computed","paper":{"title":"The Two-User Deterministic Interference Channel with Rate-Limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Vahid, A. Salman Avestimehr","submitted_at":"2010-04-28T20:14:09Z","abstract_excerpt":"In this paper we study the effect of rate-limited feedback on the sum-rate capacity of the deterministic interference channel. We characterize the sum-rate capacity of this channel in the symmetric case and show that having feedback links  can increase the sum-rate capacity by at most the rate of the available feedback. Our proof includes a novel upper-bound on the sum-rate capacity and a set of new achievability strategies."},"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":"1004.5132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-28T20:14:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08414cffe365bb861bffb1e1832f8c8a99147e307d79f2ffc2c8e7ed827839f8","abstract_canon_sha256":"09f908b182018f34438f7b1e7cd31d6f96e0e69b1d0be16678239b48d8deb85c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:15.260359Z","signature_b64":"HCVOTnagnstbSdVgpH7CsusiZPR1DVhU2dSHhKbW4x0FJ93NCxw9X05vvsA0RFyrvlx4rPrd3/hjk0bC0TQ0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d42784eb1904ab768d3d14c1392f944346890d296d029cab3aaadc3138e84b3","last_reissued_at":"2026-05-18T02:24:15.259918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:15.259918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Two-User Deterministic Interference Channel with Rate-Limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Vahid, A. Salman Avestimehr","submitted_at":"2010-04-28T20:14:09Z","abstract_excerpt":"In this paper we study the effect of rate-limited feedback on the sum-rate capacity of the deterministic interference channel. We characterize the sum-rate capacity of this channel in the symmetric case and show that having feedback links  can increase the sum-rate capacity by at most the rate of the available feedback. Our proof includes a novel upper-bound on the sum-rate capacity and a set of new achievability strategies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5132","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":"1004.5132","created_at":"2026-05-18T02:24:15.259977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.5132v1","created_at":"2026-05-18T02:24:15.259977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5132","created_at":"2026-05-18T02:24:15.259977+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVBHQTVRSBFL","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVBHQTVRSBFLO2GT","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVBHQTVR","created_at":"2026-05-18T12:26:10.704358+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/NVBHQTVRSBFLO2GT2FGBHEXZIQ","json":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ.json","graph_json":"https://pith.science/api/pith-number/NVBHQTVRSBFLO2GT2FGBHEXZIQ/graph.json","events_json":"https://pith.science/api/pith-number/NVBHQTVRSBFLO2GT2FGBHEXZIQ/events.json","paper":"https://pith.science/paper/NVBHQTVR"},"agent_actions":{"view_html":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ","download_json":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ.json","view_paper":"https://pith.science/paper/NVBHQTVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.5132&json=true","fetch_graph":"https://pith.science/api/pith-number/NVBHQTVRSBFLO2GT2FGBHEXZIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NVBHQTVRSBFLO2GT2FGBHEXZIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ/action/storage_attestation","attest_author":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ/action/author_attestation","sign_citation":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ/action/citation_signature","submit_replication":"https://pith.science/pith/NVBHQTVRSBFLO2GT2FGBHEXZIQ/action/replication_record"}},"created_at":"2026-05-18T02:24:15.259977+00:00","updated_at":"2026-05-18T02:24:15.259977+00:00"}