{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LTQNESAPWYGYVSL7363JKSDG5Z","short_pith_number":"pith:LTQNESAP","canonical_record":{"source":{"id":"1508.00527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-03T18:52:52Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"fd828139fae92b2ca3e2636e5e5f69de5dc1defc1e7d5a4f988daaffe6ca5f0f","abstract_canon_sha256":"47e702ea1c72870736ffc6db1808a78fe980cf79b20725943d2d0320334a9477"},"schema_version":"1.0"},"canonical_sha256":"5ce0d2480fb60d8ac97fdfb6954866ee711207ea156b734031f9cf03d13e0602","source":{"kind":"arxiv","id":"1508.00527","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00527","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00527v1","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00527","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"pith_short_12","alias_value":"LTQNESAPWYGY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTQNESAPWYGYVSL7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTQNESAP","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LTQNESAPWYGYVSL7363JKSDG5Z","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-03T18:52:52Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"fd828139fae92b2ca3e2636e5e5f69de5dc1defc1e7d5a4f988daaffe6ca5f0f","abstract_canon_sha256":"47e702ea1c72870736ffc6db1808a78fe980cf79b20725943d2d0320334a9477"},"schema_version":"1.0"},"canonical_sha256":"5ce0d2480fb60d8ac97fdfb6954866ee711207ea156b734031f9cf03d13e0602","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:57.883953Z","signature_b64":"LaBkV7eFN/wRIdi8UH5+YxSuwA9D0U08dO70j7etqPiHNGj8naifvDufsw+tCjW1DuW/onB4ZeZ+Hkw1BB3IBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce0d2480fb60d8ac97fdfb6954866ee711207ea156b734031f9cf03d13e0602","last_reissued_at":"2026-05-18T01:35:57.883527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:57.883527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00527","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-18T01:35:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxlVEhCG7LntfRIzYe3Q3qF9bT+gHVM96evYIcZi6QUytxd+8MnChttAsYkTEJ5Hgid4BY/iRE68O8qNfqAuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:04:17.903703Z"},"content_sha256":"862d436b07895a89691cdb03ae593fb07560c6dbce1d144f0667af9db3511ab5","schema_version":"1.0","event_id":"sha256:862d436b07895a89691cdb03ae593fb07560c6dbce1d144f0667af9db3511ab5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LTQNESAPWYGYVSL7363JKSDG5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Base Station Association Problem in HetSNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.GT","authors_text":"Elmahdi Driouch, Halima Elbiaze, Wessam Ajib, Zoubeir Mlika","submitted_at":"2015-08-03T18:52:52Z","abstract_excerpt":"The dense deployment of small-cell base stations in HetSNets requires efficient resource allocation techniques. More precisely, the problem of associating users to SBSs must be revised and carefully studied. This problem is NP-hard and requires solving an integer optimization problem. In order to efficiently solve this problem, we model it using non-cooperative game theory. First, we design two non-cooperative games to solve the problem and show the existence of pure Nash equilibria (PNE) in both games. These equilibria are shown to be far from the social optimum. Hence, we propose a better ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00527","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-18T01:35:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfvrI15nTW4gXBngIEcUyL3G9qKVHSjSHmVWX1y3TdTej4FJAhc6ESoT6S/UKcaCiW6iczJolRNlfnaGoUf/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:04:17.904238Z"},"content_sha256":"a9c4aaa425df4c98a32d07f8f8957ccd2a9a79d572b4d5347c2a11639b1c9f42","schema_version":"1.0","event_id":"sha256:a9c4aaa425df4c98a32d07f8f8957ccd2a9a79d572b4d5347c2a11639b1c9f42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTQNESAPWYGYVSL7363JKSDG5Z/bundle.json","state_url":"https://pith.science/pith/LTQNESAPWYGYVSL7363JKSDG5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTQNESAPWYGYVSL7363JKSDG5Z/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-29T15:04:17Z","links":{"resolver":"https://pith.science/pith/LTQNESAPWYGYVSL7363JKSDG5Z","bundle":"https://pith.science/pith/LTQNESAPWYGYVSL7363JKSDG5Z/bundle.json","state":"https://pith.science/pith/LTQNESAPWYGYVSL7363JKSDG5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTQNESAPWYGYVSL7363JKSDG5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LTQNESAPWYGYVSL7363JKSDG5Z","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":"47e702ea1c72870736ffc6db1808a78fe980cf79b20725943d2d0320334a9477","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-03T18:52:52Z","title_canon_sha256":"fd828139fae92b2ca3e2636e5e5f69de5dc1defc1e7d5a4f988daaffe6ca5f0f"},"schema_version":"1.0","source":{"id":"1508.00527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00527","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00527v1","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00527","created_at":"2026-05-18T01:35:57Z"},{"alias_kind":"pith_short_12","alias_value":"LTQNESAPWYGY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LTQNESAPWYGYVSL7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LTQNESAP","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:a9c4aaa425df4c98a32d07f8f8957ccd2a9a79d572b4d5347c2a11639b1c9f42","target":"graph","created_at":"2026-05-18T01:35:57Z","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":"The dense deployment of small-cell base stations in HetSNets requires efficient resource allocation techniques. More precisely, the problem of associating users to SBSs must be revised and carefully studied. This problem is NP-hard and requires solving an integer optimization problem. In order to efficiently solve this problem, we model it using non-cooperative game theory. First, we design two non-cooperative games to solve the problem and show the existence of pure Nash equilibria (PNE) in both games. These equilibria are shown to be far from the social optimum. Hence, we propose a better ga","authors_text":"Elmahdi Driouch, Halima Elbiaze, Wessam Ajib, Zoubeir Mlika","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-03T18:52:52Z","title":"On the Base Station Association Problem in HetSNets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00527","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:862d436b07895a89691cdb03ae593fb07560c6dbce1d144f0667af9db3511ab5","target":"record","created_at":"2026-05-18T01:35:57Z","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":"47e702ea1c72870736ffc6db1808a78fe980cf79b20725943d2d0320334a9477","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-03T18:52:52Z","title_canon_sha256":"fd828139fae92b2ca3e2636e5e5f69de5dc1defc1e7d5a4f988daaffe6ca5f0f"},"schema_version":"1.0","source":{"id":"1508.00527","kind":"arxiv","version":1}},"canonical_sha256":"5ce0d2480fb60d8ac97fdfb6954866ee711207ea156b734031f9cf03d13e0602","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ce0d2480fb60d8ac97fdfb6954866ee711207ea156b734031f9cf03d13e0602","first_computed_at":"2026-05-18T01:35:57.883527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:57.883527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LaBkV7eFN/wRIdi8UH5+YxSuwA9D0U08dO70j7etqPiHNGj8naifvDufsw+tCjW1DuW/onB4ZeZ+Hkw1BB3IBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:57.883953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:862d436b07895a89691cdb03ae593fb07560c6dbce1d144f0667af9db3511ab5","sha256:a9c4aaa425df4c98a32d07f8f8957ccd2a9a79d572b4d5347c2a11639b1c9f42"],"state_sha256":"fa949fefde12db82b6121e122a73ac6fdd9a0af90896be85f11c1aeeb88b118a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvl3QyK0L08f2151r5q4J1tx2x73rKx3eWb5d8xJ7bzittAdJonpU8LK1wZYo8iVZbyqwkV5aqNlOA/8t2cWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:04:17.906205Z","bundle_sha256":"4f63aedc7faebc2ddbc409d54bbe0f2c5e18a119da2679b61ce1d0e22e645b23"}}