{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZNR2YUTKGVFBUQM4D54T3AEHPK","short_pith_number":"pith:ZNR2YUTK","canonical_record":{"source":{"id":"1809.08537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-23T05:37:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ccc974ce48b044c20913e2f2f521f0e770f5a7dffda80eb1adfc2f67cf5a07ae","abstract_canon_sha256":"57228dbec2db98beb9cd931a30e875587d9444fc68155143070f76d29704bca8"},"schema_version":"1.0"},"canonical_sha256":"cb63ac526a354a1a419c1f793d80877a8e3222f29fbda05b0b8485f7d3bdf1bd","source":{"kind":"arxiv","id":"1809.08537","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08537","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08537v2","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08537","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZNR2YUTKGVFB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZNR2YUTKGVFBUQM4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZNR2YUTK","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZNR2YUTKGVFBUQM4D54T3AEHPK","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-23T05:37:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ccc974ce48b044c20913e2f2f521f0e770f5a7dffda80eb1adfc2f67cf5a07ae","abstract_canon_sha256":"57228dbec2db98beb9cd931a30e875587d9444fc68155143070f76d29704bca8"},"schema_version":"1.0"},"canonical_sha256":"cb63ac526a354a1a419c1f793d80877a8e3222f29fbda05b0b8485f7d3bdf1bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:54.262729Z","signature_b64":"beDB7II/ceTvsmJnARdOcHhJGLwFwwVJvLV4WMtJzmQIjM3R0jZpRFdMWJEqosTM5s6/FVBGQe9HStxPm5KbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb63ac526a354a1a419c1f793d80877a8e3222f29fbda05b0b8485f7d3bdf1bd","last_reissued_at":"2026-05-18T00:04:54.262189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:54.262189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08537","source_version":2,"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:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qg6oNGqSuNojSK761wFS7eVpmjV2pHF/zwnJxPzcHlXtYyr5hGzZ2sKM7ObRIeFgr9E9vxVuLNS+jvaJ5RW1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:13.393627Z"},"content_sha256":"ab36a83eccaa13518eec94db461a1061de3768bd61b5d5c80a4069f34972e52a","schema_version":"1.0","event_id":"sha256:ab36a83eccaa13518eec94db461a1061de3768bd61b5d5c80a4069f34972e52a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZNR2YUTKGVFBUQM4D54T3AEHPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Low-Rank Optimization for Topological Cooperation in Ultra-Dense Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kai Yang, Yuanming Shi, Zhi Ding","submitted_at":"2018-09-23T05:37:30Z","abstract_excerpt":"Network densification is a natural way to support dense mobile applications under stringent requirements, such as ultra-low latency, ultra-high data rate, and massive connecting devices. Severe interference in ultra-dense networks poses a key bottleneck. Sharing channel state information (CSI) and messages across transmitters can potentially alleviate interferences and improve system performance. Most existing works on interference coordination require significant CSI signaling overhead and are impractical in ultra-dense networks. This paper investigate topological cooperation to manage interf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08537","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"},"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:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxtdC5O8D8oXNB1EBK5GY3rFwEIUTcAuoJVM6KJxM7UMIGiQ8MgqHdmTZ2oVo8FzgLH1rbk0XZfa+Shron1LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:13.394265Z"},"content_sha256":"4ae48fa5ac17a43cdbd37b1ea60f6448a052d5b81ed668d795a5e3666952ceda","schema_version":"1.0","event_id":"sha256:4ae48fa5ac17a43cdbd37b1ea60f6448a052d5b81ed668d795a5e3666952ceda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNR2YUTKGVFBUQM4D54T3AEHPK/bundle.json","state_url":"https://pith.science/pith/ZNR2YUTKGVFBUQM4D54T3AEHPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNR2YUTKGVFBUQM4D54T3AEHPK/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-25T22:21:13Z","links":{"resolver":"https://pith.science/pith/ZNR2YUTKGVFBUQM4D54T3AEHPK","bundle":"https://pith.science/pith/ZNR2YUTKGVFBUQM4D54T3AEHPK/bundle.json","state":"https://pith.science/pith/ZNR2YUTKGVFBUQM4D54T3AEHPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNR2YUTKGVFBUQM4D54T3AEHPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZNR2YUTKGVFBUQM4D54T3AEHPK","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":"57228dbec2db98beb9cd931a30e875587d9444fc68155143070f76d29704bca8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-23T05:37:30Z","title_canon_sha256":"ccc974ce48b044c20913e2f2f521f0e770f5a7dffda80eb1adfc2f67cf5a07ae"},"schema_version":"1.0","source":{"id":"1809.08537","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08537","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08537v2","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08537","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZNR2YUTKGVFB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZNR2YUTKGVFBUQM4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZNR2YUTK","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:4ae48fa5ac17a43cdbd37b1ea60f6448a052d5b81ed668d795a5e3666952ceda","target":"graph","created_at":"2026-05-18T00:04:54Z","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":"Network densification is a natural way to support dense mobile applications under stringent requirements, such as ultra-low latency, ultra-high data rate, and massive connecting devices. Severe interference in ultra-dense networks poses a key bottleneck. Sharing channel state information (CSI) and messages across transmitters can potentially alleviate interferences and improve system performance. Most existing works on interference coordination require significant CSI signaling overhead and are impractical in ultra-dense networks. This paper investigate topological cooperation to manage interf","authors_text":"Kai Yang, Yuanming Shi, Zhi Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-23T05:37:30Z","title":"Generalized Low-Rank Optimization for Topological Cooperation in Ultra-Dense Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08537","kind":"arxiv","version":2},"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:ab36a83eccaa13518eec94db461a1061de3768bd61b5d5c80a4069f34972e52a","target":"record","created_at":"2026-05-18T00:04:54Z","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":"57228dbec2db98beb9cd931a30e875587d9444fc68155143070f76d29704bca8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-23T05:37:30Z","title_canon_sha256":"ccc974ce48b044c20913e2f2f521f0e770f5a7dffda80eb1adfc2f67cf5a07ae"},"schema_version":"1.0","source":{"id":"1809.08537","kind":"arxiv","version":2}},"canonical_sha256":"cb63ac526a354a1a419c1f793d80877a8e3222f29fbda05b0b8485f7d3bdf1bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb63ac526a354a1a419c1f793d80877a8e3222f29fbda05b0b8485f7d3bdf1bd","first_computed_at":"2026-05-18T00:04:54.262189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:54.262189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"beDB7II/ceTvsmJnARdOcHhJGLwFwwVJvLV4WMtJzmQIjM3R0jZpRFdMWJEqosTM5s6/FVBGQe9HStxPm5KbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:54.262729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08537","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab36a83eccaa13518eec94db461a1061de3768bd61b5d5c80a4069f34972e52a","sha256:4ae48fa5ac17a43cdbd37b1ea60f6448a052d5b81ed668d795a5e3666952ceda"],"state_sha256":"0e6d17eccebc6db94a5efd1b26c65fef68382e90b36c8b4dffa46cb5fd85e492"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9QMFSEYyGpxlfKFxGMs0BqTD/74zId22vUZSl/2TJU33S+tpl5JJG5oJjShe1MePHMWiGbceol8276pElavkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:21:13.398010Z","bundle_sha256":"eb0b85eb43bc15bf7f03108e52abd13313acb90850af517c6ec4b53b23624c90"}}