{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZKLGKWEDDZTJEN673TALRBCIRS","short_pith_number":"pith:ZKLGKWED","canonical_record":{"source":{"id":"1212.3624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-14T21:45:46Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"1a069a37ce9c8ccb983b80783bfb2814a34e2a8ec970468eabcbc68c443a2b3a","abstract_canon_sha256":"5bf54c53452dfdb6b7ced8f6c090b42f54c03e920886325ddc039a3e3ae1c6c9"},"schema_version":"1.0"},"canonical_sha256":"ca966558831e669237dfdcc0b884488cb22ad221ac9b3a8bbb75a633efa7e7db","source":{"kind":"arxiv","id":"1212.3624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3624","created_at":"2026-05-18T01:52:38Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3624v1","created_at":"2026-05-18T01:52:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3624","created_at":"2026-05-18T01:52:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZKLGKWEDDZTJ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZKLGKWEDDZTJEN67","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZKLGKWED","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZKLGKWEDDZTJEN673TALRBCIRS","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-14T21:45:46Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"1a069a37ce9c8ccb983b80783bfb2814a34e2a8ec970468eabcbc68c443a2b3a","abstract_canon_sha256":"5bf54c53452dfdb6b7ced8f6c090b42f54c03e920886325ddc039a3e3ae1c6c9"},"schema_version":"1.0"},"canonical_sha256":"ca966558831e669237dfdcc0b884488cb22ad221ac9b3a8bbb75a633efa7e7db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:52:38.005884Z","signature_b64":"jFIG9SEUMkhZVjGaZNDrUv3DCIHCORrP3ksquqK3q9WdWElqfUdzL7eHsQi3RiNL7r3r+rL442SyGGNAOd2XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca966558831e669237dfdcc0b884488cb22ad221ac9b3a8bbb75a633efa7e7db","last_reissued_at":"2026-05-18T01:52:38.005169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:52:38.005169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3624","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:52:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNaIdrGHTCCOO6McSFFw0HAJL+SLm1qgvjXflVTxZpspQx7/m/XK0Tylzo5+VF4nzYi8EdU5me2YyeOZRK6YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:05:45.300910Z"},"content_sha256":"1acff28c7fedbb3d3b5b6bea14aad2b80901f8db65e1f6b0921ebd5e26364d3e","schema_version":"1.0","event_id":"sha256:1acff28c7fedbb3d3b5b6bea14aad2b80901f8db65e1f6b0921ebd5e26364d3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZKLGKWEDDZTJEN673TALRBCIRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Adaptive Beamforming for General-Rank Signal Model with Positive Semi-Definite Constraint via POTDC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Arash Khabbazibasmenj, Sergiy A. Vorobyov","submitted_at":"2012-12-14T21:45:46Z","abstract_excerpt":"The robust adaptive beamforming (RAB) problem for general-rank signal model with an additional positive semi-definite constraint is considered. Using the principle of the worst-case performance optimization, such RAB problem leads to a difference-of-convex functions (DC) optimization problem. The existing approaches for solving the resulted non-convex DC problem are based on approximations and find only suboptimal solutions. Here we solve the non-convex DC problem rigorously and give arguments suggesting that the solution is globally optimal. Particularly, we rewrite the problem as the minimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3624","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:52:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bm700WX3FGz+lPxhctMZXLEZnVJygsIx87SO3ZNQhoiQJF3jktffhlQkPEJgSb468sU5w8NuxtCizLfGKSE+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:05:45.301634Z"},"content_sha256":"cad05df4f6f802cbf39ab6fcfd569cfb0ddedefba636b7bf4a611da5141d2f75","schema_version":"1.0","event_id":"sha256:cad05df4f6f802cbf39ab6fcfd569cfb0ddedefba636b7bf4a611da5141d2f75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKLGKWEDDZTJEN673TALRBCIRS/bundle.json","state_url":"https://pith.science/pith/ZKLGKWEDDZTJEN673TALRBCIRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKLGKWEDDZTJEN673TALRBCIRS/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-09T05:05:45Z","links":{"resolver":"https://pith.science/pith/ZKLGKWEDDZTJEN673TALRBCIRS","bundle":"https://pith.science/pith/ZKLGKWEDDZTJEN673TALRBCIRS/bundle.json","state":"https://pith.science/pith/ZKLGKWEDDZTJEN673TALRBCIRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKLGKWEDDZTJEN673TALRBCIRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZKLGKWEDDZTJEN673TALRBCIRS","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":"5bf54c53452dfdb6b7ced8f6c090b42f54c03e920886325ddc039a3e3ae1c6c9","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-14T21:45:46Z","title_canon_sha256":"1a069a37ce9c8ccb983b80783bfb2814a34e2a8ec970468eabcbc68c443a2b3a"},"schema_version":"1.0","source":{"id":"1212.3624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3624","created_at":"2026-05-18T01:52:38Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3624v1","created_at":"2026-05-18T01:52:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3624","created_at":"2026-05-18T01:52:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZKLGKWEDDZTJ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZKLGKWEDDZTJEN67","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZKLGKWED","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:cad05df4f6f802cbf39ab6fcfd569cfb0ddedefba636b7bf4a611da5141d2f75","target":"graph","created_at":"2026-05-18T01:52:38Z","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":"The robust adaptive beamforming (RAB) problem for general-rank signal model with an additional positive semi-definite constraint is considered. Using the principle of the worst-case performance optimization, such RAB problem leads to a difference-of-convex functions (DC) optimization problem. The existing approaches for solving the resulted non-convex DC problem are based on approximations and find only suboptimal solutions. Here we solve the non-convex DC problem rigorously and give arguments suggesting that the solution is globally optimal. Particularly, we rewrite the problem as the minimiz","authors_text":"Arash Khabbazibasmenj, Sergiy A. Vorobyov","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-14T21:45:46Z","title":"Robust Adaptive Beamforming for General-Rank Signal Model with Positive Semi-Definite Constraint via POTDC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3624","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:1acff28c7fedbb3d3b5b6bea14aad2b80901f8db65e1f6b0921ebd5e26364d3e","target":"record","created_at":"2026-05-18T01:52:38Z","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":"5bf54c53452dfdb6b7ced8f6c090b42f54c03e920886325ddc039a3e3ae1c6c9","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-14T21:45:46Z","title_canon_sha256":"1a069a37ce9c8ccb983b80783bfb2814a34e2a8ec970468eabcbc68c443a2b3a"},"schema_version":"1.0","source":{"id":"1212.3624","kind":"arxiv","version":1}},"canonical_sha256":"ca966558831e669237dfdcc0b884488cb22ad221ac9b3a8bbb75a633efa7e7db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca966558831e669237dfdcc0b884488cb22ad221ac9b3a8bbb75a633efa7e7db","first_computed_at":"2026-05-18T01:52:38.005169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:52:38.005169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jFIG9SEUMkhZVjGaZNDrUv3DCIHCORrP3ksquqK3q9WdWElqfUdzL7eHsQi3RiNL7r3r+rL442SyGGNAOd2XBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:52:38.005884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1acff28c7fedbb3d3b5b6bea14aad2b80901f8db65e1f6b0921ebd5e26364d3e","sha256:cad05df4f6f802cbf39ab6fcfd569cfb0ddedefba636b7bf4a611da5141d2f75"],"state_sha256":"7bb8d7e6622b11bb8e2a08eca9a6c132cbbed83038a15739afb3046c4856319e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WsCjlj4YdK8EfomkTQg+cdq82YelHmIYQHRFUAW00PYibGTZqhbR+n5MVL3s9+8PAVcdEOYO0UDv1fuzSVNmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:05:45.305457Z","bundle_sha256":"5844c4676b5b58f662cff9f2da01ccea2e71fea65ccc822136b79fa72b2c38f9"}}