{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OLUQLTNXMWLOWPYZP7OKDELC7I","short_pith_number":"pith:OLUQLTNX","canonical_record":{"source":{"id":"1001.3911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-22T03:48:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"daf0ccbabfc501035f7139bbd57770a99c65cfb9114e757de25ec90df018c8b9","abstract_canon_sha256":"2010c2152259c9b5839f74eebc96b02a95defd37855cdf4afb2eefaab161fde8"},"schema_version":"1.0"},"canonical_sha256":"72e905cdb76596eb3f197fdca19162fa17545a27c6950bc64e070d8ccba0a35e","source":{"kind":"arxiv","id":"1001.3911","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3911","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3911v2","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3911","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"OLUQLTNXMWLO","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OLUQLTNXMWLOWPYZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OLUQLTNX","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OLUQLTNXMWLOWPYZP7OKDELC7I","target":"record","payload":{"canonical_record":{"source":{"id":"1001.3911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-22T03:48:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"daf0ccbabfc501035f7139bbd57770a99c65cfb9114e757de25ec90df018c8b9","abstract_canon_sha256":"2010c2152259c9b5839f74eebc96b02a95defd37855cdf4afb2eefaab161fde8"},"schema_version":"1.0"},"canonical_sha256":"72e905cdb76596eb3f197fdca19162fa17545a27c6950bc64e070d8ccba0a35e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:51.922095Z","signature_b64":"oJw8MS/VP5FOCEgFPpm+9lP+F0nLRXBFRTuKECF6EgByXdUd61dwkuZMS2bombxmyI/JXva/I0aUey1snehmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e905cdb76596eb3f197fdca19162fa17545a27c6950bc64e070d8ccba0a35e","last_reissued_at":"2026-05-18T04:11:51.921546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:51.921546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.3911","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-18T04:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGr+JPU+OwYavbJDIc42SY+zb9DeqZYgkQRSUabfsTkLnc5QJIVSJfH74IP8Q6Hz74vpVvNznDIr+1SNBMLYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:08:42.395348Z"},"content_sha256":"80f9948f7c03e9bc6cbdd76c94a02e3210dd5ac312b850d4508ad2be2229e04c","schema_version":"1.0","event_id":"sha256:80f9948f7c03e9bc6cbdd76c94a02e3210dd5ac312b850d4508ad2be2229e04c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OLUQLTNXMWLOWPYZP7OKDELC7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Lower Bounds on the Information Rate of Intersymbol Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jaekyun Moon, Seongwook Jeong","submitted_at":"2010-01-22T03:48:55Z","abstract_excerpt":"Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV. The information rate I(X; X+S+N) serves as a tight lower bound for capacity of intersymbol interference (ISI) channels corrupted by Gaussian noise. The new bounds can be calculated with a reasonable computational load and provide a similar level of tightness as the well-known conjectured lower bound by Shamai and Laroia for a good range of finite-ISI channels of practical interest. The computation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3911","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-18T04:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XvG8G7JsjobUvRmxxhgAYYRSgYpAm5yWKqCusByz17Sf8aauHBg96U/cWZX1fBcIO6vCgcZlSwUVTrRmKJ/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:08:42.395810Z"},"content_sha256":"6069d8840f9835922bc36d8aecba11b0e5e5a66a7e06123048dc6c4f0ecb291e","schema_version":"1.0","event_id":"sha256:6069d8840f9835922bc36d8aecba11b0e5e5a66a7e06123048dc6c4f0ecb291e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLUQLTNXMWLOWPYZP7OKDELC7I/bundle.json","state_url":"https://pith.science/pith/OLUQLTNXMWLOWPYZP7OKDELC7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLUQLTNXMWLOWPYZP7OKDELC7I/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-30T06:08:42Z","links":{"resolver":"https://pith.science/pith/OLUQLTNXMWLOWPYZP7OKDELC7I","bundle":"https://pith.science/pith/OLUQLTNXMWLOWPYZP7OKDELC7I/bundle.json","state":"https://pith.science/pith/OLUQLTNXMWLOWPYZP7OKDELC7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLUQLTNXMWLOWPYZP7OKDELC7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OLUQLTNXMWLOWPYZP7OKDELC7I","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":"2010c2152259c9b5839f74eebc96b02a95defd37855cdf4afb2eefaab161fde8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-22T03:48:55Z","title_canon_sha256":"daf0ccbabfc501035f7139bbd57770a99c65cfb9114e757de25ec90df018c8b9"},"schema_version":"1.0","source":{"id":"1001.3911","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3911","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3911v2","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3911","created_at":"2026-05-18T04:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"OLUQLTNXMWLO","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OLUQLTNXMWLOWPYZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OLUQLTNX","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:6069d8840f9835922bc36d8aecba11b0e5e5a66a7e06123048dc6c4f0ecb291e","target":"graph","created_at":"2026-05-18T04:11:51Z","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":"Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV. The information rate I(X; X+S+N) serves as a tight lower bound for capacity of intersymbol interference (ISI) channels corrupted by Gaussian noise. The new bounds can be calculated with a reasonable computational load and provide a similar level of tightness as the well-known conjectured lower bound by Shamai and Laroia for a good range of finite-ISI channels of practical interest. The computation ","authors_text":"Jaekyun Moon, Seongwook Jeong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-22T03:48:55Z","title":"Computing Lower Bounds on the Information Rate of Intersymbol Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3911","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:80f9948f7c03e9bc6cbdd76c94a02e3210dd5ac312b850d4508ad2be2229e04c","target":"record","created_at":"2026-05-18T04:11:51Z","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":"2010c2152259c9b5839f74eebc96b02a95defd37855cdf4afb2eefaab161fde8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-22T03:48:55Z","title_canon_sha256":"daf0ccbabfc501035f7139bbd57770a99c65cfb9114e757de25ec90df018c8b9"},"schema_version":"1.0","source":{"id":"1001.3911","kind":"arxiv","version":2}},"canonical_sha256":"72e905cdb76596eb3f197fdca19162fa17545a27c6950bc64e070d8ccba0a35e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72e905cdb76596eb3f197fdca19162fa17545a27c6950bc64e070d8ccba0a35e","first_computed_at":"2026-05-18T04:11:51.921546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:51.921546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oJw8MS/VP5FOCEgFPpm+9lP+F0nLRXBFRTuKECF6EgByXdUd61dwkuZMS2bombxmyI/JXva/I0aUey1snehmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:51.922095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3911","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80f9948f7c03e9bc6cbdd76c94a02e3210dd5ac312b850d4508ad2be2229e04c","sha256:6069d8840f9835922bc36d8aecba11b0e5e5a66a7e06123048dc6c4f0ecb291e"],"state_sha256":"2955be0a9c826129c51e990b61f352feaaca089f54b95f945f9bf06ecee40ec4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1+PN2NDo6iJLZesBBnABUW6yYC7cgM2k3o24o50SDlxyM7BY4ozRnPjCO4MfxQK4SRz5+39m6lqAqhfMXZYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:08:42.398782Z","bundle_sha256":"194569665b032dfc070886aaed646cde6b09c2cee79b38c527e96719322c6e69"}}