{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:N4E23OWWJZS2ABTJO5DL7P3GQA","short_pith_number":"pith:N4E23OWW","canonical_record":{"source":{"id":"1105.0285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:09:43Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"9ae01f3d7e68242a958d46872e4fb88acb132258532e50143e72086246b4ef31","abstract_canon_sha256":"6f468215920caa092bb225bc95c67f620f6251b6f78cf8ef56fb7d6a6f3d62aa"},"schema_version":"1.0"},"canonical_sha256":"6f09adbad64e65a006697746bfbf66802c9d9d4cfd829767d1baafd5ea50c3df","source":{"kind":"arxiv","id":"1105.0285","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0285","created_at":"2026-05-18T02:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0285v2","created_at":"2026-05-18T02:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0285","created_at":"2026-05-18T02:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"N4E23OWWJZS2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N4E23OWWJZS2ABTJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N4E23OWW","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:N4E23OWWJZS2ABTJO5DL7P3GQA","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:09:43Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"9ae01f3d7e68242a958d46872e4fb88acb132258532e50143e72086246b4ef31","abstract_canon_sha256":"6f468215920caa092bb225bc95c67f620f6251b6f78cf8ef56fb7d6a6f3d62aa"},"schema_version":"1.0"},"canonical_sha256":"6f09adbad64e65a006697746bfbf66802c9d9d4cfd829767d1baafd5ea50c3df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:10.390074Z","signature_b64":"wve57Y5UkXKohXw57OJPB+XYMrgn3XomoWiqdj9fvxHaKVL1Fk8jvu7Nr6KpIh/zKwWxJRdU4ZnKzsw1shxSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f09adbad64e65a006697746bfbf66802c9d9d4cfd829767d1baafd5ea50c3df","last_reissued_at":"2026-05-18T02:02:10.389344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:10.389344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0285","source_version":2,"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-18T02:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzHLo4IPNsQuLgSjvubkNS4XSB1CJ6EOl3Zsv4t3LPmWHF2A+x4F6kLm/+oylPdcE7Y5+jf2ABcMtEgDZRWFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:36.011894Z"},"content_sha256":"6707ace9ef289e9a5a7562cd034621385894441ffe7c16c7603c870b32545488","schema_version":"1.0","event_id":"sha256:6707ace9ef289e9a5a7562cd034621385894441ffe7c16c7603c870b32545488"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:N4E23OWWJZS2ABTJO5DL7P3GQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"WSR Maximized Resource Allocation in Multiple DF Relays Aided OFDMA Downlink Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Luc Vandendorpe, Tao Wang","submitted_at":"2011-05-02T10:09:43Z","abstract_excerpt":"This paper considers the weighted sum rate (WSR) maximized resource allocation (RA) constrained by a system sum power in an orthogonal frequency division multiple access (OFDMA) downlink transmission system assisted by multiple decode-and-forward (DF) relays. In particular, multiple relays may cooperate with the source for every relay-aided transmission. A two-step algorithm is proposed to find the globally optimum RA. In the first step, the optimum source/relay power and assisting relays that maximize the rate is found for every combination of subcarrier and destination, assuming a sum power "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0285","kind":"arxiv","version":2},"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-18T02:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxER0dosx9mjw9DAbJoOhU7wlAcu0E41HMrmeSMRabJVuevzbTlm0jt3AOf5cnxLSL1M8AZx24yuihfS/+/VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:36.012249Z"},"content_sha256":"59d8267e75fdd9f3eb528ffecf173642d0cc3f17a27e8e2c8bcabac4d376cd86","schema_version":"1.0","event_id":"sha256:59d8267e75fdd9f3eb528ffecf173642d0cc3f17a27e8e2c8bcabac4d376cd86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4E23OWWJZS2ABTJO5DL7P3GQA/bundle.json","state_url":"https://pith.science/pith/N4E23OWWJZS2ABTJO5DL7P3GQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4E23OWWJZS2ABTJO5DL7P3GQA/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-03T01:31:36Z","links":{"resolver":"https://pith.science/pith/N4E23OWWJZS2ABTJO5DL7P3GQA","bundle":"https://pith.science/pith/N4E23OWWJZS2ABTJO5DL7P3GQA/bundle.json","state":"https://pith.science/pith/N4E23OWWJZS2ABTJO5DL7P3GQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4E23OWWJZS2ABTJO5DL7P3GQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:N4E23OWWJZS2ABTJO5DL7P3GQA","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":"6f468215920caa092bb225bc95c67f620f6251b6f78cf8ef56fb7d6a6f3d62aa","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:09:43Z","title_canon_sha256":"9ae01f3d7e68242a958d46872e4fb88acb132258532e50143e72086246b4ef31"},"schema_version":"1.0","source":{"id":"1105.0285","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0285","created_at":"2026-05-18T02:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0285v2","created_at":"2026-05-18T02:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0285","created_at":"2026-05-18T02:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"N4E23OWWJZS2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N4E23OWWJZS2ABTJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N4E23OWW","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:59d8267e75fdd9f3eb528ffecf173642d0cc3f17a27e8e2c8bcabac4d376cd86","target":"graph","created_at":"2026-05-18T02:02:10Z","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":"This paper considers the weighted sum rate (WSR) maximized resource allocation (RA) constrained by a system sum power in an orthogonal frequency division multiple access (OFDMA) downlink transmission system assisted by multiple decode-and-forward (DF) relays. In particular, multiple relays may cooperate with the source for every relay-aided transmission. A two-step algorithm is proposed to find the globally optimum RA. In the first step, the optimum source/relay power and assisting relays that maximize the rate is found for every combination of subcarrier and destination, assuming a sum power ","authors_text":"Luc Vandendorpe, Tao Wang","cross_cats":["cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:09:43Z","title":"WSR Maximized Resource Allocation in Multiple DF Relays Aided OFDMA Downlink Transmission"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0285","kind":"arxiv","version":2},"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:6707ace9ef289e9a5a7562cd034621385894441ffe7c16c7603c870b32545488","target":"record","created_at":"2026-05-18T02:02:10Z","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":"6f468215920caa092bb225bc95c67f620f6251b6f78cf8ef56fb7d6a6f3d62aa","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-02T10:09:43Z","title_canon_sha256":"9ae01f3d7e68242a958d46872e4fb88acb132258532e50143e72086246b4ef31"},"schema_version":"1.0","source":{"id":"1105.0285","kind":"arxiv","version":2}},"canonical_sha256":"6f09adbad64e65a006697746bfbf66802c9d9d4cfd829767d1baafd5ea50c3df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f09adbad64e65a006697746bfbf66802c9d9d4cfd829767d1baafd5ea50c3df","first_computed_at":"2026-05-18T02:02:10.389344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:10.389344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wve57Y5UkXKohXw57OJPB+XYMrgn3XomoWiqdj9fvxHaKVL1Fk8jvu7Nr6KpIh/zKwWxJRdU4ZnKzsw1shxSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:10.390074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0285","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6707ace9ef289e9a5a7562cd034621385894441ffe7c16c7603c870b32545488","sha256:59d8267e75fdd9f3eb528ffecf173642d0cc3f17a27e8e2c8bcabac4d376cd86"],"state_sha256":"adf9e5bc6fb012e3c4c17aff1a1c4bf3a6842ef3e58fe74943e75c6c85dd6c77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhpn6E3gWbpgMGXjO+XbacgvkkB9oqlf45GCoTzljY8W10DpaFKbMwL4BzJdVUBIpIEOSbdFoqJ3YjZey7a1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:31:36.014360Z","bundle_sha256":"597101cf5c6f50f1995ea62a69c367e809e79f308f078121c3e7793c0bc4fb9a"}}