{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZNLIPTBGIVZHGJW6A745C322NO","short_pith_number":"pith:ZNLIPTBG","canonical_record":{"source":{"id":"1903.00738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-02T17:48:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80bed07243a38c29a344b88cdc3ef84102e432aa86419c87e4bbc9f842a4c2a3","abstract_canon_sha256":"21e5e4affb84cc42974c40e003a02e427b8b614e7b7c3f2adaef8cca8718bd75"},"schema_version":"1.0"},"canonical_sha256":"cb5687cc2645727326de07f9d16f5a6bad6d889960ed11af0f39368826eae054","source":{"kind":"arxiv","id":"1903.00738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00738","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00738v1","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00738","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZNLIPTBGIVZH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZNLIPTBGIVZHGJW6","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZNLIPTBG","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZNLIPTBGIVZHGJW6A745C322NO","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-02T17:48:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80bed07243a38c29a344b88cdc3ef84102e432aa86419c87e4bbc9f842a4c2a3","abstract_canon_sha256":"21e5e4affb84cc42974c40e003a02e427b8b614e7b7c3f2adaef8cca8718bd75"},"schema_version":"1.0"},"canonical_sha256":"cb5687cc2645727326de07f9d16f5a6bad6d889960ed11af0f39368826eae054","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:13.444031Z","signature_b64":"vow+UZ/oBlcClWGVXCJtd/1qo7CueNzWUvmlG/CkIGm5cg1uyDKocT7SQeadLvGcQViBn9aJhCspEVJNqR7dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5687cc2645727326de07f9d16f5a6bad6d889960ed11af0f39368826eae054","last_reissued_at":"2026-05-17T23:52:13.443304Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:13.443304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00738","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-17T23:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e27wZv2v2XaP5EpzWMzeTf3BZ2IwclvAEtLQ74PHSU0qyol6Azh9U+YoK+PLHM7uRjCsjGeCWnkbTcXJwBA5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:23:55.225969Z"},"content_sha256":"9296285fd273befee953217b17a6dc97de6a79c3dcaefd2d597baa3b5111207b","schema_version":"1.0","event_id":"sha256:9296285fd273befee953217b17a6dc97de6a79c3dcaefd2d597baa3b5111207b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZNLIPTBGIVZHGJW6A745C322NO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Proximal Jacobian ADMM Approach for Fast Massive MIMO Signal Detection in Low-Latency Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Elghariani, Anis Elgabli, Mark R. Bell, *Mehdi Bennis, Vaneet Aggarwal","submitted_at":"2019-03-02T17:48:27Z","abstract_excerpt":"One of the 5G promises is to provide Ultra Reliable Low Latency Communications (URLLC) which targets an end to end communication latency that is less than 1ms . The very low latency requirement of URLLC entails a lot of work in all networking layers. In this paper, we focus on the physical layer, and in particular, we propose a novel formulation of the massive MIMO uplink detection problem. We introduce an objective function that is a sum of strictly convex and separable functions based on decomposing the received vector into multiple vectors. Each vector represents the contribution of one of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00738","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-17T23:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqiqiFl3pfJzIko5N07SOGLlta8HG0IsZZ9Tm2JPK0MkU5FEn82bs6rFVyjbJdDzPdisP5Wza3orMFBk1rELAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:23:55.226337Z"},"content_sha256":"7dfc5b7269a21ec52b9d870df9780f7242f5d8b32dc46ad24d845621e434af0e","schema_version":"1.0","event_id":"sha256:7dfc5b7269a21ec52b9d870df9780f7242f5d8b32dc46ad24d845621e434af0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNLIPTBGIVZHGJW6A745C322NO/bundle.json","state_url":"https://pith.science/pith/ZNLIPTBGIVZHGJW6A745C322NO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNLIPTBGIVZHGJW6A745C322NO/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-11T09:23:55Z","links":{"resolver":"https://pith.science/pith/ZNLIPTBGIVZHGJW6A745C322NO","bundle":"https://pith.science/pith/ZNLIPTBGIVZHGJW6A745C322NO/bundle.json","state":"https://pith.science/pith/ZNLIPTBGIVZHGJW6A745C322NO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNLIPTBGIVZHGJW6A745C322NO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZNLIPTBGIVZHGJW6A745C322NO","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":"21e5e4affb84cc42974c40e003a02e427b8b614e7b7c3f2adaef8cca8718bd75","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-02T17:48:27Z","title_canon_sha256":"80bed07243a38c29a344b88cdc3ef84102e432aa86419c87e4bbc9f842a4c2a3"},"schema_version":"1.0","source":{"id":"1903.00738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00738","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00738v1","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00738","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZNLIPTBGIVZH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZNLIPTBGIVZHGJW6","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZNLIPTBG","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:7dfc5b7269a21ec52b9d870df9780f7242f5d8b32dc46ad24d845621e434af0e","target":"graph","created_at":"2026-05-17T23:52:13Z","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":"One of the 5G promises is to provide Ultra Reliable Low Latency Communications (URLLC) which targets an end to end communication latency that is less than 1ms . The very low latency requirement of URLLC entails a lot of work in all networking layers. In this paper, we focus on the physical layer, and in particular, we propose a novel formulation of the massive MIMO uplink detection problem. We introduce an objective function that is a sum of strictly convex and separable functions based on decomposing the received vector into multiple vectors. Each vector represents the contribution of one of ","authors_text":"Ali Elghariani, Anis Elgabli, Mark R. Bell, *Mehdi Bennis, Vaneet Aggarwal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-02T17:48:27Z","title":"A Proximal Jacobian ADMM Approach for Fast Massive MIMO Signal Detection in Low-Latency Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00738","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:9296285fd273befee953217b17a6dc97de6a79c3dcaefd2d597baa3b5111207b","target":"record","created_at":"2026-05-17T23:52:13Z","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":"21e5e4affb84cc42974c40e003a02e427b8b614e7b7c3f2adaef8cca8718bd75","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-02T17:48:27Z","title_canon_sha256":"80bed07243a38c29a344b88cdc3ef84102e432aa86419c87e4bbc9f842a4c2a3"},"schema_version":"1.0","source":{"id":"1903.00738","kind":"arxiv","version":1}},"canonical_sha256":"cb5687cc2645727326de07f9d16f5a6bad6d889960ed11af0f39368826eae054","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb5687cc2645727326de07f9d16f5a6bad6d889960ed11af0f39368826eae054","first_computed_at":"2026-05-17T23:52:13.443304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:13.443304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vow+UZ/oBlcClWGVXCJtd/1qo7CueNzWUvmlG/CkIGm5cg1uyDKocT7SQeadLvGcQViBn9aJhCspEVJNqR7dDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:13.444031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9296285fd273befee953217b17a6dc97de6a79c3dcaefd2d597baa3b5111207b","sha256:7dfc5b7269a21ec52b9d870df9780f7242f5d8b32dc46ad24d845621e434af0e"],"state_sha256":"9d46f1a0430494a374806d301a68dfed31ca683357cc7b3306dece220da2bb8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjqNELT7Eigq90XP4jnwGA/Dn2PMMGbKqD7Un+bZLAus3rKFkxvsa2UMFWaAUyIBjIUUlN00bU47jfv6/5XcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:23:55.228353Z","bundle_sha256":"118f0b6338e09337aedfca64ad8f18b167ea8d8d529765cf10ae4c89c1922932"}}