{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7I5NZRKHSK3XZWOMUAORMZLSEV","short_pith_number":"pith:7I5NZRKH","canonical_record":{"source":{"id":"1304.2388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-08T01:35:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"586a4042b6c99d22d25abe194a84318d70502bcf55cb05b57a65c12196cbd7d0","abstract_canon_sha256":"9abe9b0ce054627c7608c016953ab1493c0249bf963a9db4205f9ef910ff06d9"},"schema_version":"1.0"},"canonical_sha256":"fa3adcc54792b77cd9cca01d1665722574a03e3a7548405856176f0e661d1d46","source":{"kind":"arxiv","id":"1304.2388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2388","created_at":"2026-05-18T03:28:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2388v1","created_at":"2026-05-18T03:28:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2388","created_at":"2026-05-18T03:28:32Z"},{"alias_kind":"pith_short_12","alias_value":"7I5NZRKHSK3X","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7I5NZRKHSK3XZWOM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7I5NZRKH","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7I5NZRKHSK3XZWOMUAORMZLSEV","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-08T01:35:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"586a4042b6c99d22d25abe194a84318d70502bcf55cb05b57a65c12196cbd7d0","abstract_canon_sha256":"9abe9b0ce054627c7608c016953ab1493c0249bf963a9db4205f9ef910ff06d9"},"schema_version":"1.0"},"canonical_sha256":"fa3adcc54792b77cd9cca01d1665722574a03e3a7548405856176f0e661d1d46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:32.171431Z","signature_b64":"a7ggm7YMQaQTC3JRYB13GGZONR5/p2BlBAUXFEyU7EpnrUeA/wEvuW6dqmNlu/PTfyvHgPLamattxVUIp/1DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3adcc54792b77cd9cca01d1665722574a03e3a7548405856176f0e661d1d46","last_reissued_at":"2026-05-18T03:28:32.170611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:32.170611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2388","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:28:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLpsOKQqNcC2J8VoY32J4BnYCKL3er1rTJNK442U4G2mCXDvXEOIYWZmqUXq9Jr++NdiF5zeUjTmuitHusfvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:17:19.668813Z"},"content_sha256":"86415191dc0b9f909e1f3d7da13b657fae81df3713dd587c3ff9049d600d5f88","schema_version":"1.0","event_id":"sha256:86415191dc0b9f909e1f3d7da13b657fae81df3713dd587c3ff9049d600d5f88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7I5NZRKHSK3XZWOMUAORMZLSEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Iterative Power Adjustment and Interference Suppression Algorithms for Cooperative DS-CDMA Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare, S. Li","submitted_at":"2013-04-08T01:35:53Z","abstract_excerpt":"This work presents joint iterative power allocation and interference suppression algorithms for DS-CDMA networks which employ multiple relays and the amplify and forward cooperation strategy. We propose a joint constrained optimization framework that considers the allocation of power levels across the relays subject to individual and global power constraints and the design of linear receivers for interference suppression. We derive constrained minimum mean-squared error (MMSE) expressions for the parameter vectors that determine the optimal power levels across the relays and the parameters of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2388","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:28:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVjvKbD3pMntFDFJk9oX2nfdwOOfzl0hBJao3HvU1LKZJbvYC2A6LMNk5VjHMCoBiG4OjbM5QTJUG2btQpqgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:17:19.669567Z"},"content_sha256":"9a2fdae16152b560211e4ba912a96191fe14ae46d3e5cdbad864192f41f87e13","schema_version":"1.0","event_id":"sha256:9a2fdae16152b560211e4ba912a96191fe14ae46d3e5cdbad864192f41f87e13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I5NZRKHSK3XZWOMUAORMZLSEV/bundle.json","state_url":"https://pith.science/pith/7I5NZRKHSK3XZWOMUAORMZLSEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I5NZRKHSK3XZWOMUAORMZLSEV/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-08T20:17:19Z","links":{"resolver":"https://pith.science/pith/7I5NZRKHSK3XZWOMUAORMZLSEV","bundle":"https://pith.science/pith/7I5NZRKHSK3XZWOMUAORMZLSEV/bundle.json","state":"https://pith.science/pith/7I5NZRKHSK3XZWOMUAORMZLSEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I5NZRKHSK3XZWOMUAORMZLSEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7I5NZRKHSK3XZWOMUAORMZLSEV","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":"9abe9b0ce054627c7608c016953ab1493c0249bf963a9db4205f9ef910ff06d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-08T01:35:53Z","title_canon_sha256":"586a4042b6c99d22d25abe194a84318d70502bcf55cb05b57a65c12196cbd7d0"},"schema_version":"1.0","source":{"id":"1304.2388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2388","created_at":"2026-05-18T03:28:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2388v1","created_at":"2026-05-18T03:28:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2388","created_at":"2026-05-18T03:28:32Z"},{"alias_kind":"pith_short_12","alias_value":"7I5NZRKHSK3X","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7I5NZRKHSK3XZWOM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7I5NZRKH","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:9a2fdae16152b560211e4ba912a96191fe14ae46d3e5cdbad864192f41f87e13","target":"graph","created_at":"2026-05-18T03:28:32Z","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 work presents joint iterative power allocation and interference suppression algorithms for DS-CDMA networks which employ multiple relays and the amplify and forward cooperation strategy. We propose a joint constrained optimization framework that considers the allocation of power levels across the relays subject to individual and global power constraints and the design of linear receivers for interference suppression. We derive constrained minimum mean-squared error (MMSE) expressions for the parameter vectors that determine the optimal power levels across the relays and the parameters of ","authors_text":"R. C. de Lamare, S. Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-08T01:35:53Z","title":"Joint Iterative Power Adjustment and Interference Suppression Algorithms for Cooperative DS-CDMA Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2388","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:86415191dc0b9f909e1f3d7da13b657fae81df3713dd587c3ff9049d600d5f88","target":"record","created_at":"2026-05-18T03:28:32Z","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":"9abe9b0ce054627c7608c016953ab1493c0249bf963a9db4205f9ef910ff06d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-08T01:35:53Z","title_canon_sha256":"586a4042b6c99d22d25abe194a84318d70502bcf55cb05b57a65c12196cbd7d0"},"schema_version":"1.0","source":{"id":"1304.2388","kind":"arxiv","version":1}},"canonical_sha256":"fa3adcc54792b77cd9cca01d1665722574a03e3a7548405856176f0e661d1d46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa3adcc54792b77cd9cca01d1665722574a03e3a7548405856176f0e661d1d46","first_computed_at":"2026-05-18T03:28:32.170611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:32.170611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a7ggm7YMQaQTC3JRYB13GGZONR5/p2BlBAUXFEyU7EpnrUeA/wEvuW6dqmNlu/PTfyvHgPLamattxVUIp/1DAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:32.171431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86415191dc0b9f909e1f3d7da13b657fae81df3713dd587c3ff9049d600d5f88","sha256:9a2fdae16152b560211e4ba912a96191fe14ae46d3e5cdbad864192f41f87e13"],"state_sha256":"393170d467117f68d8fffa46928953efe86e88e529909df119889879dcbde312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OG++6x/FKczH6Tc0fXcgLW/dgguq6r2nXgrERrsTaJL9w+ta76R416mwZP1Zc7+Zopd0I6SrJVl/c4iCSQ1jCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:17:19.673505Z","bundle_sha256":"2f9e6680cf47c1b5b9603fc9c11901d926ebe8080f4bb1fdbb3a77b5b3a17874"}}