{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WVDISIKLRL53VYOB4ST2UEAXTR","short_pith_number":"pith:WVDISIKL","canonical_record":{"source":{"id":"1101.4207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-21T19:21:40Z","cross_cats_sorted":["math.IT","stat.OT"],"title_canon_sha256":"3415a01f73a961a397739338c580d1509ae61ec5222d825093bed6e5b4eb1be8","abstract_canon_sha256":"d4b34a4d8050f150d3c4ad155f3098da3750424f1565f6f665a2d7020c6408ce"},"schema_version":"1.0"},"canonical_sha256":"b54689214b8afbbae1c1e4a7aa10179c5fb791ade773f4e10876dead3ba61426","source":{"kind":"arxiv","id":"1101.4207","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4207","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4207v2","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4207","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"WVDISIKLRL53","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WVDISIKLRL53VYOB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WVDISIKL","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WVDISIKLRL53VYOB4ST2UEAXTR","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-21T19:21:40Z","cross_cats_sorted":["math.IT","stat.OT"],"title_canon_sha256":"3415a01f73a961a397739338c580d1509ae61ec5222d825093bed6e5b4eb1be8","abstract_canon_sha256":"d4b34a4d8050f150d3c4ad155f3098da3750424f1565f6f665a2d7020c6408ce"},"schema_version":"1.0"},"canonical_sha256":"b54689214b8afbbae1c1e4a7aa10179c5fb791ade773f4e10876dead3ba61426","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:25.505877Z","signature_b64":"tQsrcwtKR5D5UseIEgyI5RTO0co9H5bTyEELX+EhgDokFlciDPu4D5Tz8E6zpZ3vpVN1qixN/fvwBJoVfzbiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b54689214b8afbbae1c1e4a7aa10179c5fb791ade773f4e10876dead3ba61426","last_reissued_at":"2026-05-18T02:03:25.505063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:25.505063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4207","source_version":2,"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:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4aInK4Q9gOZ2rcdQ7ZKJMvnqaqEEKevVMo/UrmVE1i8OFlBM5o/4Fn80pvqNzEYoBmuVjP9BOySGM+qEKGaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:45:08.684500Z"},"content_sha256":"590c51cbbcb7faa552837c190c118af96d61249f8b90f1c8275bf54136991128","schema_version":"1.0","event_id":"sha256:590c51cbbcb7faa552837c190c118af96d61249f8b90f1c8275bf54136991128"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WVDISIKLRL53VYOB4ST2UEAXTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.OT"],"primary_cat":"cs.IT","authors_text":"Ioannis N. Psaromiligkos, Saeed Abdallah","submitted_at":"2011-01-21T19:21:40Z","abstract_excerpt":"We consider the problem of channel estimation for amplify-and-forward (AF) two-way relay networks (TWRNs). Most works on this problem focus on pilot-based approaches which impose a significant training overhead that reduces the spectral efficiency of the system. To avoid such losses, this work proposes blind channel estimation algorithms for AF TWRNs that employ constant-modulus (CM) signaling. Our main algorithm is based on the deterministic maximum likelihood (DML) approach. Assuming M-PSK modulation, we show that the resulting estimator is consistent and approaches the true channel with hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4207","kind":"arxiv","version":2},"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:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dqMCkydACzMkoOqcu4Cr5UNlMpnmHewn+UUF5z/sm5q6vd+L2NENabsckceFsAm4vAvVIz2v1AuhXB/S0gnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:45:08.684866Z"},"content_sha256":"ed2d0b7f163cdf3a0d986b56f800e6b98982eb7005b0c24990e0afecf8c2313c","schema_version":"1.0","event_id":"sha256:ed2d0b7f163cdf3a0d986b56f800e6b98982eb7005b0c24990e0afecf8c2313c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVDISIKLRL53VYOB4ST2UEAXTR/bundle.json","state_url":"https://pith.science/pith/WVDISIKLRL53VYOB4ST2UEAXTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVDISIKLRL53VYOB4ST2UEAXTR/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-27T20:45:08Z","links":{"resolver":"https://pith.science/pith/WVDISIKLRL53VYOB4ST2UEAXTR","bundle":"https://pith.science/pith/WVDISIKLRL53VYOB4ST2UEAXTR/bundle.json","state":"https://pith.science/pith/WVDISIKLRL53VYOB4ST2UEAXTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVDISIKLRL53VYOB4ST2UEAXTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WVDISIKLRL53VYOB4ST2UEAXTR","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":"d4b34a4d8050f150d3c4ad155f3098da3750424f1565f6f665a2d7020c6408ce","cross_cats_sorted":["math.IT","stat.OT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-21T19:21:40Z","title_canon_sha256":"3415a01f73a961a397739338c580d1509ae61ec5222d825093bed6e5b4eb1be8"},"schema_version":"1.0","source":{"id":"1101.4207","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4207","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4207v2","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4207","created_at":"2026-05-18T02:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"WVDISIKLRL53","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WVDISIKLRL53VYOB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WVDISIKL","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:ed2d0b7f163cdf3a0d986b56f800e6b98982eb7005b0c24990e0afecf8c2313c","target":"graph","created_at":"2026-05-18T02:03:25Z","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 consider the problem of channel estimation for amplify-and-forward (AF) two-way relay networks (TWRNs). Most works on this problem focus on pilot-based approaches which impose a significant training overhead that reduces the spectral efficiency of the system. To avoid such losses, this work proposes blind channel estimation algorithms for AF TWRNs that employ constant-modulus (CM) signaling. Our main algorithm is based on the deterministic maximum likelihood (DML) approach. Assuming M-PSK modulation, we show that the resulting estimator is consistent and approaches the true channel with hig","authors_text":"Ioannis N. Psaromiligkos, Saeed Abdallah","cross_cats":["math.IT","stat.OT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-21T19:21:40Z","title":"Blind Channel Estimation for Amplify-and-Forward Two-Way Relay Networks Employing M-PSK Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4207","kind":"arxiv","version":2},"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:590c51cbbcb7faa552837c190c118af96d61249f8b90f1c8275bf54136991128","target":"record","created_at":"2026-05-18T02:03:25Z","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":"d4b34a4d8050f150d3c4ad155f3098da3750424f1565f6f665a2d7020c6408ce","cross_cats_sorted":["math.IT","stat.OT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-21T19:21:40Z","title_canon_sha256":"3415a01f73a961a397739338c580d1509ae61ec5222d825093bed6e5b4eb1be8"},"schema_version":"1.0","source":{"id":"1101.4207","kind":"arxiv","version":2}},"canonical_sha256":"b54689214b8afbbae1c1e4a7aa10179c5fb791ade773f4e10876dead3ba61426","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b54689214b8afbbae1c1e4a7aa10179c5fb791ade773f4e10876dead3ba61426","first_computed_at":"2026-05-18T02:03:25.505063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:25.505063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQsrcwtKR5D5UseIEgyI5RTO0co9H5bTyEELX+EhgDokFlciDPu4D5Tz8E6zpZ3vpVN1qixN/fvwBJoVfzbiDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:25.505877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4207","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:590c51cbbcb7faa552837c190c118af96d61249f8b90f1c8275bf54136991128","sha256:ed2d0b7f163cdf3a0d986b56f800e6b98982eb7005b0c24990e0afecf8c2313c"],"state_sha256":"5abf085270d067f40d0efe41819b8c4cac58d93e95343e540525910c75f94507"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p00qMj57j11FMY/dBYmCCCu80oQIrUiNx46ptl/oRvrndYlVzdtZaV+oXyR4XKF3q49c1xQ1VQI19Eq0b5MNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:45:08.687481Z","bundle_sha256":"f9b8f45178d368d6ba15336e8cfe6c937cf60b190ba6f520d364cbff894a5a86"}}