{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:E7UBYPMUGQ5EOU3KEZCSHJ4XIT","short_pith_number":"pith:E7UBYPMU","canonical_record":{"source":{"id":"1207.1986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T08:38:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"17ab48ab1216a9d9eadaae954b2584776911bcc33b872ea9d83f3e8de4ede561","abstract_canon_sha256":"fe405c83ff9478bde18a6224fb0ee429b3af38ada8cf9a23fe6bf099636e38a4"},"schema_version":"1.0"},"canonical_sha256":"27e81c3d94343a47536a264523a79744fd8e6080a5f7998d800338c9a0e05b54","source":{"kind":"arxiv","id":"1207.1986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1986","created_at":"2026-05-18T03:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1986v1","created_at":"2026-05-18T03:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1986","created_at":"2026-05-18T03:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"E7UBYPMUGQ5E","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E7UBYPMUGQ5EOU3K","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E7UBYPMU","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:E7UBYPMUGQ5EOU3KEZCSHJ4XIT","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T08:38:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"17ab48ab1216a9d9eadaae954b2584776911bcc33b872ea9d83f3e8de4ede561","abstract_canon_sha256":"fe405c83ff9478bde18a6224fb0ee429b3af38ada8cf9a23fe6bf099636e38a4"},"schema_version":"1.0"},"canonical_sha256":"27e81c3d94343a47536a264523a79744fd8e6080a5f7998d800338c9a0e05b54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:26.383933Z","signature_b64":"I1kXBllXeGl0klzqUeJ2SmgcWJCRD/6K/DZwYRmHiguleVYwzK6N/O4xFaGiHZnmHKjvykglHt2l+WrO9AoABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27e81c3d94343a47536a264523a79744fd8e6080a5f7998d800338c9a0e05b54","last_reissued_at":"2026-05-18T03:51:26.383103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:26.383103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1986","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:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KG+HiIo5IEqe41rAlyRMY/eg1ebMoUTlUBw6CU+Fi67JjFeps+tvVlaMdCgyaOR93A1AlF3GKXKNUafiSy3xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:31.384890Z"},"content_sha256":"d700d856cfe0bfea0a993360bff036069bbd46714c201304445d63e374258b8e","schema_version":"1.0","event_id":"sha256:d700d856cfe0bfea0a993360bff036069bbd46714c201304445d63e374258b8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:E7UBYPMUGQ5EOU3KEZCSHJ4XIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity Region of Two-User Linear Deterministic Interference Channel and Its Application to Multi-Session Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tracey Ho, Xiaoli Xu, Yong Liang Guan, Yong Zeng","submitted_at":"2012-07-09T08:38:03Z","abstract_excerpt":"In this paper, we study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized in terms of the rank of the channel matrices. It is shown that \\emph{linear precoding} with Han-Kobayashi type of rate-splitting, i.e., splitting the information-bearing symbols of each user into common and private parts, is sufficient to achieve all the rate pairs in the derived capacity region. The capacity result is applied to obtain an achievable rate re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1986","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:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agFLrDngQDlDKzsGbjPY5L2m48fNMJC89uoKsMRlEvcnb3VwHvcDVJEEfUYh62Ue3mVaFMoU3qVQC/41L+cmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:31.385232Z"},"content_sha256":"f597256a3b88d858935c568f59492df577e8c74494c05710c830c76795eb3a02","schema_version":"1.0","event_id":"sha256:f597256a3b88d858935c568f59492df577e8c74494c05710c830c76795eb3a02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7UBYPMUGQ5EOU3KEZCSHJ4XIT/bundle.json","state_url":"https://pith.science/pith/E7UBYPMUGQ5EOU3KEZCSHJ4XIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7UBYPMUGQ5EOU3KEZCSHJ4XIT/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-02T22:57:31Z","links":{"resolver":"https://pith.science/pith/E7UBYPMUGQ5EOU3KEZCSHJ4XIT","bundle":"https://pith.science/pith/E7UBYPMUGQ5EOU3KEZCSHJ4XIT/bundle.json","state":"https://pith.science/pith/E7UBYPMUGQ5EOU3KEZCSHJ4XIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7UBYPMUGQ5EOU3KEZCSHJ4XIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E7UBYPMUGQ5EOU3KEZCSHJ4XIT","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":"fe405c83ff9478bde18a6224fb0ee429b3af38ada8cf9a23fe6bf099636e38a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T08:38:03Z","title_canon_sha256":"17ab48ab1216a9d9eadaae954b2584776911bcc33b872ea9d83f3e8de4ede561"},"schema_version":"1.0","source":{"id":"1207.1986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1986","created_at":"2026-05-18T03:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1986v1","created_at":"2026-05-18T03:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1986","created_at":"2026-05-18T03:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"E7UBYPMUGQ5E","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E7UBYPMUGQ5EOU3K","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E7UBYPMU","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:f597256a3b88d858935c568f59492df577e8c74494c05710c830c76795eb3a02","target":"graph","created_at":"2026-05-18T03:51:26Z","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 study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized in terms of the rank of the channel matrices. It is shown that \\emph{linear precoding} with Han-Kobayashi type of rate-splitting, i.e., splitting the information-bearing symbols of each user into common and private parts, is sufficient to achieve all the rate pairs in the derived capacity region. The capacity result is applied to obtain an achievable rate re","authors_text":"Tracey Ho, Xiaoli Xu, Yong Liang Guan, Yong Zeng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T08:38:03Z","title":"On the Capacity Region of Two-User Linear Deterministic Interference Channel and Its Application to Multi-Session Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1986","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:d700d856cfe0bfea0a993360bff036069bbd46714c201304445d63e374258b8e","target":"record","created_at":"2026-05-18T03:51:26Z","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":"fe405c83ff9478bde18a6224fb0ee429b3af38ada8cf9a23fe6bf099636e38a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-09T08:38:03Z","title_canon_sha256":"17ab48ab1216a9d9eadaae954b2584776911bcc33b872ea9d83f3e8de4ede561"},"schema_version":"1.0","source":{"id":"1207.1986","kind":"arxiv","version":1}},"canonical_sha256":"27e81c3d94343a47536a264523a79744fd8e6080a5f7998d800338c9a0e05b54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27e81c3d94343a47536a264523a79744fd8e6080a5f7998d800338c9a0e05b54","first_computed_at":"2026-05-18T03:51:26.383103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:26.383103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I1kXBllXeGl0klzqUeJ2SmgcWJCRD/6K/DZwYRmHiguleVYwzK6N/O4xFaGiHZnmHKjvykglHt2l+WrO9AoABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:26.383933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d700d856cfe0bfea0a993360bff036069bbd46714c201304445d63e374258b8e","sha256:f597256a3b88d858935c568f59492df577e8c74494c05710c830c76795eb3a02"],"state_sha256":"09efeaf3b40cc9ca9c1b4c25f2636d35820395b1eda16d925427e97f26857fde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/q29c3NgPVbjwI/6YcdXNnw7gRtdRVl89FTPfTgM0vXmCrDGUc5p7ghsgok73ON+qP0tQ8poYo8z/WtmydjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:57:31.387200Z","bundle_sha256":"7af07cd901375f6d350a75ce720831bb2d8853310582ed5073974dd7411067cb"}}