{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YLSQRYJBV6O57K3FA4QE4AIHK6","short_pith_number":"pith:YLSQRYJB","canonical_record":{"source":{"id":"1310.0101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-01T00:06:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88b80ce9d5602434b127a263aff06eee5ea9b993a88f82401221a2d9a95ab4b7","abstract_canon_sha256":"b8686e5817eb8c6fe57617489d19e6289ac46098c6a4564623aa8aff68ba975f"},"schema_version":"1.0"},"canonical_sha256":"c2e508e121af9ddfab6507204e0107579fc2704465b494a14d0ccabb500a398c","source":{"kind":"arxiv","id":"1310.0101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0101","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0101v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0101","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"YLSQRYJBV6O5","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YLSQRYJBV6O57K3F","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YLSQRYJB","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YLSQRYJBV6O57K3FA4QE4AIHK6","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-01T00:06:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88b80ce9d5602434b127a263aff06eee5ea9b993a88f82401221a2d9a95ab4b7","abstract_canon_sha256":"b8686e5817eb8c6fe57617489d19e6289ac46098c6a4564623aa8aff68ba975f"},"schema_version":"1.0"},"canonical_sha256":"c2e508e121af9ddfab6507204e0107579fc2704465b494a14d0ccabb500a398c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:45.619187Z","signature_b64":"IC1T8UNnyx9nydUv5mfPjKZwfOUwzymJ6mMFXUSAK3wA8UH+KWb36h/dSCn17n4U4Gr4vqFxHOLFoVf//HwBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e508e121af9ddfab6507204e0107579fc2704465b494a14d0ccabb500a398c","last_reissued_at":"2026-05-18T03:11:45.618557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:45.618557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0101","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-18T03:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAPuzakTovJfROmMGl8QcaD0HypTjhgRvNa+GHibdNlCEMvN/D3lOMZFZ0PAbklqQeIjnMtyPi/koXXOw0HNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:31:18.438170Z"},"content_sha256":"6105ddbf66b2ce037d6036c74a76b843acb3c2e9ce0b9cb337acce2436b79616","schema_version":"1.0","event_id":"sha256:6105ddbf66b2ce037d6036c74a76b843acb3c2e9ce0b9cb337acce2436b79616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YLSQRYJBV6O57K3FA4QE4AIHK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Adaptive Beamforming Algorithms Based on the Constrained Constant Modulus Criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"L. Landau, M. Haardt, R. C. de Lamare","submitted_at":"2013-10-01T00:06:27Z","abstract_excerpt":"We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worst-case beamformer with the minimum variance design, the problem can be reformulated as a second-order cone (SOC) program and solved with interior point methods. An analysis of the optimization problem is carried out and conditions are obtained for enforcing its convexity and for adjusting its parameters. Furthermore, low-complexity robust adaptive beamforming algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0101","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-18T03:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JODljCEj+4sIKaJTgnpg0fdlYRGws1Qr0WejKMMvuj4zTMu7b2e1z7tXrReyLBmZJVHumRoTUmO/P8TcSlWYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:31:18.438533Z"},"content_sha256":"210da60a00761439fb77bc2a549fe01155a8c9534f0e8598f3270dfd208441ae","schema_version":"1.0","event_id":"sha256:210da60a00761439fb77bc2a549fe01155a8c9534f0e8598f3270dfd208441ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLSQRYJBV6O57K3FA4QE4AIHK6/bundle.json","state_url":"https://pith.science/pith/YLSQRYJBV6O57K3FA4QE4AIHK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLSQRYJBV6O57K3FA4QE4AIHK6/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-05-20T09:31:18Z","links":{"resolver":"https://pith.science/pith/YLSQRYJBV6O57K3FA4QE4AIHK6","bundle":"https://pith.science/pith/YLSQRYJBV6O57K3FA4QE4AIHK6/bundle.json","state":"https://pith.science/pith/YLSQRYJBV6O57K3FA4QE4AIHK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLSQRYJBV6O57K3FA4QE4AIHK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YLSQRYJBV6O57K3FA4QE4AIHK6","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":"b8686e5817eb8c6fe57617489d19e6289ac46098c6a4564623aa8aff68ba975f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-01T00:06:27Z","title_canon_sha256":"88b80ce9d5602434b127a263aff06eee5ea9b993a88f82401221a2d9a95ab4b7"},"schema_version":"1.0","source":{"id":"1310.0101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0101","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0101v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0101","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"YLSQRYJBV6O5","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YLSQRYJBV6O57K3F","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YLSQRYJB","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:210da60a00761439fb77bc2a549fe01155a8c9534f0e8598f3270dfd208441ae","target":"graph","created_at":"2026-05-18T03:11:45Z","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":"We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worst-case beamformer with the minimum variance design, the problem can be reformulated as a second-order cone (SOC) program and solved with interior point methods. An analysis of the optimization problem is carried out and conditions are obtained for enforcing its convexity and for adjusting its parameters. Furthermore, low-complexity robust adaptive beamforming algorith","authors_text":"L. Landau, M. Haardt, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-01T00:06:27Z","title":"Robust Adaptive Beamforming Algorithms Based on the Constrained Constant Modulus Criterion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0101","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:6105ddbf66b2ce037d6036c74a76b843acb3c2e9ce0b9cb337acce2436b79616","target":"record","created_at":"2026-05-18T03:11:45Z","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":"b8686e5817eb8c6fe57617489d19e6289ac46098c6a4564623aa8aff68ba975f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-01T00:06:27Z","title_canon_sha256":"88b80ce9d5602434b127a263aff06eee5ea9b993a88f82401221a2d9a95ab4b7"},"schema_version":"1.0","source":{"id":"1310.0101","kind":"arxiv","version":1}},"canonical_sha256":"c2e508e121af9ddfab6507204e0107579fc2704465b494a14d0ccabb500a398c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2e508e121af9ddfab6507204e0107579fc2704465b494a14d0ccabb500a398c","first_computed_at":"2026-05-18T03:11:45.618557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:45.618557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IC1T8UNnyx9nydUv5mfPjKZwfOUwzymJ6mMFXUSAK3wA8UH+KWb36h/dSCn17n4U4Gr4vqFxHOLFoVf//HwBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:45.619187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6105ddbf66b2ce037d6036c74a76b843acb3c2e9ce0b9cb337acce2436b79616","sha256:210da60a00761439fb77bc2a549fe01155a8c9534f0e8598f3270dfd208441ae"],"state_sha256":"23b6f963441845c69432f6036404b5a88fbbd34eac6d5c996d7589a8a58abd92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QU30hGgGybb1HblqBFJ5Cg3bVy6f7tSiozHlWpOp6InY+kOqI9NPH/4QuCbwDlU3/JeTd5X8JCT9swM+rjc2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:31:18.440465Z","bundle_sha256":"55e1f5289f115d255a86fd70d4b70f85c49cd53332b7783750d634daf714169f"}}