{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:H73CFCWDYOP4C2L4KZIYXOXGOH","short_pith_number":"pith:H73CFCWD","canonical_record":{"source":{"id":"1310.3248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-11T19:14:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6493797f7b2f2d801915f2eedbc349818cc87495e84634f6b75953bf14e995ce","abstract_canon_sha256":"72d22d7af75415ec8cd411cb54d7a7c783005eb8e8246e322ff164904b02dc0f"},"schema_version":"1.0"},"canonical_sha256":"3ff6228ac3c39fc1697c56518bbae671d28f1a2b4ab145ad8baffb48cc46ce89","source":{"kind":"arxiv","id":"1310.3248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3248","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3248v1","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3248","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"H73CFCWDYOP4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H73CFCWDYOP4C2L4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H73CFCWD","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:H73CFCWDYOP4C2L4KZIYXOXGOH","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-11T19:14:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6493797f7b2f2d801915f2eedbc349818cc87495e84634f6b75953bf14e995ce","abstract_canon_sha256":"72d22d7af75415ec8cd411cb54d7a7c783005eb8e8246e322ff164904b02dc0f"},"schema_version":"1.0"},"canonical_sha256":"3ff6228ac3c39fc1697c56518bbae671d28f1a2b4ab145ad8baffb48cc46ce89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:03.524764Z","signature_b64":"d1nlQHq7zAsxnKKJbWBl2WZ05gQlBGZRTM4FbSasAmmqpe+6hRHwpy5V8Qu79MLI15RYX2+SH2vFYSENA3kDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff6228ac3c39fc1697c56518bbae671d28f1a2b4ab145ad8baffb48cc46ce89","last_reissued_at":"2026-05-18T03:07:03.524283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:03.524283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3248","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:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r372Z7+d+7nDZ3uTtBwA/HgdEngD6fmSyDiAHuu7EDq/s58BoOiSKOn5+z/cIK5/vYilqtM3IeC7sUZrOI2+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:13:54.560271Z"},"content_sha256":"dbd8a621b012765b44ececc055b3014af7c6e8c5816480bc96b8adb535334297","schema_version":"1.0","event_id":"sha256:dbd8a621b012765b44ececc055b3014af7c6e8c5816480bc96b8adb535334297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:H73CFCWDYOP4C2L4KZIYXOXGOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A low complexity approach of combining cooperative diversity and multiuser diversity in multiuser cooperative networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shaoshi Yang, Tiejun Lv, Zhang Zhang","submitted_at":"2013-10-11T19:14:30Z","abstract_excerpt":"In this paper, we investigate the scheduling scheme to combine cooperative diversity (CD) and multiuser diversity (MUD) in multiuser cooperative networks under the time resource allocation (TRA) framework in which the whole transmission is divided into two phases: the broadcast phase and the relay phase. The broadcast phase is for direct transmission whereas the relay phase is for relay transmission. Based on this TRA framework, a user selection based low complexity relay protocol (US-LCRP) is proposed to combine CD and MUD. In each time slot (TS) of the broadcast phase, a \"best\" user is selec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3248","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:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gl2zGOwezR+RgcUg7XsiSdjVPj7QAbXz6QIStQYAGNj0Fi+/7CydQoKu0xdsMWEYc37hQ0qE4I2S3UCjfgILDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:13:54.560936Z"},"content_sha256":"216b9180dd4c4a6b269dc53ec05cd947359286eb4b1790016b642ba7583e15e1","schema_version":"1.0","event_id":"sha256:216b9180dd4c4a6b269dc53ec05cd947359286eb4b1790016b642ba7583e15e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H73CFCWDYOP4C2L4KZIYXOXGOH/bundle.json","state_url":"https://pith.science/pith/H73CFCWDYOP4C2L4KZIYXOXGOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H73CFCWDYOP4C2L4KZIYXOXGOH/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-25T20:13:54Z","links":{"resolver":"https://pith.science/pith/H73CFCWDYOP4C2L4KZIYXOXGOH","bundle":"https://pith.science/pith/H73CFCWDYOP4C2L4KZIYXOXGOH/bundle.json","state":"https://pith.science/pith/H73CFCWDYOP4C2L4KZIYXOXGOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H73CFCWDYOP4C2L4KZIYXOXGOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:H73CFCWDYOP4C2L4KZIYXOXGOH","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":"72d22d7af75415ec8cd411cb54d7a7c783005eb8e8246e322ff164904b02dc0f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-11T19:14:30Z","title_canon_sha256":"6493797f7b2f2d801915f2eedbc349818cc87495e84634f6b75953bf14e995ce"},"schema_version":"1.0","source":{"id":"1310.3248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3248","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3248v1","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3248","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"H73CFCWDYOP4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"H73CFCWDYOP4C2L4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"H73CFCWD","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:216b9180dd4c4a6b269dc53ec05cd947359286eb4b1790016b642ba7583e15e1","target":"graph","created_at":"2026-05-18T03:07:03Z","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":"In this paper, we investigate the scheduling scheme to combine cooperative diversity (CD) and multiuser diversity (MUD) in multiuser cooperative networks under the time resource allocation (TRA) framework in which the whole transmission is divided into two phases: the broadcast phase and the relay phase. The broadcast phase is for direct transmission whereas the relay phase is for relay transmission. Based on this TRA framework, a user selection based low complexity relay protocol (US-LCRP) is proposed to combine CD and MUD. In each time slot (TS) of the broadcast phase, a \"best\" user is selec","authors_text":"Shaoshi Yang, Tiejun Lv, Zhang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-11T19:14:30Z","title":"A low complexity approach of combining cooperative diversity and multiuser diversity in multiuser cooperative networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3248","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:dbd8a621b012765b44ececc055b3014af7c6e8c5816480bc96b8adb535334297","target":"record","created_at":"2026-05-18T03:07:03Z","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":"72d22d7af75415ec8cd411cb54d7a7c783005eb8e8246e322ff164904b02dc0f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-11T19:14:30Z","title_canon_sha256":"6493797f7b2f2d801915f2eedbc349818cc87495e84634f6b75953bf14e995ce"},"schema_version":"1.0","source":{"id":"1310.3248","kind":"arxiv","version":1}},"canonical_sha256":"3ff6228ac3c39fc1697c56518bbae671d28f1a2b4ab145ad8baffb48cc46ce89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ff6228ac3c39fc1697c56518bbae671d28f1a2b4ab145ad8baffb48cc46ce89","first_computed_at":"2026-05-18T03:07:03.524283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:03.524283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1nlQHq7zAsxnKKJbWBl2WZ05gQlBGZRTM4FbSasAmmqpe+6hRHwpy5V8Qu79MLI15RYX2+SH2vFYSENA3kDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:03.524764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbd8a621b012765b44ececc055b3014af7c6e8c5816480bc96b8adb535334297","sha256:216b9180dd4c4a6b269dc53ec05cd947359286eb4b1790016b642ba7583e15e1"],"state_sha256":"25bb954ac1e934f253d3760d0a53aa97d7910017f710291dc854f56ee9defbbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoW9s5nvPNMD83RnS8RN+wAYLcbUX8mwo0Zlbm0V5bxmynozbWaeLKcH9zRRqrBCOtEve4uUdVTHZwVUruZzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:13:54.566363Z","bundle_sha256":"17a54730e03707b225b89873aa9c7f06e4c92a2a56a1cdb19585dc0a962f8cf1"}}