{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QC2JUD7XG6SDVUYXXWQWHSFEOG","short_pith_number":"pith:QC2JUD7X","canonical_record":{"source":{"id":"1407.4477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T20:01:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eef831aead4994e5630098c45c11982f8f844c2f7bc2e30849b127fbc1b49a79","abstract_canon_sha256":"bffb6e716447ad22ac27b750b6930d4a6289af36a133551e03afc730bed3798f"},"schema_version":"1.0"},"canonical_sha256":"80b49a0ff737a43ad317bda163c8a4718c86ef17f41639d50554d0ef743f139d","source":{"kind":"arxiv","id":"1407.4477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4477","created_at":"2026-05-18T01:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4477v1","created_at":"2026-05-18T01:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4477","created_at":"2026-05-18T01:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"QC2JUD7XG6SD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QC2JUD7XG6SDVUYX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QC2JUD7X","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QC2JUD7XG6SDVUYXXWQWHSFEOG","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T20:01:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eef831aead4994e5630098c45c11982f8f844c2f7bc2e30849b127fbc1b49a79","abstract_canon_sha256":"bffb6e716447ad22ac27b750b6930d4a6289af36a133551e03afc730bed3798f"},"schema_version":"1.0"},"canonical_sha256":"80b49a0ff737a43ad317bda163c8a4718c86ef17f41639d50554d0ef743f139d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:35.966866Z","signature_b64":"7hT60uKkQXjQSd6P9J3ARsE39BIqUBl5nvbPmca0SwQcg/otLqL81MocWVDqgvWuAv8/1jT0AtTRsDcl1Gh2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b49a0ff737a43ad317bda163c8a4718c86ef17f41639d50554d0ef743f139d","last_reissued_at":"2026-05-18T01:42:35.966503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:35.966503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4477","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-18T01:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2avWSBcGS+Z9nqLf8j+zKah8HyD9UCvDq7LjnYFVtM/Y1GI+kYUaSC2iyEuto58FN0eKPsgx4yopDew53VZmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:09:56.164254Z"},"content_sha256":"104fcc03b576e7500439126725482565fe7454bdc53870dfbadcbb57a2bbcfcf","schema_version":"1.0","event_id":"sha256:104fcc03b576e7500439126725482565fe7454bdc53870dfbadcbb57a2bbcfcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QC2JUD7XG6SDVUYXXWQWHSFEOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex separable problems with linear and box constraints in signal processing and communications","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-07-16T20:01:51Z","abstract_excerpt":"In this work, we focus on separable convex optimization problems with box constraints and a set of triangular linear constraints. The solution is given in closed-form as a function of some Lagrange multipliers that can be computed through an iterative procedure in a finite number of steps. Graphical interpretations are given casting valuable insights into the proposed algorithm and allowing to retain some of the intuition spelled out by the water-filling policy. It turns out that it is not only general enough to compute the solution to different instances of the problem at hand but also remark"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4477","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-18T01:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxLxau1xDxwd5/e8tCfuPRKOdXQnL4zlLzdfEUmWe9UNiwWjCdS1JZNRS/vs6bI5t67F5cPY+Bx7s2xj3z6OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:09:56.164619Z"},"content_sha256":"04e301fada4af6bfe9713e08c047e654028a79f67637343e05333bc8fb877cb0","schema_version":"1.0","event_id":"sha256:04e301fada4af6bfe9713e08c047e654028a79f67637343e05333bc8fb877cb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QC2JUD7XG6SDVUYXXWQWHSFEOG/bundle.json","state_url":"https://pith.science/pith/QC2JUD7XG6SDVUYXXWQWHSFEOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QC2JUD7XG6SDVUYXXWQWHSFEOG/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-02T12:09:56Z","links":{"resolver":"https://pith.science/pith/QC2JUD7XG6SDVUYXXWQWHSFEOG","bundle":"https://pith.science/pith/QC2JUD7XG6SDVUYXXWQWHSFEOG/bundle.json","state":"https://pith.science/pith/QC2JUD7XG6SDVUYXXWQWHSFEOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QC2JUD7XG6SDVUYXXWQWHSFEOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QC2JUD7XG6SDVUYXXWQWHSFEOG","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":"bffb6e716447ad22ac27b750b6930d4a6289af36a133551e03afc730bed3798f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T20:01:51Z","title_canon_sha256":"eef831aead4994e5630098c45c11982f8f844c2f7bc2e30849b127fbc1b49a79"},"schema_version":"1.0","source":{"id":"1407.4477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4477","created_at":"2026-05-18T01:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4477v1","created_at":"2026-05-18T01:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4477","created_at":"2026-05-18T01:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"QC2JUD7XG6SD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QC2JUD7XG6SDVUYX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QC2JUD7X","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:04e301fada4af6bfe9713e08c047e654028a79f67637343e05333bc8fb877cb0","target":"graph","created_at":"2026-05-18T01:42:35Z","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":"In this work, we focus on separable convex optimization problems with box constraints and a set of triangular linear constraints. The solution is given in closed-form as a function of some Lagrange multipliers that can be computed through an iterative procedure in a finite number of steps. Graphical interpretations are given casting valuable insights into the proposed algorithm and allowing to retain some of the intuition spelled out by the water-filling policy. It turns out that it is not only general enough to compute the solution to different instances of the problem at hand but also remark","authors_text":"Antonio A. D'Amico, Daniel P. Palomar, Luca Sanguinetti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T20:01:51Z","title":"Convex separable problems with linear and box constraints in signal processing and communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4477","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:104fcc03b576e7500439126725482565fe7454bdc53870dfbadcbb57a2bbcfcf","target":"record","created_at":"2026-05-18T01:42:35Z","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":"bffb6e716447ad22ac27b750b6930d4a6289af36a133551e03afc730bed3798f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-16T20:01:51Z","title_canon_sha256":"eef831aead4994e5630098c45c11982f8f844c2f7bc2e30849b127fbc1b49a79"},"schema_version":"1.0","source":{"id":"1407.4477","kind":"arxiv","version":1}},"canonical_sha256":"80b49a0ff737a43ad317bda163c8a4718c86ef17f41639d50554d0ef743f139d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80b49a0ff737a43ad317bda163c8a4718c86ef17f41639d50554d0ef743f139d","first_computed_at":"2026-05-18T01:42:35.966503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:35.966503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hT60uKkQXjQSd6P9J3ARsE39BIqUBl5nvbPmca0SwQcg/otLqL81MocWVDqgvWuAv8/1jT0AtTRsDcl1Gh2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:35.966866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:104fcc03b576e7500439126725482565fe7454bdc53870dfbadcbb57a2bbcfcf","sha256:04e301fada4af6bfe9713e08c047e654028a79f67637343e05333bc8fb877cb0"],"state_sha256":"2d7f328236926ff624893de06a15db48446dafa89d6eec635213a3adca5c753d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/kp2eXJJj2L8M/Msf6msizV9Y6IP+Lobw0QotJ9jqOx+6Z9NIjMvJpHcAiX9CKWJNxcTjJJKJjBxZMYv4IaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:09:56.166486Z","bundle_sha256":"6a312478ea7497a8e6861fd24377f13b701ce6a7963172b26806c64fe3521ca8"}}