{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SMBW6O3HSKOZDDVFUWUZYABHWU","short_pith_number":"pith:SMBW6O3H","canonical_record":{"source":{"id":"1406.6998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-06-22T15:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"03b1d77c8bf0e4b4095f57091fd6920b27d7e8b0987e109756833f12fd0335d3","abstract_canon_sha256":"ef6ab7d73dbde8c0b37fb0b58095ce9a1450766b031b05ebb4654a835dc6586c"},"schema_version":"1.0"},"canonical_sha256":"93036f3b67929d918ea5a5a99c0027b53e8484ecab2c99e0308d7ede1d657fc7","source":{"kind":"arxiv","id":"1406.6998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6998","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6998v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6998","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"SMBW6O3HSKOZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SMBW6O3HSKOZDDVF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SMBW6O3H","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SMBW6O3HSKOZDDVFUWUZYABHWU","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-06-22T15:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"03b1d77c8bf0e4b4095f57091fd6920b27d7e8b0987e109756833f12fd0335d3","abstract_canon_sha256":"ef6ab7d73dbde8c0b37fb0b58095ce9a1450766b031b05ebb4654a835dc6586c"},"schema_version":"1.0"},"canonical_sha256":"93036f3b67929d918ea5a5a99c0027b53e8484ecab2c99e0308d7ede1d657fc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:55.310326Z","signature_b64":"BgqdSXvFwUH4m4i1qldGAV3I8vrVqgbv4X0wngVTgXWnFfCu/BvpePhPKQTvcBsvyhcLsnv1vfsrgj36AuAsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93036f3b67929d918ea5a5a99c0027b53e8484ecab2c99e0308d7ede1d657fc7","last_reissued_at":"2026-05-18T02:48:55.309818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:55.309818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6998","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-18T02:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHVh67eU/XBfJqgLfPQBGuGir1iUWzC8v18CvCTBWZEHOqynOjTWyAMlU076QzxPcsfFlpCNTAuktGDl4fhGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:24:02.058043Z"},"content_sha256":"35477b493856b11cf2b86765b752262557c86f85608b4def5ac322cdb27fbcab","schema_version":"1.0","event_id":"sha256:35477b493856b11cf2b86765b752262557c86f85608b4def5ac322cdb27fbcab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SMBW6O3HSKOZDDVFUWUZYABHWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Variable Forgetting Factor Constrained Constant Modulus RLS Algorithm for Adaptive Beamforming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"B. Champagne, M. Zhao, Q. Boya, R. C. de Lamare, Y. Cai","submitted_at":"2014-06-22T15:37:21Z","abstract_excerpt":"In this paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operates in the generalized sidelobe canceler (GSC) structure. A detailed study of its operating properties is carried out, including a convexity analysis and a mean squared error (MSE) analysis of its steady-state behavior. The results of numerical experiments demonstrate that the proposed VFF mechanism a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6998","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-18T02:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkamIY0EK+n8WMcj5HPsEp03rELiEPFS6ni0S3/PfcHGgWCapNN96agvNbh3dWpGymZuTSoffRkYC+R7xI1HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:24:02.058409Z"},"content_sha256":"7d9db209cf231fce560cee24cb6703094121670e1242cb95463c3e0681fb8cd5","schema_version":"1.0","event_id":"sha256:7d9db209cf231fce560cee24cb6703094121670e1242cb95463c3e0681fb8cd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMBW6O3HSKOZDDVFUWUZYABHWU/bundle.json","state_url":"https://pith.science/pith/SMBW6O3HSKOZDDVFUWUZYABHWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMBW6O3HSKOZDDVFUWUZYABHWU/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-04T06:24:02Z","links":{"resolver":"https://pith.science/pith/SMBW6O3HSKOZDDVFUWUZYABHWU","bundle":"https://pith.science/pith/SMBW6O3HSKOZDDVFUWUZYABHWU/bundle.json","state":"https://pith.science/pith/SMBW6O3HSKOZDDVFUWUZYABHWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMBW6O3HSKOZDDVFUWUZYABHWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SMBW6O3HSKOZDDVFUWUZYABHWU","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":"ef6ab7d73dbde8c0b37fb0b58095ce9a1450766b031b05ebb4654a835dc6586c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-06-22T15:37:21Z","title_canon_sha256":"03b1d77c8bf0e4b4095f57091fd6920b27d7e8b0987e109756833f12fd0335d3"},"schema_version":"1.0","source":{"id":"1406.6998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6998","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6998v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6998","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"SMBW6O3HSKOZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SMBW6O3HSKOZDDVF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SMBW6O3H","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:7d9db209cf231fce560cee24cb6703094121670e1242cb95463c3e0681fb8cd5","target":"graph","created_at":"2026-05-18T02:48:55Z","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 paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operates in the generalized sidelobe canceler (GSC) structure. A detailed study of its operating properties is carried out, including a convexity analysis and a mean squared error (MSE) analysis of its steady-state behavior. The results of numerical experiments demonstrate that the proposed VFF mechanism a","authors_text":"B. Champagne, M. Zhao, Q. Boya, R. C. de Lamare, Y. Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-06-22T15:37:21Z","title":"Low-Complexity Variable Forgetting Factor Constrained Constant Modulus RLS Algorithm for Adaptive Beamforming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6998","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:35477b493856b11cf2b86765b752262557c86f85608b4def5ac322cdb27fbcab","target":"record","created_at":"2026-05-18T02:48:55Z","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":"ef6ab7d73dbde8c0b37fb0b58095ce9a1450766b031b05ebb4654a835dc6586c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2014-06-22T15:37:21Z","title_canon_sha256":"03b1d77c8bf0e4b4095f57091fd6920b27d7e8b0987e109756833f12fd0335d3"},"schema_version":"1.0","source":{"id":"1406.6998","kind":"arxiv","version":1}},"canonical_sha256":"93036f3b67929d918ea5a5a99c0027b53e8484ecab2c99e0308d7ede1d657fc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93036f3b67929d918ea5a5a99c0027b53e8484ecab2c99e0308d7ede1d657fc7","first_computed_at":"2026-05-18T02:48:55.309818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:55.309818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BgqdSXvFwUH4m4i1qldGAV3I8vrVqgbv4X0wngVTgXWnFfCu/BvpePhPKQTvcBsvyhcLsnv1vfsrgj36AuAsCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:55.310326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35477b493856b11cf2b86765b752262557c86f85608b4def5ac322cdb27fbcab","sha256:7d9db209cf231fce560cee24cb6703094121670e1242cb95463c3e0681fb8cd5"],"state_sha256":"c2beeac7e12bbbf39541bb5a774d6dda13fb7fe46458d256357027917c78fd7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pz0LIya840t1RTvW9ExnbcMRxV0/3EGm/9KQNQVTOTymdd+MaffpGQROydO1G6S5iucQt85jD81RtanZCJc8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:24:02.061585Z","bundle_sha256":"531b9b1759d5cde1024df7c6e235eadceb1c55ec2067f164aa3fb0cbba68e16e"}}