{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O6ZBNR2HJCCYG5SV3C6DODFCRL","short_pith_number":"pith:O6ZBNR2H","schema_version":"1.0","canonical_sha256":"77b216c7474885837655d8bc370ca28ae56fd9c17d0af90bfea05454f5c6d0bd","source":{"kind":"arxiv","id":"1602.08469","version":2},"attestation_state":"computed","paper":{"title":"A Performance Study of Energy Minimization for Interleaved and Localized FDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Di Yuan, Lei Lei, Lei You","submitted_at":"2016-02-26T20:22:47Z","abstract_excerpt":"Optimal channel allocation is a key performance engineering aspect in single-carrier frequency-division multiple access (SC-FDMA). It is of significance to consider minimum sum power (Min-Power), subject to meeting specified user's demand, since mobile users typically employ battery-powered handsets. In this paper, we prove that Min-Power is polynomial-time solvable for interleaved SC-FDMA (IFDMA). Then we propose a channel allocation algorithm for IFDMA, which is guaranteed to achieve global optimum in polynomial time. We numerically compare the proposed algorithm with optimal localized SC-FD"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.08469","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T20:22:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"818c4c3147552b5002d668dde0474a7af474210d06e324b03653694add92c2d2","abstract_canon_sha256":"875bffab28745d795852290b8c5936b3fa1081caa9157a2c08d1c9dec1886e44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:53.710751Z","signature_b64":"wx+qtP8v1vTVWT/GDx3wWXcXTjmtS9w1HAJ1NHq/oDj0GcjKkKt6c10zwn3F1L3UPlMFrilrMBEsIYnEn9ijAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77b216c7474885837655d8bc370ca28ae56fd9c17d0af90bfea05454f5c6d0bd","last_reissued_at":"2026-05-18T00:41:53.710064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:53.710064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Performance Study of Energy Minimization for Interleaved and Localized FDMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Di Yuan, Lei Lei, Lei You","submitted_at":"2016-02-26T20:22:47Z","abstract_excerpt":"Optimal channel allocation is a key performance engineering aspect in single-carrier frequency-division multiple access (SC-FDMA). It is of significance to consider minimum sum power (Min-Power), subject to meeting specified user's demand, since mobile users typically employ battery-powered handsets. In this paper, we prove that Min-Power is polynomial-time solvable for interleaved SC-FDMA (IFDMA). Then we propose a channel allocation algorithm for IFDMA, which is guaranteed to achieve global optimum in polynomial time. We numerically compare the proposed algorithm with optimal localized SC-FD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08469","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.08469","created_at":"2026-05-18T00:41:53.710148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08469v2","created_at":"2026-05-18T00:41:53.710148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08469","created_at":"2026-05-18T00:41:53.710148+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6ZBNR2HJCCY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6ZBNR2HJCCYG5SV","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6ZBNR2H","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL","json":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL.json","graph_json":"https://pith.science/api/pith-number/O6ZBNR2HJCCYG5SV3C6DODFCRL/graph.json","events_json":"https://pith.science/api/pith-number/O6ZBNR2HJCCYG5SV3C6DODFCRL/events.json","paper":"https://pith.science/paper/O6ZBNR2H"},"agent_actions":{"view_html":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL","download_json":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL.json","view_paper":"https://pith.science/paper/O6ZBNR2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08469&json=true","fetch_graph":"https://pith.science/api/pith-number/O6ZBNR2HJCCYG5SV3C6DODFCRL/graph.json","fetch_events":"https://pith.science/api/pith-number/O6ZBNR2HJCCYG5SV3C6DODFCRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/action/storage_attestation","attest_author":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/action/author_attestation","sign_citation":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/action/citation_signature","submit_replication":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/action/replication_record"}},"created_at":"2026-05-18T00:41:53.710148+00:00","updated_at":"2026-05-18T00:41:53.710148+00:00"}