{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O6ZBNR2HJCCYG5SV3C6DODFCRL","short_pith_number":"pith:O6ZBNR2H","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"},"canonical_sha256":"77b216c7474885837655d8bc370ca28ae56fd9c17d0af90bfea05454f5c6d0bd","source":{"kind":"arxiv","id":"1602.08469","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08469","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08469v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08469","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"O6ZBNR2HJCCY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O6ZBNR2HJCCYG5SV","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O6ZBNR2H","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O6ZBNR2HJCCYG5SV3C6DODFCRL","target":"record","payload":{"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"},"canonical_sha256":"77b216c7474885837655d8bc370ca28ae56fd9c17d0af90bfea05454f5c6d0bd","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"},"source_kind":"arxiv","source_id":"1602.08469","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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTsflELsrfngKS44shL9YqtHrWib0bAkQZhJnzkuEPZAYKAj1DPOHPyU4wOL1foIjb+shfru2NqGRgyI8LbQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:22:37.764459Z"},"content_sha256":"43b26b4e5b93fa421c0137fa2dbb4d98905a6fc1ec315dda2ee1c5493be36100","schema_version":"1.0","event_id":"sha256:43b26b4e5b93fa421c0137fa2dbb4d98905a6fc1ec315dda2ee1c5493be36100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O6ZBNR2HJCCYG5SV3C6DODFCRL","target":"graph","payload":{"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"},"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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OU5/KUfcYRNsvwuL3BKbp4jkQJXL9GkM08MEApwUDa+IbY6d3sGtUBZipVmPix24nd3IyGTQ/5UY6MIoM9ySCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:22:37.764817Z"},"content_sha256":"8aa72e2736714cdd0c592b24c750ac2d0d2ba45a38c170caead9182f1eef6573","schema_version":"1.0","event_id":"sha256:8aa72e2736714cdd0c592b24c750ac2d0d2ba45a38c170caead9182f1eef6573"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/bundle.json","state_url":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/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-04T04:22:37Z","links":{"resolver":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL","bundle":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/bundle.json","state":"https://pith.science/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6ZBNR2HJCCYG5SV3C6DODFCRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O6ZBNR2HJCCYG5SV3C6DODFCRL","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":"875bffab28745d795852290b8c5936b3fa1081caa9157a2c08d1c9dec1886e44","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T20:22:47Z","title_canon_sha256":"818c4c3147552b5002d668dde0474a7af474210d06e324b03653694add92c2d2"},"schema_version":"1.0","source":{"id":"1602.08469","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08469","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08469v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08469","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"O6ZBNR2HJCCY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O6ZBNR2HJCCYG5SV","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O6ZBNR2H","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:8aa72e2736714cdd0c592b24c750ac2d0d2ba45a38c170caead9182f1eef6573","target":"graph","created_at":"2026-05-18T00:41:53Z","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":"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","authors_text":"Di Yuan, Lei Lei, Lei You","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T20:22:47Z","title":"A Performance Study of Energy Minimization for Interleaved and Localized FDMA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08469","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:43b26b4e5b93fa421c0137fa2dbb4d98905a6fc1ec315dda2ee1c5493be36100","target":"record","created_at":"2026-05-18T00:41:53Z","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":"875bffab28745d795852290b8c5936b3fa1081caa9157a2c08d1c9dec1886e44","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T20:22:47Z","title_canon_sha256":"818c4c3147552b5002d668dde0474a7af474210d06e324b03653694add92c2d2"},"schema_version":"1.0","source":{"id":"1602.08469","kind":"arxiv","version":2}},"canonical_sha256":"77b216c7474885837655d8bc370ca28ae56fd9c17d0af90bfea05454f5c6d0bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77b216c7474885837655d8bc370ca28ae56fd9c17d0af90bfea05454f5c6d0bd","first_computed_at":"2026-05-18T00:41:53.710064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:53.710064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wx+qtP8v1vTVWT/GDx3wWXcXTjmtS9w1HAJ1NHq/oDj0GcjKkKt6c10zwn3F1L3UPlMFrilrMBEsIYnEn9ijAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:53.710751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08469","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43b26b4e5b93fa421c0137fa2dbb4d98905a6fc1ec315dda2ee1c5493be36100","sha256:8aa72e2736714cdd0c592b24c750ac2d0d2ba45a38c170caead9182f1eef6573"],"state_sha256":"7dadf7345707e2e883dc603e75b7531ab3b2ff92916f4833b7485e139de0d79a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFmvUTUjYcRg+WLmx1cK5llhuXcBG7FmlOZYC8nw7PwXuqMPBOQ9GiaGARMO1kiwSQ/L3ojCbcfZW3qmINXmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:22:37.766776Z","bundle_sha256":"052f1a86254afb8a3cadff34acf92d74d515fed8fe5b41998f5e300a54f63c65"}}