{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P6K2TCW3OIU3IOCGXDIOB6YQ4F","short_pith_number":"pith:P6K2TCW3","schema_version":"1.0","canonical_sha256":"7f95a98adb7229b43846b8d0e0fb10e17055652804a69123af0c8dd8d7829678","source":{"kind":"arxiv","id":"1605.07559","version":1},"attestation_state":"computed","paper":{"title":"On the Capacity Regions of Single-Channel and Multi-Channel Full-Duplex Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gil Zussman, Jelena Mara\\v{s}evi\\'c","submitted_at":"2016-05-24T17:58:51Z","abstract_excerpt":"We study the achievable capacity regions of full-duplex links in the single- and multi-channel cases (in the latter case, the channels are assumed to be orthogonal -- e.g., OFDM). We present analytical results that characterize the uplink and downlink capacity region and efficient algorithms for computing rate pairs at the region's boundary. We also provide near-optimal and heuristic algorithms that \"convexify\" the capacity region when it is not convex. The convexified region corresponds to a combination of a few full-duplex rates (i.e., to time sharing between different operation modes). The "},"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":"1605.07559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-24T17:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"98fd4eebba409b6a61323c9c46063029ce40d04cde9e03b3bc4321b3899c19d8","abstract_canon_sha256":"96b9bd56481598e04f73c122f56c30ed1d18d54670ba3cf6cd14755bdf26f8e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:45.741028Z","signature_b64":"hBdB2YiNKz830+eufZcB1MDEnLqvjzZtL6hQM+Qpk8mGmM68sGnFMFr4aUAI1vkh/Y5ubT1JQIlogu2KDpvXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f95a98adb7229b43846b8d0e0fb10e17055652804a69123af0c8dd8d7829678","last_reissued_at":"2026-05-18T01:13:45.740402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:45.740402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity Regions of Single-Channel and Multi-Channel Full-Duplex Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gil Zussman, Jelena Mara\\v{s}evi\\'c","submitted_at":"2016-05-24T17:58:51Z","abstract_excerpt":"We study the achievable capacity regions of full-duplex links in the single- and multi-channel cases (in the latter case, the channels are assumed to be orthogonal -- e.g., OFDM). We present analytical results that characterize the uplink and downlink capacity region and efficient algorithms for computing rate pairs at the region's boundary. We also provide near-optimal and heuristic algorithms that \"convexify\" the capacity region when it is not convex. The convexified region corresponds to a combination of a few full-duplex rates (i.e., to time sharing between different operation modes). The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07559","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":"1605.07559","created_at":"2026-05-18T01:13:45.740485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07559v1","created_at":"2026-05-18T01:13:45.740485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07559","created_at":"2026-05-18T01:13:45.740485+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6K2TCW3OIU3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6K2TCW3OIU3IOCG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6K2TCW3","created_at":"2026-05-18T12:30:36.002864+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/P6K2TCW3OIU3IOCGXDIOB6YQ4F","json":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F.json","graph_json":"https://pith.science/api/pith-number/P6K2TCW3OIU3IOCGXDIOB6YQ4F/graph.json","events_json":"https://pith.science/api/pith-number/P6K2TCW3OIU3IOCGXDIOB6YQ4F/events.json","paper":"https://pith.science/paper/P6K2TCW3"},"agent_actions":{"view_html":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F","download_json":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F.json","view_paper":"https://pith.science/paper/P6K2TCW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07559&json=true","fetch_graph":"https://pith.science/api/pith-number/P6K2TCW3OIU3IOCGXDIOB6YQ4F/graph.json","fetch_events":"https://pith.science/api/pith-number/P6K2TCW3OIU3IOCGXDIOB6YQ4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F/action/storage_attestation","attest_author":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F/action/author_attestation","sign_citation":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F/action/citation_signature","submit_replication":"https://pith.science/pith/P6K2TCW3OIU3IOCGXDIOB6YQ4F/action/replication_record"}},"created_at":"2026-05-18T01:13:45.740485+00:00","updated_at":"2026-05-18T01:13:45.740485+00:00"}