{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:KM7GG6JTWBVOTRUG6OOEXHTU4L","short_pith_number":"pith:KM7GG6JT","schema_version":"1.0","canonical_sha256":"533e637933b06ae9c686f39c4b9e74e2f8dba6e086e28a3ad3b84ec1d9dbe08d","source":{"kind":"arxiv","id":"cs/0701053","version":1},"attestation_state":"computed","paper":{"title":"A Case For Amplify-Forward Relaying in the Block-Fading Multi-Access Channel","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deqiang Chen, J. Nicholas Laneman, Kambiz Azarian","submitted_at":"2007-01-08T21:27:28Z","abstract_excerpt":"This paper demonstrates the significant gains that multi-access users can achieve from sharing a single amplify-forward relay in slow fading environments. The proposed protocol, namely the multi-access relay amplify-forward, allows for a low-complexity relay and achieves the optimal diversity-multiplexing trade-off at high multiplexing gains. Analysis of the protocol reveals that it uniformly dominates the compress-forward strategy and further outperforms the dynamic decode-forward protocol at high multiplexing gains. An interesting feature of the proposed protocol is that, at high multiplexin"},"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":"cs/0701053","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-01-08T21:27:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c0d701b3f9b3a6a8025a198ca4816a7a9ef66feaeb8c6003dbc509db2f014552","abstract_canon_sha256":"9b43e5ed240be9e544f73b13077c7bd97ad56848c75c8ac0865d1e876f2a1219"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:52:30.850185Z","signature_b64":"SLSE/Wqu9FlI5YZgaONSR023lt4H0XrcW1u/8VcnaFS9FCwoG4sKAxgxciq6MQoiqPuAAiFl7dxu9B8mUJ0WBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"533e637933b06ae9c686f39c4b9e74e2f8dba6e086e28a3ad3b84ec1d9dbe08d","last_reissued_at":"2026-07-04T15:52:30.849774Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:52:30.849774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Case For Amplify-Forward Relaying in the Block-Fading Multi-Access Channel","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deqiang Chen, J. Nicholas Laneman, Kambiz Azarian","submitted_at":"2007-01-08T21:27:28Z","abstract_excerpt":"This paper demonstrates the significant gains that multi-access users can achieve from sharing a single amplify-forward relay in slow fading environments. The proposed protocol, namely the multi-access relay amplify-forward, allows for a low-complexity relay and achieves the optimal diversity-multiplexing trade-off at high multiplexing gains. Analysis of the protocol reveals that it uniformly dominates the compress-forward strategy and further outperforms the dynamic decode-forward protocol at high multiplexing gains. An interesting feature of the proposed protocol is that, at high multiplexin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701053","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0701053/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0701053","created_at":"2026-07-04T15:52:30.849838+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0701053v1","created_at":"2026-07-04T15:52:30.849838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701053","created_at":"2026-07-04T15:52:30.849838+00:00"},{"alias_kind":"pith_short_12","alias_value":"KM7GG6JTWBVO","created_at":"2026-07-04T15:52:30.849838+00:00"},{"alias_kind":"pith_short_16","alias_value":"KM7GG6JTWBVOTRUG","created_at":"2026-07-04T15:52:30.849838+00:00"},{"alias_kind":"pith_short_8","alias_value":"KM7GG6JT","created_at":"2026-07-04T15:52:30.849838+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/KM7GG6JTWBVOTRUG6OOEXHTU4L","json":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L.json","graph_json":"https://pith.science/api/pith-number/KM7GG6JTWBVOTRUG6OOEXHTU4L/graph.json","events_json":"https://pith.science/api/pith-number/KM7GG6JTWBVOTRUG6OOEXHTU4L/events.json","paper":"https://pith.science/paper/KM7GG6JT"},"agent_actions":{"view_html":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L","download_json":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L.json","view_paper":"https://pith.science/paper/KM7GG6JT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0701053&json=true","fetch_graph":"https://pith.science/api/pith-number/KM7GG6JTWBVOTRUG6OOEXHTU4L/graph.json","fetch_events":"https://pith.science/api/pith-number/KM7GG6JTWBVOTRUG6OOEXHTU4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L/action/storage_attestation","attest_author":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L/action/author_attestation","sign_citation":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L/action/citation_signature","submit_replication":"https://pith.science/pith/KM7GG6JTWBVOTRUG6OOEXHTU4L/action/replication_record"}},"created_at":"2026-07-04T15:52:30.849838+00:00","updated_at":"2026-07-04T15:52:30.849838+00:00"}