{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GSN5WVBKLRAKFT5ZKE2DCSSYUV","short_pith_number":"pith:GSN5WVBK","canonical_record":{"source":{"id":"1501.01957","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-08T20:59:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b77850421c2df46447519cc4c823b7a53aac509efc0b5bfb89bca82a8ff9e3b","abstract_canon_sha256":"d352771b960f6c07b58ff604bba6b52f4a99574c717ed4f5d4b1d0109f8dfd2b"},"schema_version":"1.0"},"canonical_sha256":"349bdb542a5c40a2cfb95134314a58a561db4bfa3bf2c9f5977d580daee94b7f","source":{"kind":"arxiv","id":"1501.01957","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01957","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01957v3","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01957","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"GSN5WVBKLRAK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GSN5WVBKLRAKFT5Z","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GSN5WVBK","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GSN5WVBKLRAKFT5ZKE2DCSSYUV","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01957","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-08T20:59:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b77850421c2df46447519cc4c823b7a53aac509efc0b5bfb89bca82a8ff9e3b","abstract_canon_sha256":"d352771b960f6c07b58ff604bba6b52f4a99574c717ed4f5d4b1d0109f8dfd2b"},"schema_version":"1.0"},"canonical_sha256":"349bdb542a5c40a2cfb95134314a58a561db4bfa3bf2c9f5977d580daee94b7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.111006Z","signature_b64":"3gVNezm0SUbnAyYJx4+3BWvv09An+MIXLuacWHXXr6xpULgAhDsa93zJSxl7eKXSJvR31MF7SE58cJ6dClwuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"349bdb542a5c40a2cfb95134314a58a561db4bfa3bf2c9f5977d580daee94b7f","last_reissued_at":"2026-05-18T00:58:11.110429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.110429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01957","source_version":3,"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-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HeZRcfsY53oa00uX+mE+hLHVm/2dEqfA5kVIL7DAh6MxUDkZBLjqLNp0RGmfubY7kYdl4cmNARCcV9OsSI6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:47:10.114349Z"},"content_sha256":"660fe26faa3b48439b1521f8f5477c643ea2419ecf83f073843bd3b56e4bad53","schema_version":"1.0","event_id":"sha256:660fe26faa3b48439b1521f8f5477c643ea2419ecf83f073843bd3b56e4bad53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GSN5WVBKLRAKFT5ZKE2DCSSYUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Durisi, Johan \\\"Ostman, Rahul Devassy, Tome Eftimov, Wei Yang, Zoran Utkovski","submitted_at":"2015-01-08T20:59:48Z","abstract_excerpt":"We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for channel capacity and on the assumption that the users can cooperate perfectly. The lower bound is derived assuming a noncooperative scenario, where each user employs unitary space-time modulation (independently from the other users). Numerical results show that the gap between the upper and the lower bound is small already at moderate SNR values. This sugge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01957","kind":"arxiv","version":3},"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-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QsXJD3SbTn0ahWee1x516J8VFUD/bWDW8PfEBIWkCI1WNucsSPaotep57mqkG/z1KWNutY4LvJZzYW+hzGZMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:47:10.114910Z"},"content_sha256":"3e386423d6fa820970f291d3bcb9c65fb3ad3dc4a6871925510fab15857bd4a0","schema_version":"1.0","event_id":"sha256:3e386423d6fa820970f291d3bcb9c65fb3ad3dc4a6871925510fab15857bd4a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/bundle.json","state_url":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/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-05T02:47:10Z","links":{"resolver":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV","bundle":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/bundle.json","state":"https://pith.science/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSN5WVBKLRAKFT5ZKE2DCSSYUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GSN5WVBKLRAKFT5ZKE2DCSSYUV","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":"d352771b960f6c07b58ff604bba6b52f4a99574c717ed4f5d4b1d0109f8dfd2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-08T20:59:48Z","title_canon_sha256":"3b77850421c2df46447519cc4c823b7a53aac509efc0b5bfb89bca82a8ff9e3b"},"schema_version":"1.0","source":{"id":"1501.01957","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01957","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01957v3","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01957","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"GSN5WVBKLRAK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GSN5WVBKLRAKFT5Z","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GSN5WVBK","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:3e386423d6fa820970f291d3bcb9c65fb3ad3dc4a6871925510fab15857bd4a0","target":"graph","created_at":"2026-05-18T00:58:11Z","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":"We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for channel capacity and on the assumption that the users can cooperate perfectly. The lower bound is derived assuming a noncooperative scenario, where each user employs unitary space-time modulation (independently from the other users). Numerical results show that the gap between the upper and the lower bound is small already at moderate SNR values. This sugge","authors_text":"Giuseppe Durisi, Johan \\\"Ostman, Rahul Devassy, Tome Eftimov, Wei Yang, Zoran Utkovski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-08T20:59:48Z","title":"Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01957","kind":"arxiv","version":3},"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:660fe26faa3b48439b1521f8f5477c643ea2419ecf83f073843bd3b56e4bad53","target":"record","created_at":"2026-05-18T00:58:11Z","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":"d352771b960f6c07b58ff604bba6b52f4a99574c717ed4f5d4b1d0109f8dfd2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-08T20:59:48Z","title_canon_sha256":"3b77850421c2df46447519cc4c823b7a53aac509efc0b5bfb89bca82a8ff9e3b"},"schema_version":"1.0","source":{"id":"1501.01957","kind":"arxiv","version":3}},"canonical_sha256":"349bdb542a5c40a2cfb95134314a58a561db4bfa3bf2c9f5977d580daee94b7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"349bdb542a5c40a2cfb95134314a58a561db4bfa3bf2c9f5977d580daee94b7f","first_computed_at":"2026-05-18T00:58:11.110429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:11.110429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gVNezm0SUbnAyYJx4+3BWvv09An+MIXLuacWHXXr6xpULgAhDsa93zJSxl7eKXSJvR31MF7SE58cJ6dClwuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:11.111006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01957","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:660fe26faa3b48439b1521f8f5477c643ea2419ecf83f073843bd3b56e4bad53","sha256:3e386423d6fa820970f291d3bcb9c65fb3ad3dc4a6871925510fab15857bd4a0"],"state_sha256":"f1796761f791edfa32e09cf48ea172f27aec034e83e850894621dbc27576bb79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MZnlOUlck4xBDp/R29IeQpX+qEXZoMO2qMylP4bBUxSUZnhpMqJ5QfmlkPngFiVL2tsjGHUUIhz68MbXsxSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:47:10.117725Z","bundle_sha256":"8ab27e39301b53b6b036b8a1dd772f4e646876e51a9bb6f1b442251443d0b4cc"}}