{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7WE5FABO2IBZFFFHVOWBSRNX3V","short_pith_number":"pith:7WE5FABO","schema_version":"1.0","canonical_sha256":"fd89d2802ed2039294a7abac1945b7dd676bb741321609c504da9157b7a648df","source":{"kind":"arxiv","id":"1904.09807","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Multi-Step Nonlinearity Compensation with Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"eess.SP","authors_text":"Alex Alvarado, Christian H\\\"ager, Gabriele Liga, Henry D. Pfister, Rick M. B\\\"utler","submitted_at":"2019-04-22T12:01:39Z","abstract_excerpt":"For the efficient compensation of fiber nonlinearity, one of the guiding principles appears to be: fewer steps are better and more efficient. We challenge this assumption and show that carefully designed multi-step approaches can lead to better performance-complexity trade-offs than their few-step counterparts."},"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":"1904.09807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-04-22T12:01:39Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"e394c199310abe6a85f29a7e6496d1eda5bcaca75d73bec4a5b97940aaa820c6","abstract_canon_sha256":"c4948bd84fe668d36d629eae5083c19e64b8a532e1c749897ae084ffd226ad46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:03.257913Z","signature_b64":"9OQwcWu2ZfbhA9eynvGCJKM0mB/tqtp0PVsJvfpjYpn8N0XGDF9Eu5EOcFloADfLi+GQKKeYkkS/FgeCaLMXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd89d2802ed2039294a7abac1945b7dd676bb741321609c504da9157b7a648df","last_reissued_at":"2026-05-17T23:48:03.257269Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:03.257269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Multi-Step Nonlinearity Compensation with Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"eess.SP","authors_text":"Alex Alvarado, Christian H\\\"ager, Gabriele Liga, Henry D. Pfister, Rick M. B\\\"utler","submitted_at":"2019-04-22T12:01:39Z","abstract_excerpt":"For the efficient compensation of fiber nonlinearity, one of the guiding principles appears to be: fewer steps are better and more efficient. We challenge this assumption and show that carefully designed multi-step approaches can lead to better performance-complexity trade-offs than their few-step counterparts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09807","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.09807","created_at":"2026-05-17T23:48:03.257365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09807v1","created_at":"2026-05-17T23:48:03.257365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09807","created_at":"2026-05-17T23:48:03.257365+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WE5FABO2IBZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WE5FABO2IBZFFFH","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WE5FABO","created_at":"2026-05-18T12:33:12.712433+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/7WE5FABO2IBZFFFHVOWBSRNX3V","json":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V.json","graph_json":"https://pith.science/api/pith-number/7WE5FABO2IBZFFFHVOWBSRNX3V/graph.json","events_json":"https://pith.science/api/pith-number/7WE5FABO2IBZFFFHVOWBSRNX3V/events.json","paper":"https://pith.science/paper/7WE5FABO"},"agent_actions":{"view_html":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V","download_json":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V.json","view_paper":"https://pith.science/paper/7WE5FABO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09807&json=true","fetch_graph":"https://pith.science/api/pith-number/7WE5FABO2IBZFFFHVOWBSRNX3V/graph.json","fetch_events":"https://pith.science/api/pith-number/7WE5FABO2IBZFFFHVOWBSRNX3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V/action/storage_attestation","attest_author":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V/action/author_attestation","sign_citation":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V/action/citation_signature","submit_replication":"https://pith.science/pith/7WE5FABO2IBZFFFHVOWBSRNX3V/action/replication_record"}},"created_at":"2026-05-17T23:48:03.257365+00:00","updated_at":"2026-05-17T23:48:03.257365+00:00"}