{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3QOBPK6Z23CKPOK4MBSPPMUKAS","short_pith_number":"pith:3QOBPK6Z","schema_version":"1.0","canonical_sha256":"dc1c17abd9d6c4a7b95c6064f7b28a04959e5d920474b846d8d4cc8689c63e71","source":{"kind":"arxiv","id":"1305.5352","version":1},"attestation_state":"computed","paper":{"title":"Tight Upper and Lower Bounds to the Information Rate of the Phase Noise Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arnaldo Spalvieri, Luca Barletta, Maurizio Magarini","submitted_at":"2013-05-23T09:08:27Z","abstract_excerpt":"Numerical upper and lower bounds to the information rate transferred through the additive white Gaussian noise channel affected by discrete-time multiplicative autoregressive moving-average (ARMA) phase noise are proposed in the paper. The state space of the ARMA model being multidimensional, the problem cannot be approached by the conventional trellis-based methods that assume a first-order model for phase noise and quantization of the phase space, because the number of state of the trellis would be enormous. The proposed lower and upper bounds are based on particle filtering and Kalman filte"},"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":"1305.5352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-23T09:08:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f92cc5daa163b119a2e7653cec8b47648982e0d7982e3908c3a0caf64ecd9d28","abstract_canon_sha256":"6617a2c718475ae325565a8aefefe2dff2188e0d079336dc81b15407cb63401e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:05.028044Z","signature_b64":"0TTEGbdxgmA70IQW0h84Ay+b7bnoy1rXqFwuaZt+0/9lPzIjdofjzkC+fOxm5c0gIqzvInh4kv0ie1me/lcfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc1c17abd9d6c4a7b95c6064f7b28a04959e5d920474b846d8d4cc8689c63e71","last_reissued_at":"2026-05-18T03:25:05.027525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:05.027525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Upper and Lower Bounds to the Information Rate of the Phase Noise Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arnaldo Spalvieri, Luca Barletta, Maurizio Magarini","submitted_at":"2013-05-23T09:08:27Z","abstract_excerpt":"Numerical upper and lower bounds to the information rate transferred through the additive white Gaussian noise channel affected by discrete-time multiplicative autoregressive moving-average (ARMA) phase noise are proposed in the paper. The state space of the ARMA model being multidimensional, the problem cannot be approached by the conventional trellis-based methods that assume a first-order model for phase noise and quantization of the phase space, because the number of state of the trellis would be enormous. The proposed lower and upper bounds are based on particle filtering and Kalman filte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5352","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":"1305.5352","created_at":"2026-05-18T03:25:05.027620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5352v1","created_at":"2026-05-18T03:25:05.027620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5352","created_at":"2026-05-18T03:25:05.027620+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QOBPK6Z23CK","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QOBPK6Z23CKPOK4","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QOBPK6Z","created_at":"2026-05-18T12:27:32.513160+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/3QOBPK6Z23CKPOK4MBSPPMUKAS","json":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS.json","graph_json":"https://pith.science/api/pith-number/3QOBPK6Z23CKPOK4MBSPPMUKAS/graph.json","events_json":"https://pith.science/api/pith-number/3QOBPK6Z23CKPOK4MBSPPMUKAS/events.json","paper":"https://pith.science/paper/3QOBPK6Z"},"agent_actions":{"view_html":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS","download_json":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS.json","view_paper":"https://pith.science/paper/3QOBPK6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5352&json=true","fetch_graph":"https://pith.science/api/pith-number/3QOBPK6Z23CKPOK4MBSPPMUKAS/graph.json","fetch_events":"https://pith.science/api/pith-number/3QOBPK6Z23CKPOK4MBSPPMUKAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS/action/storage_attestation","attest_author":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS/action/author_attestation","sign_citation":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS/action/citation_signature","submit_replication":"https://pith.science/pith/3QOBPK6Z23CKPOK4MBSPPMUKAS/action/replication_record"}},"created_at":"2026-05-18T03:25:05.027620+00:00","updated_at":"2026-05-18T03:25:05.027620+00:00"}