{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CGW5EC4BXIRCY4FDW3AVF5RNXF","short_pith_number":"pith:CGW5EC4B","schema_version":"1.0","canonical_sha256":"11add20b81ba222c70a3b6c152f62db96eac842a79c7d1228431c8d20034d884","source":{"kind":"arxiv","id":"1601.06686","version":4},"attestation_state":"computed","paper":{"title":"Upper Bounds on the Capacity of 2-Layer $N$-Relay Symmetric Gaussian Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Satyajit Thakor, Syed Abbas","submitted_at":"2016-01-25T17:29:37Z","abstract_excerpt":"The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on the capacity can be obtained by considering broadcast cut between the source and relays and multiple access cut between relays and the destination. Niesen and Diggavi derived an upper bound for Gaussian parallel $N$-relay network by considering all other possible cuts and showed an achievability scheme that can attain rates close to the upper bound in different channel gain regimes thus establishing approximate capaci"},"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":"1601.06686","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T17:29:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0faf9f0c962940cfe9dd88406beb42a390baccc476333775f18f260733efe734","abstract_canon_sha256":"4e7b14361758adb083b4da1be1aa4e9735ee7f0113f8109c2a57d1a0f615c9ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:17.655142Z","signature_b64":"VBGpOMLnxCNoDwRI+qG/Y/OPfw/xnXHGBRtRtlX+06fIWEUehvuLZP5+XAo9GwquZl0QuURBNSgLs9ZrzgJfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11add20b81ba222c70a3b6c152f62db96eac842a79c7d1228431c8d20034d884","last_reissued_at":"2026-05-18T01:17:17.654424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:17.654424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper Bounds on the Capacity of 2-Layer $N$-Relay Symmetric Gaussian Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Satyajit Thakor, Syed Abbas","submitted_at":"2016-01-25T17:29:37Z","abstract_excerpt":"The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on the capacity can be obtained by considering broadcast cut between the source and relays and multiple access cut between relays and the destination. Niesen and Diggavi derived an upper bound for Gaussian parallel $N$-relay network by considering all other possible cuts and showed an achievability scheme that can attain rates close to the upper bound in different channel gain regimes thus establishing approximate capaci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06686","kind":"arxiv","version":4},"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":"1601.06686","created_at":"2026-05-18T01:17:17.654546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06686v4","created_at":"2026-05-18T01:17:17.654546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06686","created_at":"2026-05-18T01:17:17.654546+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGW5EC4BXIRC","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGW5EC4BXIRCY4FD","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGW5EC4B","created_at":"2026-05-18T12:30:09.641336+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/CGW5EC4BXIRCY4FDW3AVF5RNXF","json":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF.json","graph_json":"https://pith.science/api/pith-number/CGW5EC4BXIRCY4FDW3AVF5RNXF/graph.json","events_json":"https://pith.science/api/pith-number/CGW5EC4BXIRCY4FDW3AVF5RNXF/events.json","paper":"https://pith.science/paper/CGW5EC4B"},"agent_actions":{"view_html":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF","download_json":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF.json","view_paper":"https://pith.science/paper/CGW5EC4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06686&json=true","fetch_graph":"https://pith.science/api/pith-number/CGW5EC4BXIRCY4FDW3AVF5RNXF/graph.json","fetch_events":"https://pith.science/api/pith-number/CGW5EC4BXIRCY4FDW3AVF5RNXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF/action/storage_attestation","attest_author":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF/action/author_attestation","sign_citation":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF/action/citation_signature","submit_replication":"https://pith.science/pith/CGW5EC4BXIRCY4FDW3AVF5RNXF/action/replication_record"}},"created_at":"2026-05-18T01:17:17.654546+00:00","updated_at":"2026-05-18T01:17:17.654546+00:00"}