{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IVT7MMRBPN7MU73YIX5TWZ5HMN","short_pith_number":"pith:IVT7MMRB","canonical_record":{"source":{"id":"1901.08570","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-24T18:41:08Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"c935244e9f08743de06e9fc33fbd753f0fdc31416e28ed78423801c226448909","abstract_canon_sha256":"2b04abab25faeee9fe6c0f381f448399d499e3e970aa5b6c1910a40096f575eb"},"schema_version":"1.0"},"canonical_sha256":"4567f632217b7eca7f7845fb3b67a76361215b67d95541cfe0875fa5be4cc5be","source":{"kind":"arxiv","id":"1901.08570","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08570","created_at":"2026-05-17T23:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08570v2","created_at":"2026-05-17T23:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08570","created_at":"2026-05-17T23:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"IVT7MMRBPN7M","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IVT7MMRBPN7MU73Y","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IVT7MMRB","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IVT7MMRBPN7MU73YIX5TWZ5HMN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08570","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-24T18:41:08Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"c935244e9f08743de06e9fc33fbd753f0fdc31416e28ed78423801c226448909","abstract_canon_sha256":"2b04abab25faeee9fe6c0f381f448399d499e3e970aa5b6c1910a40096f575eb"},"schema_version":"1.0"},"canonical_sha256":"4567f632217b7eca7f7845fb3b67a76361215b67d95541cfe0875fa5be4cc5be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:55.206115Z","signature_b64":"UFgGiluJ+j0SZDIMRbN6KGROfbDnZW2QTiUSBcp10TUaUcOrozGgnAIjdlmZCfrYkFL5ONnht27ckSWtkKPTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4567f632217b7eca7f7845fb3b67a76361215b67d95541cfe0875fa5be4cc5be","last_reissued_at":"2026-05-17T23:39:55.205426Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:55.205426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08570","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-17T23:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KozhqtLOamujdXyzOni2YFFLKP9+E0v9LO8KcxNLkQc71gPJHuK+VjXa0H2xkKkTMaqiL1oGl9yt2kSC03yZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:33:27.052622Z"},"content_sha256":"ad9cfc9ae292f1d9aae81d201e45d66bc1066365f1ca5beb552bbb8f4cace1ca","schema_version":"1.0","event_id":"sha256:ad9cfc9ae292f1d9aae81d201e45d66bc1066365f1ca5beb552bbb8f4cace1ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IVT7MMRBPN7MU73YIX5TWZ5HMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"End-to-End Optimized Transmission over Dispersive Intensity-Modulated Channels Using Bidirectional Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Boris Karanov, Domani\\c{c} Lavery, Laurent Schmalen, Polina Bayvel","submitted_at":"2019-01-24T18:41:08Z","abstract_excerpt":"We propose an autoencoding sequence-based transceiver for communication over dispersive channels with intensity modulation and direct detection (IM/DD), designed as a bidirectional deep recurrent neural network (BRNN). The receiver uses a sliding window technique to allow for efficient data stream estimation. We find that this sliding window BRNN (SBRNN), based on end-to-end deep learning of the communication system, achieves a significant bit-error-rate reduction at all examined distances in comparison to previous block-based autoencoders implemented as feed-forward neural networks (FFNNs), l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08570","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-17T23:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+3TqaR+nkGiYMpP+60cOPkHUCydVa1f/3u9HK5K/arIcje4Bdj6ffNKlwDsocjRCD246/pJeZV3De0wQ6N1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:33:27.052967Z"},"content_sha256":"a10efee9b0e124d1f5765c697a4983205cefe40307426cf7595f357e1beab887","schema_version":"1.0","event_id":"sha256:a10efee9b0e124d1f5765c697a4983205cefe40307426cf7595f357e1beab887"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVT7MMRBPN7MU73YIX5TWZ5HMN/bundle.json","state_url":"https://pith.science/pith/IVT7MMRBPN7MU73YIX5TWZ5HMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVT7MMRBPN7MU73YIX5TWZ5HMN/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-21T20:33:27Z","links":{"resolver":"https://pith.science/pith/IVT7MMRBPN7MU73YIX5TWZ5HMN","bundle":"https://pith.science/pith/IVT7MMRBPN7MU73YIX5TWZ5HMN/bundle.json","state":"https://pith.science/pith/IVT7MMRBPN7MU73YIX5TWZ5HMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVT7MMRBPN7MU73YIX5TWZ5HMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IVT7MMRBPN7MU73YIX5TWZ5HMN","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":"2b04abab25faeee9fe6c0f381f448399d499e3e970aa5b6c1910a40096f575eb","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-24T18:41:08Z","title_canon_sha256":"c935244e9f08743de06e9fc33fbd753f0fdc31416e28ed78423801c226448909"},"schema_version":"1.0","source":{"id":"1901.08570","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08570","created_at":"2026-05-17T23:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08570v2","created_at":"2026-05-17T23:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08570","created_at":"2026-05-17T23:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"IVT7MMRBPN7M","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IVT7MMRBPN7MU73Y","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IVT7MMRB","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:a10efee9b0e124d1f5765c697a4983205cefe40307426cf7595f357e1beab887","target":"graph","created_at":"2026-05-17T23:39:55Z","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 propose an autoencoding sequence-based transceiver for communication over dispersive channels with intensity modulation and direct detection (IM/DD), designed as a bidirectional deep recurrent neural network (BRNN). The receiver uses a sliding window technique to allow for efficient data stream estimation. We find that this sliding window BRNN (SBRNN), based on end-to-end deep learning of the communication system, achieves a significant bit-error-rate reduction at all examined distances in comparison to previous block-based autoencoders implemented as feed-forward neural networks (FFNNs), l","authors_text":"Boris Karanov, Domani\\c{c} Lavery, Laurent Schmalen, Polina Bayvel","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-24T18:41:08Z","title":"End-to-End Optimized Transmission over Dispersive Intensity-Modulated Channels Using Bidirectional Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08570","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:ad9cfc9ae292f1d9aae81d201e45d66bc1066365f1ca5beb552bbb8f4cace1ca","target":"record","created_at":"2026-05-17T23:39:55Z","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":"2b04abab25faeee9fe6c0f381f448399d499e3e970aa5b6c1910a40096f575eb","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-24T18:41:08Z","title_canon_sha256":"c935244e9f08743de06e9fc33fbd753f0fdc31416e28ed78423801c226448909"},"schema_version":"1.0","source":{"id":"1901.08570","kind":"arxiv","version":2}},"canonical_sha256":"4567f632217b7eca7f7845fb3b67a76361215b67d95541cfe0875fa5be4cc5be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4567f632217b7eca7f7845fb3b67a76361215b67d95541cfe0875fa5be4cc5be","first_computed_at":"2026-05-17T23:39:55.205426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:55.205426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFgGiluJ+j0SZDIMRbN6KGROfbDnZW2QTiUSBcp10TUaUcOrozGgnAIjdlmZCfrYkFL5ONnht27ckSWtkKPTCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:55.206115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08570","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad9cfc9ae292f1d9aae81d201e45d66bc1066365f1ca5beb552bbb8f4cace1ca","sha256:a10efee9b0e124d1f5765c697a4983205cefe40307426cf7595f357e1beab887"],"state_sha256":"5009ab200b1ffbfefbd43f543db685858e206583ae091add966dbec1826a539a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHVTWLMEunMFSca4VJgiLfJTINScXuMAcJ7fEOoBjyZ9wmIK4PhQRS8o6Cc7C96oB/q4tAl7AbN07NgAnmV8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:33:27.054862Z","bundle_sha256":"0f9f234a5dd8dc5d5f7cefd1713cc71a8f391ac125b588dda038769b2db7f604"}}