{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5S2T4Y7O37KCYAKGYCLAK2WSY3","short_pith_number":"pith:5S2T4Y7O","canonical_record":{"source":{"id":"1307.6125","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-23T15:37:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b76e696667ddc1ed27ce6bec87fdadc0f947e610fe77caa2ec4ae8b6234957e3","abstract_canon_sha256":"d5cf7bae8e4a40309054d2b5f3e964056a55dc0715d49b862507b151ff80e40f"},"schema_version":"1.0"},"canonical_sha256":"ecb53e63eedfd42c0146c096056ad2c6da915275f5b9a3e509d2acf43e3aeeed","source":{"kind":"arxiv","id":"1307.6125","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6125","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6125v3","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6125","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"5S2T4Y7O37KC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5S2T4Y7O37KCYAKG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5S2T4Y7O","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5S2T4Y7O37KCYAKGYCLAK2WSY3","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6125","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-23T15:37:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b76e696667ddc1ed27ce6bec87fdadc0f947e610fe77caa2ec4ae8b6234957e3","abstract_canon_sha256":"d5cf7bae8e4a40309054d2b5f3e964056a55dc0715d49b862507b151ff80e40f"},"schema_version":"1.0"},"canonical_sha256":"ecb53e63eedfd42c0146c096056ad2c6da915275f5b9a3e509d2acf43e3aeeed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.140657Z","signature_b64":"ro2kaZLC2DAIDvGf6EQo6Djk2Q7ABmdPOM6YhsiaeM/6/JYmIzNOpCwgIHJAOXj4hmsm36VupOxwv+uWM35FAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb53e63eedfd42c0146c096056ad2c6da915275f5b9a3e509d2acf43e3aeeed","last_reissued_at":"2026-05-18T00:58:42.139962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.139962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6125","source_version":3,"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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ib3ZWHoCP24eCKiMdXr1YTwGC/EeR/guqC5c8S3MckYzET0CUu4sxgavdYRb3GtLE6mKsUbnYcIHaJHuqNWTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:50:10.578411Z"},"content_sha256":"63f9c8d5932a5e70ed9322182334e241597f970e208519228b4ced7b457f0337","schema_version":"1.0","event_id":"sha256:63f9c8d5932a5e70ed9322182334e241597f970e208519228b4ced7b457f0337"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5S2T4Y7O37KCYAKGYCLAK2WSY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference alignment using finite and dependent channel extensions: the single beam case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ruoyu Sun, Zhi-Quan Luo","submitted_at":"2013-07-23T15:37:04Z","abstract_excerpt":"Vector space interference alignment (IA) is known to achieve high degrees of freedom (DoF) with infinite independent channel extensions, but its performance is largely unknown for a finite number of possibly dependent channel extensions. In this paper, we consider a $K$-user $M_t \\times M_r$ MIMO interference channel (IC) with arbitrary number of channel extensions $T$ and arbitrary channel diversity order $L$ (i.e., each channel matrix is a generic linear combination of $L$ fixed basis matrices). We study the maximum DoF achievable via vector space IA in the single beam case (i.e. each user s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6125","kind":"arxiv","version":3},"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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEpUyRIk70fjEHCy953LVgcU1TW9lcfiGBpu9LeAHde60t4ztElilAjHyxxQKLvHdQM0RMuku0zguH504PJTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:50:10.579183Z"},"content_sha256":"0567ab4c33e0b29e9ef283a64b69bf3374e6ad33f284b48ec6193063641c0e1f","schema_version":"1.0","event_id":"sha256:0567ab4c33e0b29e9ef283a64b69bf3374e6ad33f284b48ec6193063641c0e1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5S2T4Y7O37KCYAKGYCLAK2WSY3/bundle.json","state_url":"https://pith.science/pith/5S2T4Y7O37KCYAKGYCLAK2WSY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5S2T4Y7O37KCYAKGYCLAK2WSY3/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-05-31T04:50:10Z","links":{"resolver":"https://pith.science/pith/5S2T4Y7O37KCYAKGYCLAK2WSY3","bundle":"https://pith.science/pith/5S2T4Y7O37KCYAKGYCLAK2WSY3/bundle.json","state":"https://pith.science/pith/5S2T4Y7O37KCYAKGYCLAK2WSY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5S2T4Y7O37KCYAKGYCLAK2WSY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5S2T4Y7O37KCYAKGYCLAK2WSY3","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":"d5cf7bae8e4a40309054d2b5f3e964056a55dc0715d49b862507b151ff80e40f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-23T15:37:04Z","title_canon_sha256":"b76e696667ddc1ed27ce6bec87fdadc0f947e610fe77caa2ec4ae8b6234957e3"},"schema_version":"1.0","source":{"id":"1307.6125","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6125","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6125v3","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6125","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"5S2T4Y7O37KC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5S2T4Y7O37KCYAKG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5S2T4Y7O","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:0567ab4c33e0b29e9ef283a64b69bf3374e6ad33f284b48ec6193063641c0e1f","target":"graph","created_at":"2026-05-18T00:58:42Z","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":"Vector space interference alignment (IA) is known to achieve high degrees of freedom (DoF) with infinite independent channel extensions, but its performance is largely unknown for a finite number of possibly dependent channel extensions. In this paper, we consider a $K$-user $M_t \\times M_r$ MIMO interference channel (IC) with arbitrary number of channel extensions $T$ and arbitrary channel diversity order $L$ (i.e., each channel matrix is a generic linear combination of $L$ fixed basis matrices). We study the maximum DoF achievable via vector space IA in the single beam case (i.e. each user s","authors_text":"Ruoyu Sun, Zhi-Quan Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-23T15:37:04Z","title":"Interference alignment using finite and dependent channel extensions: the single beam case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6125","kind":"arxiv","version":3},"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:63f9c8d5932a5e70ed9322182334e241597f970e208519228b4ced7b457f0337","target":"record","created_at":"2026-05-18T00:58:42Z","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":"d5cf7bae8e4a40309054d2b5f3e964056a55dc0715d49b862507b151ff80e40f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-23T15:37:04Z","title_canon_sha256":"b76e696667ddc1ed27ce6bec87fdadc0f947e610fe77caa2ec4ae8b6234957e3"},"schema_version":"1.0","source":{"id":"1307.6125","kind":"arxiv","version":3}},"canonical_sha256":"ecb53e63eedfd42c0146c096056ad2c6da915275f5b9a3e509d2acf43e3aeeed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecb53e63eedfd42c0146c096056ad2c6da915275f5b9a3e509d2acf43e3aeeed","first_computed_at":"2026-05-18T00:58:42.139962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.139962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ro2kaZLC2DAIDvGf6EQo6Djk2Q7ABmdPOM6YhsiaeM/6/JYmIzNOpCwgIHJAOXj4hmsm36VupOxwv+uWM35FAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.140657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6125","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63f9c8d5932a5e70ed9322182334e241597f970e208519228b4ced7b457f0337","sha256:0567ab4c33e0b29e9ef283a64b69bf3374e6ad33f284b48ec6193063641c0e1f"],"state_sha256":"30ea6f1bec0dfb52f4b424495bda3e6a26eccd5b1a3313d81cdcf01fd7555890"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkB6K8uv56D9Ytoc2TYjlJj8Ndv28OSKnLSrHCfJ8hvefXJVkexmD4MOucaXDHKOLLVWM1vlf0Uev7c9RtL0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:50:10.583128Z","bundle_sha256":"14457ec3db1bab3c02c1bf89d2310fd99eb6fef176473cc0e28f6650ac961679"}}