{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q53SZUBYP3Q3KQX5BEUH5C2LTX","short_pith_number":"pith:Q53SZUBY","canonical_record":{"source":{"id":"1510.03492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T00:49:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ba38a36664dfdb4a4446636d379b0d9a0beb2ee108b645c81171dd20b87a33b","abstract_canon_sha256":"d03061d14595e36abd050c994de8dbf87fba237f1eac39234bb33e9ec7a615e7"},"schema_version":"1.0"},"canonical_sha256":"87772cd0387ee1b542fd09287e8b4b9de143c5974bcb241f702b5e55b02efdc7","source":{"kind":"arxiv","id":"1510.03492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03492","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03492v1","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03492","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"Q53SZUBYP3Q3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q53SZUBYP3Q3KQX5","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q53SZUBY","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q53SZUBYP3Q3KQX5BEUH5C2LTX","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T00:49:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ba38a36664dfdb4a4446636d379b0d9a0beb2ee108b645c81171dd20b87a33b","abstract_canon_sha256":"d03061d14595e36abd050c994de8dbf87fba237f1eac39234bb33e9ec7a615e7"},"schema_version":"1.0"},"canonical_sha256":"87772cd0387ee1b542fd09287e8b4b9de143c5974bcb241f702b5e55b02efdc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:17.079386Z","signature_b64":"mt48zVBHjWzWE2equuraO6oxrmjmDEOaBrQZtIgVAria7z0voYk0HH/C71e6zn2b2i20AN3c9818wN6PzSceCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87772cd0387ee1b542fd09287e8b4b9de143c5974bcb241f702b5e55b02efdc7","last_reissued_at":"2026-05-18T01:30:17.078620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:17.078620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03492","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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzoOZmhgrktKqSvr8HSqe8Wo//YaUJ4TJuyR8p2qr1pMJtZG945Z7TrILTNL9RObc9FM4D0qKUnjeyfEMI75DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:41:11.932947Z"},"content_sha256":"2452dca4ad4087965a0319cd4a706e44e8699ea08705b498aa8e93081884b9f9","schema_version":"1.0","event_id":"sha256:2452dca4ad4087965a0319cd4a706e44e8699ea08705b498aa8e93081884b9f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q53SZUBYP3Q3KQX5BEUH5C2LTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference Suppression in Multiuser Systems Based on Bidirectional Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"P. Clarke, R. C. de Lamare","submitted_at":"2015-10-13T00:49:07Z","abstract_excerpt":"This paper presents adaptive bidirectional minimum mean-square error parameter estimation algorithms for fast-fading channels. The time correlation between successive channel gains is exploited to improve the estimation and tracking capabilities of adaptive algorithms and provide robustness against time-varying channels. Bidirectional normalized least mean-square and conjugate gradient algorithms are devised along with adaptive mixing parameters that adjust to the time-varying channel correlation properties. An analysis of the proposed algorithms is provided along with a discussion of their pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03492","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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NT+hQk+8x7T7QoP5lTovSXYV608dYzbndOaWTya4hXykQ6a6NujEx5OvpP0MX80ntI2LmgMwsDJ4gVK0qB8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:41:11.933652Z"},"content_sha256":"3abe7e38a8f37b5c9cf92dcf3836efa5213087667adfaa9c1d822f950ad555e0","schema_version":"1.0","event_id":"sha256:3abe7e38a8f37b5c9cf92dcf3836efa5213087667adfaa9c1d822f950ad555e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q53SZUBYP3Q3KQX5BEUH5C2LTX/bundle.json","state_url":"https://pith.science/pith/Q53SZUBYP3Q3KQX5BEUH5C2LTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q53SZUBYP3Q3KQX5BEUH5C2LTX/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-09T08:41:11Z","links":{"resolver":"https://pith.science/pith/Q53SZUBYP3Q3KQX5BEUH5C2LTX","bundle":"https://pith.science/pith/Q53SZUBYP3Q3KQX5BEUH5C2LTX/bundle.json","state":"https://pith.science/pith/Q53SZUBYP3Q3KQX5BEUH5C2LTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q53SZUBYP3Q3KQX5BEUH5C2LTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q53SZUBYP3Q3KQX5BEUH5C2LTX","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":"d03061d14595e36abd050c994de8dbf87fba237f1eac39234bb33e9ec7a615e7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T00:49:07Z","title_canon_sha256":"4ba38a36664dfdb4a4446636d379b0d9a0beb2ee108b645c81171dd20b87a33b"},"schema_version":"1.0","source":{"id":"1510.03492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03492","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03492v1","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03492","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"Q53SZUBYP3Q3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q53SZUBYP3Q3KQX5","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q53SZUBY","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:3abe7e38a8f37b5c9cf92dcf3836efa5213087667adfaa9c1d822f950ad555e0","target":"graph","created_at":"2026-05-18T01:30:17Z","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":"This paper presents adaptive bidirectional minimum mean-square error parameter estimation algorithms for fast-fading channels. The time correlation between successive channel gains is exploited to improve the estimation and tracking capabilities of adaptive algorithms and provide robustness against time-varying channels. Bidirectional normalized least mean-square and conjugate gradient algorithms are devised along with adaptive mixing parameters that adjust to the time-varying channel correlation properties. An analysis of the proposed algorithms is provided along with a discussion of their pe","authors_text":"P. Clarke, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T00:49:07Z","title":"Interference Suppression in Multiuser Systems Based on Bidirectional Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03492","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:2452dca4ad4087965a0319cd4a706e44e8699ea08705b498aa8e93081884b9f9","target":"record","created_at":"2026-05-18T01:30:17Z","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":"d03061d14595e36abd050c994de8dbf87fba237f1eac39234bb33e9ec7a615e7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-13T00:49:07Z","title_canon_sha256":"4ba38a36664dfdb4a4446636d379b0d9a0beb2ee108b645c81171dd20b87a33b"},"schema_version":"1.0","source":{"id":"1510.03492","kind":"arxiv","version":1}},"canonical_sha256":"87772cd0387ee1b542fd09287e8b4b9de143c5974bcb241f702b5e55b02efdc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87772cd0387ee1b542fd09287e8b4b9de143c5974bcb241f702b5e55b02efdc7","first_computed_at":"2026-05-18T01:30:17.078620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:17.078620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mt48zVBHjWzWE2equuraO6oxrmjmDEOaBrQZtIgVAria7z0voYk0HH/C71e6zn2b2i20AN3c9818wN6PzSceCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:17.079386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2452dca4ad4087965a0319cd4a706e44e8699ea08705b498aa8e93081884b9f9","sha256:3abe7e38a8f37b5c9cf92dcf3836efa5213087667adfaa9c1d822f950ad555e0"],"state_sha256":"7ab3a2b5e69dbc49392973ed1d369258e96871034638b9dc577315b016e8d218"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjcQrjAol24i5hmZm+E5ApB97bF5A18RahYY7fPeO9PcsJs3f/jpFW+4mbrYhiu7fMuZuWvAhcPT/Z8mz2b/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:41:11.937632Z","bundle_sha256":"43422777f8036752a8c645361235f81daa4e5a71cd64451b3d11d1d45ca242df"}}