{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W6G4VLBN7JUUKVS6BZ4DZSDIGJ","short_pith_number":"pith:W6G4VLBN","schema_version":"1.0","canonical_sha256":"b78dcaac2dfa6945565e0e783cc8683253ce0aebdeeb1f8bb491def6edcf015e","source":{"kind":"arxiv","id":"1401.3225","version":1},"attestation_state":"computed","paper":{"title":"Cyclic Interference Alignment and Cancellation in 3-User X-Networks with Minimal Backhaul","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henning Maier, Rudolf Mathar","submitted_at":"2014-01-14T15:39:01Z","abstract_excerpt":"We consider the problem of Cyclic Interference Alignment (IA) on the 3-user X-network and show that it is infeasible to exactly achieve the upper bound of $\\frac{K^2}{2K-1}=\\frac{9}{5}$ degrees of freedom for the lower bound of n=5 signalling dimensions and K=3 user-pairs. This infeasibility goes beyond the problem of common eigenvectors in invariant subspaces within spatial IA.\n  In order to gain non-asymptotic feasibility with minimal intervention, we first investigate an alignment strategy that enables IA by feedforwarding a subset of messages with minimal rate. In a second step, we replace"},"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.3225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-14T15:39:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"40553aca4abec786ecd66932e3d81d75eaf10215c2a9717c410cd14bd9e43e9d","abstract_canon_sha256":"900bd820b47a583e99fa77c5401c958dec1781aab9e7640a4858974577fd4408"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:19.226247Z","signature_b64":"82wNk1O57TmUN+8qNFbM4MqC04GRW0dCpcINTDrksd/Wm1KiGMwwhm+wsUMmWHca4FBSw2OA97D9fOnxOqUfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b78dcaac2dfa6945565e0e783cc8683253ce0aebdeeb1f8bb491def6edcf015e","last_reissued_at":"2026-05-18T03:02:19.225452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:19.225452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic Interference Alignment and Cancellation in 3-User X-Networks with Minimal Backhaul","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henning Maier, Rudolf Mathar","submitted_at":"2014-01-14T15:39:01Z","abstract_excerpt":"We consider the problem of Cyclic Interference Alignment (IA) on the 3-user X-network and show that it is infeasible to exactly achieve the upper bound of $\\frac{K^2}{2K-1}=\\frac{9}{5}$ degrees of freedom for the lower bound of n=5 signalling dimensions and K=3 user-pairs. This infeasibility goes beyond the problem of common eigenvectors in invariant subspaces within spatial IA.\n  In order to gain non-asymptotic feasibility with minimal intervention, we first investigate an alignment strategy that enables IA by feedforwarding a subset of messages with minimal rate. In a second step, we replace"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3225","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":"1401.3225","created_at":"2026-05-18T03:02:19.225583+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3225v1","created_at":"2026-05-18T03:02:19.225583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3225","created_at":"2026-05-18T03:02:19.225583+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6G4VLBN7JUU","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6G4VLBN7JUUKVS6","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6G4VLBN","created_at":"2026-05-18T12:28:54.890064+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/W6G4VLBN7JUUKVS6BZ4DZSDIGJ","json":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ.json","graph_json":"https://pith.science/api/pith-number/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/graph.json","events_json":"https://pith.science/api/pith-number/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/events.json","paper":"https://pith.science/paper/W6G4VLBN"},"agent_actions":{"view_html":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ","download_json":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ.json","view_paper":"https://pith.science/paper/W6G4VLBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3225&json=true","fetch_graph":"https://pith.science/api/pith-number/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/action/storage_attestation","attest_author":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/action/author_attestation","sign_citation":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/action/citation_signature","submit_replication":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/action/replication_record"}},"created_at":"2026-05-18T03:02:19.225583+00:00","updated_at":"2026-05-18T03:02:19.225583+00:00"}