{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S7RZTZ6VDI2LHVPZEXMPF56QV6","short_pith_number":"pith:S7RZTZ6V","schema_version":"1.0","canonical_sha256":"97e399e7d51a34b3d5f925d8f2f7d0afb0ba4e95823a0bedba80240bb745eb12","source":{"kind":"arxiv","id":"1508.00443","version":1},"attestation_state":"computed","paper":{"title":"Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jing Li, Young-Han Kim","submitted_at":"2015-08-03T15:12:47Z","abstract_excerpt":"The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate through degraded sets of message parts, achieves the cutset upper bound within $(1/2)\\log N$ bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode--forward yet has an unbounded gap from the cutset bound for $L \\ge 2$ destinations. When specialized to ind"},"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.00443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-03T15:12:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6481a2d21e616f1dd6095909150887b8f43737084745884e0e4166b389962e19","abstract_canon_sha256":"2b7dcaf07e94cd267ee423cbd566eb5ffd60ed6720e20dec46e51a0ac6c8c2f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:58.118479Z","signature_b64":"aVRp5cYdhJBjy/hAFX7/wLe/VD15RyDkX8k+o9AHAk2zQjDIgYyrtZHnBrJ0VWkWpWOBYpD/BWkKEL/wUS9qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e399e7d51a34b3d5f925d8f2f7d0afb0ba4e95823a0bedba80240bb745eb12","last_reissued_at":"2026-05-18T01:35:58.117885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:58.117885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jing Li, Young-Han Kim","submitted_at":"2015-08-03T15:12:47Z","abstract_excerpt":"The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate through degraded sets of message parts, achieves the cutset upper bound within $(1/2)\\log N$ bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode--forward yet has an unbounded gap from the cutset bound for $L \\ge 2$ destinations. When specialized to ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00443","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.00443","created_at":"2026-05-18T01:35:58.118002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00443v1","created_at":"2026-05-18T01:35:58.118002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00443","created_at":"2026-05-18T01:35:58.118002+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7RZTZ6VDI2L","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7RZTZ6VDI2LHVPZ","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7RZTZ6V","created_at":"2026-05-18T12:29:39.896362+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/S7RZTZ6VDI2LHVPZEXMPF56QV6","json":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6.json","graph_json":"https://pith.science/api/pith-number/S7RZTZ6VDI2LHVPZEXMPF56QV6/graph.json","events_json":"https://pith.science/api/pith-number/S7RZTZ6VDI2LHVPZEXMPF56QV6/events.json","paper":"https://pith.science/paper/S7RZTZ6V"},"agent_actions":{"view_html":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6","download_json":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6.json","view_paper":"https://pith.science/paper/S7RZTZ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00443&json=true","fetch_graph":"https://pith.science/api/pith-number/S7RZTZ6VDI2LHVPZEXMPF56QV6/graph.json","fetch_events":"https://pith.science/api/pith-number/S7RZTZ6VDI2LHVPZEXMPF56QV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6/action/storage_attestation","attest_author":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6/action/author_attestation","sign_citation":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6/action/citation_signature","submit_replication":"https://pith.science/pith/S7RZTZ6VDI2LHVPZEXMPF56QV6/action/replication_record"}},"created_at":"2026-05-18T01:35:58.118002+00:00","updated_at":"2026-05-18T01:35:58.118002+00:00"}