{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:V3V4GUHS4GRVX5GFCF4TMFBYXJ","short_pith_number":"pith:V3V4GUHS","canonical_record":{"source":{"id":"cs/0610107","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-18T08:58:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"93b249007de16e99a2b719152428976aff7a08981ce248175b65089452fa1fca","abstract_canon_sha256":"09c95a866644ffa70f2e91253cb647324e897a1f0dfc16b2ba8ea958022064c3"},"schema_version":"1.0"},"canonical_sha256":"aeebc350f2e1a35bf4c51179361438ba7b40c0b0440e421be0ee144ca30e716d","source":{"kind":"arxiv","id":"cs/0610107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610107","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610107v1","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610107","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"V3V4GUHS4GRV","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_16","alias_value":"V3V4GUHS4GRVX5GF","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_8","alias_value":"V3V4GUHS","created_at":"2026-07-04T15:02:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:V3V4GUHS4GRVX5GFCF4TMFBYXJ","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0610107","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-18T08:58:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"93b249007de16e99a2b719152428976aff7a08981ce248175b65089452fa1fca","abstract_canon_sha256":"09c95a866644ffa70f2e91253cb647324e897a1f0dfc16b2ba8ea958022064c3"},"schema_version":"1.0"},"canonical_sha256":"aeebc350f2e1a35bf4c51179361438ba7b40c0b0440e421be0ee144ca30e716d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:53.674903Z","signature_b64":"TGIb8ygPuz0ydm8us6UfWiENVNokzvWaCUqIZwz7zE3HbMdSLNW/3JrNNAHZVLKMug1mbVt/MpojYRF2fV9uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeebc350f2e1a35bf4c51179361438ba7b40c0b0440e421be0ee144ca30e716d","last_reissued_at":"2026-07-04T15:02:53.674497Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:53.674497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0610107","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-07-04T15:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qiuTAFC1BdDWj6qr+QhwbN79XdNYA/GupY/Aln6QEE71y1t1t54wlUYawgrVdhoTCfTRzJsat41oqO1958yQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:03:49.136882Z"},"content_sha256":"93688130cc36613b4101a66bc487d9aeda373d7fb470e0e1a5cfcd967ec19747","schema_version":"1.0","event_id":"sha256:93688130cc36613b4101a66bc487d9aeda373d7fb470e0e1a5cfcd967ec19747"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:V3V4GUHS4GRVX5GFCF4TMFBYXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference Channels with Common Information","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hari Krishna Garg, Jinhua Jiang, Yan Xin","submitted_at":"2006-10-18T08:58:47Z","abstract_excerpt":"In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an achievable rate region for such a channel by exploiting a random coding strategy, namely cascaded superposition coding. We reveal that the derived achievable rate region generalizes some important existing results for the interference channels with or without common information. Furthermore, we specialize to a class of deterministic interference channels with c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610107","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0610107/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5TEF8mbmoItj9Thewvmje0fYREO3mDkarCkA4VXRAX3CJO6dvrYzCZ/ew2MNffaOcSLNbecD4ME/X51n48hBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:03:49.137250Z"},"content_sha256":"19293b2e3e491d0bcb1857a18e84237c0d57f9a06f274d7993f1284892c1b4d7","schema_version":"1.0","event_id":"sha256:19293b2e3e491d0bcb1857a18e84237c0d57f9a06f274d7993f1284892c1b4d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3V4GUHS4GRVX5GFCF4TMFBYXJ/bundle.json","state_url":"https://pith.science/pith/V3V4GUHS4GRVX5GFCF4TMFBYXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3V4GUHS4GRVX5GFCF4TMFBYXJ/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-07-05T08:03:49Z","links":{"resolver":"https://pith.science/pith/V3V4GUHS4GRVX5GFCF4TMFBYXJ","bundle":"https://pith.science/pith/V3V4GUHS4GRVX5GFCF4TMFBYXJ/bundle.json","state":"https://pith.science/pith/V3V4GUHS4GRVX5GFCF4TMFBYXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3V4GUHS4GRVX5GFCF4TMFBYXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:V3V4GUHS4GRVX5GFCF4TMFBYXJ","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":"09c95a866644ffa70f2e91253cb647324e897a1f0dfc16b2ba8ea958022064c3","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-18T08:58:47Z","title_canon_sha256":"93b249007de16e99a2b719152428976aff7a08981ce248175b65089452fa1fca"},"schema_version":"1.0","source":{"id":"cs/0610107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610107","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610107v1","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610107","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"V3V4GUHS4GRV","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_16","alias_value":"V3V4GUHS4GRVX5GF","created_at":"2026-07-04T15:02:53Z"},{"alias_kind":"pith_short_8","alias_value":"V3V4GUHS","created_at":"2026-07-04T15:02:53Z"}],"graph_snapshots":[{"event_id":"sha256:19293b2e3e491d0bcb1857a18e84237c0d57f9a06f274d7993f1284892c1b4d7","target":"graph","created_at":"2026-07-04T15:02:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0610107/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an achievable rate region for such a channel by exploiting a random coding strategy, namely cascaded superposition coding. We reveal that the derived achievable rate region generalizes some important existing results for the interference channels with or without common information. Furthermore, we specialize to a class of deterministic interference channels with c","authors_text":"Hari Krishna Garg, Jinhua Jiang, Yan Xin","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2006-10-18T08:58:47Z","title":"Interference Channels with Common Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610107","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:93688130cc36613b4101a66bc487d9aeda373d7fb470e0e1a5cfcd967ec19747","target":"record","created_at":"2026-07-04T15:02:53Z","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":"09c95a866644ffa70f2e91253cb647324e897a1f0dfc16b2ba8ea958022064c3","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-18T08:58:47Z","title_canon_sha256":"93b249007de16e99a2b719152428976aff7a08981ce248175b65089452fa1fca"},"schema_version":"1.0","source":{"id":"cs/0610107","kind":"arxiv","version":1}},"canonical_sha256":"aeebc350f2e1a35bf4c51179361438ba7b40c0b0440e421be0ee144ca30e716d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeebc350f2e1a35bf4c51179361438ba7b40c0b0440e421be0ee144ca30e716d","first_computed_at":"2026-07-04T15:02:53.674497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:53.674497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TGIb8ygPuz0ydm8us6UfWiENVNokzvWaCUqIZwz7zE3HbMdSLNW/3JrNNAHZVLKMug1mbVt/MpojYRF2fV9uDA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:53.674903Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0610107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93688130cc36613b4101a66bc487d9aeda373d7fb470e0e1a5cfcd967ec19747","sha256:19293b2e3e491d0bcb1857a18e84237c0d57f9a06f274d7993f1284892c1b4d7"],"state_sha256":"e1ce5ec7635731ab6f3068b57099884542d1cca82e190a018e9bb91e575b25a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P01BMeT9LVhh5X0v3T+y3hXVSbWxvkYuEYBQoP7HdppgXnP6/Zhz9YRFVLgRSBnIS+hPTZfmwSZfWSpFmjXrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:03:49.139097Z","bundle_sha256":"afef4258bba40d31d86846f2baf0ed76cdc058215afb75326267ab26169d5415"}}