{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:UVFHXJN6RIP7PQX27FNRHGPSLW","short_pith_number":"pith:UVFHXJN6","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"},"canonical_sha256":"a54a7ba5be8a1ff7c2faf95b1399f25d859563276629f84594b029df19badce7","source":{"kind":"arxiv","id":"cs/0510071","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0510071","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0510071v1","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0510071","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"UVFHXJN6RIP7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UVFHXJN6RIP7PQX2","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UVFHXJN6","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:UVFHXJN6RIP7PQX27FNRHGPSLW","target":"record","payload":{"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"},"canonical_sha256":"a54a7ba5be8a1ff7c2faf95b1399f25d859563276629f84594b029df19badce7","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"},"source_kind":"arxiv","source_id":"cs/0510071","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-18T00:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HGWERJGt84jnOmA8hu6TpNm8YJ0EH2SELuBUhhDO29QQQGFlZZPNZxsweKI3WHdp2EzU4k8QJd+kUmRFY/CBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:58:28.616749Z"},"content_sha256":"a046aeabd054f161e3610a0cde44e7f47440d497572c1c7d0beaf9f89ecf9636","schema_version":"1.0","event_id":"sha256:a046aeabd054f161e3610a0cde44e7f47440d497572c1c7d0beaf9f89ecf9636"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:UVFHXJN6RIP7PQX27FNRHGPSLW","target":"graph","payload":{"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"},"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:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b91CdNQR+PGQ3G+MEmWJ3YIau1tN7ksiTD6eRYAlgHMlW+bS4KExSmFN+hmUbgVcShZwsjXc6Fvv0crzmnTlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:58:28.617094Z"},"content_sha256":"991ec8ca6acb44e0689c6be1e1a7de8acb564fa6871f00208f7110b435a69c7f","schema_version":"1.0","event_id":"sha256:991ec8ca6acb44e0689c6be1e1a7de8acb564fa6871f00208f7110b435a69c7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/bundle.json","state_url":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/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-27T14:58:28Z","links":{"resolver":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW","bundle":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/bundle.json","state":"https://pith.science/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVFHXJN6RIP7PQX27FNRHGPSLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:UVFHXJN6RIP7PQX27FNRHGPSLW","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":"61e63e7f29d931073d0d3117ef70f85c772842af03df70afc77c8aa12232c373","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-10-24T01:18:23Z","title_canon_sha256":"34d2c947ce5ddc52d1a0be0046f1a8677952aa6a5fb3532f7bbcbc95fc59b3a2"},"schema_version":"1.0","source":{"id":"cs/0510071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0510071","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0510071v1","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0510071","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"UVFHXJN6RIP7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UVFHXJN6RIP7PQX2","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UVFHXJN6","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:991ec8ca6acb44e0689c6be1e1a7de8acb564fa6871f00208f7110b435a69c7f","target":"graph","created_at":"2026-05-18T00:57:45Z","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":"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","authors_text":"Aggelos Bletsas, Andrew Lippman, Ashish Khisti, David P. Reed","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-10-24T01:18:23Z","title":"A Simple Cooperative Diversity Method Based on Network Path Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0510071","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:a046aeabd054f161e3610a0cde44e7f47440d497572c1c7d0beaf9f89ecf9636","target":"record","created_at":"2026-05-18T00:57:45Z","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":"61e63e7f29d931073d0d3117ef70f85c772842af03df70afc77c8aa12232c373","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-10-24T01:18:23Z","title_canon_sha256":"34d2c947ce5ddc52d1a0be0046f1a8677952aa6a5fb3532f7bbcbc95fc59b3a2"},"schema_version":"1.0","source":{"id":"cs/0510071","kind":"arxiv","version":1}},"canonical_sha256":"a54a7ba5be8a1ff7c2faf95b1399f25d859563276629f84594b029df19badce7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a54a7ba5be8a1ff7c2faf95b1399f25d859563276629f84594b029df19badce7","first_computed_at":"2026-05-18T00:57:45.060013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:45.060013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iMnaN5FwImjrUP1H/XteR9Kxuw7VVXZV+MCxPocOqjkXjffc5Dl4EeYPXQqOaOS08DJKCCY0dVlIr9TU7UeBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:45.060480Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0510071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a046aeabd054f161e3610a0cde44e7f47440d497572c1c7d0beaf9f89ecf9636","sha256:991ec8ca6acb44e0689c6be1e1a7de8acb564fa6871f00208f7110b435a69c7f"],"state_sha256":"e19133a1ef10ee01673c7d3eaad4c7b5fbb98763af8af586c034dfda5b0e1ebe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cq3wPvpZY6LzXw3l6KnfBunJXvU5gY/EUEu4uiKOwglJCmVIEA4OSa7UDzF1+fu3/WzNLuQsz7Oz5dvbuPsPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:58:28.618988Z","bundle_sha256":"c7ef2de62db90e6e477bf4772abec08c3f565d04bcc08b66197c61c8f9eaf2a9"}}