{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6OJOGAKXXKG3Q7VG7PUX44R4LO","short_pith_number":"pith:6OJOGAKX","schema_version":"1.0","canonical_sha256":"f392e30157ba8db87ea6fbe97e723c5baee9dfbc9dd2c94c2c8b840ce45c7426","source":{"kind":"arxiv","id":"1610.02181","version":1},"attestation_state":"computed","paper":{"title":"An Algebraic Approach to a Class of Rank-Constrained Semi-Definite Programs With Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Matthew W. Morency, Sergiy A. Vorobyov","submitted_at":"2016-10-07T08:37:30Z","abstract_excerpt":"A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink beamforming design in MIMO communications, generalized sidelobe canceller design, phase retrieval, etc., is presented. The essence of the approach is the use of underlying algebraic structure enforced in such problems by other practical constraints such as, for example, null shaping constraint. According to this approach, instead of relaxing the non-convex ran"},"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":"1610.02181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-07T08:37:30Z","cross_cats_sorted":["math.AG","math.IT"],"title_canon_sha256":"76857d9075ebdd51df0b74fad5c82fe159d094b0353376b8ce20df9f895f69e3","abstract_canon_sha256":"b2d76df4d89e7a1b688aaadc3f3d3e446dfd878c1b9614f3f228776e95a59f4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:58.172967Z","signature_b64":"2kA+4cumY23uL4jMk5ez3Hlmx0Iu4YXwpI/xHGxN56kpThq2aNF7Om6T62NV8DrUwzWgDbadzeQ7Hy8N7mu1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f392e30157ba8db87ea6fbe97e723c5baee9dfbc9dd2c94c2c8b840ce45c7426","last_reissued_at":"2026-05-18T01:02:58.172243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:58.172243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algebraic Approach to a Class of Rank-Constrained Semi-Definite Programs With Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Matthew W. Morency, Sergiy A. Vorobyov","submitted_at":"2016-10-07T08:37:30Z","abstract_excerpt":"A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink beamforming design in MIMO communications, generalized sidelobe canceller design, phase retrieval, etc., is presented. The essence of the approach is the use of underlying algebraic structure enforced in such problems by other practical constraints such as, for example, null shaping constraint. According to this approach, instead of relaxing the non-convex ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02181","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":"1610.02181","created_at":"2026-05-18T01:02:58.172355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02181v1","created_at":"2026-05-18T01:02:58.172355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02181","created_at":"2026-05-18T01:02:58.172355+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OJOGAKXXKG3","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OJOGAKXXKG3Q7VG","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OJOGAKX","created_at":"2026-05-18T12:30:01.593930+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/6OJOGAKXXKG3Q7VG7PUX44R4LO","json":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO.json","graph_json":"https://pith.science/api/pith-number/6OJOGAKXXKG3Q7VG7PUX44R4LO/graph.json","events_json":"https://pith.science/api/pith-number/6OJOGAKXXKG3Q7VG7PUX44R4LO/events.json","paper":"https://pith.science/paper/6OJOGAKX"},"agent_actions":{"view_html":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO","download_json":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO.json","view_paper":"https://pith.science/paper/6OJOGAKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02181&json=true","fetch_graph":"https://pith.science/api/pith-number/6OJOGAKXXKG3Q7VG7PUX44R4LO/graph.json","fetch_events":"https://pith.science/api/pith-number/6OJOGAKXXKG3Q7VG7PUX44R4LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO/action/storage_attestation","attest_author":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO/action/author_attestation","sign_citation":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO/action/citation_signature","submit_replication":"https://pith.science/pith/6OJOGAKXXKG3Q7VG7PUX44R4LO/action/replication_record"}},"created_at":"2026-05-18T01:02:58.172355+00:00","updated_at":"2026-05-18T01:02:58.172355+00:00"}