{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CBEUCLMAMYOXE44HYCZIHQD4A5","short_pith_number":"pith:CBEUCLMA","canonical_record":{"source":{"id":"1112.2372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-11T16:24:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f0e9cdf2e38080979c348bb7380182dfdb4779b82704461bcb0b92b15cba5503","abstract_canon_sha256":"938553901b0a27226c610da76ba171272dbaa80d6e9882692213a7f5f68c9c56"},"schema_version":"1.0"},"canonical_sha256":"1049412d80661d727387c0b283c07c076e0f0dd090aa57511c38f55c7d81d5ca","source":{"kind":"arxiv","id":"1112.2372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2372","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2372v1","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2372","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"CBEUCLMAMYOX","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CBEUCLMAMYOXE44H","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CBEUCLMA","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CBEUCLMAMYOXE44HYCZIHQD4A5","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-11T16:24:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f0e9cdf2e38080979c348bb7380182dfdb4779b82704461bcb0b92b15cba5503","abstract_canon_sha256":"938553901b0a27226c610da76ba171272dbaa80d6e9882692213a7f5f68c9c56"},"schema_version":"1.0"},"canonical_sha256":"1049412d80661d727387c0b283c07c076e0f0dd090aa57511c38f55c7d81d5ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:34.628186Z","signature_b64":"1E+cP7WhAI+wdxu1ur/Ca/4FS9ah8JpZfeE/TZP5R8Vcfv0VySQ0R6jiinBgd6Ez8plTW4QAzJw4UZAxTHygDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1049412d80661d727387c0b283c07c076e0f0dd090aa57511c38f55c7d81d5ca","last_reissued_at":"2026-05-18T04:06:34.627641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:34.627641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2372","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-18T04:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5CwMb7bBSYChHL61uJWeoPa+qHyhEeFQ6cK2V8W41KHO0wXumwmG2Z93/XDL1njfMiSc7l3KHssy8bKgeTOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:23.766157Z"},"content_sha256":"cd63bf03764ee266a3069943be9537ec0299db22d4ce6d1280931a6e7fe4b6b7","schema_version":"1.0","event_id":"sha256:cd63bf03764ee266a3069943be9537ec0299db22d4ce6d1280931a6e7fe4b6b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CBEUCLMAMYOXE44HYCZIHQD4A5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Tractability Aspects of Optimal Resource Allocation in OFDMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Chin Keong Ho, Di Yuan, Jingon Joung, Sumei Sun","submitted_at":"2011-12-11T16:24:25Z","abstract_excerpt":"Joint channel and rate allocation with power minimization in orthogonal frequency-division multiple access (OFDMA) has attracted extensive attention. Most of the research has dealt with the development of sub-optimal but low-complexity algorithms. In this paper, the contributions comprise new insights from revisiting tractability aspects of computing optimum. Previous complexity analyses have been limited by assumptions of fixed power on each subcarrier, or power-rate functions that locally grow arbitrarily fast. The analysis under the former assumption does not generalize to problem tractabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2372","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-18T04:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZmXw+zsYcBz9ds3obmZLo/CFnl158hwheNZvhNusZgqq/T7aryu6RRxYdBSMG83Oh6MZ3xzkgMgWlSrkEX1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:23.766542Z"},"content_sha256":"22aa78c9ab108048b28e0f4ab01d9700b0d7938cee9aeb5d75de060db8106305","schema_version":"1.0","event_id":"sha256:22aa78c9ab108048b28e0f4ab01d9700b0d7938cee9aeb5d75de060db8106305"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBEUCLMAMYOXE44HYCZIHQD4A5/bundle.json","state_url":"https://pith.science/pith/CBEUCLMAMYOXE44HYCZIHQD4A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBEUCLMAMYOXE44HYCZIHQD4A5/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-26T15:48:23Z","links":{"resolver":"https://pith.science/pith/CBEUCLMAMYOXE44HYCZIHQD4A5","bundle":"https://pith.science/pith/CBEUCLMAMYOXE44HYCZIHQD4A5/bundle.json","state":"https://pith.science/pith/CBEUCLMAMYOXE44HYCZIHQD4A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBEUCLMAMYOXE44HYCZIHQD4A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CBEUCLMAMYOXE44HYCZIHQD4A5","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":"938553901b0a27226c610da76ba171272dbaa80d6e9882692213a7f5f68c9c56","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-11T16:24:25Z","title_canon_sha256":"f0e9cdf2e38080979c348bb7380182dfdb4779b82704461bcb0b92b15cba5503"},"schema_version":"1.0","source":{"id":"1112.2372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2372","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2372v1","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2372","created_at":"2026-05-18T04:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"CBEUCLMAMYOX","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CBEUCLMAMYOXE44H","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CBEUCLMA","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:22aa78c9ab108048b28e0f4ab01d9700b0d7938cee9aeb5d75de060db8106305","target":"graph","created_at":"2026-05-18T04:06:34Z","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":"Joint channel and rate allocation with power minimization in orthogonal frequency-division multiple access (OFDMA) has attracted extensive attention. Most of the research has dealt with the development of sub-optimal but low-complexity algorithms. In this paper, the contributions comprise new insights from revisiting tractability aspects of computing optimum. Previous complexity analyses have been limited by assumptions of fixed power on each subcarrier, or power-rate functions that locally grow arbitrarily fast. The analysis under the former assumption does not generalize to problem tractabil","authors_text":"Chin Keong Ho, Di Yuan, Jingon Joung, Sumei Sun","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-11T16:24:25Z","title":"On Tractability Aspects of Optimal Resource Allocation in OFDMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2372","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:cd63bf03764ee266a3069943be9537ec0299db22d4ce6d1280931a6e7fe4b6b7","target":"record","created_at":"2026-05-18T04:06:34Z","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":"938553901b0a27226c610da76ba171272dbaa80d6e9882692213a7f5f68c9c56","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-11T16:24:25Z","title_canon_sha256":"f0e9cdf2e38080979c348bb7380182dfdb4779b82704461bcb0b92b15cba5503"},"schema_version":"1.0","source":{"id":"1112.2372","kind":"arxiv","version":1}},"canonical_sha256":"1049412d80661d727387c0b283c07c076e0f0dd090aa57511c38f55c7d81d5ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1049412d80661d727387c0b283c07c076e0f0dd090aa57511c38f55c7d81d5ca","first_computed_at":"2026-05-18T04:06:34.627641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:34.627641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1E+cP7WhAI+wdxu1ur/Ca/4FS9ah8JpZfeE/TZP5R8Vcfv0VySQ0R6jiinBgd6Ez8plTW4QAzJw4UZAxTHygDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:34.628186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd63bf03764ee266a3069943be9537ec0299db22d4ce6d1280931a6e7fe4b6b7","sha256:22aa78c9ab108048b28e0f4ab01d9700b0d7938cee9aeb5d75de060db8106305"],"state_sha256":"118e379fe49c0035bcb7c3e9c45abc03dda5c42ee4650fbcd95f375e3c5413be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWGLApBjQ++wfmC5JM61Od0jcIm1lAjTl5yqN4FdSl8UCLKRK1H1dC8weDWihLqvRNf/JwUdZz+Lhk8k/P6aDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:48:23.768695Z","bundle_sha256":"90121d92a213d91cd5e5c93aa4891baf2ef622e28836e1024054bd9a624ab84e"}}