{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:34UUMSF7KAXM3DHWG3JCJ42ZA2","short_pith_number":"pith:34UUMSF7","schema_version":"1.0","canonical_sha256":"df294648bf502ecd8cf636d224f35906a083aa0f29306e9ec25c4056429eabd9","source":{"kind":"arxiv","id":"1303.1095","version":1},"attestation_state":"computed","paper":{"title":"A New Achievable Scheme for Interference Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byungjun Kang, Changho Suh, Sae-Young Chung, Si-Hyeon Lee","submitted_at":"2013-03-05T16:45:22Z","abstract_excerpt":"We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding schemes. We apply our achievability to two cases. First, we characterize the capacity region of a class of discrete memoryless interference relay channels. This class naturally generalizes the injective deterministic discrete memoryless interference channel by El Gamal and Costa and the deterministic discrete memoryless relay channel with orthogonal receive"},"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":"1303.1095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-05T16:45:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df8f5e18509ef537b566c0d4d5616b2adbc8341d8a227caecba702babdd23de4","abstract_canon_sha256":"007809f1725efad51323627146923456934931beb2a4cf065f506c10a308f873"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:45.576711Z","signature_b64":"GcPcMb9wZCxkKV/774I8v9SBPxpNy/TEwT+iCgpufhBi4LDH3mayzH6X3L+RKEFYiaRIokA85BOKkGtMIwtrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df294648bf502ecd8cf636d224f35906a083aa0f29306e9ec25c4056429eabd9","last_reissued_at":"2026-05-18T03:31:45.575935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:45.575935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Achievable Scheme for Interference Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byungjun Kang, Changho Suh, Sae-Young Chung, Si-Hyeon Lee","submitted_at":"2013-03-05T16:45:22Z","abstract_excerpt":"We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding schemes. We apply our achievability to two cases. First, we characterize the capacity region of a class of discrete memoryless interference relay channels. This class naturally generalizes the injective deterministic discrete memoryless interference channel by El Gamal and Costa and the deterministic discrete memoryless relay channel with orthogonal receive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1095","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":"1303.1095","created_at":"2026-05-18T03:31:45.576062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1095v1","created_at":"2026-05-18T03:31:45.576062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1095","created_at":"2026-05-18T03:31:45.576062+00:00"},{"alias_kind":"pith_short_12","alias_value":"34UUMSF7KAXM","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"34UUMSF7KAXM3DHW","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"34UUMSF7","created_at":"2026-05-18T12:27:32.513160+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/34UUMSF7KAXM3DHWG3JCJ42ZA2","json":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2.json","graph_json":"https://pith.science/api/pith-number/34UUMSF7KAXM3DHWG3JCJ42ZA2/graph.json","events_json":"https://pith.science/api/pith-number/34UUMSF7KAXM3DHWG3JCJ42ZA2/events.json","paper":"https://pith.science/paper/34UUMSF7"},"agent_actions":{"view_html":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2","download_json":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2.json","view_paper":"https://pith.science/paper/34UUMSF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1095&json=true","fetch_graph":"https://pith.science/api/pith-number/34UUMSF7KAXM3DHWG3JCJ42ZA2/graph.json","fetch_events":"https://pith.science/api/pith-number/34UUMSF7KAXM3DHWG3JCJ42ZA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2/action/storage_attestation","attest_author":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2/action/author_attestation","sign_citation":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2/action/citation_signature","submit_replication":"https://pith.science/pith/34UUMSF7KAXM3DHWG3JCJ42ZA2/action/replication_record"}},"created_at":"2026-05-18T03:31:45.576062+00:00","updated_at":"2026-05-18T03:31:45.576062+00:00"}