{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:KUK7ABKGRJQ4WJPYM5KIGOQEDC","short_pith_number":"pith:KUK7ABKG","canonical_record":{"source":{"id":"0902.4106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-24T09:54:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"23de90eaffa60ea8a4fcb3227982b955cf27c7617ed63be563e318adb47ff78b","abstract_canon_sha256":"79ff5bdeb7c2e32fe1d8ee72f337a77ac3a8a22102eafab7b75712ef5c6fdb08"},"schema_version":"1.0"},"canonical_sha256":"5515f005468a61cb25f86754833a041885db32faa89d9e1c7b1d9ab1ac7ca65c","source":{"kind":"arxiv","id":"0902.4106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.4106","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"0902.4106v1","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4106","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"KUK7ABKGRJQ4","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KUK7ABKGRJQ4WJPY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KUK7ABKG","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:KUK7ABKGRJQ4WJPYM5KIGOQEDC","target":"record","payload":{"canonical_record":{"source":{"id":"0902.4106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-24T09:54:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"23de90eaffa60ea8a4fcb3227982b955cf27c7617ed63be563e318adb47ff78b","abstract_canon_sha256":"79ff5bdeb7c2e32fe1d8ee72f337a77ac3a8a22102eafab7b75712ef5c6fdb08"},"schema_version":"1.0"},"canonical_sha256":"5515f005468a61cb25f86754833a041885db32faa89d9e1c7b1d9ab1ac7ca65c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:22.436668Z","signature_b64":"nP5LhU91eO/nx1yHKMJ6mY+IdNqDVdcvAJhIH4yaAZXA5vs6yWNDXrtGdlPwZsUBGjA3dsY7cazWSUYGPz4bBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5515f005468a61cb25f86754833a041885db32faa89d9e1c7b1d9ab1ac7ca65c","last_reissued_at":"2026-05-18T04:19:22.436286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:22.436286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0902.4106","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-18T04:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3N7HerSsa17Wfnp8MGDu4Rm8Z1EIZktwl+XVltj6tQKu7dLOLR79WA5fH2gYv6Fv9aQHjF6Xy9YoYXgQ12aRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:35:53.030892Z"},"content_sha256":"89a8a2cfe7b89da20b964953fa70b70b86249490ac847dc9f53a6222c56871bf","schema_version":"1.0","event_id":"sha256:89a8a2cfe7b89da20b964953fa70b70b86249490ac847dc9f53a6222c56871bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:KUK7ABKGRJQ4WJPYM5KIGOQEDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Filter and nested-lattice code design for fading MIMO channels with side-information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung-Pi Lee, Hsuan-Jung Su, Pin-Hsun Lin, Shih-Chun Lin","submitted_at":"2009-02-24T09:54:57Z","abstract_excerpt":"Linear-assignment Gel'fand-Pinsker coding (LA-GPC) is a coding technique for channels with interference known only at the transmitter, where the known interference is treated as side-information (SI). As a special case of LA-GPC, dirty paper coding has been shown to be able to achieve the optimal interference-free rate for interference channels with perfect channel state information at the transmitter (CSIT). In the cases where only the channel distribution information at the transmitter (CDIT) is available, LA-GPC also has good (sometimes optimal) performance in a variety of fast and slow fad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4106","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-18T04:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4I4+wzILsHhto/mJ+DT8AIdNGYMxl8uMbMjVrh99PPeKHOdXzR7fqN/TDUmRsSWmZmn63cHgQZZeNmvdHUvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:35:53.031546Z"},"content_sha256":"0108fd5559d85246f7d660664d5a2e3848afada64e39a522eab088d485cebebf","schema_version":"1.0","event_id":"sha256:0108fd5559d85246f7d660664d5a2e3848afada64e39a522eab088d485cebebf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUK7ABKGRJQ4WJPYM5KIGOQEDC/bundle.json","state_url":"https://pith.science/pith/KUK7ABKGRJQ4WJPYM5KIGOQEDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUK7ABKGRJQ4WJPYM5KIGOQEDC/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-31T01:35:53Z","links":{"resolver":"https://pith.science/pith/KUK7ABKGRJQ4WJPYM5KIGOQEDC","bundle":"https://pith.science/pith/KUK7ABKGRJQ4WJPYM5KIGOQEDC/bundle.json","state":"https://pith.science/pith/KUK7ABKGRJQ4WJPYM5KIGOQEDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUK7ABKGRJQ4WJPYM5KIGOQEDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:KUK7ABKGRJQ4WJPYM5KIGOQEDC","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":"79ff5bdeb7c2e32fe1d8ee72f337a77ac3a8a22102eafab7b75712ef5c6fdb08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-24T09:54:57Z","title_canon_sha256":"23de90eaffa60ea8a4fcb3227982b955cf27c7617ed63be563e318adb47ff78b"},"schema_version":"1.0","source":{"id":"0902.4106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.4106","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"0902.4106v1","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4106","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"KUK7ABKGRJQ4","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KUK7ABKGRJQ4WJPY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KUK7ABKG","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:0108fd5559d85246f7d660664d5a2e3848afada64e39a522eab088d485cebebf","target":"graph","created_at":"2026-05-18T04:19:22Z","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":"Linear-assignment Gel'fand-Pinsker coding (LA-GPC) is a coding technique for channels with interference known only at the transmitter, where the known interference is treated as side-information (SI). As a special case of LA-GPC, dirty paper coding has been shown to be able to achieve the optimal interference-free rate for interference channels with perfect channel state information at the transmitter (CSIT). In the cases where only the channel distribution information at the transmitter (CDIT) is available, LA-GPC also has good (sometimes optimal) performance in a variety of fast and slow fad","authors_text":"Chung-Pi Lee, Hsuan-Jung Su, Pin-Hsun Lin, Shih-Chun Lin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-24T09:54:57Z","title":"Filter and nested-lattice code design for fading MIMO channels with side-information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4106","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:89a8a2cfe7b89da20b964953fa70b70b86249490ac847dc9f53a6222c56871bf","target":"record","created_at":"2026-05-18T04:19:22Z","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":"79ff5bdeb7c2e32fe1d8ee72f337a77ac3a8a22102eafab7b75712ef5c6fdb08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-24T09:54:57Z","title_canon_sha256":"23de90eaffa60ea8a4fcb3227982b955cf27c7617ed63be563e318adb47ff78b"},"schema_version":"1.0","source":{"id":"0902.4106","kind":"arxiv","version":1}},"canonical_sha256":"5515f005468a61cb25f86754833a041885db32faa89d9e1c7b1d9ab1ac7ca65c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5515f005468a61cb25f86754833a041885db32faa89d9e1c7b1d9ab1ac7ca65c","first_computed_at":"2026-05-18T04:19:22.436286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:22.436286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nP5LhU91eO/nx1yHKMJ6mY+IdNqDVdcvAJhIH4yaAZXA5vs6yWNDXrtGdlPwZsUBGjA3dsY7cazWSUYGPz4bBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:22.436668Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.4106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89a8a2cfe7b89da20b964953fa70b70b86249490ac847dc9f53a6222c56871bf","sha256:0108fd5559d85246f7d660664d5a2e3848afada64e39a522eab088d485cebebf"],"state_sha256":"762ff9380a9417ac85b703582a94f19a88039658850f6a7aa5bb4d7ae36f9a2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kl0KNn3Zr7SOY0lZXW43jaCqk0/7xqXX0QvheGW7YOqhozjPoStzNqrNzuejmh+SdozL/U8es3eqRndPUuiDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:35:53.034539Z","bundle_sha256":"a51cbe3b4b07d963a724742ef9bddc665163084581472908e8026e361989d9bb"}}