{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4BNXFJHCY4YSIAJ6BGXVZOE36U","short_pith_number":"pith:4BNXFJHC","canonical_record":{"source":{"id":"1406.5926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T14:38:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bf90842d9a9456af99fbd852b8f0a80b99a3d2b1640ae87e3f24e67fa1d8a6b","abstract_canon_sha256":"146bb33cea5ff465dc2a1418375f8c3dabfbbc572424bf3b19015480b1c44b8c"},"schema_version":"1.0"},"canonical_sha256":"e05b72a4e2c73124013e09af5cb89bf536e0bb5bd85fdd0b34c3e52dbaa1bbf9","source":{"kind":"arxiv","id":"1406.5926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5926","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5926v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5926","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"4BNXFJHCY4YS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4BNXFJHCY4YSIAJ6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4BNXFJHC","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4BNXFJHCY4YSIAJ6BGXVZOE36U","target":"record","payload":{"canonical_record":{"source":{"id":"1406.5926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T14:38:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bf90842d9a9456af99fbd852b8f0a80b99a3d2b1640ae87e3f24e67fa1d8a6b","abstract_canon_sha256":"146bb33cea5ff465dc2a1418375f8c3dabfbbc572424bf3b19015480b1c44b8c"},"schema_version":"1.0"},"canonical_sha256":"e05b72a4e2c73124013e09af5cb89bf536e0bb5bd85fdd0b34c3e52dbaa1bbf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:10.474661Z","signature_b64":"Th4mMGv94ZzvCPtMqCvsmp14yaOdrlylaThnit65yE/zhYOOcdJEvCC7KtyE7LGsS5dohKe0JG+ojFTs3TAMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e05b72a4e2c73124013e09af5cb89bf536e0bb5bd85fdd0b34c3e52dbaa1bbf9","last_reissued_at":"2026-05-18T02:49:10.474101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:10.474101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.5926","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-18T02:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dO7tjZETmztVBGsPhjGRqxbT1itWDncmDRjrCoBCuST5b2+Ebdu0qBxeIbBz+eyHEyiT5k9+A6HGx2gQD4gIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:45:31.748065Z"},"content_sha256":"2c6f0760f30a6aff8b357bff032e6ac03a0b7e380872f12ab6f2c95d74d84099","schema_version":"1.0","event_id":"sha256:2c6f0760f30a6aff8b357bff032e6ac03a0b7e380872f12ab6f2c95d74d84099"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4BNXFJHCY4YSIAJ6BGXVZOE36U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Lower Bound on the Noncoherent Capacity of Highly Underspread Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ian Wassell, Steven Herbert, Tian-Hong Loh","submitted_at":"2014-06-23T14:38:45Z","abstract_excerpt":"Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with perfect receiver Channel State Information (CSI). This paper presents a lower bound on the capacity of a channel with finite bandwidth, expressed in a form which is mathematically elegant, and computationally simple. The bounding method exploits the fact that most actual channels are highly underspread; and that typically more is known about their impulse response"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5926","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-18T02:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9NRZW1hUoZVx7/UoTz5MrE31DEzkSHiCJe57rt2429kYT08UQdtDcM03bFXda71/+5U9Jt+LCVHsuvPBHwyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:45:31.748440Z"},"content_sha256":"7f0677e86010fb981c160ad8c84c16e6e0d66b4aa7c68a89a2a0cc77b1a4c9b6","schema_version":"1.0","event_id":"sha256:7f0677e86010fb981c160ad8c84c16e6e0d66b4aa7c68a89a2a0cc77b1a4c9b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BNXFJHCY4YSIAJ6BGXVZOE36U/bundle.json","state_url":"https://pith.science/pith/4BNXFJHCY4YSIAJ6BGXVZOE36U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BNXFJHCY4YSIAJ6BGXVZOE36U/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-06-10T18:45:31Z","links":{"resolver":"https://pith.science/pith/4BNXFJHCY4YSIAJ6BGXVZOE36U","bundle":"https://pith.science/pith/4BNXFJHCY4YSIAJ6BGXVZOE36U/bundle.json","state":"https://pith.science/pith/4BNXFJHCY4YSIAJ6BGXVZOE36U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BNXFJHCY4YSIAJ6BGXVZOE36U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4BNXFJHCY4YSIAJ6BGXVZOE36U","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":"146bb33cea5ff465dc2a1418375f8c3dabfbbc572424bf3b19015480b1c44b8c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T14:38:45Z","title_canon_sha256":"8bf90842d9a9456af99fbd852b8f0a80b99a3d2b1640ae87e3f24e67fa1d8a6b"},"schema_version":"1.0","source":{"id":"1406.5926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5926","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5926v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5926","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"4BNXFJHCY4YS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4BNXFJHCY4YSIAJ6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4BNXFJHC","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:7f0677e86010fb981c160ad8c84c16e6e0d66b4aa7c68a89a2a0cc77b1a4c9b6","target":"graph","created_at":"2026-05-18T02:49:10Z","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":"Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with perfect receiver Channel State Information (CSI). This paper presents a lower bound on the capacity of a channel with finite bandwidth, expressed in a form which is mathematically elegant, and computationally simple. The bounding method exploits the fact that most actual channels are highly underspread; and that typically more is known about their impulse response","authors_text":"Ian Wassell, Steven Herbert, Tian-Hong Loh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T14:38:45Z","title":"A Simple Lower Bound on the Noncoherent Capacity of Highly Underspread Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5926","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:2c6f0760f30a6aff8b357bff032e6ac03a0b7e380872f12ab6f2c95d74d84099","target":"record","created_at":"2026-05-18T02:49:10Z","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":"146bb33cea5ff465dc2a1418375f8c3dabfbbc572424bf3b19015480b1c44b8c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T14:38:45Z","title_canon_sha256":"8bf90842d9a9456af99fbd852b8f0a80b99a3d2b1640ae87e3f24e67fa1d8a6b"},"schema_version":"1.0","source":{"id":"1406.5926","kind":"arxiv","version":1}},"canonical_sha256":"e05b72a4e2c73124013e09af5cb89bf536e0bb5bd85fdd0b34c3e52dbaa1bbf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e05b72a4e2c73124013e09af5cb89bf536e0bb5bd85fdd0b34c3e52dbaa1bbf9","first_computed_at":"2026-05-18T02:49:10.474101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:10.474101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Th4mMGv94ZzvCPtMqCvsmp14yaOdrlylaThnit65yE/zhYOOcdJEvCC7KtyE7LGsS5dohKe0JG+ojFTs3TAMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:10.474661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c6f0760f30a6aff8b357bff032e6ac03a0b7e380872f12ab6f2c95d74d84099","sha256:7f0677e86010fb981c160ad8c84c16e6e0d66b4aa7c68a89a2a0cc77b1a4c9b6"],"state_sha256":"29e457cab9b31008d880afc2f46b9a9f8c2d184517a84b7a5dc8b68f16d8f6a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ibO3t5cQkgVZ8Tqfk5LRqXweNEGmocDVXsILXtn1+qGfhFQ/+NWRu5GmJErKhEs7JxjO1eBtfgUEhscqyo+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:45:31.750468Z","bundle_sha256":"a7547d14e459fccb40c7f11c2c09ef524ad6ff4da0a4feb32d4450c511dc93a7"}}