{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FZYOTTFPZKJ7S4EVW3VPEYAGHS","short_pith_number":"pith:FZYOTTFP","schema_version":"1.0","canonical_sha256":"2e70e9ccafca93f97095b6eaf260063c85514e6bc17c86a7700b995716bf92e2","source":{"kind":"arxiv","id":"1004.2300","version":1},"attestation_state":"computed","paper":{"title":"Capacity Theorems for the AWGN Multi-Way Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher M. Kellett, Lawrence Ong, Sarah J. Johnson","submitted_at":"2010-04-14T01:23:00Z","abstract_excerpt":"The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and compress-forward are shown to be bounded away from the cut-set upper bound at high signal-to-noise ratios (SNR). It is known that the gap between the compress-forward rate and the capacity upper bound is a constant at high SNR, and that between the complete-decode-forward rate and the upper bound increases with SNR at high SNR. In this paper, a functional-decode-forward co"},"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":"1004.2300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:23:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9437d4ce3f3dfe37e896b4502fea461a0685d8347c1849513fd9f83c87cb6da6","abstract_canon_sha256":"20956cef390ab3c82f8a49726e1cc3372bf33cbb01c77e25ac8266858909a2c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:16.676431Z","signature_b64":"jXiH/uxYj0uYUIgCbqQBevn4kJ4zkmKpkTCHwrb6uew/dIxCw7w9c6fhf+62NHCzBG/fBFBehgAX2tsJwoB0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e70e9ccafca93f97095b6eaf260063c85514e6bc17c86a7700b995716bf92e2","last_reissued_at":"2026-05-18T02:24:16.675838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:16.675838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity Theorems for the AWGN Multi-Way Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher M. Kellett, Lawrence Ong, Sarah J. Johnson","submitted_at":"2010-04-14T01:23:00Z","abstract_excerpt":"The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and compress-forward are shown to be bounded away from the cut-set upper bound at high signal-to-noise ratios (SNR). It is known that the gap between the compress-forward rate and the capacity upper bound is a constant at high SNR, and that between the complete-decode-forward rate and the upper bound increases with SNR at high SNR. In this paper, a functional-decode-forward co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2300","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":"1004.2300","created_at":"2026-05-18T02:24:16.675936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2300v1","created_at":"2026-05-18T02:24:16.675936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2300","created_at":"2026-05-18T02:24:16.675936+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZYOTTFPZKJ7","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZYOTTFPZKJ7S4EV","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZYOTTFP","created_at":"2026-05-18T12:26:07.630475+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/FZYOTTFPZKJ7S4EVW3VPEYAGHS","json":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS.json","graph_json":"https://pith.science/api/pith-number/FZYOTTFPZKJ7S4EVW3VPEYAGHS/graph.json","events_json":"https://pith.science/api/pith-number/FZYOTTFPZKJ7S4EVW3VPEYAGHS/events.json","paper":"https://pith.science/paper/FZYOTTFP"},"agent_actions":{"view_html":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS","download_json":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS.json","view_paper":"https://pith.science/paper/FZYOTTFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2300&json=true","fetch_graph":"https://pith.science/api/pith-number/FZYOTTFPZKJ7S4EVW3VPEYAGHS/graph.json","fetch_events":"https://pith.science/api/pith-number/FZYOTTFPZKJ7S4EVW3VPEYAGHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/action/storage_attestation","attest_author":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/action/author_attestation","sign_citation":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/action/citation_signature","submit_replication":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/action/replication_record"}},"created_at":"2026-05-18T02:24:16.675936+00:00","updated_at":"2026-05-18T02:24:16.675936+00:00"}