{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FLAOC3BDU3VR6VMDV32MYMRWFW","short_pith_number":"pith:FLAOC3BD","canonical_record":{"source":{"id":"1706.05583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-17T22:00:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab91225fc9ed2eb523562fe178d96c362f7d1ce1c080baead4a4f1d110151a3c","abstract_canon_sha256":"cf770c24bbf8c749a5e6a5a32b8aab5b747a360d2f43c58a5dbcbc9662e7e9c4"},"schema_version":"1.0"},"canonical_sha256":"2ac0e16c23a6eb1f5583aef4cc32362dbfe8db2f1283e2143a03e7657ee2a35e","source":{"kind":"arxiv","id":"1706.05583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05583","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05583v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05583","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"FLAOC3BDU3VR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLAOC3BDU3VR6VMD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLAOC3BD","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FLAOC3BDU3VR6VMDV32MYMRWFW","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-17T22:00:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab91225fc9ed2eb523562fe178d96c362f7d1ce1c080baead4a4f1d110151a3c","abstract_canon_sha256":"cf770c24bbf8c749a5e6a5a32b8aab5b747a360d2f43c58a5dbcbc9662e7e9c4"},"schema_version":"1.0"},"canonical_sha256":"2ac0e16c23a6eb1f5583aef4cc32362dbfe8db2f1283e2143a03e7657ee2a35e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:09.468841Z","signature_b64":"JaHpPRNPtXqHiT6R1pbWmo2msLYedwPEWdUZu9DH7jpLIuNZejGhnDSp/Hc2YE4JJOCvkVH7QhHNM9IzuBfqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ac0e16c23a6eb1f5583aef4cc32362dbfe8db2f1283e2143a03e7657ee2a35e","last_reissued_at":"2026-05-18T00:42:09.468414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:09.468414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05583","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbbcDF1CeiCQ/002+KBxZE/QL2A5okwG3siFIuW9O/95IdkLvuM0mKNPw6RBrDPv68a0T4lmNmsdjBf63psQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:38:57.150084Z"},"content_sha256":"35e2c4c8cad4b13ca22ff3b314cd58c4c9861a0f1f1854cc4a4c58683e199c67","schema_version":"1.0","event_id":"sha256:35e2c4c8cad4b13ca22ff3b314cd58c4c9861a0f1f1854cc4a4c58683e199c67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FLAOC3BDU3VR6VMDV32MYMRWFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Optimization and Power Allocation in In-band Full Duplex (IBFD)-Enabled Non-Orthogonal Multiple Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Matti Latva-aho, Mehdi Bennis, M\\'erouane Debbah, Mohammed S. Elbamby, Walid Saad","submitted_at":"2017-06-17T22:00:19Z","abstract_excerpt":"In this paper, the problem of uplink (UL) and downlink (DL) resource optimization, mode selection and power allocation is studied for wireless cellular networks under the assumption of in-band full duplex (IBFD) base stations, non-orthogonal multiple access (NOMA) operation, and queue stability constraints. The problem is formulated as a network utility maximization problem for which a Lyapunov framework is used to decompose it into two disjoint subproblems of auxiliary variable selection and rate maximization. The latter is further decoupled into a user association and mode selection (UAMS) p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05583","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:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEI3+Og/SE9nEebAtP7kMoeNclbeLZZxm3Gnb7OtKwEsiX9RgHQcUCaivr//zrHE3V9C2KdiNmedmUXlCYXkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:38:57.150446Z"},"content_sha256":"7e32751dfd84f0cc8855445a58de6077f90cc32f5323dc0ebd935edbd7d65190","schema_version":"1.0","event_id":"sha256:7e32751dfd84f0cc8855445a58de6077f90cc32f5323dc0ebd935edbd7d65190"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLAOC3BDU3VR6VMDV32MYMRWFW/bundle.json","state_url":"https://pith.science/pith/FLAOC3BDU3VR6VMDV32MYMRWFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLAOC3BDU3VR6VMDV32MYMRWFW/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-01T14:38:57Z","links":{"resolver":"https://pith.science/pith/FLAOC3BDU3VR6VMDV32MYMRWFW","bundle":"https://pith.science/pith/FLAOC3BDU3VR6VMDV32MYMRWFW/bundle.json","state":"https://pith.science/pith/FLAOC3BDU3VR6VMDV32MYMRWFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLAOC3BDU3VR6VMDV32MYMRWFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FLAOC3BDU3VR6VMDV32MYMRWFW","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":"cf770c24bbf8c749a5e6a5a32b8aab5b747a360d2f43c58a5dbcbc9662e7e9c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-17T22:00:19Z","title_canon_sha256":"ab91225fc9ed2eb523562fe178d96c362f7d1ce1c080baead4a4f1d110151a3c"},"schema_version":"1.0","source":{"id":"1706.05583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05583","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05583v1","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05583","created_at":"2026-05-18T00:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"FLAOC3BDU3VR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLAOC3BDU3VR6VMD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLAOC3BD","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:7e32751dfd84f0cc8855445a58de6077f90cc32f5323dc0ebd935edbd7d65190","target":"graph","created_at":"2026-05-18T00:42:09Z","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 problem of uplink (UL) and downlink (DL) resource optimization, mode selection and power allocation is studied for wireless cellular networks under the assumption of in-band full duplex (IBFD) base stations, non-orthogonal multiple access (NOMA) operation, and queue stability constraints. The problem is formulated as a network utility maximization problem for which a Lyapunov framework is used to decompose it into two disjoint subproblems of auxiliary variable selection and rate maximization. The latter is further decoupled into a user association and mode selection (UAMS) p","authors_text":"Matti Latva-aho, Mehdi Bennis, M\\'erouane Debbah, Mohammed S. Elbamby, Walid Saad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-17T22:00:19Z","title":"Resource Optimization and Power Allocation in In-band Full Duplex (IBFD)-Enabled Non-Orthogonal Multiple Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05583","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:35e2c4c8cad4b13ca22ff3b314cd58c4c9861a0f1f1854cc4a4c58683e199c67","target":"record","created_at":"2026-05-18T00:42:09Z","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":"cf770c24bbf8c749a5e6a5a32b8aab5b747a360d2f43c58a5dbcbc9662e7e9c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-17T22:00:19Z","title_canon_sha256":"ab91225fc9ed2eb523562fe178d96c362f7d1ce1c080baead4a4f1d110151a3c"},"schema_version":"1.0","source":{"id":"1706.05583","kind":"arxiv","version":1}},"canonical_sha256":"2ac0e16c23a6eb1f5583aef4cc32362dbfe8db2f1283e2143a03e7657ee2a35e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ac0e16c23a6eb1f5583aef4cc32362dbfe8db2f1283e2143a03e7657ee2a35e","first_computed_at":"2026-05-18T00:42:09.468414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:09.468414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JaHpPRNPtXqHiT6R1pbWmo2msLYedwPEWdUZu9DH7jpLIuNZejGhnDSp/Hc2YE4JJOCvkVH7QhHNM9IzuBfqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:09.468841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35e2c4c8cad4b13ca22ff3b314cd58c4c9861a0f1f1854cc4a4c58683e199c67","sha256:7e32751dfd84f0cc8855445a58de6077f90cc32f5323dc0ebd935edbd7d65190"],"state_sha256":"7f01e02217b0aa579d63617c543e98ce6cbd5fad16b20f5f11cfb5d6a7984a0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sz4EfVYBw4JDu6stmEIrR2/NgTcpoSE6rVEsBJ9YvrBfNqkWAhtDN8VE4DuufUVco4Lv6U13SlaCwnX2J8QlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:38:57.152389Z","bundle_sha256":"934ac8e8ddc95a4c90487f16e40928a6b676376c0a6d74d4ec43f5e990c8d918"}}