{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XMPVOOZ3SCEJYOJQX6WU26MYEH","short_pith_number":"pith:XMPVOOZ3","canonical_record":{"source":{"id":"1012.4874","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.NI","submitted_at":"2010-12-22T03:34:38Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"8bfe5864359dbb2fb7fa0098b52375f8de76ed053f578354acefe4a8c92f2fff","abstract_canon_sha256":"231eb9426e9af0eb774e7da5e3800c4dbe793d8913bfbe63fc0cfd8b440d6b17"},"schema_version":"1.0"},"canonical_sha256":"bb1f573b3b90889c3930bfad4d799821d066e279bcb73ccc2e783f5eb024c2b5","source":{"kind":"arxiv","id":"1012.4874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4874","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4874v1","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4874","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"XMPVOOZ3SCEJ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XMPVOOZ3SCEJYOJQ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XMPVOOZ3","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XMPVOOZ3SCEJYOJQX6WU26MYEH","target":"record","payload":{"canonical_record":{"source":{"id":"1012.4874","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.NI","submitted_at":"2010-12-22T03:34:38Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"8bfe5864359dbb2fb7fa0098b52375f8de76ed053f578354acefe4a8c92f2fff","abstract_canon_sha256":"231eb9426e9af0eb774e7da5e3800c4dbe793d8913bfbe63fc0cfd8b440d6b17"},"schema_version":"1.0"},"canonical_sha256":"bb1f573b3b90889c3930bfad4d799821d066e279bcb73ccc2e783f5eb024c2b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:06.633428Z","signature_b64":"GMjIX9DhTLbuTw+MapWrUxM7XXgAaHo+H8d73RoAup7YBXJaPfXSdSLXSSbEVMBmq5ZoRmFJQpHc/Zv3dc7uCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb1f573b3b90889c3930bfad4d799821d066e279bcb73ccc2e783f5eb024c2b5","last_reissued_at":"2026-05-18T02:23:06.632905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:06.632905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.4874","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-18T02:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pG6N0EKlfyd6JhZa+m2CGWihW9jss1nMbmKD44hn49vn9lRuDyPhsJxwXAnynC1b4rZzzK1/BOHsTiDs0LRMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:12:41.246905Z"},"content_sha256":"3adff80ca4269ec792f862bfbe1828ead345c4f96252f0450d88e98a7264b238","schema_version":"1.0","event_id":"sha256:3adff80ca4269ec792f862bfbe1828ead345c4f96252f0450d88e98a7264b238"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XMPVOOZ3SCEJYOJQX6WU26MYEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.NI","authors_text":"Jianwei Huang, Liang Chen, Minghua Chen, Xiaoxin Zhang, Yuping Zhao","submitted_at":"2010-12-22T03:34:38Z","abstract_excerpt":"Orthogonal Frequency Division Multiplexing (OFDM) is the key component of many emerging broadband wireless access standards. The resource allocation in OFDM uplink, however, is challenging due to heterogeneity of users' Quality of Service requirements, channel conditions, and individual resource constraints. We formulate the resource allocation problem as a non-strictly convex optimization problem, which typically has multiple global optimal solutions. We then propose a reduced primal-dual algorithm, which is distributed, low in computational complexity, and probably globally convergent to a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4874","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-18T02:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4Wx5CzFLiGlvzkmbu7s7k3UrWXlhbSKcIJk4hoqzy4GVWiyYf7k8ZnV/NcDBhi52texXhd3J0Xd/jP4SdkcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:12:41.247313Z"},"content_sha256":"149790f011a838a4d303612feb6453b2bfeb0a1e91985cadfbbc4a728e7544e4","schema_version":"1.0","event_id":"sha256:149790f011a838a4d303612feb6453b2bfeb0a1e91985cadfbbc4a728e7544e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMPVOOZ3SCEJYOJQX6WU26MYEH/bundle.json","state_url":"https://pith.science/pith/XMPVOOZ3SCEJYOJQX6WU26MYEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMPVOOZ3SCEJYOJQX6WU26MYEH/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-05T21:12:41Z","links":{"resolver":"https://pith.science/pith/XMPVOOZ3SCEJYOJQX6WU26MYEH","bundle":"https://pith.science/pith/XMPVOOZ3SCEJYOJQX6WU26MYEH/bundle.json","state":"https://pith.science/pith/XMPVOOZ3SCEJYOJQX6WU26MYEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMPVOOZ3SCEJYOJQX6WU26MYEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XMPVOOZ3SCEJYOJQX6WU26MYEH","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":"231eb9426e9af0eb774e7da5e3800c4dbe793d8913bfbe63fc0cfd8b440d6b17","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.NI","submitted_at":"2010-12-22T03:34:38Z","title_canon_sha256":"8bfe5864359dbb2fb7fa0098b52375f8de76ed053f578354acefe4a8c92f2fff"},"schema_version":"1.0","source":{"id":"1012.4874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4874","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4874v1","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4874","created_at":"2026-05-18T02:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"XMPVOOZ3SCEJ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XMPVOOZ3SCEJYOJQ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XMPVOOZ3","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:149790f011a838a4d303612feb6453b2bfeb0a1e91985cadfbbc4a728e7544e4","target":"graph","created_at":"2026-05-18T02:23:06Z","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":"Orthogonal Frequency Division Multiplexing (OFDM) is the key component of many emerging broadband wireless access standards. The resource allocation in OFDM uplink, however, is challenging due to heterogeneity of users' Quality of Service requirements, channel conditions, and individual resource constraints. We formulate the resource allocation problem as a non-strictly convex optimization problem, which typically has multiple global optimal solutions. We then propose a reduced primal-dual algorithm, which is distributed, low in computational complexity, and probably globally convergent to a g","authors_text":"Jianwei Huang, Liang Chen, Minghua Chen, Xiaoxin Zhang, Yuping Zhao","cross_cats":["cs.CC","cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.NI","submitted_at":"2010-12-22T03:34:38Z","title":"Distributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4874","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:3adff80ca4269ec792f862bfbe1828ead345c4f96252f0450d88e98a7264b238","target":"record","created_at":"2026-05-18T02:23:06Z","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":"231eb9426e9af0eb774e7da5e3800c4dbe793d8913bfbe63fc0cfd8b440d6b17","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.NI","submitted_at":"2010-12-22T03:34:38Z","title_canon_sha256":"8bfe5864359dbb2fb7fa0098b52375f8de76ed053f578354acefe4a8c92f2fff"},"schema_version":"1.0","source":{"id":"1012.4874","kind":"arxiv","version":1}},"canonical_sha256":"bb1f573b3b90889c3930bfad4d799821d066e279bcb73ccc2e783f5eb024c2b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb1f573b3b90889c3930bfad4d799821d066e279bcb73ccc2e783f5eb024c2b5","first_computed_at":"2026-05-18T02:23:06.632905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:06.632905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMjIX9DhTLbuTw+MapWrUxM7XXgAaHo+H8d73RoAup7YBXJaPfXSdSLXSSbEVMBmq5ZoRmFJQpHc/Zv3dc7uCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:06.633428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3adff80ca4269ec792f862bfbe1828ead345c4f96252f0450d88e98a7264b238","sha256:149790f011a838a4d303612feb6453b2bfeb0a1e91985cadfbbc4a728e7544e4"],"state_sha256":"970a15a9abf9cbf594a28a8374b8866844143b2f17b62c37cc72eb9d1d1253ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oTP4TqDOTOEqvz5pMl73ugF6VnTyRP0+USPr1ZZrBnUGzkxlMhV98qXZmPjG+suQWLqGb7e0KIu6KUkALbgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:12:41.250213Z","bundle_sha256":"686c1c0d29ca6a261653600a3c5399fb015a4ba12bcc9aa526e6b4c600849310"}}