{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LXGAK7MTWDILLWAQSYRTPEFQGH","short_pith_number":"pith:LXGAK7MT","canonical_record":{"source":{"id":"1905.04788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-12T20:33:03Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"f38d44841efa588efe9b4527c23bfc632277b6ce18f432509e3e70b84dbab698","abstract_canon_sha256":"6a9e9605efaa2e41dd6ab68c9a6457f9c784cf6835e690efae74fc5c1b5fff6e"},"schema_version":"1.0"},"canonical_sha256":"5dcc057d93b0d0b5d81096233790b031d81e77d27d040baa7dd8028f89429ede","source":{"kind":"arxiv","id":"1905.04788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04788","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04788v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04788","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"LXGAK7MTWDIL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LXGAK7MTWDILLWAQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LXGAK7MT","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LXGAK7MTWDILLWAQSYRTPEFQGH","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-12T20:33:03Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"f38d44841efa588efe9b4527c23bfc632277b6ce18f432509e3e70b84dbab698","abstract_canon_sha256":"6a9e9605efaa2e41dd6ab68c9a6457f9c784cf6835e690efae74fc5c1b5fff6e"},"schema_version":"1.0"},"canonical_sha256":"5dcc057d93b0d0b5d81096233790b031d81e77d27d040baa7dd8028f89429ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:23.512765Z","signature_b64":"yD7zoP5RDa+22J2fqb+68NU4V/xkPkQn4bsGuuGi1wMfL22EkKBa3fG36dEAr7Y+r3pEd1Haq5Ut+weCIXS2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dcc057d93b0d0b5d81096233790b031d81e77d27d040baa7dd8028f89429ede","last_reissued_at":"2026-05-17T23:46:23.512228Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:23.512228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04788","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:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZSNjrO4CYnzTHWlU+8/+m/KkEAx5kSj4VEq0nxdWlKLufechlXF35osAmLpTNIxL1uFzj/gdNABMzkC9bemSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:38:38.467509Z"},"content_sha256":"1c66ecaffe6e80ba5152326484b3bd651ca3c355c0a1189186841ddc83f9cb05","schema_version":"1.0","event_id":"sha256:1c66ecaffe6e80ba5152326484b3bd651ca3c355c0a1189186841ddc83f9cb05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LXGAK7MTWDILLWAQSYRTPEFQGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-based Resource Optimization in Ultra Reliable Low Latency HetNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.NI","authors_text":"Kenza Hamidouche, Mohammad Yousefvand, Narayan B. Mandayam","submitted_at":"2019-05-12T20:33:03Z","abstract_excerpt":"In this paper, the problems of user offloading and resource optimization are jointly addressed to support ultra-reliable and low latency communications (URLLC) in HetNets. In particular, a multi-tier network with a single macro base station (MBS) and multiple overlaid small cell base stations (SBSs) is considered that includes users with different latency and reliability constraints. Modeling the latency and reliability constraints of users with probabilistic guarantees, the joint problem of user offloading and resource allocation (JUR) in a URLLC setting is formulated as an optimization probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04788","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:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PccjkmBulb/SRxxVhIldNO6tCqxDGcqQ8BhgDPWveXGOWq4hNKCH4CNAZ8QyB8ypcUcNhHNoOlVToOUtcWg8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:38:38.467871Z"},"content_sha256":"2a6d8c1d7fc3d39438583a44cb634070ad2b22fe6c942aef1b1af22bcbe3e91c","schema_version":"1.0","event_id":"sha256:2a6d8c1d7fc3d39438583a44cb634070ad2b22fe6c942aef1b1af22bcbe3e91c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXGAK7MTWDILLWAQSYRTPEFQGH/bundle.json","state_url":"https://pith.science/pith/LXGAK7MTWDILLWAQSYRTPEFQGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXGAK7MTWDILLWAQSYRTPEFQGH/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-05T13:38:38Z","links":{"resolver":"https://pith.science/pith/LXGAK7MTWDILLWAQSYRTPEFQGH","bundle":"https://pith.science/pith/LXGAK7MTWDILLWAQSYRTPEFQGH/bundle.json","state":"https://pith.science/pith/LXGAK7MTWDILLWAQSYRTPEFQGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXGAK7MTWDILLWAQSYRTPEFQGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LXGAK7MTWDILLWAQSYRTPEFQGH","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":"6a9e9605efaa2e41dd6ab68c9a6457f9c784cf6835e690efae74fc5c1b5fff6e","cross_cats_sorted":["cs.LG","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-12T20:33:03Z","title_canon_sha256":"f38d44841efa588efe9b4527c23bfc632277b6ce18f432509e3e70b84dbab698"},"schema_version":"1.0","source":{"id":"1905.04788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04788","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04788v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04788","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"LXGAK7MTWDIL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LXGAK7MTWDILLWAQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LXGAK7MT","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2a6d8c1d7fc3d39438583a44cb634070ad2b22fe6c942aef1b1af22bcbe3e91c","target":"graph","created_at":"2026-05-17T23:46:23Z","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, the problems of user offloading and resource optimization are jointly addressed to support ultra-reliable and low latency communications (URLLC) in HetNets. In particular, a multi-tier network with a single macro base station (MBS) and multiple overlaid small cell base stations (SBSs) is considered that includes users with different latency and reliability constraints. Modeling the latency and reliability constraints of users with probabilistic guarantees, the joint problem of user offloading and resource allocation (JUR) in a URLLC setting is formulated as an optimization probl","authors_text":"Kenza Hamidouche, Mohammad Yousefvand, Narayan B. Mandayam","cross_cats":["cs.LG","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-12T20:33:03Z","title":"Learning-based Resource Optimization in Ultra Reliable Low Latency HetNets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04788","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:1c66ecaffe6e80ba5152326484b3bd651ca3c355c0a1189186841ddc83f9cb05","target":"record","created_at":"2026-05-17T23:46:23Z","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":"6a9e9605efaa2e41dd6ab68c9a6457f9c784cf6835e690efae74fc5c1b5fff6e","cross_cats_sorted":["cs.LG","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-12T20:33:03Z","title_canon_sha256":"f38d44841efa588efe9b4527c23bfc632277b6ce18f432509e3e70b84dbab698"},"schema_version":"1.0","source":{"id":"1905.04788","kind":"arxiv","version":1}},"canonical_sha256":"5dcc057d93b0d0b5d81096233790b031d81e77d27d040baa7dd8028f89429ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dcc057d93b0d0b5d81096233790b031d81e77d27d040baa7dd8028f89429ede","first_computed_at":"2026-05-17T23:46:23.512228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:23.512228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yD7zoP5RDa+22J2fqb+68NU4V/xkPkQn4bsGuuGi1wMfL22EkKBa3fG36dEAr7Y+r3pEd1Haq5Ut+weCIXS2Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:23.512765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c66ecaffe6e80ba5152326484b3bd651ca3c355c0a1189186841ddc83f9cb05","sha256:2a6d8c1d7fc3d39438583a44cb634070ad2b22fe6c942aef1b1af22bcbe3e91c"],"state_sha256":"d21fd3bb493a83fa0fd97ac3969a08666580b75cbcac2e7162ea67d9658a9110"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rafbk9SycIxHs82RgL6ndLQPAkgflDYugdtq7nQI4ObSraUTK1JwIa2AlAZJk97ezOu983tcmI39JUo90JoqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:38:38.469882Z","bundle_sha256":"a4c085a2738eaedb887e7c8514401545cbdccb6094154671d6d95a8f2193a768"}}