{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7OUV64FTD6YXOCDXS75MVFBUIB","short_pith_number":"pith:7OUV64FT","schema_version":"1.0","canonical_sha256":"fba95f70b31fb177087797faca9434404dd13e4221f9c009956cbced081ab304","source":{"kind":"arxiv","id":"1704.06124","version":2},"attestation_state":"computed","paper":{"title":"An Achievable Rate for an Optical Channel with Finite Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K Gautam Shenoy, Vinod Sharma","submitted_at":"2017-04-20T13:06:27Z","abstract_excerpt":"A fiber optic channel is modeled in a variety of ways; from the simple additive white complex Gaussian noise model, to models that incorporate memory in the channel. Because of Kerr nonlinearity, a simple model is not a good approximation to an optical fiber. Hence we study a fiber optic channel with finite memory and provide an achievable bound on channel capacity that improves upon a previously known bound."},"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":"1704.06124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-20T13:06:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9b2d6f8c18ea28a12e950a7efc8e03ce0da936c7d880d1577675ffd74f1d0a5","abstract_canon_sha256":"b996724ea585464e4bca9bc4cf20b9d22b39791bcafed9a0747314b24ce7b857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.215891Z","signature_b64":"mwACH1BMQ8DErZLlOR0liLMdFcxyqLfwNeZA2ufiBtznUhHGiINU8L6kUSl0rNxGc0c7av27qPsQD3kwhaLZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba95f70b31fb177087797faca9434404dd13e4221f9c009956cbced081ab304","last_reissued_at":"2026-05-18T00:31:51.215208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.215208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Achievable Rate for an Optical Channel with Finite Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K Gautam Shenoy, Vinod Sharma","submitted_at":"2017-04-20T13:06:27Z","abstract_excerpt":"A fiber optic channel is modeled in a variety of ways; from the simple additive white complex Gaussian noise model, to models that incorporate memory in the channel. Because of Kerr nonlinearity, a simple model is not a good approximation to an optical fiber. Hence we study a fiber optic channel with finite memory and provide an achievable bound on channel capacity that improves upon a previously known bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06124","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.06124","created_at":"2026-05-18T00:31:51.215341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06124v2","created_at":"2026-05-18T00:31:51.215341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06124","created_at":"2026-05-18T00:31:51.215341+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OUV64FTD6YX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OUV64FTD6YXOCDX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OUV64FT","created_at":"2026-05-18T12:31:05.417338+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/7OUV64FTD6YXOCDXS75MVFBUIB","json":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB.json","graph_json":"https://pith.science/api/pith-number/7OUV64FTD6YXOCDXS75MVFBUIB/graph.json","events_json":"https://pith.science/api/pith-number/7OUV64FTD6YXOCDXS75MVFBUIB/events.json","paper":"https://pith.science/paper/7OUV64FT"},"agent_actions":{"view_html":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB","download_json":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB.json","view_paper":"https://pith.science/paper/7OUV64FT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06124&json=true","fetch_graph":"https://pith.science/api/pith-number/7OUV64FTD6YXOCDXS75MVFBUIB/graph.json","fetch_events":"https://pith.science/api/pith-number/7OUV64FTD6YXOCDXS75MVFBUIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB/action/storage_attestation","attest_author":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB/action/author_attestation","sign_citation":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB/action/citation_signature","submit_replication":"https://pith.science/pith/7OUV64FTD6YXOCDXS75MVFBUIB/action/replication_record"}},"created_at":"2026-05-18T00:31:51.215341+00:00","updated_at":"2026-05-18T00:31:51.215341+00:00"}