{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:UVFHXJN6RIP7PQX27FNRHGPSLW","short_pith_number":"pith:UVFHXJN6","schema_version":"1.0","canonical_sha256":"a54a7ba5be8a1ff7c2faf95b1399f25d859563276629f84594b029df19badce7","source":{"kind":"arxiv","id":"cs/0510071","version":1},"attestation_state":"computed","paper":{"title":"A Simple Cooperative Diversity Method Based on Network Path Selection","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aggelos Bletsas, Andrew Lippman, Ashish Khisti, David P. Reed","submitted_at":"2005-10-24T01:18:23Z","abstract_excerpt":"Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme, that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this best relay for coo"},"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/0510071","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-10-24T01:18:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34d2c947ce5ddc52d1a0be0046f1a8677952aa6a5fb3532f7bbcbc95fc59b3a2","abstract_canon_sha256":"61e63e7f29d931073d0d3117ef70f85c772842af03df70afc77c8aa12232c373"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:45.060480Z","signature_b64":"iMnaN5FwImjrUP1H/XteR9Kxuw7VVXZV+MCxPocOqjkXjffc5Dl4EeYPXQqOaOS08DJKCCY0dVlIr9TU7UeBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54a7ba5be8a1ff7c2faf95b1399f25d859563276629f84594b029df19badce7","last_reissued_at":"2026-05-18T00:57:45.060013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:45.060013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Cooperative Diversity Method Based on Network Path Selection","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aggelos Bletsas, Andrew Lippman, Ashish Khisti, David P. Reed","submitted_at":"2005-10-24T01:18:23Z","abstract_excerpt":"Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme, that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this best relay for coo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0510071","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":"cs/0510071","created_at":"2026-05-18T00:57:45.060077+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0510071v1","created_at":"2026-05-18T00:57:45.060077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0510071","created_at":"2026-05-18T00:57:45.060077+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVFHXJN6RIP7","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVFHXJN6RIP7PQX2","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVFHXJN6","created_at":"2026-05-18T12:25:53.939244+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/UVFHXJN6RIP7PQX27FNRHGPSLW","json":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW.json","graph_json":"https://pith.science/api/pith-number/UVFHXJN6RIP7PQX27FNRHGPSLW/graph.json","events_json":"https://pith.science/api/pith-number/UVFHXJN6RIP7PQX27FNRHGPSLW/events.json","paper":"https://pith.science/paper/UVFHXJN6"},"agent_actions":{"view_html":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW","download_json":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW.json","view_paper":"https://pith.science/paper/UVFHXJN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0510071&json=true","fetch_graph":"https://pith.science/api/pith-number/UVFHXJN6RIP7PQX27FNRHGPSLW/graph.json","fetch_events":"https://pith.science/api/pith-number/UVFHXJN6RIP7PQX27FNRHGPSLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/action/storage_attestation","attest_author":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/action/author_attestation","sign_citation":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/action/citation_signature","submit_replication":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/action/replication_record"}},"created_at":"2026-05-18T00:57:45.060077+00:00","updated_at":"2026-05-18T00:57:45.060077+00:00"}