{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RDDI5XVRRYLRYZGA2RYIQ4FLP5","short_pith_number":"pith:RDDI5XVR","canonical_record":{"source":{"id":"1409.8359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-30T01:37:11Z","cross_cats_sorted":["cs.NI","math.IT","stat.ML"],"title_canon_sha256":"6d036a1483eeabc5b6b7dd08fd83b248e09ae46e52c516cb147a01697491bef2","abstract_canon_sha256":"1d5b4159076ae323f26bd9d26e0b19f7ba9a1d8fc850e6f1186ad26509b72ad7"},"schema_version":"1.0"},"canonical_sha256":"88c68edeb18e171c64c0d4708870ab7f5aaf442ece7655535ce8bd170aa046e7","source":{"kind":"arxiv","id":"1409.8359","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8359","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8359v2","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8359","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"RDDI5XVRRYLR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDDI5XVRRYLRYZGA","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDDI5XVR","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RDDI5XVRRYLRYZGA2RYIQ4FLP5","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-30T01:37:11Z","cross_cats_sorted":["cs.NI","math.IT","stat.ML"],"title_canon_sha256":"6d036a1483eeabc5b6b7dd08fd83b248e09ae46e52c516cb147a01697491bef2","abstract_canon_sha256":"1d5b4159076ae323f26bd9d26e0b19f7ba9a1d8fc850e6f1186ad26509b72ad7"},"schema_version":"1.0"},"canonical_sha256":"88c68edeb18e171c64c0d4708870ab7f5aaf442ece7655535ce8bd170aa046e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:08.304463Z","signature_b64":"5mzZFWvpBquWXeAjF57nfMIlP98Aa9FP+rsU6QAua3dJ5HgtmgNY1sU+XX3SVM8BYNNgq42pEpBTs2EoON9VDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88c68edeb18e171c64c0d4708870ab7f5aaf442ece7655535ce8bd170aa046e7","last_reissued_at":"2026-05-18T01:30:08.303793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:08.303793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8359","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-18T01:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hT91AJlEQUuExfzAHcSwKh5Ofu2VMtj1p3jRV6oYhuBQ8VEXSBzc/Fb9jKkB9/4PjPGXIKkgDQIUuxnUeo3KAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:35:01.589816Z"},"content_sha256":"c0da1a999ae8cf3a3844782bb70dcdaa7c803cbf137ac53c787282269e513412","schema_version":"1.0","event_id":"sha256:c0da1a999ae8cf3a3844782bb70dcdaa7c803cbf137ac53c787282269e513412"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RDDI5XVRRYLRYZGA2RYIQ4FLP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Backhaul-Constrained Multi-Cell Cooperation Leveraging Sparsity and Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Georgios B. Giannakis, Seung-Jun Kim, Swayambhoo Jain","submitted_at":"2014-09-30T01:37:11Z","abstract_excerpt":"Multi-cell cooperative processing with limited backhaul traffic is studied for cellular uplinks. Aiming at reduced backhaul overhead, a sparsity-regularized multi-cell receive-filter design problem is formulated. Both unstructured distributed cooperation as well as clustered cooperation, in which base station groups are formed for tight cooperation, are considered. Dynamic clustered cooperation, where the sparse equalizer and the cooperation clusters are jointly determined, is solved via alternating minimization based on spectral clustering and group-sparse regression. Furthermore, decentraliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8359","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-18T01:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lx1iPvf23QBjPSkY2vmDbJUuhi5FHCFe5BLIC1zjuSbrg/4PSQY+xDhkrR8FMHkEJCmy/sUENc/DclBMV7siAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:35:01.590485Z"},"content_sha256":"8bab638076be881a2f0939cfe35f7e6c4ad07e82bbfdc78aada28ba4f560a696","schema_version":"1.0","event_id":"sha256:8bab638076be881a2f0939cfe35f7e6c4ad07e82bbfdc78aada28ba4f560a696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDDI5XVRRYLRYZGA2RYIQ4FLP5/bundle.json","state_url":"https://pith.science/pith/RDDI5XVRRYLRYZGA2RYIQ4FLP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDDI5XVRRYLRYZGA2RYIQ4FLP5/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-10T23:35:01Z","links":{"resolver":"https://pith.science/pith/RDDI5XVRRYLRYZGA2RYIQ4FLP5","bundle":"https://pith.science/pith/RDDI5XVRRYLRYZGA2RYIQ4FLP5/bundle.json","state":"https://pith.science/pith/RDDI5XVRRYLRYZGA2RYIQ4FLP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDDI5XVRRYLRYZGA2RYIQ4FLP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RDDI5XVRRYLRYZGA2RYIQ4FLP5","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":"1d5b4159076ae323f26bd9d26e0b19f7ba9a1d8fc850e6f1186ad26509b72ad7","cross_cats_sorted":["cs.NI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-30T01:37:11Z","title_canon_sha256":"6d036a1483eeabc5b6b7dd08fd83b248e09ae46e52c516cb147a01697491bef2"},"schema_version":"1.0","source":{"id":"1409.8359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8359","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8359v2","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8359","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"RDDI5XVRRYLR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDDI5XVRRYLRYZGA","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDDI5XVR","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:8bab638076be881a2f0939cfe35f7e6c4ad07e82bbfdc78aada28ba4f560a696","target":"graph","created_at":"2026-05-18T01:30:08Z","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":"Multi-cell cooperative processing with limited backhaul traffic is studied for cellular uplinks. Aiming at reduced backhaul overhead, a sparsity-regularized multi-cell receive-filter design problem is formulated. Both unstructured distributed cooperation as well as clustered cooperation, in which base station groups are formed for tight cooperation, are considered. Dynamic clustered cooperation, where the sparse equalizer and the cooperation clusters are jointly determined, is solved via alternating minimization based on spectral clustering and group-sparse regression. Furthermore, decentraliz","authors_text":"Georgios B. Giannakis, Seung-Jun Kim, Swayambhoo Jain","cross_cats":["cs.NI","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-30T01:37:11Z","title":"Backhaul-Constrained Multi-Cell Cooperation Leveraging Sparsity and Spectral Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8359","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:c0da1a999ae8cf3a3844782bb70dcdaa7c803cbf137ac53c787282269e513412","target":"record","created_at":"2026-05-18T01:30:08Z","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":"1d5b4159076ae323f26bd9d26e0b19f7ba9a1d8fc850e6f1186ad26509b72ad7","cross_cats_sorted":["cs.NI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-30T01:37:11Z","title_canon_sha256":"6d036a1483eeabc5b6b7dd08fd83b248e09ae46e52c516cb147a01697491bef2"},"schema_version":"1.0","source":{"id":"1409.8359","kind":"arxiv","version":2}},"canonical_sha256":"88c68edeb18e171c64c0d4708870ab7f5aaf442ece7655535ce8bd170aa046e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88c68edeb18e171c64c0d4708870ab7f5aaf442ece7655535ce8bd170aa046e7","first_computed_at":"2026-05-18T01:30:08.303793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:08.303793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5mzZFWvpBquWXeAjF57nfMIlP98Aa9FP+rsU6QAua3dJ5HgtmgNY1sU+XX3SVM8BYNNgq42pEpBTs2EoON9VDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:08.304463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0da1a999ae8cf3a3844782bb70dcdaa7c803cbf137ac53c787282269e513412","sha256:8bab638076be881a2f0939cfe35f7e6c4ad07e82bbfdc78aada28ba4f560a696"],"state_sha256":"de73e88f3d0180725300cedabec1bc5eecba3aca31fbebec3534a752490bc768"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWjgsVR+756ZdIUJWhSRZNzrlEQQlg+IKeH0LBf/8ovsK2CMZB/yiWTzG0KjAWoanjGllF0yzMKSXD3P3XaaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:35:01.594114Z","bundle_sha256":"0a662b5a1fe0b9b8f663234d608f8814a725b14d0f7e675d7be886a7b3b78a5a"}}