{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3LYZWABL3F2L4PSLILT3OP4KHA","short_pith_number":"pith:3LYZWABL","canonical_record":{"source":{"id":"1306.2361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-10T21:31:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ef503ebdc9c4b22fe863841af1f53138ec8af61c5ee866ef39f578621938f9a","abstract_canon_sha256":"b25ac228268af0b9d8a1605fb1b16a6bb9c95765c217c6ba2503ff281917ea0a"},"schema_version":"1.0"},"canonical_sha256":"daf19b002bd974be3e4b42e7b73f8a3813ca00cb58e1383f8c29b7b6ed54195d","source":{"kind":"arxiv","id":"1306.2361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2361","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2361v1","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2361","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"3LYZWABL3F2L","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LYZWABL3F2L4PSL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LYZWABL","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3LYZWABL3F2L4PSLILT3OP4KHA","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-10T21:31:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ef503ebdc9c4b22fe863841af1f53138ec8af61c5ee866ef39f578621938f9a","abstract_canon_sha256":"b25ac228268af0b9d8a1605fb1b16a6bb9c95765c217c6ba2503ff281917ea0a"},"schema_version":"1.0"},"canonical_sha256":"daf19b002bd974be3e4b42e7b73f8a3813ca00cb58e1383f8c29b7b6ed54195d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:21.251423Z","signature_b64":"9DahgR+njmi1NzZpZoEF8fssxJSljVWcPKKsPFe04MDzTjy5SPxOoBfExDlkoTw5wejcXXAgGs6VyZIwnSQ4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf19b002bd974be3e4b42e7b73f8a3813ca00cb58e1383f8c29b7b6ed54195d","last_reissued_at":"2026-05-18T03:21:21.250663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:21.250663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2361","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-18T03:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMLLdj5k2DdwYE13Y1URVw0lhYbn7z9ie7YP10DA0QFKCNPXvDBxhq4rj+75v8KVG/pHUIilRA2k23y2rPb0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:47:36.453055Z"},"content_sha256":"e0429edcb50fcc79ff084fdd739d60e30a1a47c29a8bcad008099c81e48927e2","schema_version":"1.0","event_id":"sha256:e0429edcb50fcc79ff084fdd739d60e30a1a47c29a8bcad008099c81e48927e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3LYZWABL3F2L4PSLILT3OP4KHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Transmit Diversity Optimization and Relay Selection for Cooperative MIMO Systems using Discrete Stochastic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"P. Clarke, R. C. de Lamare","submitted_at":"2013-06-10T21:31:14Z","abstract_excerpt":"We propose a joint discrete stochastic optimization based transmit diversity selection (TDS) and relay selection (RS) algorithm for decode-and-forward (DF), cooperative MIMO systems with a non-negligible direct path. TDS and RS are performed jointly with continuous least squares channel estimation (CE), linear minimum mean square error (MMSE) receivers are used at all nodes and no inter-relay communication is required. The performance of the proposed scheme is evaluated via bit-error rate (BER) comparisons and diversity analysis, and is shown to converge to the optimum exhaustive solution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2361","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-18T03:21:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMr0mrvG6xaarSZ5qWVFvyi8dKBCOVnf2XUa7YHItabKJ1j2DNhaWPacjeiNsiYDowd3OqpsRVvGQCbNLDL+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:47:36.453444Z"},"content_sha256":"379741602cab0edafb5af0186554e494b371af0e2235d08f107a39333eb3d679","schema_version":"1.0","event_id":"sha256:379741602cab0edafb5af0186554e494b371af0e2235d08f107a39333eb3d679"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LYZWABL3F2L4PSLILT3OP4KHA/bundle.json","state_url":"https://pith.science/pith/3LYZWABL3F2L4PSLILT3OP4KHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LYZWABL3F2L4PSLILT3OP4KHA/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-05-20T11:47:36Z","links":{"resolver":"https://pith.science/pith/3LYZWABL3F2L4PSLILT3OP4KHA","bundle":"https://pith.science/pith/3LYZWABL3F2L4PSLILT3OP4KHA/bundle.json","state":"https://pith.science/pith/3LYZWABL3F2L4PSLILT3OP4KHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LYZWABL3F2L4PSLILT3OP4KHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3LYZWABL3F2L4PSLILT3OP4KHA","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":"b25ac228268af0b9d8a1605fb1b16a6bb9c95765c217c6ba2503ff281917ea0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-10T21:31:14Z","title_canon_sha256":"4ef503ebdc9c4b22fe863841af1f53138ec8af61c5ee866ef39f578621938f9a"},"schema_version":"1.0","source":{"id":"1306.2361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2361","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2361v1","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2361","created_at":"2026-05-18T03:21:21Z"},{"alias_kind":"pith_short_12","alias_value":"3LYZWABL3F2L","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LYZWABL3F2L4PSL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LYZWABL","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:379741602cab0edafb5af0186554e494b371af0e2235d08f107a39333eb3d679","target":"graph","created_at":"2026-05-18T03:21:21Z","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 propose a joint discrete stochastic optimization based transmit diversity selection (TDS) and relay selection (RS) algorithm for decode-and-forward (DF), cooperative MIMO systems with a non-negligible direct path. TDS and RS are performed jointly with continuous least squares channel estimation (CE), linear minimum mean square error (MMSE) receivers are used at all nodes and no inter-relay communication is required. The performance of the proposed scheme is evaluated via bit-error rate (BER) comparisons and diversity analysis, and is shown to converge to the optimum exhaustive solution.","authors_text":"P. Clarke, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-10T21:31:14Z","title":"Joint Transmit Diversity Optimization and Relay Selection for Cooperative MIMO Systems using Discrete Stochastic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2361","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:e0429edcb50fcc79ff084fdd739d60e30a1a47c29a8bcad008099c81e48927e2","target":"record","created_at":"2026-05-18T03:21:21Z","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":"b25ac228268af0b9d8a1605fb1b16a6bb9c95765c217c6ba2503ff281917ea0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-10T21:31:14Z","title_canon_sha256":"4ef503ebdc9c4b22fe863841af1f53138ec8af61c5ee866ef39f578621938f9a"},"schema_version":"1.0","source":{"id":"1306.2361","kind":"arxiv","version":1}},"canonical_sha256":"daf19b002bd974be3e4b42e7b73f8a3813ca00cb58e1383f8c29b7b6ed54195d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daf19b002bd974be3e4b42e7b73f8a3813ca00cb58e1383f8c29b7b6ed54195d","first_computed_at":"2026-05-18T03:21:21.250663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:21.250663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9DahgR+njmi1NzZpZoEF8fssxJSljVWcPKKsPFe04MDzTjy5SPxOoBfExDlkoTw5wejcXXAgGs6VyZIwnSQ4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:21.251423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0429edcb50fcc79ff084fdd739d60e30a1a47c29a8bcad008099c81e48927e2","sha256:379741602cab0edafb5af0186554e494b371af0e2235d08f107a39333eb3d679"],"state_sha256":"73bd3069ca840d01d8db899933b1b15c7baa81a97a8d5db270a17e2da9bd14f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkRytrIIeR4hU9g/FTNWJTYegzp3t2nP6l+9bYeoKwtBV+ROQmcr2p5LjfLlslLLGgL6qI4YBBZbTewZNBM7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T11:47:36.456585Z","bundle_sha256":"56312256de82724a12d1ed973640d6320d15f9497035627f2d7ad252c8e5c1ff"}}