{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LOR7RYI3YWBHPNYWDHOUBDN5WD","short_pith_number":"pith:LOR7RYI3","canonical_record":{"source":{"id":"1809.06431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T20:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"f7980f1cef207045b01586d57a61f002a7d2d2498523379e3ccb5c355d628643","abstract_canon_sha256":"024532cf0dac9937d553b9f34371152adba132ca12659008fbeef9f6ae2affc9"},"schema_version":"1.0"},"canonical_sha256":"5ba3f8e11bc58277b71619dd408dbdb0d578b87b8ff778d7b2a50e3284145d2d","source":{"kind":"arxiv","id":"1809.06431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06431","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06431v1","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06431","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"LOR7RYI3YWBH","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOR7RYI3YWBHPNYW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOR7RYI3","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LOR7RYI3YWBHPNYWDHOUBDN5WD","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T20:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"f7980f1cef207045b01586d57a61f002a7d2d2498523379e3ccb5c355d628643","abstract_canon_sha256":"024532cf0dac9937d553b9f34371152adba132ca12659008fbeef9f6ae2affc9"},"schema_version":"1.0"},"canonical_sha256":"5ba3f8e11bc58277b71619dd408dbdb0d578b87b8ff778d7b2a50e3284145d2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:29.556577Z","signature_b64":"WVg76R0cp/XkLdsNC9YJb4ztdkAEaOyJs+Dkh9Hb1fbCaReZc9fgfNlOgdGsivvpZ3+KNovgeTBCKbKEys0BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba3f8e11bc58277b71619dd408dbdb0d578b87b8ff778d7b2a50e3284145d2d","last_reissued_at":"2026-05-17T23:42:29.555848Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:29.555848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06431","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:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f++EulvXFdEdTIe0HpZozSLeRJvyW9SzSfrZYJ8zWWZd6lYAo8QFhYvptp/H5yXxidTaQggPXRQfqtddbAQrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:29:27.560255Z"},"content_sha256":"42024afc30a09bc71321c7f6932cae9360e5d140e6ab606865a110619c8f76ba","schema_version":"1.0","event_id":"sha256:42024afc30a09bc71321c7f6932cae9360e5d140e6ab606865a110619c8f76ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LOR7RYI3YWBHPNYWDHOUBDN5WD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Framework for Temporal Fair User Scheduling in NOMA Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Elza Erkip, Farhad Shirani, Shahram Shahsavari","submitted_at":"2018-09-17T20:30:18Z","abstract_excerpt":"Non-orthogonal multiple access (NOMA) is one of the promising radio access techniques for next generation wireless networks. Opportunistic multi-user scheduling is necessary to fully exploit multiplexing gains in NOMA systems, but compared with traditional scheduling, interrelations between users' throughputs induced by multi-user interference poses new challenges in the design of NOMA schedulers. A successful NOMA scheduler has to carefully balance the following three objectives: maximizing average system utility, satisfying desired fairness constraints among the users and enabling real-time,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06431","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:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvOa4/7i7yvgL4GFrh71dW4KdkEMXplPW3FlO8WfvWka0AzEeiRB2rMNeI0xE+DvIdv65Xop72/eJsnw3kfmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:29:27.561013Z"},"content_sha256":"f274f2afd597901aa35187d9c0ddcdf46642a734175ed4d81344444dcc09a2c5","schema_version":"1.0","event_id":"sha256:f274f2afd597901aa35187d9c0ddcdf46642a734175ed4d81344444dcc09a2c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOR7RYI3YWBHPNYWDHOUBDN5WD/bundle.json","state_url":"https://pith.science/pith/LOR7RYI3YWBHPNYWDHOUBDN5WD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOR7RYI3YWBHPNYWDHOUBDN5WD/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-10T22:29:27Z","links":{"resolver":"https://pith.science/pith/LOR7RYI3YWBHPNYWDHOUBDN5WD","bundle":"https://pith.science/pith/LOR7RYI3YWBHPNYWDHOUBDN5WD/bundle.json","state":"https://pith.science/pith/LOR7RYI3YWBHPNYWDHOUBDN5WD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOR7RYI3YWBHPNYWDHOUBDN5WD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LOR7RYI3YWBHPNYWDHOUBDN5WD","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":"024532cf0dac9937d553b9f34371152adba132ca12659008fbeef9f6ae2affc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T20:30:18Z","title_canon_sha256":"f7980f1cef207045b01586d57a61f002a7d2d2498523379e3ccb5c355d628643"},"schema_version":"1.0","source":{"id":"1809.06431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06431","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06431v1","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06431","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"LOR7RYI3YWBH","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOR7RYI3YWBHPNYW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOR7RYI3","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:f274f2afd597901aa35187d9c0ddcdf46642a734175ed4d81344444dcc09a2c5","target":"graph","created_at":"2026-05-17T23:42:29Z","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":"Non-orthogonal multiple access (NOMA) is one of the promising radio access techniques for next generation wireless networks. Opportunistic multi-user scheduling is necessary to fully exploit multiplexing gains in NOMA systems, but compared with traditional scheduling, interrelations between users' throughputs induced by multi-user interference poses new challenges in the design of NOMA schedulers. A successful NOMA scheduler has to carefully balance the following three objectives: maximizing average system utility, satisfying desired fairness constraints among the users and enabling real-time,","authors_text":"Elza Erkip, Farhad Shirani, Shahram Shahsavari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T20:30:18Z","title":"A General Framework for Temporal Fair User Scheduling in NOMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06431","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:42024afc30a09bc71321c7f6932cae9360e5d140e6ab606865a110619c8f76ba","target":"record","created_at":"2026-05-17T23:42:29Z","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":"024532cf0dac9937d553b9f34371152adba132ca12659008fbeef9f6ae2affc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-17T20:30:18Z","title_canon_sha256":"f7980f1cef207045b01586d57a61f002a7d2d2498523379e3ccb5c355d628643"},"schema_version":"1.0","source":{"id":"1809.06431","kind":"arxiv","version":1}},"canonical_sha256":"5ba3f8e11bc58277b71619dd408dbdb0d578b87b8ff778d7b2a50e3284145d2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ba3f8e11bc58277b71619dd408dbdb0d578b87b8ff778d7b2a50e3284145d2d","first_computed_at":"2026-05-17T23:42:29.555848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:29.555848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WVg76R0cp/XkLdsNC9YJb4ztdkAEaOyJs+Dkh9Hb1fbCaReZc9fgfNlOgdGsivvpZ3+KNovgeTBCKbKEys0BBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:29.556577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42024afc30a09bc71321c7f6932cae9360e5d140e6ab606865a110619c8f76ba","sha256:f274f2afd597901aa35187d9c0ddcdf46642a734175ed4d81344444dcc09a2c5"],"state_sha256":"651fe3f45593823b953b74a75df214da8d9842e15a5687585c31b28fe6197e8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSGyr3ChUMTad0QhYFjKXkZ21/ELVvm/NwtipZVQaDnrcHINuCmd1E67d5gQ8b+Am39Lr0rXoPPl7gheSCV5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:29:27.565459Z","bundle_sha256":"446870ffbc718c5fd4ddf5300aa9f81ba41e33b633f0ee32d7476dd859a8b52c"}}