{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W6G4VLBN7JUUKVS6BZ4DZSDIGJ","short_pith_number":"pith:W6G4VLBN","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"},"canonical_sha256":"b78dcaac2dfa6945565e0e783cc8683253ce0aebdeeb1f8bb491def6edcf015e","source":{"kind":"arxiv","id":"1401.3225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3225","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3225v1","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3225","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"W6G4VLBN7JUU","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W6G4VLBN7JUUKVS6","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W6G4VLBN","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W6G4VLBN7JUUKVS6BZ4DZSDIGJ","target":"record","payload":{"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"},"canonical_sha256":"b78dcaac2dfa6945565e0e783cc8683253ce0aebdeeb1f8bb491def6edcf015e","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"},"source_kind":"arxiv","source_id":"1401.3225","source_version":1,"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-18T03:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TAq2WXQwgBJVE5baH1qqXlq/lYteEWw+QoKfnROCNPueg/M5cEu1ftJmWvyAGWnLjk/9WPbmztG58gggc8cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:18:53.182292Z"},"content_sha256":"51d28454315209c9d5f27b2da0ab87c58a2c81668883ee08f1a266a906d95c63","schema_version":"1.0","event_id":"sha256:51d28454315209c9d5f27b2da0ab87c58a2c81668883ee08f1a266a906d95c63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W6G4VLBN7JUUKVS6BZ4DZSDIGJ","target":"graph","payload":{"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"},"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-18T03:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tbMD5i3nFLgI9czg/sNmhp1czR2k9RVSD0KIVM4ad8c40AERGxvkV8vKoT5HwhWwGlGOEkD/s8UFw+LEq3UnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:18:53.182648Z"},"content_sha256":"86b09bb13192ed7ea482216a46dfedbe7db4c87cfc340b044ba014bd8a58e980","schema_version":"1.0","event_id":"sha256:86b09bb13192ed7ea482216a46dfedbe7db4c87cfc340b044ba014bd8a58e980"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/bundle.json","state_url":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/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-07-01T12:18:53Z","links":{"resolver":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ","bundle":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/bundle.json","state":"https://pith.science/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6G4VLBN7JUUKVS6BZ4DZSDIGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W6G4VLBN7JUUKVS6BZ4DZSDIGJ","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":"900bd820b47a583e99fa77c5401c958dec1781aab9e7640a4858974577fd4408","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-14T15:39:01Z","title_canon_sha256":"40553aca4abec786ecd66932e3d81d75eaf10215c2a9717c410cd14bd9e43e9d"},"schema_version":"1.0","source":{"id":"1401.3225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3225","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3225v1","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3225","created_at":"2026-05-18T03:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"W6G4VLBN7JUU","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W6G4VLBN7JUUKVS6","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W6G4VLBN","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:86b09bb13192ed7ea482216a46dfedbe7db4c87cfc340b044ba014bd8a58e980","target":"graph","created_at":"2026-05-18T03:02:19Z","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 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","authors_text":"Henning Maier, Rudolf Mathar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-14T15:39:01Z","title":"Cyclic Interference Alignment and Cancellation in 3-User X-Networks with Minimal Backhaul"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3225","kind":"arxiv","version":1},"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:51d28454315209c9d5f27b2da0ab87c58a2c81668883ee08f1a266a906d95c63","target":"record","created_at":"2026-05-18T03:02:19Z","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":"900bd820b47a583e99fa77c5401c958dec1781aab9e7640a4858974577fd4408","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-14T15:39:01Z","title_canon_sha256":"40553aca4abec786ecd66932e3d81d75eaf10215c2a9717c410cd14bd9e43e9d"},"schema_version":"1.0","source":{"id":"1401.3225","kind":"arxiv","version":1}},"canonical_sha256":"b78dcaac2dfa6945565e0e783cc8683253ce0aebdeeb1f8bb491def6edcf015e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b78dcaac2dfa6945565e0e783cc8683253ce0aebdeeb1f8bb491def6edcf015e","first_computed_at":"2026-05-18T03:02:19.225452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:19.225452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"82wNk1O57TmUN+8qNFbM4MqC04GRW0dCpcINTDrksd/Wm1KiGMwwhm+wsUMmWHca4FBSw2OA97D9fOnxOqUfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:19.226247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51d28454315209c9d5f27b2da0ab87c58a2c81668883ee08f1a266a906d95c63","sha256:86b09bb13192ed7ea482216a46dfedbe7db4c87cfc340b044ba014bd8a58e980"],"state_sha256":"9636fac3c4b6a31a14f14edfa8ca1e031d445996574939b7488fc3f233a3c553"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nD5H5j8Qp3aMxi+G+WFqX+tuv+o5+JmTcAmet4593uaBjJt7f8L/UMyrDaBYWnTwopWAnqRgDW0fIek2cQjeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:18:53.184585Z","bundle_sha256":"b699c73f04acc2a7ff2adb0f230e98093728701fc732ae3736c97478c443da49"}}