{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5W2LMNTNJ4AUQ5VYB7FQV4GSPX","short_pith_number":"pith:5W2LMNTN","canonical_record":{"source":{"id":"1803.06019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-15T22:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"0fe0118da3e8e775b9bc0a1cfd9605066b6b28f9ec101f0ce0e53dafddaede9e","abstract_canon_sha256":"1b351e89f997c5b8df4c1398b4752766a5202d8e66c27bb7300339b530822d88"},"schema_version":"1.0"},"canonical_sha256":"edb4b6366d4f014876b80fcb0af0d27df6ebea1864fc119889e4b8179f90be9a","source":{"kind":"arxiv","id":"1803.06019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06019","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06019v1","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06019","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"5W2LMNTNJ4AU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5W2LMNTNJ4AUQ5VY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5W2LMNTN","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5W2LMNTNJ4AUQ5VYB7FQV4GSPX","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-15T22:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"0fe0118da3e8e775b9bc0a1cfd9605066b6b28f9ec101f0ce0e53dafddaede9e","abstract_canon_sha256":"1b351e89f997c5b8df4c1398b4752766a5202d8e66c27bb7300339b530822d88"},"schema_version":"1.0"},"canonical_sha256":"edb4b6366d4f014876b80fcb0af0d27df6ebea1864fc119889e4b8179f90be9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:51.016634Z","signature_b64":"iTsYUVxZcx7lTwn6Ur/P489vLc9CDzs61ZqCyeFSGgxzGZbw0nsJHRKtn719Wj96uukH1dbrNWyaVISXfNcwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb4b6366d4f014876b80fcb0af0d27df6ebea1864fc119889e4b8179f90be9a","last_reissued_at":"2026-05-18T00:20:51.015970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:51.015970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06019","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-18T00:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ANXuZNMllM7+gJtmkluKOxsVOhkcV6RVq4jy9LwFcuG0bRRtSsQhcKJ7JQyyvz010mQN6470lSKpx+ICMnwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:03:37.361655Z"},"content_sha256":"dd9b8cde7aa2f9583d5cc0eed1dacdb070a39a775dcea1f7c5d937ef13ba88d6","schema_version":"1.0","event_id":"sha256:dd9b8cde7aa2f9583d5cc0eed1dacdb070a39a775dcea1f7c5d937ef13ba88d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5W2LMNTNJ4AUQ5VYB7FQV4GSPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Matrix Asymptotic Analysis of ZF and MMSE Crosstalk Cancelers for Wireline Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Amir Leshem, Itsik Bergel, S. M. Zafaruddin","submitted_at":"2018-03-15T22:08:56Z","abstract_excerpt":"We present asymptotic expressions for user throughput in a multi-user wireline system with a linear decoder, in increasingly large system sizes. This analysis can be seen as a generalization of results obtained for wireless communication. The features of the diagonal elements of the wireline channel matrices make wireless asymptotic analyses inapplicable for wireline systems. Further, direct application of results from random matrix theory (RMT) yields a trivial lower bound. This paper presents a novel approach to asymptotic analysis, where an alternative sequence of systems is constructed tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06019","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-18T00:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bp9Sz8+C4JmE3OITtsEe9EXkXHgPZD2zHjobN6+DfoWDMJjyLbYuxitbqYxKS1hqUuUe4GP4edKyT18rIg3ODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:03:37.362068Z"},"content_sha256":"6cf066508f3461d05cd2b2302c62da878d044c2d04ff9a588b53a32a41dd0475","schema_version":"1.0","event_id":"sha256:6cf066508f3461d05cd2b2302c62da878d044c2d04ff9a588b53a32a41dd0475"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5W2LMNTNJ4AUQ5VYB7FQV4GSPX/bundle.json","state_url":"https://pith.science/pith/5W2LMNTNJ4AUQ5VYB7FQV4GSPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5W2LMNTNJ4AUQ5VYB7FQV4GSPX/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-30T11:03:37Z","links":{"resolver":"https://pith.science/pith/5W2LMNTNJ4AUQ5VYB7FQV4GSPX","bundle":"https://pith.science/pith/5W2LMNTNJ4AUQ5VYB7FQV4GSPX/bundle.json","state":"https://pith.science/pith/5W2LMNTNJ4AUQ5VYB7FQV4GSPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5W2LMNTNJ4AUQ5VYB7FQV4GSPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5W2LMNTNJ4AUQ5VYB7FQV4GSPX","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":"1b351e89f997c5b8df4c1398b4752766a5202d8e66c27bb7300339b530822d88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-15T22:08:56Z","title_canon_sha256":"0fe0118da3e8e775b9bc0a1cfd9605066b6b28f9ec101f0ce0e53dafddaede9e"},"schema_version":"1.0","source":{"id":"1803.06019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06019","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06019v1","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06019","created_at":"2026-05-18T00:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"5W2LMNTNJ4AU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5W2LMNTNJ4AUQ5VY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5W2LMNTN","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:6cf066508f3461d05cd2b2302c62da878d044c2d04ff9a588b53a32a41dd0475","target":"graph","created_at":"2026-05-18T00:20: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":"We present asymptotic expressions for user throughput in a multi-user wireline system with a linear decoder, in increasingly large system sizes. This analysis can be seen as a generalization of results obtained for wireless communication. The features of the diagonal elements of the wireline channel matrices make wireless asymptotic analyses inapplicable for wireline systems. Further, direct application of results from random matrix theory (RMT) yields a trivial lower bound. This paper presents a novel approach to asymptotic analysis, where an alternative sequence of systems is constructed tha","authors_text":"Amir Leshem, Itsik Bergel, S. M. Zafaruddin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-15T22:08:56Z","title":"Large Matrix Asymptotic Analysis of ZF and MMSE Crosstalk Cancelers for Wireline Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06019","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:dd9b8cde7aa2f9583d5cc0eed1dacdb070a39a775dcea1f7c5d937ef13ba88d6","target":"record","created_at":"2026-05-18T00:20: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":"1b351e89f997c5b8df4c1398b4752766a5202d8e66c27bb7300339b530822d88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-15T22:08:56Z","title_canon_sha256":"0fe0118da3e8e775b9bc0a1cfd9605066b6b28f9ec101f0ce0e53dafddaede9e"},"schema_version":"1.0","source":{"id":"1803.06019","kind":"arxiv","version":1}},"canonical_sha256":"edb4b6366d4f014876b80fcb0af0d27df6ebea1864fc119889e4b8179f90be9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edb4b6366d4f014876b80fcb0af0d27df6ebea1864fc119889e4b8179f90be9a","first_computed_at":"2026-05-18T00:20:51.015970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:51.015970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iTsYUVxZcx7lTwn6Ur/P489vLc9CDzs61ZqCyeFSGgxzGZbw0nsJHRKtn719Wj96uukH1dbrNWyaVISXfNcwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:51.016634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd9b8cde7aa2f9583d5cc0eed1dacdb070a39a775dcea1f7c5d937ef13ba88d6","sha256:6cf066508f3461d05cd2b2302c62da878d044c2d04ff9a588b53a32a41dd0475"],"state_sha256":"26d4d5d0711c99b0b5dfe12da2504f7087eb83f4aa51a765d7206cfd45e1521a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1I/7aKid1/i4sA+IAWRG3111p9SX0wViLcnxSryyC1ZSto7ZYj0Vc/jdwcdLtaGZS0Fwu4DZksYZjQR0AHKHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:03:37.364216Z","bundle_sha256":"7d27b6ad981cbbabd1ec66046337393d62b35d3a3d8f5d21dfbb5072b04992c9"}}