{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RO253D5JEN5HZKDTUM72FB5RLG","short_pith_number":"pith:RO253D5J","canonical_record":{"source":{"id":"1602.08714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-28T13:31:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d876dd1319893cfe60dda5a5f361697f3894802d5b9ea0524002c0ab3bb91143","abstract_canon_sha256":"a0730aa369386d45e9f6b7591f885e72e7461d3260702afe09587aef3d64634f"},"schema_version":"1.0"},"canonical_sha256":"8bb5dd8fa9237a7ca873a33fa287b1599e77b29c5cbe3598bf022d484faa9a8d","source":{"kind":"arxiv","id":"1602.08714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08714","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08714v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08714","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"RO253D5JEN5H","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RO253D5JEN5HZKDT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RO253D5J","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RO253D5JEN5HZKDTUM72FB5RLG","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-28T13:31:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d876dd1319893cfe60dda5a5f361697f3894802d5b9ea0524002c0ab3bb91143","abstract_canon_sha256":"a0730aa369386d45e9f6b7591f885e72e7461d3260702afe09587aef3d64634f"},"schema_version":"1.0"},"canonical_sha256":"8bb5dd8fa9237a7ca873a33fa287b1599e77b29c5cbe3598bf022d484faa9a8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.120280Z","signature_b64":"PDKI62PZyl4izM/j/Bjd5dOx9XPtqn+LHvyW8JdZEaSAn0fadZ6VxMkBqNfzXAoNNVRge8CxA5M93GqsbLaqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb5dd8fa9237a7ca873a33fa287b1599e77b29c5cbe3598bf022d484faa9a8d","last_reissued_at":"2026-05-18T01:19:52.119648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.119648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08714","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jV3Autz0AQTMqA5zcH4drb3GjCuoN2QlKA/sYb2x31wjHd8QqW2YPzT4nD04G/f+MCA0T7hWfIvaUSjLEGJ/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:56:14.264008Z"},"content_sha256":"06bb15ec17c5c0ed457bdfb464313afb269957944c8bbd59de25a1618e74bc2d","schema_version":"1.0","event_id":"sha256:06bb15ec17c5c0ed457bdfb464313afb269957944c8bbd59de25a1618e74bc2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RO253D5JEN5HZKDTUM72FB5RLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossy Compression for Compute-and-Forward in Limited Backhaul Uplink Multicell Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdellatif Zaidi, I\\~naki Estella Aguerri","submitted_at":"2016-02-28T13:31:25Z","abstract_excerpt":"We study the transmission over a cloud radio access network in which multiple base stations (BS) are connected to a central processor (CP) via finite-capacity backhaul links. We propose two lattice-based coding schemes. In the first scheme, the base stations decode linear combinations of the transmitted messages, in the spirit of compute-and-forward (CoF), but differs from it essentially in that the decoded equations are remapped to linear combinations of the channel input symbols, sent compressed in a lossy manner to the central processor, and are not required to be linearly independent. Also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08714","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BAbfHcAIa1czW6H/t5AfzT9BwIviYIDTh3nMvZJ0Kuolxgyy1sT3W3YyCPo+YX2PuNMzRt3/V+Mf2A1QT8sVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:56:14.264685Z"},"content_sha256":"9abbd5cc4739ed10f80b68ff614dd64c8df93328fa7f4a7e4452ea43bed9fdb6","schema_version":"1.0","event_id":"sha256:9abbd5cc4739ed10f80b68ff614dd64c8df93328fa7f4a7e4452ea43bed9fdb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/bundle.json","state_url":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RO253D5JEN5HZKDTUM72FB5RLG/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-25T22:56:14Z","links":{"resolver":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG","bundle":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/bundle.json","state":"https://pith.science/pith/RO253D5JEN5HZKDTUM72FB5RLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RO253D5JEN5HZKDTUM72FB5RLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RO253D5JEN5HZKDTUM72FB5RLG","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":"a0730aa369386d45e9f6b7591f885e72e7461d3260702afe09587aef3d64634f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-28T13:31:25Z","title_canon_sha256":"d876dd1319893cfe60dda5a5f361697f3894802d5b9ea0524002c0ab3bb91143"},"schema_version":"1.0","source":{"id":"1602.08714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08714","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08714v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08714","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"RO253D5JEN5H","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RO253D5JEN5HZKDT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RO253D5J","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:9abbd5cc4739ed10f80b68ff614dd64c8df93328fa7f4a7e4452ea43bed9fdb6","target":"graph","created_at":"2026-05-18T01:19:52Z","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 study the transmission over a cloud radio access network in which multiple base stations (BS) are connected to a central processor (CP) via finite-capacity backhaul links. We propose two lattice-based coding schemes. In the first scheme, the base stations decode linear combinations of the transmitted messages, in the spirit of compute-and-forward (CoF), but differs from it essentially in that the decoded equations are remapped to linear combinations of the channel input symbols, sent compressed in a lossy manner to the central processor, and are not required to be linearly independent. Also","authors_text":"Abdellatif Zaidi, I\\~naki Estella Aguerri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-28T13:31:25Z","title":"Lossy Compression for Compute-and-Forward in Limited Backhaul Uplink Multicell Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08714","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:06bb15ec17c5c0ed457bdfb464313afb269957944c8bbd59de25a1618e74bc2d","target":"record","created_at":"2026-05-18T01:19:52Z","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":"a0730aa369386d45e9f6b7591f885e72e7461d3260702afe09587aef3d64634f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-28T13:31:25Z","title_canon_sha256":"d876dd1319893cfe60dda5a5f361697f3894802d5b9ea0524002c0ab3bb91143"},"schema_version":"1.0","source":{"id":"1602.08714","kind":"arxiv","version":1}},"canonical_sha256":"8bb5dd8fa9237a7ca873a33fa287b1599e77b29c5cbe3598bf022d484faa9a8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bb5dd8fa9237a7ca873a33fa287b1599e77b29c5cbe3598bf022d484faa9a8d","first_computed_at":"2026-05-18T01:19:52.119648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:52.119648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PDKI62PZyl4izM/j/Bjd5dOx9XPtqn+LHvyW8JdZEaSAn0fadZ6VxMkBqNfzXAoNNVRge8CxA5M93GqsbLaqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:52.120280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06bb15ec17c5c0ed457bdfb464313afb269957944c8bbd59de25a1618e74bc2d","sha256:9abbd5cc4739ed10f80b68ff614dd64c8df93328fa7f4a7e4452ea43bed9fdb6"],"state_sha256":"90c1513a694aef08c10557b8076520978af2575188bde82f71225f89075826db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHrLjXGknjZFqFV2kMdFFFMw/frl3+MQ4EwjnZKWNuMbXO+XmnCwrK73ca2scbj+HzZT6mtd7Ov+RL/mULA0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:56:14.268190Z","bundle_sha256":"35fcde29880d9a3f89ed3b46d4bf369faa77ce97ef424b7596e60c66632430ec"}}