{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TAXQCEIJL7F7HA25XVI2MAX6UU","short_pith_number":"pith:TAXQCEIJ","canonical_record":{"source":{"id":"1903.03856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T19:36:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d62296560094bb0bb4145b6185f368a07506c95e39a0c12c7cbb978fc4fb73cc","abstract_canon_sha256":"50b632776f8057aa2c9d468ce718f09d116ecf0cda4271455192e7c66004bf68"},"schema_version":"1.0"},"canonical_sha256":"982f0111095fcbf3835dbd51a602fea50e6fb1400be63363b6a6e53e16bb3fb4","source":{"kind":"arxiv","id":"1903.03856","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03856","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03856v2","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03856","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"TAXQCEIJL7F7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAXQCEIJL7F7HA25","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAXQCEIJ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TAXQCEIJL7F7HA25XVI2MAX6UU","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T19:36:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d62296560094bb0bb4145b6185f368a07506c95e39a0c12c7cbb978fc4fb73cc","abstract_canon_sha256":"50b632776f8057aa2c9d468ce718f09d116ecf0cda4271455192e7c66004bf68"},"schema_version":"1.0"},"canonical_sha256":"982f0111095fcbf3835dbd51a602fea50e6fb1400be63363b6a6e53e16bb3fb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.776262Z","signature_b64":"58niAhm+p1VlKVIl9KddDjtD39mLh6xobW3vXdNwfz2YUJYiUYRaJ9cv0dP+whWIcZWyICcWdF2o1RyRSCnnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"982f0111095fcbf3835dbd51a602fea50e6fb1400be63363b6a6e53e16bb3fb4","last_reissued_at":"2026-05-17T23:45:57.775837Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.775837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03856","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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m67NKu5rksuIA1ve5FD/rn2k0R/gtytfWDaBzGssZCyVkmkHC9Yl6/GGF8MYSP3Upxfk1xmI7r/iduwTOcAhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:27:03.857115Z"},"content_sha256":"4f06f31423c424c7640191487ab032d6d0d526afb7c04fe2f4dc3191d30f3f29","schema_version":"1.0","event_id":"sha256:4f06f31423c424c7640191487ab032d6d0d526afb7c04fe2f4dc3191d30f3f29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TAXQCEIJL7F7HA25XVI2MAX6UU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Complexity Cache-Aided Multi-antenna Content Delivery Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deniz G\\\"und\\\"uz, Junlin Zhao, Mohammad Mohammadi Amiri","submitted_at":"2019-03-09T19:36:42Z","abstract_excerpt":"We study downlink beamforming in a single-cell network with a multi-antenna base station (BS) serving cache-enabled users. For a given common rate of the files in the system, we first formulate the minimum transmit power with beamforming at the BS as a non-convex optimization problem. This corresponds to a multiple multicast problem, to which a stationary solution can be efficiently obtained through successive convex approximation (SCA). It is observed that the complexity of the problem grows exponentially with the number of subfiles delivered to each user in each time slot, which itself grows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03856","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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkWdulzmhELHvf/6TR23tzAWGrL2lC1PBNObn3CZXxvMvGSbkmU2lrn507LuAc0no1Q+MRdNLC8xxk+0XTWGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:27:03.857475Z"},"content_sha256":"8f7502f538d265208acfb683660f02a9fe390626a9d780a0b2aa86be79eb98c5","schema_version":"1.0","event_id":"sha256:8f7502f538d265208acfb683660f02a9fe390626a9d780a0b2aa86be79eb98c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAXQCEIJL7F7HA25XVI2MAX6UU/bundle.json","state_url":"https://pith.science/pith/TAXQCEIJL7F7HA25XVI2MAX6UU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAXQCEIJL7F7HA25XVI2MAX6UU/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-28T10:27:03Z","links":{"resolver":"https://pith.science/pith/TAXQCEIJL7F7HA25XVI2MAX6UU","bundle":"https://pith.science/pith/TAXQCEIJL7F7HA25XVI2MAX6UU/bundle.json","state":"https://pith.science/pith/TAXQCEIJL7F7HA25XVI2MAX6UU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAXQCEIJL7F7HA25XVI2MAX6UU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TAXQCEIJL7F7HA25XVI2MAX6UU","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":"50b632776f8057aa2c9d468ce718f09d116ecf0cda4271455192e7c66004bf68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T19:36:42Z","title_canon_sha256":"d62296560094bb0bb4145b6185f368a07506c95e39a0c12c7cbb978fc4fb73cc"},"schema_version":"1.0","source":{"id":"1903.03856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03856","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03856v2","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03856","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"TAXQCEIJL7F7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAXQCEIJL7F7HA25","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAXQCEIJ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:8f7502f538d265208acfb683660f02a9fe390626a9d780a0b2aa86be79eb98c5","target":"graph","created_at":"2026-05-17T23:45:57Z","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 downlink beamforming in a single-cell network with a multi-antenna base station (BS) serving cache-enabled users. For a given common rate of the files in the system, we first formulate the minimum transmit power with beamforming at the BS as a non-convex optimization problem. This corresponds to a multiple multicast problem, to which a stationary solution can be efficiently obtained through successive convex approximation (SCA). It is observed that the complexity of the problem grows exponentially with the number of subfiles delivered to each user in each time slot, which itself grows","authors_text":"Deniz G\\\"und\\\"uz, Junlin Zhao, Mohammad Mohammadi Amiri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T19:36:42Z","title":"A Low-Complexity Cache-Aided Multi-antenna Content Delivery Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03856","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:4f06f31423c424c7640191487ab032d6d0d526afb7c04fe2f4dc3191d30f3f29","target":"record","created_at":"2026-05-17T23:45:57Z","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":"50b632776f8057aa2c9d468ce718f09d116ecf0cda4271455192e7c66004bf68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-09T19:36:42Z","title_canon_sha256":"d62296560094bb0bb4145b6185f368a07506c95e39a0c12c7cbb978fc4fb73cc"},"schema_version":"1.0","source":{"id":"1903.03856","kind":"arxiv","version":2}},"canonical_sha256":"982f0111095fcbf3835dbd51a602fea50e6fb1400be63363b6a6e53e16bb3fb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"982f0111095fcbf3835dbd51a602fea50e6fb1400be63363b6a6e53e16bb3fb4","first_computed_at":"2026-05-17T23:45:57.775837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:57.775837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"58niAhm+p1VlKVIl9KddDjtD39mLh6xobW3vXdNwfz2YUJYiUYRaJ9cv0dP+whWIcZWyICcWdF2o1RyRSCnnBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:57.776262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f06f31423c424c7640191487ab032d6d0d526afb7c04fe2f4dc3191d30f3f29","sha256:8f7502f538d265208acfb683660f02a9fe390626a9d780a0b2aa86be79eb98c5"],"state_sha256":"1843de93cef0dfa54301555c0f6a8ad709186f0012a47b67d06c08b74db78e2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyrPotyS/ux8VenYW8Sau8d4ifAUHHftZAaBj7EE9lxCpqI+KjZrrOxGzttpZ0xH5JlySImOmedaNxvy9c2zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:27:03.859337Z","bundle_sha256":"b3c6e1f4ee7ec6ccbc9e0b3628ff09949c1fbf166b6770945b18801adcf8a50b"}}