{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MSO6T65L5ARUXJCXDQR3WJBT4Z","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":"13191079dd9cb73458ba10e401c6eb41ba96fd68fa0146d6d799f36663b2936a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T14:15:04Z","title_canon_sha256":"533ad2472b85126eee37a71ead93b38d9a11e1d981c743014cb9328634a8d74d"},"schema_version":"1.0","source":{"id":"1603.01729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01729","created_at":"2026-05-18T01:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01729v1","created_at":"2026-05-18T01:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01729","created_at":"2026-05-18T01:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"MSO6T65L5ARU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MSO6T65L5ARUXJCX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MSO6T65L","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:148c1fc7b5f492fc4f02ce5ec3a0526c4fd5faf1e2d04b660859e66128a513f4","target":"graph","created_at":"2026-05-18T01:19:34Z","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":"In this paper, we present a flexible low-rank matrix completion (LRMC) approach for topological interference management (TIM) in the partially connected K-user interference channel. No channel state information (CSI) is required at the transmitters except the network topology information. The previous attempt on the TIM problem is mainly based on its equivalence to the index coding problem, but so far only a few index coding problems have been solved. In contrast, in this paper, we present an algorithmic approach to investigate the achievable degrees-of-freedom (DoFs) by recasting the TIM prob","authors_text":"Jun Zhang, Khaled B. Letaief, Yuanming Shi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T14:15:04Z","title":"Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01729","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:0f9dbbc668dba0e13b2d3c80454740af1e9bda96784452c3fd42e3e95f4d16e4","target":"record","created_at":"2026-05-18T01:19:34Z","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":"13191079dd9cb73458ba10e401c6eb41ba96fd68fa0146d6d799f36663b2936a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-05T14:15:04Z","title_canon_sha256":"533ad2472b85126eee37a71ead93b38d9a11e1d981c743014cb9328634a8d74d"},"schema_version":"1.0","source":{"id":"1603.01729","kind":"arxiv","version":1}},"canonical_sha256":"649de9fbabe8234ba4571c23bb2433e65fd7b23473398ff9b57943955389b71b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"649de9fbabe8234ba4571c23bb2433e65fd7b23473398ff9b57943955389b71b","first_computed_at":"2026-05-18T01:19:34.907796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:34.907796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rhqyRhWlKNBeIh50m2Gc2W18a1iqmx8NrO+wgHXuBtS7FRtDFIQqL1Rrvam2tJCreRaC+VC+jjFhoCr3k43WDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:34.908212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f9dbbc668dba0e13b2d3c80454740af1e9bda96784452c3fd42e3e95f4d16e4","sha256:148c1fc7b5f492fc4f02ce5ec3a0526c4fd5faf1e2d04b660859e66128a513f4"],"state_sha256":"850beda9dcf8967795b9102aab0faef5c37e2b5a1628ec7a02894c1aed123576"}