{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HKMI7KL2TS26F7CLREB52FCNPE","short_pith_number":"pith:HKMI7KL2","schema_version":"1.0","canonical_sha256":"3a988fa97a9cb5e2fc4b8903dd144d791087fa46082146f4226d6b22c5360e86","source":{"kind":"arxiv","id":"1210.1752","version":1},"attestation_state":"computed","paper":{"title":"Constellation Design for Channels Affected by Phase Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farbod Kayhan, Guido Montorsi","submitted_at":"2012-10-05T13:27:08Z","abstract_excerpt":"In this paper we optimize constellation sets to be used for channels affected by phase noise. The main objective is to maximize the achievable mutual information of the constellation under a given power constraint. The mutual information and pragmatic mutual information of a given constellation is calculated approximately assuming that both the channel and phase noise are white. Then a simulated annealing algorithm is used to jointly optimize the constellation and the binary labeling. The performance of optimized constellations is compared with conventional constellations showing considerable "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.1752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-05T13:27:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34825d83d8dfc5df9beb25ee91e467cbf0e5ce4d69c286b88a5694ff9b30ea34","abstract_canon_sha256":"b0da0ecb2ae301e171c4f32b07fe66efc7e067f7f13586934a3d181663747d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:53.417294Z","signature_b64":"vu3aTjUfAcW1t4fs8JsF0/QI7oxAcZ/Twrsd0aOxjCB1Aqh/cwVCjAxWtJucOIhU9xS13GHJn1QohmbQ4BRTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a988fa97a9cb5e2fc4b8903dd144d791087fa46082146f4226d6b22c5360e86","last_reissued_at":"2026-05-18T03:43:53.415997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:53.415997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constellation Design for Channels Affected by Phase Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farbod Kayhan, Guido Montorsi","submitted_at":"2012-10-05T13:27:08Z","abstract_excerpt":"In this paper we optimize constellation sets to be used for channels affected by phase noise. The main objective is to maximize the achievable mutual information of the constellation under a given power constraint. The mutual information and pragmatic mutual information of a given constellation is calculated approximately assuming that both the channel and phase noise are white. Then a simulated annealing algorithm is used to jointly optimize the constellation and the binary labeling. The performance of optimized constellations is compared with conventional constellations showing considerable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1752","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.1752","created_at":"2026-05-18T03:43:53.416523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1752v1","created_at":"2026-05-18T03:43:53.416523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1752","created_at":"2026-05-18T03:43:53.416523+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKMI7KL2TS26","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKMI7KL2TS26F7CL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKMI7KL2","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE","json":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE.json","graph_json":"https://pith.science/api/pith-number/HKMI7KL2TS26F7CLREB52FCNPE/graph.json","events_json":"https://pith.science/api/pith-number/HKMI7KL2TS26F7CLREB52FCNPE/events.json","paper":"https://pith.science/paper/HKMI7KL2"},"agent_actions":{"view_html":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE","download_json":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE.json","view_paper":"https://pith.science/paper/HKMI7KL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1752&json=true","fetch_graph":"https://pith.science/api/pith-number/HKMI7KL2TS26F7CLREB52FCNPE/graph.json","fetch_events":"https://pith.science/api/pith-number/HKMI7KL2TS26F7CLREB52FCNPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE/action/storage_attestation","attest_author":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE/action/author_attestation","sign_citation":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE/action/citation_signature","submit_replication":"https://pith.science/pith/HKMI7KL2TS26F7CLREB52FCNPE/action/replication_record"}},"created_at":"2026-05-18T03:43:53.416523+00:00","updated_at":"2026-05-18T03:43:53.416523+00:00"}