{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CW4S6RASYALKYMWHTMR25YFN3P","short_pith_number":"pith:CW4S6RAS","canonical_record":{"source":{"id":"1502.06670","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T01:43:22Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"c8d568d6fce5d000f321af93c71bfeb1fb502e117c7b1a7364db599c6e231686","abstract_canon_sha256":"74ab4fb499b23b11a44c5fd500110533970e0a1c268e5ace4128fa29e6bdd24c"},"schema_version":"1.0"},"canonical_sha256":"15b92f4412c016ac32c79b23aee0addbe19c47fa3620237c7652f48401055b23","source":{"kind":"arxiv","id":"1502.06670","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06670","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06670v3","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06670","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"CW4S6RASYALK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CW4S6RASYALKYMWH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CW4S6RAS","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CW4S6RASYALKYMWHTMR25YFN3P","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06670","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T01:43:22Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"c8d568d6fce5d000f321af93c71bfeb1fb502e117c7b1a7364db599c6e231686","abstract_canon_sha256":"74ab4fb499b23b11a44c5fd500110533970e0a1c268e5ace4128fa29e6bdd24c"},"schema_version":"1.0"},"canonical_sha256":"15b92f4412c016ac32c79b23aee0addbe19c47fa3620237c7652f48401055b23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.126331Z","signature_b64":"2ec7KKW/K1eorWuF8oL26TjC4eaEFtrpNMdjngukxdVpbF+cW1XxN4vW/uk6u/2EZzH0vm4GK0jVRypwgtvWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15b92f4412c016ac32c79b23aee0addbe19c47fa3620237c7652f48401055b23","last_reissued_at":"2026-05-18T00:58:36.125833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.125833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06670","source_version":3,"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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8XdQkBoRKTlDIXxPr4lI58OMPKzOcychHKztp4SU+1z4SGbIIwzd7n306i7qQOB50DyJqzDjBb2wCylnGt+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:16:19.006642Z"},"content_sha256":"86e044eb2a6a07ff6731ad8b43084054e5230e7226995dd73ce4f02c4abc023f","schema_version":"1.0","event_id":"sha256:86e044eb2a6a07ff6731ad8b43084054e5230e7226995dd73ce4f02c4abc023f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CW4S6RASYALKYMWHTMR25YFN3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Load-aware Dynamic Spectrum Access for Small Cell Networks: A Graphical Game Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Alagan Anpalagan, Chenggui Wang, Jinlong Wang, Junhong Chen, Qihui Wu, Yitao Xu, Yuhua Xu","submitted_at":"2015-02-24T01:43:22Z","abstract_excerpt":"In this letter, we investigate the problem of dynamic spectrum access for small cell networks, using a graphical game approach. Compared with existing studies, we take the features of different cell loads and local interference relationship into account. It is proved that the formulated spectrum access game is an exact potential game with the aggregate interference level as the potential function, and Nash equilibrium (NE) of the game corresponds to the global or local optima of the original optimization problem. A lower bound of the achievable aggregate interference level is rigorously derive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06670","kind":"arxiv","version":3},"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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JI6l41KJtQxpPIhh76CTyiwCYYK0i2t6p+cVg5EXJvIx5DX+2EUxo9Fd5MN9dADkeBoXq4B1XpOIbW/BAJ+FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:16:19.007329Z"},"content_sha256":"4f0834e221564fbbe8155b713a6c96faa71776fcf64ce90a3af0f9c839c2058b","schema_version":"1.0","event_id":"sha256:4f0834e221564fbbe8155b713a6c96faa71776fcf64ce90a3af0f9c839c2058b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CW4S6RASYALKYMWHTMR25YFN3P/bundle.json","state_url":"https://pith.science/pith/CW4S6RASYALKYMWHTMR25YFN3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CW4S6RASYALKYMWHTMR25YFN3P/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-05-30T02:16:19Z","links":{"resolver":"https://pith.science/pith/CW4S6RASYALKYMWHTMR25YFN3P","bundle":"https://pith.science/pith/CW4S6RASYALKYMWHTMR25YFN3P/bundle.json","state":"https://pith.science/pith/CW4S6RASYALKYMWHTMR25YFN3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CW4S6RASYALKYMWHTMR25YFN3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CW4S6RASYALKYMWHTMR25YFN3P","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":"74ab4fb499b23b11a44c5fd500110533970e0a1c268e5ace4128fa29e6bdd24c","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T01:43:22Z","title_canon_sha256":"c8d568d6fce5d000f321af93c71bfeb1fb502e117c7b1a7364db599c6e231686"},"schema_version":"1.0","source":{"id":"1502.06670","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06670","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06670v3","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06670","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"CW4S6RASYALK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CW4S6RASYALKYMWH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CW4S6RAS","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:4f0834e221564fbbe8155b713a6c96faa71776fcf64ce90a3af0f9c839c2058b","target":"graph","created_at":"2026-05-18T00:58:36Z","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 letter, we investigate the problem of dynamic spectrum access for small cell networks, using a graphical game approach. Compared with existing studies, we take the features of different cell loads and local interference relationship into account. It is proved that the formulated spectrum access game is an exact potential game with the aggregate interference level as the potential function, and Nash equilibrium (NE) of the game corresponds to the global or local optima of the original optimization problem. A lower bound of the achievable aggregate interference level is rigorously derive","authors_text":"Alagan Anpalagan, Chenggui Wang, Jinlong Wang, Junhong Chen, Qihui Wu, Yitao Xu, Yuhua Xu","cross_cats":["cs.GT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T01:43:22Z","title":"Load-aware Dynamic Spectrum Access for Small Cell Networks: A Graphical Game Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06670","kind":"arxiv","version":3},"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:86e044eb2a6a07ff6731ad8b43084054e5230e7226995dd73ce4f02c4abc023f","target":"record","created_at":"2026-05-18T00:58:36Z","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":"74ab4fb499b23b11a44c5fd500110533970e0a1c268e5ace4128fa29e6bdd24c","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T01:43:22Z","title_canon_sha256":"c8d568d6fce5d000f321af93c71bfeb1fb502e117c7b1a7364db599c6e231686"},"schema_version":"1.0","source":{"id":"1502.06670","kind":"arxiv","version":3}},"canonical_sha256":"15b92f4412c016ac32c79b23aee0addbe19c47fa3620237c7652f48401055b23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15b92f4412c016ac32c79b23aee0addbe19c47fa3620237c7652f48401055b23","first_computed_at":"2026-05-18T00:58:36.125833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:36.125833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ec7KKW/K1eorWuF8oL26TjC4eaEFtrpNMdjngukxdVpbF+cW1XxN4vW/uk6u/2EZzH0vm4GK0jVRypwgtvWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:36.126331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06670","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86e044eb2a6a07ff6731ad8b43084054e5230e7226995dd73ce4f02c4abc023f","sha256:4f0834e221564fbbe8155b713a6c96faa71776fcf64ce90a3af0f9c839c2058b"],"state_sha256":"b5bc7e04c3a2f8db11d4af403c7a3b65aa9bf6ce397a7a7730a15dd325b8a0b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOiQ1wIIvbg5qVjY8/nyw9s1B2G3cnI3196wFt20yXM0s5bu2wF+pLUJp4skAsn59F3+vwP1gzYjL9xgwN98CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:16:19.010954Z","bundle_sha256":"4cd21dfed26a9c550ed2334b2ca071083e0936a65f917603eb05d7a1d2db5223"}}