{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:N76VW5RQ64XULLYSR6DO5GWJGE","short_pith_number":"pith:N76VW5RQ","canonical_record":{"source":{"id":"1009.4268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T04:38:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4044ae9a68ab27bf1a39288e00fd7ad8fadc33982f0dd7d4a93a1fa31d389675","abstract_canon_sha256":"574ab8747b590f667585fbaaabc241b3d16f32d84e7b102715e593a092c46b37"},"schema_version":"1.0"},"canonical_sha256":"6ffd5b7630f72f45af128f86ee9ac9311bca9208fdb29390929bafd801c3a72d","source":{"kind":"arxiv","id":"1009.4268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4268","created_at":"2026-05-18T02:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4268v2","created_at":"2026-05-18T02:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4268","created_at":"2026-05-18T02:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"N76VW5RQ64XU","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N76VW5RQ64XULLYS","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N76VW5RQ","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:N76VW5RQ64XULLYSR6DO5GWJGE","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T04:38:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4044ae9a68ab27bf1a39288e00fd7ad8fadc33982f0dd7d4a93a1fa31d389675","abstract_canon_sha256":"574ab8747b590f667585fbaaabc241b3d16f32d84e7b102715e593a092c46b37"},"schema_version":"1.0"},"canonical_sha256":"6ffd5b7630f72f45af128f86ee9ac9311bca9208fdb29390929bafd801c3a72d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:18.876031Z","signature_b64":"xvo84S6OUHehodQoIGozuEBLl7SbsQm/KNYF/hqv0zVCrnR4Z3hJlY7+3dc82GsbcpEthNVwIE1HjTWyy+nxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ffd5b7630f72f45af128f86ee9ac9311bca9208fdb29390929bafd801c3a72d","last_reissued_at":"2026-05-18T02:05:18.872931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:18.872931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4268","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-18T02:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+93ZT88+kb97VQmqf8WhlTBrcSCEUXbJYhqfngzgoW2A1ltT3mgncwnzypPt19iiGjukLm1gaEOWV8a0l/UDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:24:20.267903Z"},"content_sha256":"702e75bec3435dc04779627893ec8a0de49e50b800d7bdbc413232c949638872","schema_version":"1.0","event_id":"sha256:702e75bec3435dc04779627893ec8a0de49e50b800d7bdbc413232c949638872"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:N76VW5RQ64XULLYSR6DO5GWJGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank-Constrained Schur-Convex Optimization with Multiple Trace/Log-Det Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Yu, Vincent K. N. Lau","submitted_at":"2010-09-22T04:38:20Z","abstract_excerpt":"Rank-constrained optimization problems have received an increasing intensity of interest recently, because many optimization problems in communications and signal processing applications can be cast into a rank-constrained optimization problem. However, due to the non-convex nature of rank constraints, a systematic solution to general rank-constrained problems has remained open for a long time. In this paper, we focus on a rank-constrained optimization problem with a Schur-convex/concave objective function and multiple trace/logdeterminant constraints. We first derive a structural result on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4268","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-18T02:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dpUHdBde93UqkH/Q3Klm0YafapocFybMAUl+9oMLGorEGOqa9T0ZiR+os3t/AF6T0Sj+QNTUyA5lQ2V8tQYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:24:20.268272Z"},"content_sha256":"8f827eee4404723caee7f0e6018406a98ba060b216f0280bdc4c7edd8b7949e8","schema_version":"1.0","event_id":"sha256:8f827eee4404723caee7f0e6018406a98ba060b216f0280bdc4c7edd8b7949e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N76VW5RQ64XULLYSR6DO5GWJGE/bundle.json","state_url":"https://pith.science/pith/N76VW5RQ64XULLYSR6DO5GWJGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N76VW5RQ64XULLYSR6DO5GWJGE/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-03T19:24:20Z","links":{"resolver":"https://pith.science/pith/N76VW5RQ64XULLYSR6DO5GWJGE","bundle":"https://pith.science/pith/N76VW5RQ64XULLYSR6DO5GWJGE/bundle.json","state":"https://pith.science/pith/N76VW5RQ64XULLYSR6DO5GWJGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N76VW5RQ64XULLYSR6DO5GWJGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:N76VW5RQ64XULLYSR6DO5GWJGE","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":"574ab8747b590f667585fbaaabc241b3d16f32d84e7b102715e593a092c46b37","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T04:38:20Z","title_canon_sha256":"4044ae9a68ab27bf1a39288e00fd7ad8fadc33982f0dd7d4a93a1fa31d389675"},"schema_version":"1.0","source":{"id":"1009.4268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4268","created_at":"2026-05-18T02:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4268v2","created_at":"2026-05-18T02:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4268","created_at":"2026-05-18T02:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"N76VW5RQ64XU","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N76VW5RQ64XULLYS","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N76VW5RQ","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:8f827eee4404723caee7f0e6018406a98ba060b216f0280bdc4c7edd8b7949e8","target":"graph","created_at":"2026-05-18T02:05:18Z","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":"Rank-constrained optimization problems have received an increasing intensity of interest recently, because many optimization problems in communications and signal processing applications can be cast into a rank-constrained optimization problem. However, due to the non-convex nature of rank constraints, a systematic solution to general rank-constrained problems has remained open for a long time. In this paper, we focus on a rank-constrained optimization problem with a Schur-convex/concave objective function and multiple trace/logdeterminant constraints. We first derive a structural result on th","authors_text":"Hao Yu, Vincent K. N. Lau","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T04:38:20Z","title":"Rank-Constrained Schur-Convex Optimization with Multiple Trace/Log-Det Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4268","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:702e75bec3435dc04779627893ec8a0de49e50b800d7bdbc413232c949638872","target":"record","created_at":"2026-05-18T02:05:18Z","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":"574ab8747b590f667585fbaaabc241b3d16f32d84e7b102715e593a092c46b37","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T04:38:20Z","title_canon_sha256":"4044ae9a68ab27bf1a39288e00fd7ad8fadc33982f0dd7d4a93a1fa31d389675"},"schema_version":"1.0","source":{"id":"1009.4268","kind":"arxiv","version":2}},"canonical_sha256":"6ffd5b7630f72f45af128f86ee9ac9311bca9208fdb29390929bafd801c3a72d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ffd5b7630f72f45af128f86ee9ac9311bca9208fdb29390929bafd801c3a72d","first_computed_at":"2026-05-18T02:05:18.872931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:18.872931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xvo84S6OUHehodQoIGozuEBLl7SbsQm/KNYF/hqv0zVCrnR4Z3hJlY7+3dc82GsbcpEthNVwIE1HjTWyy+nxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:18.876031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:702e75bec3435dc04779627893ec8a0de49e50b800d7bdbc413232c949638872","sha256:8f827eee4404723caee7f0e6018406a98ba060b216f0280bdc4c7edd8b7949e8"],"state_sha256":"7c88ac67fe5859e5e350dcb5084bc5119bdab65a8b7ced12114fa80d378131f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XndNutlV5isstbO/YznHMC+GTiqR2HAINAdiLOg6+y9O21JIUh+PpaYTtJHeHcx/WdGXcdQTOBTXUS45fCKBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:24:20.270462Z","bundle_sha256":"0eb9786c85c12e065d00086674d8f1f1e61c605a027802d2701932c8d4540ba4"}}