{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NQMBIYPAXB3J3CSR4ZQQZT5JH5","short_pith_number":"pith:NQMBIYPA","canonical_record":{"source":{"id":"1408.1044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-05T17:32:25Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"126595965f60b69ba99f85dbf4ac4b87f2f1642c90468a65a6ca524d011bf060","abstract_canon_sha256":"be5ed6761b0421f1528814d94a5b8b6ef277747f54725ddba070bb9728da9bfd"},"schema_version":"1.0"},"canonical_sha256":"6c181461e0b8769d8a51e6610ccfa93f57f95552fbaecce6ecd9b1967e7df345","source":{"kind":"arxiv","id":"1408.1044","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1044","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1044v2","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1044","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"NQMBIYPAXB3J","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NQMBIYPAXB3J3CSR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NQMBIYPA","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NQMBIYPAXB3J3CSR4ZQQZT5JH5","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-05T17:32:25Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"126595965f60b69ba99f85dbf4ac4b87f2f1642c90468a65a6ca524d011bf060","abstract_canon_sha256":"be5ed6761b0421f1528814d94a5b8b6ef277747f54725ddba070bb9728da9bfd"},"schema_version":"1.0"},"canonical_sha256":"6c181461e0b8769d8a51e6610ccfa93f57f95552fbaecce6ecd9b1967e7df345","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:52.849877Z","signature_b64":"Fq5M4rRVxrWH8yA1I0vItl3up+H33sB1a2Cgd16wjEG5jG3aonm4tsE7gfKrK4+M6WauDDtt6e0Y250K8JuxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c181461e0b8769d8a51e6610ccfa93f57f95552fbaecce6ecd9b1967e7df345","last_reissued_at":"2026-05-18T02:38:52.849544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:52.849544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1044","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:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8U7ell/6ly6EyG7XoH5cdBp+yrYLXQk2w8hp5QhK02DgN7NTC2/LalB6NPRP8+zVi6ix4esUaf1T/0yLwgStBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:33:28.605224Z"},"content_sha256":"b7d744e9bee8a997391a099fc192a0cdd978dae4900648e8e3c26759ac7ef11f","schema_version":"1.0","event_id":"sha256:b7d744e9bee8a997391a099fc192a0cdd978dae4900648e8e3c26759ac7ef11f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NQMBIYPAXB3J3CSR4ZQQZT5JH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Heuristics for Power Allocation in Zero-Forcing OFDMA-SDMA Systems with Minimum Rate Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Andre Girard, Diego Perea-Vega, Jean-Francois Frigon","submitted_at":"2014-08-05T17:32:25Z","abstract_excerpt":"We investigate in this paper the optimal power allocation in an OFDM-SDMA system when some users have minimum downlink transmission rate requirements. We first solve the unconstrained power allocation problem for which we propose a fast zero-finding technique that is guaranteed to find an optimal solution, and an approximate solution that has lower complexity but is not guaranteed to converge. For the more complex minimum rate constrained problem, we propose two approximate algorithms. One is an iterative technique that finds an optimal solution on the rate boundaries so that the solution is f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1044","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:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jc1FZry7pgkTCTVBMHX2lAqI2P0o+S3DUoTcZB4xTvsdAOotBIsekTABitVCE41ND0XuS48t2AGJErRzKi90BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:33:28.605573Z"},"content_sha256":"670b46b415214d40afca0fd4277ce6d8373cd1099358b9de7f6ac3916c24b13e","schema_version":"1.0","event_id":"sha256:670b46b415214d40afca0fd4277ce6d8373cd1099358b9de7f6ac3916c24b13e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQMBIYPAXB3J3CSR4ZQQZT5JH5/bundle.json","state_url":"https://pith.science/pith/NQMBIYPAXB3J3CSR4ZQQZT5JH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQMBIYPAXB3J3CSR4ZQQZT5JH5/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-02T16:33:28Z","links":{"resolver":"https://pith.science/pith/NQMBIYPAXB3J3CSR4ZQQZT5JH5","bundle":"https://pith.science/pith/NQMBIYPAXB3J3CSR4ZQQZT5JH5/bundle.json","state":"https://pith.science/pith/NQMBIYPAXB3J3CSR4ZQQZT5JH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQMBIYPAXB3J3CSR4ZQQZT5JH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NQMBIYPAXB3J3CSR4ZQQZT5JH5","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":"be5ed6761b0421f1528814d94a5b8b6ef277747f54725ddba070bb9728da9bfd","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-05T17:32:25Z","title_canon_sha256":"126595965f60b69ba99f85dbf4ac4b87f2f1642c90468a65a6ca524d011bf060"},"schema_version":"1.0","source":{"id":"1408.1044","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1044","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1044v2","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1044","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"NQMBIYPAXB3J","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NQMBIYPAXB3J3CSR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NQMBIYPA","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:670b46b415214d40afca0fd4277ce6d8373cd1099358b9de7f6ac3916c24b13e","target":"graph","created_at":"2026-05-18T02:38:52Z","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 investigate in this paper the optimal power allocation in an OFDM-SDMA system when some users have minimum downlink transmission rate requirements. We first solve the unconstrained power allocation problem for which we propose a fast zero-finding technique that is guaranteed to find an optimal solution, and an approximate solution that has lower complexity but is not guaranteed to converge. For the more complex minimum rate constrained problem, we propose two approximate algorithms. One is an iterative technique that finds an optimal solution on the rate boundaries so that the solution is f","authors_text":"Andre Girard, Diego Perea-Vega, Jean-Francois Frigon","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-05T17:32:25Z","title":"Fast Heuristics for Power Allocation in Zero-Forcing OFDMA-SDMA Systems with Minimum Rate Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1044","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:b7d744e9bee8a997391a099fc192a0cdd978dae4900648e8e3c26759ac7ef11f","target":"record","created_at":"2026-05-18T02:38:52Z","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":"be5ed6761b0421f1528814d94a5b8b6ef277747f54725ddba070bb9728da9bfd","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-05T17:32:25Z","title_canon_sha256":"126595965f60b69ba99f85dbf4ac4b87f2f1642c90468a65a6ca524d011bf060"},"schema_version":"1.0","source":{"id":"1408.1044","kind":"arxiv","version":2}},"canonical_sha256":"6c181461e0b8769d8a51e6610ccfa93f57f95552fbaecce6ecd9b1967e7df345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c181461e0b8769d8a51e6610ccfa93f57f95552fbaecce6ecd9b1967e7df345","first_computed_at":"2026-05-18T02:38:52.849544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:52.849544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fq5M4rRVxrWH8yA1I0vItl3up+H33sB1a2Cgd16wjEG5jG3aonm4tsE7gfKrK4+M6WauDDtt6e0Y250K8JuxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:52.849877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1044","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7d744e9bee8a997391a099fc192a0cdd978dae4900648e8e3c26759ac7ef11f","sha256:670b46b415214d40afca0fd4277ce6d8373cd1099358b9de7f6ac3916c24b13e"],"state_sha256":"8dc13d9da0f65fc131e1eb2bfa02f74c5ef121c5bae0a7eb09f9d1fa709ea47c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kq68Kf3Di2T1oiIiX0Bu0GKK2k+u6OfC7oYhwT/nSEla15ma9gBw5HWoGXrCZcl+D7UzKzItkM5YfRpjXwhJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:33:28.607360Z","bundle_sha256":"2713b238f9681a35eeb5c00b77e13bd6724fdd480e504c83c1299d86c5ddec97"}}