{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MGYYNITXEBQSG4H73JZOTJRK3P","short_pith_number":"pith:MGYYNITX","schema_version":"1.0","canonical_sha256":"61b186a27720612370ffda72e9a62adbd4e99a9c545308f8bee27e5000342eb4","source":{"kind":"arxiv","id":"1403.5638","version":1},"attestation_state":"computed","paper":{"title":"Convex separable problems with linear and box constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonio A. D'Amico, Daniel P. Palomar, Luca Sanguinetti","submitted_at":"2014-03-22T10:14:12Z","abstract_excerpt":"In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of iterations. This allows us to bridge the gap between a wide family of power allocation problems of practical interest in signal processing and communications and their efficient implementation in practice."},"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":"1403.5638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-22T10:14:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d05bea6344bbcfa9d25a8a139706b112ca34e447fbbeb4e93739578c88f289b","abstract_canon_sha256":"db0c45144dfbb625bcb6b5b272fcd64bcf58c2dfcf03af32be1016caac202d6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:49.288606Z","signature_b64":"sfjn/U3VPvfzzwDLdMLnT0UFwVWTsNRMdZKlqroIw3GqlQ+Ltba7vh1n2AjC2bH9ZzD6Y3KdLFXdrGp/T91VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b186a27720612370ffda72e9a62adbd4e99a9c545308f8bee27e5000342eb4","last_reissued_at":"2026-05-18T02:55:49.287950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:49.287950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex separable problems with linear and box constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonio A. D'Amico, Daniel P. Palomar, Luca Sanguinetti","submitted_at":"2014-03-22T10:14:12Z","abstract_excerpt":"In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of iterations. This allows us to bridge the gap between a wide family of power allocation problems of practical interest in signal processing and communications and their efficient implementation in practice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5638","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":"1403.5638","created_at":"2026-05-18T02:55:49.288047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5638v1","created_at":"2026-05-18T02:55:49.288047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5638","created_at":"2026-05-18T02:55:49.288047+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGYYNITXEBQS","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGYYNITXEBQSG4H7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGYYNITX","created_at":"2026-05-18T12:28:38.356838+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/MGYYNITXEBQSG4H73JZOTJRK3P","json":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P.json","graph_json":"https://pith.science/api/pith-number/MGYYNITXEBQSG4H73JZOTJRK3P/graph.json","events_json":"https://pith.science/api/pith-number/MGYYNITXEBQSG4H73JZOTJRK3P/events.json","paper":"https://pith.science/paper/MGYYNITX"},"agent_actions":{"view_html":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P","download_json":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P.json","view_paper":"https://pith.science/paper/MGYYNITX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5638&json=true","fetch_graph":"https://pith.science/api/pith-number/MGYYNITXEBQSG4H73JZOTJRK3P/graph.json","fetch_events":"https://pith.science/api/pith-number/MGYYNITXEBQSG4H73JZOTJRK3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P/action/storage_attestation","attest_author":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P/action/author_attestation","sign_citation":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P/action/citation_signature","submit_replication":"https://pith.science/pith/MGYYNITXEBQSG4H73JZOTJRK3P/action/replication_record"}},"created_at":"2026-05-18T02:55:49.288047+00:00","updated_at":"2026-05-18T02:55:49.288047+00:00"}