{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:F7YW46UKZMYRVYGQ6X2UDVGWUS","short_pith_number":"pith:F7YW46UK","canonical_record":{"source":{"id":"0711.4406","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-11-28T02:16:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d01d192c1bd12fc45d2fdb714e1ebd4063affd6e1d059631357ef88b0fa291eb","abstract_canon_sha256":"ba6011d792988cac09e73cac7b15732d98889ee7eea193ea104cffb3980089bb"},"schema_version":"1.0"},"canonical_sha256":"2ff16e7a8acb311ae0d0f5f541d4d6a48d14e2929a84a6e271afc6766f29b035","source":{"kind":"arxiv","id":"0711.4406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.4406","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0711.4406v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.4406","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"F7YW46UKZMYR","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"F7YW46UKZMYRVYGQ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"F7YW46UK","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:F7YW46UKZMYRVYGQ6X2UDVGWUS","target":"record","payload":{"canonical_record":{"source":{"id":"0711.4406","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-11-28T02:16:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d01d192c1bd12fc45d2fdb714e1ebd4063affd6e1d059631357ef88b0fa291eb","abstract_canon_sha256":"ba6011d792988cac09e73cac7b15732d98889ee7eea193ea104cffb3980089bb"},"schema_version":"1.0"},"canonical_sha256":"2ff16e7a8acb311ae0d0f5f541d4d6a48d14e2929a84a6e271afc6766f29b035","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.881099Z","signature_b64":"fd9Lcd0MkvF2CmQJN8kM+7c9RgcCRNGUebKh+0SjQu9RLtPhkCAh1m30UXablt+nx5B9q5V4UhdmacMifPYaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ff16e7a8acb311ae0d0f5f541d4d6a48d14e2929a84a6e271afc6766f29b035","last_reissued_at":"2026-05-18T00:58:25.880389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.880389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0711.4406","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":"8WEqr5oY8MAH1rvIae1VyZfFGzGVaqcixOH40laqWcv9wAsj8cb0uBzA+bC/JZv1WzYXXkJGWuafieIL3gvJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:05:33.260934Z"},"content_sha256":"25e3adaf6efc876f47f83c0ed1c521c5abe1920574259ef29d5bd21cee8634bd","schema_version":"1.0","event_id":"sha256:25e3adaf6efc876f47f83c0ed1c521c5abe1920574259ef29d5bd21cee8634bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:F7YW46UKZMYRVYGQ6X2UDVGWUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of Information Rate Upper and Lower Bounds for Channels with Memory","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams","submitted_at":"2007-11-28T02:16:22Z","abstract_excerpt":"We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial response channels, or they can have an infinite state-space, such as time-varying fading channels. We optimize recently-proposed information rate bounds for such channels, which make use of auxiliary finite-state machine channels (FSMCs). Our main contribution in this paper is to provide iterative expectation-maximization (EM) type algorithms to optimize the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.4406","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":"ZGfRMzyP66cVf/+3R+O3q3hqU6jQV+Am9heyLkeH3AmTQL88fF7VTik9x1BL42gaT5mZlZeUUbUeP/3Wp9xCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:05:33.261313Z"},"content_sha256":"581c20ade522e57f3632e87f7c549529f5ea4388579035428fb87117ea91b717","schema_version":"1.0","event_id":"sha256:581c20ade522e57f3632e87f7c549529f5ea4388579035428fb87117ea91b717"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7YW46UKZMYRVYGQ6X2UDVGWUS/bundle.json","state_url":"https://pith.science/pith/F7YW46UKZMYRVYGQ6X2UDVGWUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7YW46UKZMYRVYGQ6X2UDVGWUS/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-29T17:05:33Z","links":{"resolver":"https://pith.science/pith/F7YW46UKZMYRVYGQ6X2UDVGWUS","bundle":"https://pith.science/pith/F7YW46UKZMYRVYGQ6X2UDVGWUS/bundle.json","state":"https://pith.science/pith/F7YW46UKZMYRVYGQ6X2UDVGWUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7YW46UKZMYRVYGQ6X2UDVGWUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:F7YW46UKZMYRVYGQ6X2UDVGWUS","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":"ba6011d792988cac09e73cac7b15732d98889ee7eea193ea104cffb3980089bb","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-11-28T02:16:22Z","title_canon_sha256":"d01d192c1bd12fc45d2fdb714e1ebd4063affd6e1d059631357ef88b0fa291eb"},"schema_version":"1.0","source":{"id":"0711.4406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0711.4406","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0711.4406v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0711.4406","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"F7YW46UKZMYR","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"F7YW46UKZMYRVYGQ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"F7YW46UK","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:581c20ade522e57f3632e87f7c549529f5ea4388579035428fb87117ea91b717","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":"We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial response channels, or they can have an infinite state-space, such as time-varying fading channels. We optimize recently-proposed information rate bounds for such channels, which make use of auxiliary finite-state machine channels (FSMCs). Our main contribution in this paper is to provide iterative expectation-maximization (EM) type algorithms to optimize the ","authors_text":"Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-11-28T02:16:22Z","title":"Optimization of Information Rate Upper and Lower Bounds for Channels with Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0711.4406","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:25e3adaf6efc876f47f83c0ed1c521c5abe1920574259ef29d5bd21cee8634bd","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":"ba6011d792988cac09e73cac7b15732d98889ee7eea193ea104cffb3980089bb","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-11-28T02:16:22Z","title_canon_sha256":"d01d192c1bd12fc45d2fdb714e1ebd4063affd6e1d059631357ef88b0fa291eb"},"schema_version":"1.0","source":{"id":"0711.4406","kind":"arxiv","version":1}},"canonical_sha256":"2ff16e7a8acb311ae0d0f5f541d4d6a48d14e2929a84a6e271afc6766f29b035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ff16e7a8acb311ae0d0f5f541d4d6a48d14e2929a84a6e271afc6766f29b035","first_computed_at":"2026-05-18T00:58:25.880389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.880389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fd9Lcd0MkvF2CmQJN8kM+7c9RgcCRNGUebKh+0SjQu9RLtPhkCAh1m30UXablt+nx5B9q5V4UhdmacMifPYaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.881099Z","signed_message":"canonical_sha256_bytes"},"source_id":"0711.4406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25e3adaf6efc876f47f83c0ed1c521c5abe1920574259ef29d5bd21cee8634bd","sha256:581c20ade522e57f3632e87f7c549529f5ea4388579035428fb87117ea91b717"],"state_sha256":"4e3369f29678a22b5adc36b2572ca6ea9b638920a52dfa4eb758b828cb4e17c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"minUy62tK3H8Br491jhL3qUMHnM+2kADzxNyTqolOnxwG2JJymGA97Limq2MPqPDw3rscxGhx4ptsSFGH1OnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:05:33.264200Z","bundle_sha256":"ef50b96c697947717c5d4c18ebc974f193e698b6d4c0075795da89873d70e4ae"}}