{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PXGA2D3O546NVLRPLAR3FZ4UTK","short_pith_number":"pith:PXGA2D3O","canonical_record":{"source":{"id":"1710.10857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-10-30T10:32:52Z","cross_cats_sorted":[],"title_canon_sha256":"bd0291125e63b1d9ad7459f9da4ba8bb45eef10d0fe172f8f548cc8ac1f1c4ca","abstract_canon_sha256":"9d5f232f17b8532c39dee41661394913085d592f0ebae4bd6e5e63024313a836"},"schema_version":"1.0"},"canonical_sha256":"7dcc0d0f6eef3cdaae2f5823b2e7949aba76c34870b90d1ca6521cf71b1225cd","source":{"kind":"arxiv","id":"1710.10857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10857","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10857v1","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10857","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"PXGA2D3O546N","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXGA2D3O546NVLRP","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXGA2D3O","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PXGA2D3O546NVLRPLAR3FZ4UTK","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-10-30T10:32:52Z","cross_cats_sorted":[],"title_canon_sha256":"bd0291125e63b1d9ad7459f9da4ba8bb45eef10d0fe172f8f548cc8ac1f1c4ca","abstract_canon_sha256":"9d5f232f17b8532c39dee41661394913085d592f0ebae4bd6e5e63024313a836"},"schema_version":"1.0"},"canonical_sha256":"7dcc0d0f6eef3cdaae2f5823b2e7949aba76c34870b90d1ca6521cf71b1225cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:46.284507Z","signature_b64":"zZ/rSyzCSp3B1eBlK4GNaAtOibsf7A1YaaVDkQf7PfkpXob5amVpaEupqLs74sUsU4xZ0yCHE94E4iZXgrtmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dcc0d0f6eef3cdaae2f5823b2e7949aba76c34870b90d1ca6521cf71b1225cd","last_reissued_at":"2026-05-18T00:31:46.284065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:46.284065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10857","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-18T00:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHkdury55IJD2ACST22p0SY9/3tJ+YGVlOhH06klV4GslTGQBAhVTNHBkHejPEowurjEOXYw/R8q7di/+lzSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:33:30.208964Z"},"content_sha256":"a9789eaf3d6eae101ad010cc675a68a131ec9d9457b235eb7e97141e6184beba","schema_version":"1.0","event_id":"sha256:a9789eaf3d6eae101ad010cc675a68a131ec9d9457b235eb7e97141e6184beba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PXGA2D3O546NVLRPLAR3FZ4UTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Proportional Fair Scheduling for Downlink Non-Orthogonal Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Catherine Douillard, Charbel Abdel Nour, Joumana Farah, Marie-Rita Hojeij","submitted_at":"2017-10-30T10:32:52Z","abstract_excerpt":"In this paper, a weighted proportional fair (PF) scheduling method is proposed in the context of non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC) at the receiver side. The new scheme introduces weights that adapt the classical PF metric to the NOMA scenario, improving performance indicators and enabling new services. The distinguishing value of the proposal resides in its ability to improve long term fairness and total system throughput while achieving a high level of fairness in every scheduling slot. Finally, it is shown that the additional complexity cau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10857","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-18T00:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEXUetntboW1zik/2kdsMEjaPELTidqZ0KZ3wazMu5ljyKXY5Wn27bVWoEMJJM9ILPW9ErRsN9ikJsX5yCu8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:33:30.209303Z"},"content_sha256":"fc7520e94ff8403432fa4761d25f7c92cfbae50c9a399c4316d219b7dcd3865b","schema_version":"1.0","event_id":"sha256:fc7520e94ff8403432fa4761d25f7c92cfbae50c9a399c4316d219b7dcd3865b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXGA2D3O546NVLRPLAR3FZ4UTK/bundle.json","state_url":"https://pith.science/pith/PXGA2D3O546NVLRPLAR3FZ4UTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXGA2D3O546NVLRPLAR3FZ4UTK/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-20T08:33:30Z","links":{"resolver":"https://pith.science/pith/PXGA2D3O546NVLRPLAR3FZ4UTK","bundle":"https://pith.science/pith/PXGA2D3O546NVLRPLAR3FZ4UTK/bundle.json","state":"https://pith.science/pith/PXGA2D3O546NVLRPLAR3FZ4UTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXGA2D3O546NVLRPLAR3FZ4UTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PXGA2D3O546NVLRPLAR3FZ4UTK","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":"9d5f232f17b8532c39dee41661394913085d592f0ebae4bd6e5e63024313a836","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-10-30T10:32:52Z","title_canon_sha256":"bd0291125e63b1d9ad7459f9da4ba8bb45eef10d0fe172f8f548cc8ac1f1c4ca"},"schema_version":"1.0","source":{"id":"1710.10857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10857","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10857v1","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10857","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"PXGA2D3O546N","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXGA2D3O546NVLRP","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXGA2D3O","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:fc7520e94ff8403432fa4761d25f7c92cfbae50c9a399c4316d219b7dcd3865b","target":"graph","created_at":"2026-05-18T00:31:46Z","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, a weighted proportional fair (PF) scheduling method is proposed in the context of non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC) at the receiver side. The new scheme introduces weights that adapt the classical PF metric to the NOMA scenario, improving performance indicators and enabling new services. The distinguishing value of the proposal resides in its ability to improve long term fairness and total system throughput while achieving a high level of fairness in every scheduling slot. Finally, it is shown that the additional complexity cau","authors_text":"Catherine Douillard, Charbel Abdel Nour, Joumana Farah, Marie-Rita Hojeij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-10-30T10:32:52Z","title":"Weighted Proportional Fair Scheduling for Downlink Non-Orthogonal Multiple Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10857","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:a9789eaf3d6eae101ad010cc675a68a131ec9d9457b235eb7e97141e6184beba","target":"record","created_at":"2026-05-18T00:31:46Z","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":"9d5f232f17b8532c39dee41661394913085d592f0ebae4bd6e5e63024313a836","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-10-30T10:32:52Z","title_canon_sha256":"bd0291125e63b1d9ad7459f9da4ba8bb45eef10d0fe172f8f548cc8ac1f1c4ca"},"schema_version":"1.0","source":{"id":"1710.10857","kind":"arxiv","version":1}},"canonical_sha256":"7dcc0d0f6eef3cdaae2f5823b2e7949aba76c34870b90d1ca6521cf71b1225cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dcc0d0f6eef3cdaae2f5823b2e7949aba76c34870b90d1ca6521cf71b1225cd","first_computed_at":"2026-05-18T00:31:46.284065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:46.284065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zZ/rSyzCSp3B1eBlK4GNaAtOibsf7A1YaaVDkQf7PfkpXob5amVpaEupqLs74sUsU4xZ0yCHE94E4iZXgrtmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:46.284507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9789eaf3d6eae101ad010cc675a68a131ec9d9457b235eb7e97141e6184beba","sha256:fc7520e94ff8403432fa4761d25f7c92cfbae50c9a399c4316d219b7dcd3865b"],"state_sha256":"d65ea4ec05864a5fbf083966e28dca6a7f2d61d0e3c252ba10c56bb113c6478c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggn8xTp1BQdC/RNESP7selOzQG/B76YZ6wj0Bk8WMyTamosuxF4KK9Kb2qSurFaCliCxcrjiov+5zuTIK62GCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:33:30.211256Z","bundle_sha256":"2639f1725c780d18f72efbdd5d3aea0152427fb00c2ce95de0e0d0083607b76f"}}