{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3OR4P52SWOVHH2YRLYEN35WSVV","short_pith_number":"pith:3OR4P52S","schema_version":"1.0","canonical_sha256":"dba3c7f752b3aa73eb115e08ddf6d2ad46f228955a445fc83e1167aa3e96c086","source":{"kind":"arxiv","id":"1310.1153","version":1},"attestation_state":"computed","paper":{"title":"The Gaussian Two-way Diamond Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Prathyusha V, Srikrishna Bhashyam","submitted_at":"2013-10-04T02:57:44Z","abstract_excerpt":"We consider two-way relaying in a Gaussian diamond channel, where two terminal nodes wish to exchange information using two relays. A simple baseline protocol is obtained by time-sharing between two one-way protocols. To improve upon the baseline performance, we propose two compute-and-forward (CF) protocols: Compute-and-forward Compound multiple access channel (CF-CMAC) and Compute-and-forward-Broadcast (CF-BC). These protocols mix the two flows through the two relays and achieve rates better than the simple time-sharing protocol. We derive an outer bound to the capacity region that is satisf"},"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":"1310.1153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-04T02:57:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ffbb1a4c9fce15622a4d3ae525da0a482f16adab179bd772393c47c70fb50da","abstract_canon_sha256":"19f1673a1d9f8d811c752a6fe81f057e9863a50887121309174bf58dba543bd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:23.390965Z","signature_b64":"pIgj9srYjSHM/S1DcDNqAGAgJbkr2u23uMvyOwEsAw6oXLCf2i8g30IFDTuxE60l9F00eCM/d8d/UtFOgtmUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dba3c7f752b3aa73eb115e08ddf6d2ad46f228955a445fc83e1167aa3e96c086","last_reissued_at":"2026-05-18T03:11:23.390225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:23.390225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Gaussian Two-way Diamond Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Prathyusha V, Srikrishna Bhashyam","submitted_at":"2013-10-04T02:57:44Z","abstract_excerpt":"We consider two-way relaying in a Gaussian diamond channel, where two terminal nodes wish to exchange information using two relays. A simple baseline protocol is obtained by time-sharing between two one-way protocols. To improve upon the baseline performance, we propose two compute-and-forward (CF) protocols: Compute-and-forward Compound multiple access channel (CF-CMAC) and Compute-and-forward-Broadcast (CF-BC). These protocols mix the two flows through the two relays and achieve rates better than the simple time-sharing protocol. We derive an outer bound to the capacity region that is satisf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1153","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":"1310.1153","created_at":"2026-05-18T03:11:23.390333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1153v1","created_at":"2026-05-18T03:11:23.390333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1153","created_at":"2026-05-18T03:11:23.390333+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OR4P52SWOVH","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OR4P52SWOVHH2YR","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OR4P52S","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/3OR4P52SWOVHH2YRLYEN35WSVV","json":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV.json","graph_json":"https://pith.science/api/pith-number/3OR4P52SWOVHH2YRLYEN35WSVV/graph.json","events_json":"https://pith.science/api/pith-number/3OR4P52SWOVHH2YRLYEN35WSVV/events.json","paper":"https://pith.science/paper/3OR4P52S"},"agent_actions":{"view_html":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV","download_json":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV.json","view_paper":"https://pith.science/paper/3OR4P52S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1153&json=true","fetch_graph":"https://pith.science/api/pith-number/3OR4P52SWOVHH2YRLYEN35WSVV/graph.json","fetch_events":"https://pith.science/api/pith-number/3OR4P52SWOVHH2YRLYEN35WSVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV/action/storage_attestation","attest_author":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV/action/author_attestation","sign_citation":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV/action/citation_signature","submit_replication":"https://pith.science/pith/3OR4P52SWOVHH2YRLYEN35WSVV/action/replication_record"}},"created_at":"2026-05-18T03:11:23.390333+00:00","updated_at":"2026-05-18T03:11:23.390333+00:00"}