{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IHFR2DX34CWSFIWAP652743OLY","short_pith_number":"pith:IHFR2DX3","canonical_record":{"source":{"id":"1802.07793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T20:31:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"78bf448eb7c790fb4adfe19fc84447d3b0fa96302873afe621643ddf1afe94be","abstract_canon_sha256":"2ea271e05473875981f1f2d4c37df915d6ede4435d5752bb24486231f8d8d22d"},"schema_version":"1.0"},"canonical_sha256":"41cb1d0efbe0ad22a2c07fbbaff36e5e28ce9318e9745906d4494a477851e618","source":{"kind":"arxiv","id":"1802.07793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07793","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07793v1","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07793","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"IHFR2DX34CWS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHFR2DX34CWSFIWA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHFR2DX3","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IHFR2DX34CWSFIWAP652743OLY","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T20:31:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"78bf448eb7c790fb4adfe19fc84447d3b0fa96302873afe621643ddf1afe94be","abstract_canon_sha256":"2ea271e05473875981f1f2d4c37df915d6ede4435d5752bb24486231f8d8d22d"},"schema_version":"1.0"},"canonical_sha256":"41cb1d0efbe0ad22a2c07fbbaff36e5e28ce9318e9745906d4494a477851e618","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:48.875001Z","signature_b64":"DbE63K5GL5CSpV7sVOYB1KlmFbsqcWVy6qhz6kjLejCB2BleoErD81Cz0qycc87Lj/k8TFVuiixD561715rAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41cb1d0efbe0ad22a2c07fbbaff36e5e28ce9318e9745906d4494a477851e618","last_reissued_at":"2026-05-18T00:22:48.874570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:48.874570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07793","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:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iff6zTU2lRHnKejSIF9lvlcu6OZUAnH68eBS7Fs6ANeKchcVWjAIm5p9la5Dn1NRq+YknIY7EewQQOA/O+0MBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:06:48.228734Z"},"content_sha256":"c81041cd8b310d26e9f6ba9ce78b9a9c68efe7e4b6ffa6f8b9230d791cdb4186","schema_version":"1.0","event_id":"sha256:c81041cd8b310d26e9f6ba9ce78b9a9c68efe7e4b6ffa6f8b9230d791cdb4186"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IHFR2DX34CWSFIWAP652743OLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Multi-User Scheduling of Buffer-Aided Relay Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Xia, Cheng Li, Dingjie Xu, Pihe Hu","submitted_at":"2018-02-21T20:31:00Z","abstract_excerpt":"Multi-User scheduling is a challenging problem under the relaying scenarios. Traditional schemes, which are based on the instantaneous signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent disparities of the qualities between different links. Hence, the system performance is always limited by the weaker links. In this paper, from the whole system throughput view, we propose an optimal multi-user scheduling scheme for the multi-user full-duplex (FD) buffer aided relay systems. We first formulate the throughput maximization problem. Then, according to the characteristics o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07793","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:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQxVJyDpcmRawrULKiQ3xbdxsDyhXIuduQmqmESKraWSGHNhIVCLPwGLykARk4VomX8Ecz5HyFaXmUkOuw7HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:06:48.229438Z"},"content_sha256":"4a421ef4c6f4a12b93fc22d7f52e4a71feac1d152bb9e83039a13ca01b5de68b","schema_version":"1.0","event_id":"sha256:4a421ef4c6f4a12b93fc22d7f52e4a71feac1d152bb9e83039a13ca01b5de68b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHFR2DX34CWSFIWAP652743OLY/bundle.json","state_url":"https://pith.science/pith/IHFR2DX34CWSFIWAP652743OLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHFR2DX34CWSFIWAP652743OLY/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-11T21:06:48Z","links":{"resolver":"https://pith.science/pith/IHFR2DX34CWSFIWAP652743OLY","bundle":"https://pith.science/pith/IHFR2DX34CWSFIWAP652743OLY/bundle.json","state":"https://pith.science/pith/IHFR2DX34CWSFIWAP652743OLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHFR2DX34CWSFIWAP652743OLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IHFR2DX34CWSFIWAP652743OLY","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":"2ea271e05473875981f1f2d4c37df915d6ede4435d5752bb24486231f8d8d22d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T20:31:00Z","title_canon_sha256":"78bf448eb7c790fb4adfe19fc84447d3b0fa96302873afe621643ddf1afe94be"},"schema_version":"1.0","source":{"id":"1802.07793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07793","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07793v1","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07793","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"IHFR2DX34CWS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHFR2DX34CWSFIWA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHFR2DX3","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:4a421ef4c6f4a12b93fc22d7f52e4a71feac1d152bb9e83039a13ca01b5de68b","target":"graph","created_at":"2026-05-18T00:22:48Z","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":"Multi-User scheduling is a challenging problem under the relaying scenarios. Traditional schemes, which are based on the instantaneous signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent disparities of the qualities between different links. Hence, the system performance is always limited by the weaker links. In this paper, from the whole system throughput view, we propose an optimal multi-user scheduling scheme for the multi-user full-duplex (FD) buffer aided relay systems. We first formulate the throughput maximization problem. Then, according to the characteristics o","authors_text":"Bin Xia, Cheng Li, Dingjie Xu, Pihe Hu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T20:31:00Z","title":"Optimal Multi-User Scheduling of Buffer-Aided Relay Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07793","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:c81041cd8b310d26e9f6ba9ce78b9a9c68efe7e4b6ffa6f8b9230d791cdb4186","target":"record","created_at":"2026-05-18T00:22:48Z","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":"2ea271e05473875981f1f2d4c37df915d6ede4435d5752bb24486231f8d8d22d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T20:31:00Z","title_canon_sha256":"78bf448eb7c790fb4adfe19fc84447d3b0fa96302873afe621643ddf1afe94be"},"schema_version":"1.0","source":{"id":"1802.07793","kind":"arxiv","version":1}},"canonical_sha256":"41cb1d0efbe0ad22a2c07fbbaff36e5e28ce9318e9745906d4494a477851e618","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41cb1d0efbe0ad22a2c07fbbaff36e5e28ce9318e9745906d4494a477851e618","first_computed_at":"2026-05-18T00:22:48.874570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:48.874570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DbE63K5GL5CSpV7sVOYB1KlmFbsqcWVy6qhz6kjLejCB2BleoErD81Cz0qycc87Lj/k8TFVuiixD561715rAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:48.875001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c81041cd8b310d26e9f6ba9ce78b9a9c68efe7e4b6ffa6f8b9230d791cdb4186","sha256:4a421ef4c6f4a12b93fc22d7f52e4a71feac1d152bb9e83039a13ca01b5de68b"],"state_sha256":"e66835c90f053e06d63213480adf59b58f30c6e8b7fb8452cb850d3e5220b0a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CActAkrdT4z0MWviU+kr+NpLauHFzBnqZVcXpwdbcfk6vHPfwPcoo7IePJuUAT7EBB0TNpv6QMC59R1nXXJ4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:06:48.233790Z","bundle_sha256":"1b6fa7791651d4cf2be70b4c3988527f0388314880fc7531d69ee8c6b06696e8"}}