{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UYVB7RF65FQ247C7VVPVOM26QC","short_pith_number":"pith:UYVB7RF6","schema_version":"1.0","canonical_sha256":"a62a1fc4bee961ae7c5fad5f57335e8097ee36112ba2c13413087e73e051df92","source":{"kind":"arxiv","id":"1602.06695","version":1},"attestation_state":"computed","paper":{"title":"Optimal Mode Selection in D2D-Enabled Multi-Base Station Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yuan Liu","submitted_at":"2016-02-22T09:24:35Z","abstract_excerpt":"In this paper, we consider device-to-device (D2D) communication underlaying uplink cellular networks with multiple base stations (BSs), where each user can switch between traditional cellular mode (through BS) and D2D mode (by connecting proximity user), namely mode selection. We impose load balancing constraints on BSs to efficient resource usage. The joint problem of mode selection and user association is formulated as a combinatorial problem and NP-complete. We adopt a graph-based approach to solve the problem globally optimally in polynomial time. To further reduce complexity, we also prop"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.06695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-22T09:24:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c8f07c58e906e90e366cb304a9a1527dc34927256d35c62e25396ebf7d85e3cc","abstract_canon_sha256":"afa9a9a2ca4952b0770bbf5b6f74d5d990303ec0e1316fb5675cdfc52bdb143c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:13.356293Z","signature_b64":"NYl0vf3evb9NlFN7YhX2wtYESl8/O7/qevQhRq3xC2yURUhXaFjNJBHpUgcIcFk3zS//3DPEjEQ4k5J5AY75CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a62a1fc4bee961ae7c5fad5f57335e8097ee36112ba2c13413087e73e051df92","last_reissued_at":"2026-05-18T01:20:13.355647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:13.355647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Mode Selection in D2D-Enabled Multi-Base Station Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yuan Liu","submitted_at":"2016-02-22T09:24:35Z","abstract_excerpt":"In this paper, we consider device-to-device (D2D) communication underlaying uplink cellular networks with multiple base stations (BSs), where each user can switch between traditional cellular mode (through BS) and D2D mode (by connecting proximity user), namely mode selection. We impose load balancing constraints on BSs to efficient resource usage. The joint problem of mode selection and user association is formulated as a combinatorial problem and NP-complete. We adopt a graph-based approach to solve the problem globally optimally in polynomial time. To further reduce complexity, we also prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06695","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.06695","created_at":"2026-05-18T01:20:13.355760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06695v1","created_at":"2026-05-18T01:20:13.355760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06695","created_at":"2026-05-18T01:20:13.355760+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYVB7RF65FQ2","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYVB7RF65FQ247C7","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYVB7RF6","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC","json":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC.json","graph_json":"https://pith.science/api/pith-number/UYVB7RF65FQ247C7VVPVOM26QC/graph.json","events_json":"https://pith.science/api/pith-number/UYVB7RF65FQ247C7VVPVOM26QC/events.json","paper":"https://pith.science/paper/UYVB7RF6"},"agent_actions":{"view_html":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC","download_json":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC.json","view_paper":"https://pith.science/paper/UYVB7RF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06695&json=true","fetch_graph":"https://pith.science/api/pith-number/UYVB7RF65FQ247C7VVPVOM26QC/graph.json","fetch_events":"https://pith.science/api/pith-number/UYVB7RF65FQ247C7VVPVOM26QC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC/action/storage_attestation","attest_author":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC/action/author_attestation","sign_citation":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC/action/citation_signature","submit_replication":"https://pith.science/pith/UYVB7RF65FQ247C7VVPVOM26QC/action/replication_record"}},"created_at":"2026-05-18T01:20:13.355760+00:00","updated_at":"2026-05-18T01:20:13.355760+00:00"}