{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2IDLIGKIMCAEZUQDLVRKJJRN2F","short_pith_number":"pith:2IDLIGKI","canonical_record":{"source":{"id":"1008.2386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T20:06:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f78acd4ac4b729f521bf4a03d1e437c15d14b1260dd42019fe0fc2b045e904d3","abstract_canon_sha256":"cb58a853a38c9396f9be3d1d3a5b8a3fae06a9ffe1b18c72080d5aa99b6304a8"},"schema_version":"1.0"},"canonical_sha256":"d206b4194860804cd2035d62a4a62dd174c4650676c658a943827a412db655aa","source":{"kind":"arxiv","id":"1008.2386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2386","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2386v1","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2386","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"2IDLIGKIMCAE","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2IDLIGKIMCAEZUQD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2IDLIGKI","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2IDLIGKIMCAEZUQDLVRKJJRN2F","target":"record","payload":{"canonical_record":{"source":{"id":"1008.2386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T20:06:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f78acd4ac4b729f521bf4a03d1e437c15d14b1260dd42019fe0fc2b045e904d3","abstract_canon_sha256":"cb58a853a38c9396f9be3d1d3a5b8a3fae06a9ffe1b18c72080d5aa99b6304a8"},"schema_version":"1.0"},"canonical_sha256":"d206b4194860804cd2035d62a4a62dd174c4650676c658a943827a412db655aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:10.624808Z","signature_b64":"2AAMpBP8dBiYWpR2kqkYvuDzV2ulg2u09F9/7V4XPFKOD2lkOaYGckMhFG1lZahCu4pjkhWwD6h2Uap3HnQsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d206b4194860804cd2035d62a4a62dd174c4650676c658a943827a412db655aa","last_reissued_at":"2026-05-18T03:26:10.623987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:10.623987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.2386","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:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5/zXhf39qglkm4ish53U3FF9cbeVo9LFbKe+l0LEiXceojN7LMLAGxtdPTuiqeG5SCoCEzz9si4snmiWPUbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:32:37.273659Z"},"content_sha256":"7ce90ff1c9133274ef4630b52c3a1b7af7553c152ecc5aab5a005c65c89e2a69","schema_version":"1.0","event_id":"sha256:7ce90ff1c9133274ef4630b52c3a1b7af7553c152ecc5aab5a005c65c89e2a69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2IDLIGKIMCAEZUQDLVRKJJRN2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Precoding in Cooperative MIMO Cellular Networks with Limited Coordination Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chris T. K. Ng, Howard Huang","submitted_at":"2010-08-13T20:06:15Z","abstract_excerpt":"In a cooperative multiple-antenna downlink cellular network, maximization of a concave function of user rates is considered. A new linear precoding technique called soft interference nulling (SIN) is proposed, which performs at least as well as zero-forcing (ZF) beamforming. All base stations share channel state information, but each user's message is only routed to those that participate in the user's coordination cluster. SIN precoding is particularly useful when clusters of limited sizes overlap in the network, in which case traditional techniques such as dirty paper coding or ZF do not dir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2386","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:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lf5yx++dQ5AyW0ieDbjJ3BL0+SoSy0Z7R+/3w9dKsPZm9GyAghLfK9h9O8YIp9NjViEszNTsmNhAoIQYCVFgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:32:37.274005Z"},"content_sha256":"ef74a98e2f5607861b545715a688676ce988e9460690eddaeef3c8b3a6137b05","schema_version":"1.0","event_id":"sha256:ef74a98e2f5607861b545715a688676ce988e9460690eddaeef3c8b3a6137b05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IDLIGKIMCAEZUQDLVRKJJRN2F/bundle.json","state_url":"https://pith.science/pith/2IDLIGKIMCAEZUQDLVRKJJRN2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IDLIGKIMCAEZUQDLVRKJJRN2F/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-06-03T06:32:37Z","links":{"resolver":"https://pith.science/pith/2IDLIGKIMCAEZUQDLVRKJJRN2F","bundle":"https://pith.science/pith/2IDLIGKIMCAEZUQDLVRKJJRN2F/bundle.json","state":"https://pith.science/pith/2IDLIGKIMCAEZUQDLVRKJJRN2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IDLIGKIMCAEZUQDLVRKJJRN2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2IDLIGKIMCAEZUQDLVRKJJRN2F","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":"cb58a853a38c9396f9be3d1d3a5b8a3fae06a9ffe1b18c72080d5aa99b6304a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T20:06:15Z","title_canon_sha256":"f78acd4ac4b729f521bf4a03d1e437c15d14b1260dd42019fe0fc2b045e904d3"},"schema_version":"1.0","source":{"id":"1008.2386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2386","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2386v1","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2386","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"2IDLIGKIMCAE","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2IDLIGKIMCAEZUQD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2IDLIGKI","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:ef74a98e2f5607861b545715a688676ce988e9460690eddaeef3c8b3a6137b05","target":"graph","created_at":"2026-05-18T03:26:10Z","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 a cooperative multiple-antenna downlink cellular network, maximization of a concave function of user rates is considered. A new linear precoding technique called soft interference nulling (SIN) is proposed, which performs at least as well as zero-forcing (ZF) beamforming. All base stations share channel state information, but each user's message is only routed to those that participate in the user's coordination cluster. SIN precoding is particularly useful when clusters of limited sizes overlap in the network, in which case traditional techniques such as dirty paper coding or ZF do not dir","authors_text":"Chris T. K. Ng, Howard Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T20:06:15Z","title":"Linear Precoding in Cooperative MIMO Cellular Networks with Limited Coordination Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2386","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:7ce90ff1c9133274ef4630b52c3a1b7af7553c152ecc5aab5a005c65c89e2a69","target":"record","created_at":"2026-05-18T03:26:10Z","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":"cb58a853a38c9396f9be3d1d3a5b8a3fae06a9ffe1b18c72080d5aa99b6304a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-13T20:06:15Z","title_canon_sha256":"f78acd4ac4b729f521bf4a03d1e437c15d14b1260dd42019fe0fc2b045e904d3"},"schema_version":"1.0","source":{"id":"1008.2386","kind":"arxiv","version":1}},"canonical_sha256":"d206b4194860804cd2035d62a4a62dd174c4650676c658a943827a412db655aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d206b4194860804cd2035d62a4a62dd174c4650676c658a943827a412db655aa","first_computed_at":"2026-05-18T03:26:10.623987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:10.623987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AAMpBP8dBiYWpR2kqkYvuDzV2ulg2u09F9/7V4XPFKOD2lkOaYGckMhFG1lZahCu4pjkhWwD6h2Uap3HnQsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:10.624808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce90ff1c9133274ef4630b52c3a1b7af7553c152ecc5aab5a005c65c89e2a69","sha256:ef74a98e2f5607861b545715a688676ce988e9460690eddaeef3c8b3a6137b05"],"state_sha256":"4380f67296b56ff775051332c9c5f69e96b8611890bd270702b8775b9bf56a38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NaiOoF/qaDJ+j2Pt5TXxF7601o2MUq7lyJdBrsTvAFBa/Mkh184UPqpfmRrJhFPUgmNjYZf5gFrLabUKZ4/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:32:37.276181Z","bundle_sha256":"9597fb1d00f19ae9b828400b333701d5fd021c988bb854bff87e8fe4e658c36a"}}