{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CVETS6EJMD3BYAKJ5X2QQINIBX","short_pith_number":"pith:CVETS6EJ","schema_version":"1.0","canonical_sha256":"154939788960f61c0149edf50821a80dee8028c82db163c0f9b1fdb3cf5794b1","source":{"kind":"arxiv","id":"1506.00749","version":1},"attestation_state":"computed","paper":{"title":"Large-Scale Convex Optimization for Dense Wireless Cooperative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Brendan O'Donoghue, Jun Zhang, Khaled B. Letaief, Yuanming Shi","submitted_at":"2015-06-02T04:56:57Z","abstract_excerpt":"Convex optimization is a powerful tool for resource allocation and signal processing in wireless networks. As the network density is expected to drastically increase in order to accommodate the exponentially growing mobile data traffic, performance optimization problems are entering a new era characterized by a high dimension and/or a large number of constraints, which poses significant design and computational challenges. In this paper, we present a novel two-stage approach to solve large-scale convex optimization problems for dense wireless cooperative networks, which can effectively detect "},"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":"1506.00749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T04:56:57Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"44efd88984bf77d4155f9c24658b72161e82b729e9df0f0c43b7b7bcc0c33fdc","abstract_canon_sha256":"7b5fa464330e1e73e0b41755fe451fade790036897beddb1cc9d66d3bbf533ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:55.499121Z","signature_b64":"L5S9ao4ibRypZoBhSZsTu3aE8rYdzRLRkr/SIlMgz7TotLSIqPAmXHDfoOATDzREWJRkBaoPohCThOMAV7vIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"154939788960f61c0149edf50821a80dee8028c82db163c0f9b1fdb3cf5794b1","last_reissued_at":"2026-05-18T01:28:55.498517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:55.498517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-Scale Convex Optimization for Dense Wireless Cooperative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Brendan O'Donoghue, Jun Zhang, Khaled B. Letaief, Yuanming Shi","submitted_at":"2015-06-02T04:56:57Z","abstract_excerpt":"Convex optimization is a powerful tool for resource allocation and signal processing in wireless networks. As the network density is expected to drastically increase in order to accommodate the exponentially growing mobile data traffic, performance optimization problems are entering a new era characterized by a high dimension and/or a large number of constraints, which poses significant design and computational challenges. In this paper, we present a novel two-stage approach to solve large-scale convex optimization problems for dense wireless cooperative networks, which can effectively detect "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00749","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00749","created_at":"2026-05-18T01:28:55.498617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00749v1","created_at":"2026-05-18T01:28:55.498617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00749","created_at":"2026-05-18T01:28:55.498617+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVETS6EJMD3B","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVETS6EJMD3BYAKJ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVETS6EJ","created_at":"2026-05-18T12:29:17.054201+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/CVETS6EJMD3BYAKJ5X2QQINIBX","json":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX.json","graph_json":"https://pith.science/api/pith-number/CVETS6EJMD3BYAKJ5X2QQINIBX/graph.json","events_json":"https://pith.science/api/pith-number/CVETS6EJMD3BYAKJ5X2QQINIBX/events.json","paper":"https://pith.science/paper/CVETS6EJ"},"agent_actions":{"view_html":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX","download_json":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX.json","view_paper":"https://pith.science/paper/CVETS6EJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00749&json=true","fetch_graph":"https://pith.science/api/pith-number/CVETS6EJMD3BYAKJ5X2QQINIBX/graph.json","fetch_events":"https://pith.science/api/pith-number/CVETS6EJMD3BYAKJ5X2QQINIBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX/action/storage_attestation","attest_author":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX/action/author_attestation","sign_citation":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX/action/citation_signature","submit_replication":"https://pith.science/pith/CVETS6EJMD3BYAKJ5X2QQINIBX/action/replication_record"}},"created_at":"2026-05-18T01:28:55.498617+00:00","updated_at":"2026-05-18T01:28:55.498617+00:00"}