{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LQTDQO7T3PYOSUR4OV3AKZZWW2","short_pith_number":"pith:LQTDQO7T","schema_version":"1.0","canonical_sha256":"5c26383bf3dbf0e9523c7576056736b697cbf8735c565814a56e1bd2382f08d2","source":{"kind":"arxiv","id":"1307.1461","version":2},"attestation_state":"computed","paper":{"title":"Degrees of Freedom of the Rank-deficient Interference Channel with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Changho Suh, Sae-Young Chung, Sung ho Chae","submitted_at":"2013-07-04T19:49:24Z","abstract_excerpt":"We investigate the total degrees of freedom (DoF) of the K-user rank-deficient interference channel with feedback. For the two-user case, we characterize the total DoF by developing an achievable scheme and deriving a matching upper bound. For the three-user case, we develop a new achievable scheme which employs interference alignment to efficiently utilize the dimension of the received signal space. In addition, we derive an upper bound for the general K-user case and show the tightness of the bound when the number of antennas at each node is sufficiently large. As a consequence of these resu"},"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":"1307.1461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-04T19:49:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"760ae39123190ad47dcf46f6cddff88e93b1f78d4958458845acdc674146cc79","abstract_canon_sha256":"0037f8fd13be282d41b6641a353303cd5ee9aa8b478113d3ed81141f584ffcd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.043469Z","signature_b64":"YXq+cQPNcFa7eXirjZ7nGsCghOXiJoKWwFNCVQHZ+jDkhNpCgFOpaVyPcxLjDQz3GEWFy1ueHGSNAWAzZj/SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c26383bf3dbf0e9523c7576056736b697cbf8735c565814a56e1bd2382f08d2","last_reissued_at":"2026-05-18T00:58:17.042698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.042698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degrees of Freedom of the Rank-deficient Interference Channel with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Changho Suh, Sae-Young Chung, Sung ho Chae","submitted_at":"2013-07-04T19:49:24Z","abstract_excerpt":"We investigate the total degrees of freedom (DoF) of the K-user rank-deficient interference channel with feedback. For the two-user case, we characterize the total DoF by developing an achievable scheme and deriving a matching upper bound. For the three-user case, we develop a new achievable scheme which employs interference alignment to efficiently utilize the dimension of the received signal space. In addition, we derive an upper bound for the general K-user case and show the tightness of the bound when the number of antennas at each node is sufficiently large. As a consequence of these resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1461","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.1461","created_at":"2026-05-18T00:58:17.042822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1461v2","created_at":"2026-05-18T00:58:17.042822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1461","created_at":"2026-05-18T00:58:17.042822+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQTDQO7T3PYO","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQTDQO7T3PYOSUR4","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQTDQO7T","created_at":"2026-05-18T12:27:51.066281+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/LQTDQO7T3PYOSUR4OV3AKZZWW2","json":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2.json","graph_json":"https://pith.science/api/pith-number/LQTDQO7T3PYOSUR4OV3AKZZWW2/graph.json","events_json":"https://pith.science/api/pith-number/LQTDQO7T3PYOSUR4OV3AKZZWW2/events.json","paper":"https://pith.science/paper/LQTDQO7T"},"agent_actions":{"view_html":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2","download_json":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2.json","view_paper":"https://pith.science/paper/LQTDQO7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1461&json=true","fetch_graph":"https://pith.science/api/pith-number/LQTDQO7T3PYOSUR4OV3AKZZWW2/graph.json","fetch_events":"https://pith.science/api/pith-number/LQTDQO7T3PYOSUR4OV3AKZZWW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2/action/storage_attestation","attest_author":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2/action/author_attestation","sign_citation":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2/action/citation_signature","submit_replication":"https://pith.science/pith/LQTDQO7T3PYOSUR4OV3AKZZWW2/action/replication_record"}},"created_at":"2026-05-18T00:58:17.042822+00:00","updated_at":"2026-05-18T00:58:17.042822+00:00"}