{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ENSIJXKLNCHGEJNRRNPUV7DVZN","short_pith_number":"pith:ENSIJXKL","canonical_record":{"source":{"id":"2002.12770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-26T20:32:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c0559a4e0d67b09637d58db36bfa58ff13d60c645b3a79dbb46d0c604bc672bd","abstract_canon_sha256":"05de3ddfc7942222c2a7b003293738d4e67cbdfa02fa1ce6e4aaa84e9a0b3e46"},"schema_version":"1.0"},"canonical_sha256":"236484dd4b688e6225b18b5f4afc75cb5bf6f76615a507863f34eb99c471091c","source":{"kind":"arxiv","id":"2002.12770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.12770","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"2002.12770v1","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.12770","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"ENSIJXKLNCHG","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"pith_short_16","alias_value":"ENSIJXKLNCHGEJNR","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"pith_short_8","alias_value":"ENSIJXKL","created_at":"2026-07-05T00:44:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ENSIJXKLNCHGEJNRRNPUV7DVZN","target":"record","payload":{"canonical_record":{"source":{"id":"2002.12770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-26T20:32:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c0559a4e0d67b09637d58db36bfa58ff13d60c645b3a79dbb46d0c604bc672bd","abstract_canon_sha256":"05de3ddfc7942222c2a7b003293738d4e67cbdfa02fa1ce6e4aaa84e9a0b3e46"},"schema_version":"1.0"},"canonical_sha256":"236484dd4b688e6225b18b5f4afc75cb5bf6f76615a507863f34eb99c471091c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:34.136809Z","signature_b64":"Pw4lLEqwO9iiu3nGibigLcAfPHlUzaWrG8pTzofwCnm4jlQCP0/AkCqONug8jQvyVMjhA2DyEqrBfSbfVfbABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"236484dd4b688e6225b18b5f4afc75cb5bf6f76615a507863f34eb99c471091c","last_reissued_at":"2026-07-05T00:44:34.136396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:34.136396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.12770","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-07-05T00:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4fhlaKLiXsY0MOdaDTbzEN9zHnYxNxCuoXFapARF4uRSJCpNME1y2Dd3NlEfyKcZrNlVgyyvXWRhRLMNQzjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:42:11.732058Z"},"content_sha256":"f3195b053066aade94377147a5127ae1229bd43a575a86757e1a39080982136c","schema_version":"1.0","event_id":"sha256:f3195b053066aade94377147a5127ae1229bd43a575a86757e1a39080982136c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ENSIJXKLNCHGEJNRRNPUV7DVZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation for Secure Multi-User Downlink MISO-URLLC Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Robert Schober, Vahid Jamali, Walid R. Ghanem","submitted_at":"2020-02-26T20:32:07Z","abstract_excerpt":"In this paper, we study resource allocation algorithm design for secure multi-user downlink ultra-reliable low latency communication (URLLC). To enhance physical layer security (PLS), the base station (BS) is equipped with multiple antennas and artificial noise (AN) is injected by the BS to impair the eavesdroppers' channels. To meet the stringent delay requirements in secure URLLC systems, short packet transmission (SPT) is adopted and taken into consideration for resource allocation design. The resource allocation algorithm design is formulated as an optimization problem for minimization of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.12770","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.12770/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEZadR8DlXER1p3srEvjSpRTa0bcPf9MnzhH5Y3DeicwULn5WTOg2QBNA1W1shUPPxQj3iCHbCu3i2vfJpGrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:42:11.732763Z"},"content_sha256":"680652208b6f892a677f6395c35602a6022df2b07724255e237a6a325bd3d885","schema_version":"1.0","event_id":"sha256:680652208b6f892a677f6395c35602a6022df2b07724255e237a6a325bd3d885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENSIJXKLNCHGEJNRRNPUV7DVZN/bundle.json","state_url":"https://pith.science/pith/ENSIJXKLNCHGEJNRRNPUV7DVZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENSIJXKLNCHGEJNRRNPUV7DVZN/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-08-21T17:42:11Z","links":{"resolver":"https://pith.science/pith/ENSIJXKLNCHGEJNRRNPUV7DVZN","bundle":"https://pith.science/pith/ENSIJXKLNCHGEJNRRNPUV7DVZN/bundle.json","state":"https://pith.science/pith/ENSIJXKLNCHGEJNRRNPUV7DVZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENSIJXKLNCHGEJNRRNPUV7DVZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ENSIJXKLNCHGEJNRRNPUV7DVZN","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":"05de3ddfc7942222c2a7b003293738d4e67cbdfa02fa1ce6e4aaa84e9a0b3e46","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-26T20:32:07Z","title_canon_sha256":"c0559a4e0d67b09637d58db36bfa58ff13d60c645b3a79dbb46d0c604bc672bd"},"schema_version":"1.0","source":{"id":"2002.12770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.12770","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"2002.12770v1","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.12770","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"ENSIJXKLNCHG","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"pith_short_16","alias_value":"ENSIJXKLNCHGEJNR","created_at":"2026-07-05T00:44:34Z"},{"alias_kind":"pith_short_8","alias_value":"ENSIJXKL","created_at":"2026-07-05T00:44:34Z"}],"graph_snapshots":[{"event_id":"sha256:680652208b6f892a677f6395c35602a6022df2b07724255e237a6a325bd3d885","target":"graph","created_at":"2026-07-05T00:44:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.12770/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study resource allocation algorithm design for secure multi-user downlink ultra-reliable low latency communication (URLLC). To enhance physical layer security (PLS), the base station (BS) is equipped with multiple antennas and artificial noise (AN) is injected by the BS to impair the eavesdroppers' channels. To meet the stringent delay requirements in secure URLLC systems, short packet transmission (SPT) is adopted and taken into consideration for resource allocation design. The resource allocation algorithm design is formulated as an optimization problem for minimization of ","authors_text":"Robert Schober, Vahid Jamali, Walid R. Ghanem","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-26T20:32:07Z","title":"Resource Allocation for Secure Multi-User Downlink MISO-URLLC Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.12770","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:f3195b053066aade94377147a5127ae1229bd43a575a86757e1a39080982136c","target":"record","created_at":"2026-07-05T00:44:34Z","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":"05de3ddfc7942222c2a7b003293738d4e67cbdfa02fa1ce6e4aaa84e9a0b3e46","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-26T20:32:07Z","title_canon_sha256":"c0559a4e0d67b09637d58db36bfa58ff13d60c645b3a79dbb46d0c604bc672bd"},"schema_version":"1.0","source":{"id":"2002.12770","kind":"arxiv","version":1}},"canonical_sha256":"236484dd4b688e6225b18b5f4afc75cb5bf6f76615a507863f34eb99c471091c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"236484dd4b688e6225b18b5f4afc75cb5bf6f76615a507863f34eb99c471091c","first_computed_at":"2026-07-05T00:44:34.136396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:44:34.136396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pw4lLEqwO9iiu3nGibigLcAfPHlUzaWrG8pTzofwCnm4jlQCP0/AkCqONug8jQvyVMjhA2DyEqrBfSbfVfbABg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:44:34.136809Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.12770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3195b053066aade94377147a5127ae1229bd43a575a86757e1a39080982136c","sha256:680652208b6f892a677f6395c35602a6022df2b07724255e237a6a325bd3d885"],"state_sha256":"1574a84f486d874ba8fe91061254a40c796fa3f6eae1c06317c3013dfb55b9bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0UT3J7q0VwU7iCduajBIArHgfN0NAlYWOUxrB0jffuMZrKuCAUDysxDaQICb+CQAaSD0SfhEjcEYqTcfDSTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:42:11.738419Z","bundle_sha256":"a3cba218356ac818c203c31720b3f43c6f2a4345386bb91306abd9e212cf6a62"}}