{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:CZMYJDJG74QG7256KNH5PCXRAI","short_pith_number":"pith:CZMYJDJG","canonical_record":{"source":{"id":"0806.2198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-13T07:40:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"665e1a7a779df9d55bb9bdea70eff7e97c82d1c87ea871829d2d477e4b7fb77c","abstract_canon_sha256":"43c303b22be0e7f2efbaf53d44f5700c2979ea6ef1be6c63ee219abe1bd27a5e"},"schema_version":"1.0"},"canonical_sha256":"1659848d26ff206febbe534fd78af1020a690cb253b60f7b4f4678221dd7bfa9","source":{"kind":"arxiv","id":"0806.2198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.2198","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0806.2198v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.2198","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"CZMYJDJG74QG","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"CZMYJDJG74QG7256","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"CZMYJDJG","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:CZMYJDJG74QG7256KNH5PCXRAI","target":"record","payload":{"canonical_record":{"source":{"id":"0806.2198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-13T07:40:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"665e1a7a779df9d55bb9bdea70eff7e97c82d1c87ea871829d2d477e4b7fb77c","abstract_canon_sha256":"43c303b22be0e7f2efbaf53d44f5700c2979ea6ef1be6c63ee219abe1bd27a5e"},"schema_version":"1.0"},"canonical_sha256":"1659848d26ff206febbe534fd78af1020a690cb253b60f7b4f4678221dd7bfa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.542962Z","signature_b64":"r1YgufMUbE/qI7142JWDdnGxR8oQRMWH0q1tH8qZk46qOoS8/bZp4zrrcfJ+hLu/R5MKXl9jlm5WtuxvoRFjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1659848d26ff206febbe534fd78af1020a690cb253b60f7b4f4678221dd7bfa9","last_reissued_at":"2026-05-18T00:58:25.542271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.542271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.2198","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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17skoU4Cnb3hcoOaNF/LgNgqphYdRn6mhhttBx3H4UKfyM4Jf1lTrqYt8P3sFHMy9kZp5pBJBDZ+gNSL7LtpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:47:21.253536Z"},"content_sha256":"4632d1e4f679d199a43796fc305bacfb2c93d1732ca6af06ea7f701f2f913262","schema_version":"1.0","event_id":"sha256:4632d1e4f679d199a43796fc305bacfb2c93d1732ca6af06ea7f701f2f913262"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:CZMYJDJG74QG7256KNH5PCXRAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity-achieving CPM schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Perotti, Alberto Tarable, Guido Montorsi, Sergio Benedetto","submitted_at":"2008-06-13T07:40:35Z","abstract_excerpt":"The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the best spectrally-efficient CPM modulations to be embedded into SC-CPM schemes. Then, we consider the pragmatic capacity (a.k.a. BICM capacity) of CPM modulations and optimize it through a careful design of the mapping between input bits and CPM waveforms. The so obtained schemes are cascaded with an outer serially-concatenated convolutional code to form a pragma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.2198","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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyhA55kyK6ljf/tvr3Wxm1CaocolVQV75itoyzjEVDwNWn6LOzvgxVpFvzkX1mqSqtUyvDK5kl9Y/wLQibs6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:47:21.253903Z"},"content_sha256":"dd197c720f280fce442c8517da12f9a23042686c95b41297cc53cf611f86712b","schema_version":"1.0","event_id":"sha256:dd197c720f280fce442c8517da12f9a23042686c95b41297cc53cf611f86712b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/bundle.json","state_url":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZMYJDJG74QG7256KNH5PCXRAI/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-30T10:47:21Z","links":{"resolver":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI","bundle":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/bundle.json","state":"https://pith.science/pith/CZMYJDJG74QG7256KNH5PCXRAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZMYJDJG74QG7256KNH5PCXRAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:CZMYJDJG74QG7256KNH5PCXRAI","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":"43c303b22be0e7f2efbaf53d44f5700c2979ea6ef1be6c63ee219abe1bd27a5e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-13T07:40:35Z","title_canon_sha256":"665e1a7a779df9d55bb9bdea70eff7e97c82d1c87ea871829d2d477e4b7fb77c"},"schema_version":"1.0","source":{"id":"0806.2198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.2198","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0806.2198v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.2198","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"CZMYJDJG74QG","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"CZMYJDJG74QG7256","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"CZMYJDJG","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:dd197c720f280fce442c8517da12f9a23042686c95b41297cc53cf611f86712b","target":"graph","created_at":"2026-05-18T00:58: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":"The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the best spectrally-efficient CPM modulations to be embedded into SC-CPM schemes. Then, we consider the pragmatic capacity (a.k.a. BICM capacity) of CPM modulations and optimize it through a careful design of the mapping between input bits and CPM waveforms. The so obtained schemes are cascaded with an outer serially-concatenated convolutional code to form a pragma","authors_text":"Alberto Perotti, Alberto Tarable, Guido Montorsi, Sergio Benedetto","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-13T07:40:35Z","title":"Capacity-achieving CPM schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.2198","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:4632d1e4f679d199a43796fc305bacfb2c93d1732ca6af06ea7f701f2f913262","target":"record","created_at":"2026-05-18T00:58: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":"43c303b22be0e7f2efbaf53d44f5700c2979ea6ef1be6c63ee219abe1bd27a5e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-06-13T07:40:35Z","title_canon_sha256":"665e1a7a779df9d55bb9bdea70eff7e97c82d1c87ea871829d2d477e4b7fb77c"},"schema_version":"1.0","source":{"id":"0806.2198","kind":"arxiv","version":1}},"canonical_sha256":"1659848d26ff206febbe534fd78af1020a690cb253b60f7b4f4678221dd7bfa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1659848d26ff206febbe534fd78af1020a690cb253b60f7b4f4678221dd7bfa9","first_computed_at":"2026-05-18T00:58:25.542271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.542271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r1YgufMUbE/qI7142JWDdnGxR8oQRMWH0q1tH8qZk46qOoS8/bZp4zrrcfJ+hLu/R5MKXl9jlm5WtuxvoRFjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.542962Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.2198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4632d1e4f679d199a43796fc305bacfb2c93d1732ca6af06ea7f701f2f913262","sha256:dd197c720f280fce442c8517da12f9a23042686c95b41297cc53cf611f86712b"],"state_sha256":"d0a1ca85c36241ccac1d0cef77810b322c2e69dd862f77ef9b14fe3243d4365b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbLEp6E7tcKP7EkHEK/I2tEMI31RQQUGGlVU8uAexD8nC75l8gudLuhu3j0r6FjyzbhBSpoxQZXoDrejHfrpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:47:21.256204Z","bundle_sha256":"f271c7f523dd57a8a7af781da3e7458ce19cf1cef877899372d413767c5625e7"}}