{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LVDEKTVLTNV7ULCBRJPWPBWTIY","short_pith_number":"pith:LVDEKTVL","canonical_record":{"source":{"id":"1801.07571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:01:07Z","cross_cats_sorted":[],"title_canon_sha256":"72fd7652da7a905078fa6214a2c4538c747e630993c79f8d4a0fbd8a3d9379b9","abstract_canon_sha256":"a1b485a475fa5feae6516b7230468070c8c384c0841f58bd79245cc70c41b508"},"schema_version":"1.0"},"canonical_sha256":"5d46454eab9b6bfa2c418a5f6786d346023933a25d377f55d48af9e8cdea76c0","source":{"kind":"arxiv","id":"1801.07571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07571","created_at":"2026-05-17T23:54:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07571v2","created_at":"2026-05-17T23:54:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07571","created_at":"2026-05-17T23:54:11Z"},{"alias_kind":"pith_short_12","alias_value":"LVDEKTVLTNV7","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LVDEKTVLTNV7ULCB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LVDEKTVL","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LVDEKTVLTNV7ULCBRJPWPBWTIY","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:01:07Z","cross_cats_sorted":[],"title_canon_sha256":"72fd7652da7a905078fa6214a2c4538c747e630993c79f8d4a0fbd8a3d9379b9","abstract_canon_sha256":"a1b485a475fa5feae6516b7230468070c8c384c0841f58bd79245cc70c41b508"},"schema_version":"1.0"},"canonical_sha256":"5d46454eab9b6bfa2c418a5f6786d346023933a25d377f55d48af9e8cdea76c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:11.622625Z","signature_b64":"jerPNhDX5SJQqVlpmu+60snyzVHiR/tQ8zmFjHspuerOlMDyXP6T0P2hE1dwDZEo4X6Y/RLv7HwDiQZCE6rcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d46454eab9b6bfa2c418a5f6786d346023933a25d377f55d48af9e8cdea76c0","last_reissued_at":"2026-05-17T23:54:11.622113Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:11.622113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07571","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-17T23:54:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkirOiHF9Kdz7qaMzQQy8OUFV3h4q6VSZG4SsPlHeqwrqhvU01DYK9Ikysqxh2DIyx7F7Ml4JQ2K3/MFeaEVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:47:26.514937Z"},"content_sha256":"5bfe6934b47f093167fa023877be7d8bd77ed9eade8f4a4923d50ae196e13a3a","schema_version":"1.0","event_id":"sha256:5bfe6934b47f093167fa023877be7d8bd77ed9eade8f4a4923d50ae196e13a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LVDEKTVLTNV7ULCBRJPWPBWTIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Optimization of Bit and Power Loading for Multicarrier Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ebrahim Bedeer, Kareem E. Baddour, Mohamed H. Ahmed, Octavia A. Dobre","submitted_at":"2018-01-12T17:01:07Z","abstract_excerpt":"In this letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient $\\alpha$, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial $\\alpha$ causes the transmit power not to violate the power constraint; otherwise, a bisection search is used to find the appropriate $\\alpha$. Close"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07571","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-17T23:54:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSQ19/vWmkZVeAjkCY58vdlW17RlV/HHa2xyCxUtQTZLqi9rivXKkO3lpJTOV9pTfIKZbZPOEf1Gcn6+MA5wBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:47:26.515271Z"},"content_sha256":"0c061c95d61bb87818a8c48ae1b9b726c054727913d2eb7dcd654699d60aa558","schema_version":"1.0","event_id":"sha256:0c061c95d61bb87818a8c48ae1b9b726c054727913d2eb7dcd654699d60aa558"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/bundle.json","state_url":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/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-29T08:47:26Z","links":{"resolver":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY","bundle":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/bundle.json","state":"https://pith.science/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVDEKTVLTNV7ULCBRJPWPBWTIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LVDEKTVLTNV7ULCBRJPWPBWTIY","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":"a1b485a475fa5feae6516b7230468070c8c384c0841f58bd79245cc70c41b508","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:01:07Z","title_canon_sha256":"72fd7652da7a905078fa6214a2c4538c747e630993c79f8d4a0fbd8a3d9379b9"},"schema_version":"1.0","source":{"id":"1801.07571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07571","created_at":"2026-05-17T23:54:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07571v2","created_at":"2026-05-17T23:54:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07571","created_at":"2026-05-17T23:54:11Z"},{"alias_kind":"pith_short_12","alias_value":"LVDEKTVLTNV7","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LVDEKTVLTNV7ULCB","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LVDEKTVL","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:0c061c95d61bb87818a8c48ae1b9b726c054727913d2eb7dcd654699d60aa558","target":"graph","created_at":"2026-05-17T23:54:11Z","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 letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient $\\alpha$, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial $\\alpha$ causes the transmit power not to violate the power constraint; otherwise, a bisection search is used to find the appropriate $\\alpha$. Close","authors_text":"Ebrahim Bedeer, Kareem E. Baddour, Mohamed H. Ahmed, Octavia A. Dobre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:01:07Z","title":"Joint Optimization of Bit and Power Loading for Multicarrier Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07571","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:5bfe6934b47f093167fa023877be7d8bd77ed9eade8f4a4923d50ae196e13a3a","target":"record","created_at":"2026-05-17T23:54:11Z","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":"a1b485a475fa5feae6516b7230468070c8c384c0841f58bd79245cc70c41b508","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:01:07Z","title_canon_sha256":"72fd7652da7a905078fa6214a2c4538c747e630993c79f8d4a0fbd8a3d9379b9"},"schema_version":"1.0","source":{"id":"1801.07571","kind":"arxiv","version":2}},"canonical_sha256":"5d46454eab9b6bfa2c418a5f6786d346023933a25d377f55d48af9e8cdea76c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d46454eab9b6bfa2c418a5f6786d346023933a25d377f55d48af9e8cdea76c0","first_computed_at":"2026-05-17T23:54:11.622113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:11.622113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jerPNhDX5SJQqVlpmu+60snyzVHiR/tQ8zmFjHspuerOlMDyXP6T0P2hE1dwDZEo4X6Y/RLv7HwDiQZCE6rcBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:11.622625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bfe6934b47f093167fa023877be7d8bd77ed9eade8f4a4923d50ae196e13a3a","sha256:0c061c95d61bb87818a8c48ae1b9b726c054727913d2eb7dcd654699d60aa558"],"state_sha256":"cabf2771bed10f4a45e9cb04b9ebde881e4b64312fb6b21a9bc2ce28e060c851"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+U+dlHeuuYT8o1+wmTVgtzBGkW62ifejMpQBlOb/waaP/K4UjQI48EvNbcQadFm2gOEPHuFAmX85h32ORgzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:47:26.517085Z","bundle_sha256":"ea743959d19887edb7423e032faf3a4fd0b085396ccdf65f3ae2203e95dc8e1e"}}