{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GJGA5HSINKCLRFKXOU4HIY2KHA","short_pith_number":"pith:GJGA5HSI","schema_version":"1.0","canonical_sha256":"324c0e9e486a84b89557753874634a380cde2369b3c4fab87c185e4388aa12bf","source":{"kind":"arxiv","id":"1508.00169","version":1},"attestation_state":"computed","paper":{"title":"Capacity and Rate Regions of A Class of Broadcast Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elza Erkip, Yuanpeng Liu","submitted_at":"2015-08-01T21:43:41Z","abstract_excerpt":"In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast interference channel (DM-BIC), an achievable scheme based on message splitting, superposition and binning is proposed and a concise representation of the corresponding achievable rate region R is obtained. Two partial-order broadcast conditions interference-oblivious less noisy and interference-cognizant less noisy are defined, thereby extending the usual less n"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1508.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-01T21:43:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"58b2756c18a0373f7706b214d79fbfe8495430aceda00436979eeae35ed7fb2a","abstract_canon_sha256":"4a35d25cea87886908f434079222d1ccfb9bca457c0390bb6afe61472abf21b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:58.808929Z","signature_b64":"fngA87W7+R8My27AsxN4lb2LgBTmOvnk71JNE/iZvk2ouxv9XQlZHXdbenH0z4tjdpvodRoADPpYWrDL2hCrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"324c0e9e486a84b89557753874634a380cde2369b3c4fab87c185e4388aa12bf","last_reissued_at":"2026-05-18T01:35:58.808427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:58.808427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity and Rate Regions of A Class of Broadcast Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elza Erkip, Yuanpeng Liu","submitted_at":"2015-08-01T21:43:41Z","abstract_excerpt":"In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast interference channel (DM-BIC), an achievable scheme based on message splitting, superposition and binning is proposed and a concise representation of the corresponding achievable rate region R is obtained. Two partial-order broadcast conditions interference-oblivious less noisy and interference-cognizant less noisy are defined, thereby extending the usual less n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00169","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.00169","created_at":"2026-05-18T01:35:58.808499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00169v1","created_at":"2026-05-18T01:35:58.808499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00169","created_at":"2026-05-18T01:35:58.808499+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJGA5HSINKCL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJGA5HSINKCLRFKX","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJGA5HSI","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA","json":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA.json","graph_json":"https://pith.science/api/pith-number/GJGA5HSINKCLRFKXOU4HIY2KHA/graph.json","events_json":"https://pith.science/api/pith-number/GJGA5HSINKCLRFKXOU4HIY2KHA/events.json","paper":"https://pith.science/paper/GJGA5HSI"},"agent_actions":{"view_html":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA","download_json":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA.json","view_paper":"https://pith.science/paper/GJGA5HSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00169&json=true","fetch_graph":"https://pith.science/api/pith-number/GJGA5HSINKCLRFKXOU4HIY2KHA/graph.json","fetch_events":"https://pith.science/api/pith-number/GJGA5HSINKCLRFKXOU4HIY2KHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA/action/storage_attestation","attest_author":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA/action/author_attestation","sign_citation":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA/action/citation_signature","submit_replication":"https://pith.science/pith/GJGA5HSINKCLRFKXOU4HIY2KHA/action/replication_record"}},"created_at":"2026-05-18T01:35:58.808499+00:00","updated_at":"2026-05-18T01:35:58.808499+00:00"}