{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N4UIXQWK6CQHHBA6XF3SZR2IGE","short_pith_number":"pith:N4UIXQWK","canonical_record":{"source":{"id":"1303.4120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-17T23:39:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d8170fef2f3ca80f930ae60b3eecc5f356dec32ed63ed450f96ebff3368da51","abstract_canon_sha256":"9a8cd0c7bbea6a12946637a89ca20dbb87d8c49583861ffd254a50d67aaa932d"},"schema_version":"1.0"},"canonical_sha256":"6f288bc2caf0a073841eb9772cc7483122bdd50c6fbb5c3254c009de86c3d1a0","source":{"kind":"arxiv","id":"1303.4120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4120","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4120v1","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4120","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"N4UIXQWK6CQH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4UIXQWK6CQHHBA6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4UIXQWK","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N4UIXQWK6CQHHBA6XF3SZR2IGE","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-17T23:39:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d8170fef2f3ca80f930ae60b3eecc5f356dec32ed63ed450f96ebff3368da51","abstract_canon_sha256":"9a8cd0c7bbea6a12946637a89ca20dbb87d8c49583861ffd254a50d67aaa932d"},"schema_version":"1.0"},"canonical_sha256":"6f288bc2caf0a073841eb9772cc7483122bdd50c6fbb5c3254c009de86c3d1a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:39.731797Z","signature_b64":"fYPIYye5cYZ3iNx09M0rl5wq+Ne50ywLo3ks9lVXOodpWiF5vgg228uBBjNbQKvFtmxihsbY+P0qFcB3I2wQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f288bc2caf0a073841eb9772cc7483122bdd50c6fbb5c3254c009de86c3d1a0","last_reissued_at":"2026-05-18T03:30:39.731022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:39.731022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4120","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CptSi8E7Yb134a8AvjhtS1E4tuxFIHODZ09x0FujcVrGZ8MapJ2WgaPo7zAyP9VYTAvaJHWciXVly7JGaj3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:11:14.400858Z"},"content_sha256":"625503f396b82a8a281036798d4b9f5c0c061007e2a5dfa8b2eb411c19e31871","schema_version":"1.0","event_id":"sha256:625503f396b82a8a281036798d4b9f5c0c061007e2a5dfa8b2eb411c19e31871"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N4UIXQWK6CQHHBA6XF3SZR2IGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Randomized Distributed Space-Time Coding in Cooperative MIMO Relay Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Schmeink, R. C. de Lamare, T. Peng","submitted_at":"2013-03-17T23:39:01Z","abstract_excerpt":"An adaptive randomized distributed space-time coding (DSTC) scheme and algorithms are proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receivers and an amplify-and-forward (AF) cooperation strategy are considered. In the proposed DSTC scheme, a randomized matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. Linear MMSE expressions are devised to compute the parameters of the adaptive randomized matrix and the linear receive filter. A stochastic gradient algorithm is also developed to compute the par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4120","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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLEB3xdcXPS6DIVdlC9Ey/51NrHyJGzhntPUQHm1jqVl7MfUOROKngNkd8MdBzDNFSeH+u2dDUeVacYhb0OICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:11:14.401199Z"},"content_sha256":"ab598dd8b5d556a43980740d56ad001deecdea2e5687bfbfdfc9a0360af44952","schema_version":"1.0","event_id":"sha256:ab598dd8b5d556a43980740d56ad001deecdea2e5687bfbfdfc9a0360af44952"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4UIXQWK6CQHHBA6XF3SZR2IGE/bundle.json","state_url":"https://pith.science/pith/N4UIXQWK6CQHHBA6XF3SZR2IGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4UIXQWK6CQHHBA6XF3SZR2IGE/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-20T12:11:14Z","links":{"resolver":"https://pith.science/pith/N4UIXQWK6CQHHBA6XF3SZR2IGE","bundle":"https://pith.science/pith/N4UIXQWK6CQHHBA6XF3SZR2IGE/bundle.json","state":"https://pith.science/pith/N4UIXQWK6CQHHBA6XF3SZR2IGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4UIXQWK6CQHHBA6XF3SZR2IGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N4UIXQWK6CQHHBA6XF3SZR2IGE","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":"9a8cd0c7bbea6a12946637a89ca20dbb87d8c49583861ffd254a50d67aaa932d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-17T23:39:01Z","title_canon_sha256":"1d8170fef2f3ca80f930ae60b3eecc5f356dec32ed63ed450f96ebff3368da51"},"schema_version":"1.0","source":{"id":"1303.4120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4120","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4120v1","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4120","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"N4UIXQWK6CQH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N4UIXQWK6CQHHBA6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N4UIXQWK","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:ab598dd8b5d556a43980740d56ad001deecdea2e5687bfbfdfc9a0360af44952","target":"graph","created_at":"2026-05-18T03:30:39Z","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":"An adaptive randomized distributed space-time coding (DSTC) scheme and algorithms are proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receivers and an amplify-and-forward (AF) cooperation strategy are considered. In the proposed DSTC scheme, a randomized matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. Linear MMSE expressions are devised to compute the parameters of the adaptive randomized matrix and the linear receive filter. A stochastic gradient algorithm is also developed to compute the par","authors_text":"A. Schmeink, R. C. de Lamare, T. Peng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-17T23:39:01Z","title":"Adaptive Randomized Distributed Space-Time Coding in Cooperative MIMO Relay Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4120","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:625503f396b82a8a281036798d4b9f5c0c061007e2a5dfa8b2eb411c19e31871","target":"record","created_at":"2026-05-18T03:30:39Z","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":"9a8cd0c7bbea6a12946637a89ca20dbb87d8c49583861ffd254a50d67aaa932d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-17T23:39:01Z","title_canon_sha256":"1d8170fef2f3ca80f930ae60b3eecc5f356dec32ed63ed450f96ebff3368da51"},"schema_version":"1.0","source":{"id":"1303.4120","kind":"arxiv","version":1}},"canonical_sha256":"6f288bc2caf0a073841eb9772cc7483122bdd50c6fbb5c3254c009de86c3d1a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f288bc2caf0a073841eb9772cc7483122bdd50c6fbb5c3254c009de86c3d1a0","first_computed_at":"2026-05-18T03:30:39.731022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:39.731022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fYPIYye5cYZ3iNx09M0rl5wq+Ne50ywLo3ks9lVXOodpWiF5vgg228uBBjNbQKvFtmxihsbY+P0qFcB3I2wQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:39.731797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:625503f396b82a8a281036798d4b9f5c0c061007e2a5dfa8b2eb411c19e31871","sha256:ab598dd8b5d556a43980740d56ad001deecdea2e5687bfbfdfc9a0360af44952"],"state_sha256":"ae06339f6072846728a09f950673dd301ed8ce424df21d4b7d28fea4b5fbde56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K67gElJ+g3SFZPqwCu2SJiM7jBM766bPnsY9rvcWambnoITKyCxWA/tRFM8nrR/nu4satlNZYcYslAG3CDP0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T12:11:14.403471Z","bundle_sha256":"6f4a1b0e5382e845246388fbe64c1e09bde881ff504f11dc43169967a8ae6125"}}