{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E5MA4EYNSW27R6MGJV2YR7STOE","short_pith_number":"pith:E5MA4EYN","canonical_record":{"source":{"id":"1901.05825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T15:07:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d07fcfd0206bbfde00236a36150900dcdf70f089e68ec9fad11ebe1b9ff8c53f","abstract_canon_sha256":"a7c43193fb3276b537a220ea5ad68d6099a5dc4bcf2124b071cc94ed010fcee4"},"schema_version":"1.0"},"canonical_sha256":"27580e130d95b5f8f9864d7588fe53710ea3dcd5362fe98fc89e2a6ffa13bd44","source":{"kind":"arxiv","id":"1901.05825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05825","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05825v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05825","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"E5MA4EYNSW27","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E5MA4EYNSW27R6MG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E5MA4EYN","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E5MA4EYNSW27R6MGJV2YR7STOE","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T15:07:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d07fcfd0206bbfde00236a36150900dcdf70f089e68ec9fad11ebe1b9ff8c53f","abstract_canon_sha256":"a7c43193fb3276b537a220ea5ad68d6099a5dc4bcf2124b071cc94ed010fcee4"},"schema_version":"1.0"},"canonical_sha256":"27580e130d95b5f8f9864d7588fe53710ea3dcd5362fe98fc89e2a6ffa13bd44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:06.090223Z","signature_b64":"Z7GxuW76tLd3FX8L5cNiLbLBZ1Y55eGEvgXvRaUkHvgB1uKJg10ZTtv1Aal9NIcT6QsHA2aSHD9stohSlrDCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27580e130d95b5f8f9864d7588fe53710ea3dcd5362fe98fc89e2a6ffa13bd44","last_reissued_at":"2026-05-17T23:56:06.089748Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:06.089748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05825","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:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Q9yk9crIjQDwBv4sVZug5H0zfLK2ew5S4OnmZ+CUrkHygvqcfQMwWkVzKFA2HRDon/swxdGfUvXqMnrRYFkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:28.060108Z"},"content_sha256":"1cec46b143a5c9c9148442c7c4e9ac9c8d23f92482741298ac2948c2d888216e","schema_version":"1.0","event_id":"sha256:1cec46b143a5c9c9148442c7c4e9ac9c8d23f92482741298ac2948c2d888216e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E5MA4EYNSW27R6MGJV2YR7STOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation for Multi-User Downlink URLLC-OFDMA 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, Yan Sun","submitted_at":"2019-01-17T15:07:37Z","abstract_excerpt":"In this paper, we study resource allocation for downlink orthogonal frequency division multiple access (OFDMA) systems with the objective to enable ultra-reliable low latency communication (URLLC). To meet the stringent delay requirements of URLLC, the impact of short packet communication is taken into account for resource allocation algorithm design. In particular, the resource allocation design is formulated as a weighted system sum throughput maximization problem with quality-of-service (QoS) constraints for the URLLC users. The formulated problem is non-convex, and hence, finding the globa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05825","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:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fs7a+bvlsel3nLSTaBVlQUH+7rQiiI7I9wQCp8lyHR8SmvJqlMRbiUH9EtjJt/nva1FQIQbZVo/5+2ZNdfCNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:28.060528Z"},"content_sha256":"e294b549a0ab1288d9fe76cac66bd6e36b560411ba8de813771051853c17983a","schema_version":"1.0","event_id":"sha256:e294b549a0ab1288d9fe76cac66bd6e36b560411ba8de813771051853c17983a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5MA4EYNSW27R6MGJV2YR7STOE/bundle.json","state_url":"https://pith.science/pith/E5MA4EYNSW27R6MGJV2YR7STOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5MA4EYNSW27R6MGJV2YR7STOE/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:30:28Z","links":{"resolver":"https://pith.science/pith/E5MA4EYNSW27R6MGJV2YR7STOE","bundle":"https://pith.science/pith/E5MA4EYNSW27R6MGJV2YR7STOE/bundle.json","state":"https://pith.science/pith/E5MA4EYNSW27R6MGJV2YR7STOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5MA4EYNSW27R6MGJV2YR7STOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E5MA4EYNSW27R6MGJV2YR7STOE","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":"a7c43193fb3276b537a220ea5ad68d6099a5dc4bcf2124b071cc94ed010fcee4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T15:07:37Z","title_canon_sha256":"d07fcfd0206bbfde00236a36150900dcdf70f089e68ec9fad11ebe1b9ff8c53f"},"schema_version":"1.0","source":{"id":"1901.05825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05825","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05825v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05825","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"E5MA4EYNSW27","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E5MA4EYNSW27R6MG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E5MA4EYN","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:e294b549a0ab1288d9fe76cac66bd6e36b560411ba8de813771051853c17983a","target":"graph","created_at":"2026-05-17T23:56:06Z","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":"In this paper, we study resource allocation for downlink orthogonal frequency division multiple access (OFDMA) systems with the objective to enable ultra-reliable low latency communication (URLLC). To meet the stringent delay requirements of URLLC, the impact of short packet communication is taken into account for resource allocation algorithm design. In particular, the resource allocation design is formulated as a weighted system sum throughput maximization problem with quality-of-service (QoS) constraints for the URLLC users. The formulated problem is non-convex, and hence, finding the globa","authors_text":"Robert Schober, Vahid Jamali, Walid R. Ghanem, Yan Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T15:07:37Z","title":"Resource Allocation for Multi-User Downlink URLLC-OFDMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05825","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:1cec46b143a5c9c9148442c7c4e9ac9c8d23f92482741298ac2948c2d888216e","target":"record","created_at":"2026-05-17T23:56:06Z","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":"a7c43193fb3276b537a220ea5ad68d6099a5dc4bcf2124b071cc94ed010fcee4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T15:07:37Z","title_canon_sha256":"d07fcfd0206bbfde00236a36150900dcdf70f089e68ec9fad11ebe1b9ff8c53f"},"schema_version":"1.0","source":{"id":"1901.05825","kind":"arxiv","version":1}},"canonical_sha256":"27580e130d95b5f8f9864d7588fe53710ea3dcd5362fe98fc89e2a6ffa13bd44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27580e130d95b5f8f9864d7588fe53710ea3dcd5362fe98fc89e2a6ffa13bd44","first_computed_at":"2026-05-17T23:56:06.089748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:06.089748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z7GxuW76tLd3FX8L5cNiLbLBZ1Y55eGEvgXvRaUkHvgB1uKJg10ZTtv1Aal9NIcT6QsHA2aSHD9stohSlrDCCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:06.090223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cec46b143a5c9c9148442c7c4e9ac9c8d23f92482741298ac2948c2d888216e","sha256:e294b549a0ab1288d9fe76cac66bd6e36b560411ba8de813771051853c17983a"],"state_sha256":"41345cf97d28066471f00062fe4ea6ae5231089a5486fbdbf5bc504604f82ed2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVIs6NjRVk+AE4s/Fzw4KodkCKTjENKjfbFgKsdVWxj0hBKM6MpvAnsN5BFz8k4n4ug1mQ3hBtaxWxVwitR1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:30:28.063941Z","bundle_sha256":"f408a819bb31dc725145e38f53d839e9c0fb8265ff5ab2b466b4c922679d9d7d"}}