{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FZYOTTFPZKJ7S4EVW3VPEYAGHS","short_pith_number":"pith:FZYOTTFP","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"},"canonical_sha256":"2e70e9ccafca93f97095b6eaf260063c85514e6bc17c86a7700b995716bf92e2","source":{"kind":"arxiv","id":"1004.2300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2300","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2300v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2300","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"FZYOTTFPZKJ7","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FZYOTTFPZKJ7S4EV","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FZYOTTFP","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FZYOTTFPZKJ7S4EVW3VPEYAGHS","target":"record","payload":{"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"},"canonical_sha256":"2e70e9ccafca93f97095b6eaf260063c85514e6bc17c86a7700b995716bf92e2","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"},"source_kind":"arxiv","source_id":"1004.2300","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNFAJpRxAIbIZpnjp20Hx67oTqPoslC+lisXjVKYIZBmcTR2a/bHvp5ST8dV7CwPQ4eYMKB+bSULuuzk7VVDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:01.952309Z"},"content_sha256":"2ca36239409da4ccbb4d433ee1405888b23da09646c4c63f0ebc4224d31cf538","schema_version":"1.0","event_id":"sha256:2ca36239409da4ccbb4d433ee1405888b23da09646c4c63f0ebc4224d31cf538"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FZYOTTFPZKJ7S4EVW3VPEYAGHS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHyU+vwZL8YLVGOZ3DiiwV898Fx8ecLp1eYMo79Bbgr8YAKXTPDseryfDkxWjzKCqhklRw8RHzDHo1yrbVedBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:01.952682Z"},"content_sha256":"525e5877e7e5e224b846608a9fad774e5b6d9ecfa4750fa279e72aa07d98db47","schema_version":"1.0","event_id":"sha256:525e5877e7e5e224b846608a9fad774e5b6d9ecfa4750fa279e72aa07d98db47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/bundle.json","state_url":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T10:00:01Z","links":{"resolver":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS","bundle":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/bundle.json","state":"https://pith.science/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZYOTTFPZKJ7S4EVW3VPEYAGHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FZYOTTFPZKJ7S4EVW3VPEYAGHS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"20956cef390ab3c82f8a49726e1cc3372bf33cbb01c77e25ac8266858909a2c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:23:00Z","title_canon_sha256":"9437d4ce3f3dfe37e896b4502fea461a0685d8347c1849513fd9f83c87cb6da6"},"schema_version":"1.0","source":{"id":"1004.2300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2300","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2300v1","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2300","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"FZYOTTFPZKJ7","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FZYOTTFPZKJ7S4EV","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FZYOTTFP","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:525e5877e7e5e224b846608a9fad774e5b6d9ecfa4750fa279e72aa07d98db47","target":"graph","created_at":"2026-05-18T02:24:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christopher M. Kellett, Lawrence Ong, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:23:00Z","title":"Capacity Theorems for the AWGN Multi-Way Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2300","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ca36239409da4ccbb4d433ee1405888b23da09646c4c63f0ebc4224d31cf538","target":"record","created_at":"2026-05-18T02:24:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"20956cef390ab3c82f8a49726e1cc3372bf33cbb01c77e25ac8266858909a2c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-14T01:23:00Z","title_canon_sha256":"9437d4ce3f3dfe37e896b4502fea461a0685d8347c1849513fd9f83c87cb6da6"},"schema_version":"1.0","source":{"id":"1004.2300","kind":"arxiv","version":1}},"canonical_sha256":"2e70e9ccafca93f97095b6eaf260063c85514e6bc17c86a7700b995716bf92e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e70e9ccafca93f97095b6eaf260063c85514e6bc17c86a7700b995716bf92e2","first_computed_at":"2026-05-18T02:24:16.675838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:16.675838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jXiH/uxYj0uYUIgCbqQBevn4kJ4zkmKpkTCHwrb6uew/dIxCw7w9c6fhf+62NHCzBG/fBFBehgAX2tsJwoB0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:16.676431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ca36239409da4ccbb4d433ee1405888b23da09646c4c63f0ebc4224d31cf538","sha256:525e5877e7e5e224b846608a9fad774e5b6d9ecfa4750fa279e72aa07d98db47"],"state_sha256":"d7244f1ac4ec4a7e15ac2db46fce50423772a5d61c2c861a270023b4df106b5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iD/O5GuHwQMJ7r13030m47s5SOyTPAwzRn44DMLMd2EwP8cgKIRTF7ad2v1IUw9zckKNvw2LQ5CK/LIrwnvACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:00:01.954614Z","bundle_sha256":"d8adf305c1668172449aa87dc75f06829d0400f439ed6f8626ac36dce4affb7c"}}