{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JB6XIEUX3SQXFJCPLYJIAVFMKH","short_pith_number":"pith:JB6XIEUX","canonical_record":{"source":{"id":"1502.06667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T01:42:05Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"7279641733bfa2ec0c0361344c7503cbcc95851ec11b9598d02c0a5769180ae5","abstract_canon_sha256":"12ab89fa7002803f34bf2cb84000be8dd055d02e872ace689941b51c1e6ef0eb"},"schema_version":"1.0"},"canonical_sha256":"487d741297dca172a44f5e128054ac51d4724eb0dcf83108765e8b5152e13c4e","source":{"kind":"arxiv","id":"1502.06667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06667","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06667v1","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06667","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"pith_short_12","alias_value":"JB6XIEUX3SQX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JB6XIEUX3SQXFJCP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JB6XIEUX","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JB6XIEUX3SQXFJCPLYJIAVFMKH","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-24T01:42:05Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"7279641733bfa2ec0c0361344c7503cbcc95851ec11b9598d02c0a5769180ae5","abstract_canon_sha256":"12ab89fa7002803f34bf2cb84000be8dd055d02e872ace689941b51c1e6ef0eb"},"schema_version":"1.0"},"canonical_sha256":"487d741297dca172a44f5e128054ac51d4724eb0dcf83108765e8b5152e13c4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:29.480207Z","signature_b64":"eD9rnDb6fhMpRZMxvg74prswmpz3aue/UrWYMWnuUKwp+jCqPnZWgPtcQeBFfauaLPWHOH2upfE3bK5QSH2fCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"487d741297dca172a44f5e128054ac51d4724eb0dcf83108765e8b5152e13c4e","last_reissued_at":"2026-05-18T02:26:29.479717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:29.479717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06667","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-18T02:26:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apM8oz3DNlSnmkPZjHfJniOhiuq9BQ1TgBRvcUIvKqJ+mBs1lg5sTvbzEndF/h3aow6mWyqf+x/EszKplYGaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:00:04.196362Z"},"content_sha256":"17c4aa450d80b5a2d2b8e099497e0482beb8bc1b9a000efcb80049e8a6700f58","schema_version":"1.0","event_id":"sha256:17c4aa450d80b5a2d2b8e099497e0482beb8bc1b9a000efcb80049e8a6700f58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JB6XIEUX3SQXFJCPLYJIAVFMKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Spectrum Access for Cognitive Small Cell Networks: A Robust 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":"Jinlong Wang, Liang Shen, Qihui Wu, Yuhua Xu, Yuli Zhang","submitted_at":"2015-02-24T01:42:05Z","abstract_excerpt":"This letter investigates the problem of distributed spectrum access for cognitive small cell networks. Compared with existing work, two inherent features are considered: i) the transmission of a cognitive small cell base station only interferes with its neighbors due to the low power, i.e., the interference is local, and ii) the channel state is time-varying due to fading. We formulate the problem as a robust graphical game, and prove that it is an ordinal potential game which has at least one pure strategy Nash equilibrium (NE). Also, the lower throughput bound of NE solutions is analytically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06667","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-18T02:26:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pPOqFg5bQFs8/sznjEjUCQ8fH2ivMCcwD1bBw5amo8jlzYGZFpNV2lInCDybNlRaYKHx+U4oBrwvZmw/rcLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:00:04.196728Z"},"content_sha256":"b844ce55aab68a08de9d3669b425fcfe419ab77f97e10af4566d2fc391780279","schema_version":"1.0","event_id":"sha256:b844ce55aab68a08de9d3669b425fcfe419ab77f97e10af4566d2fc391780279"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JB6XIEUX3SQXFJCPLYJIAVFMKH/bundle.json","state_url":"https://pith.science/pith/JB6XIEUX3SQXFJCPLYJIAVFMKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JB6XIEUX3SQXFJCPLYJIAVFMKH/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-05T10:00:04Z","links":{"resolver":"https://pith.science/pith/JB6XIEUX3SQXFJCPLYJIAVFMKH","bundle":"https://pith.science/pith/JB6XIEUX3SQXFJCPLYJIAVFMKH/bundle.json","state":"https://pith.science/pith/JB6XIEUX3SQXFJCPLYJIAVFMKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JB6XIEUX3SQXFJCPLYJIAVFMKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JB6XIEUX3SQXFJCPLYJIAVFMKH","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":"12ab89fa7002803f34bf2cb84000be8dd055d02e872ace689941b51c1e6ef0eb","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:42:05Z","title_canon_sha256":"7279641733bfa2ec0c0361344c7503cbcc95851ec11b9598d02c0a5769180ae5"},"schema_version":"1.0","source":{"id":"1502.06667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06667","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06667v1","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06667","created_at":"2026-05-18T02:26:29Z"},{"alias_kind":"pith_short_12","alias_value":"JB6XIEUX3SQX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JB6XIEUX3SQXFJCP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JB6XIEUX","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:b844ce55aab68a08de9d3669b425fcfe419ab77f97e10af4566d2fc391780279","target":"graph","created_at":"2026-05-18T02:26:29Z","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":"This letter investigates the problem of distributed spectrum access for cognitive small cell networks. Compared with existing work, two inherent features are considered: i) the transmission of a cognitive small cell base station only interferes with its neighbors due to the low power, i.e., the interference is local, and ii) the channel state is time-varying due to fading. We formulate the problem as a robust graphical game, and prove that it is an ordinal potential game which has at least one pure strategy Nash equilibrium (NE). Also, the lower throughput bound of NE solutions is analytically","authors_text":"Jinlong Wang, Liang Shen, Qihui Wu, Yuhua Xu, Yuli Zhang","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:42:05Z","title":"Distributed Spectrum Access for Cognitive Small Cell Networks: A Robust Graphical Game Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06667","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:17c4aa450d80b5a2d2b8e099497e0482beb8bc1b9a000efcb80049e8a6700f58","target":"record","created_at":"2026-05-18T02:26:29Z","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":"12ab89fa7002803f34bf2cb84000be8dd055d02e872ace689941b51c1e6ef0eb","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:42:05Z","title_canon_sha256":"7279641733bfa2ec0c0361344c7503cbcc95851ec11b9598d02c0a5769180ae5"},"schema_version":"1.0","source":{"id":"1502.06667","kind":"arxiv","version":1}},"canonical_sha256":"487d741297dca172a44f5e128054ac51d4724eb0dcf83108765e8b5152e13c4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"487d741297dca172a44f5e128054ac51d4724eb0dcf83108765e8b5152e13c4e","first_computed_at":"2026-05-18T02:26:29.479717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:29.479717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eD9rnDb6fhMpRZMxvg74prswmpz3aue/UrWYMWnuUKwp+jCqPnZWgPtcQeBFfauaLPWHOH2upfE3bK5QSH2fCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:29.480207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17c4aa450d80b5a2d2b8e099497e0482beb8bc1b9a000efcb80049e8a6700f58","sha256:b844ce55aab68a08de9d3669b425fcfe419ab77f97e10af4566d2fc391780279"],"state_sha256":"5fada6d113b46dfaa78cab5a181c54202e24972fd48a4a05c968a048ce917c4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WdVpoy33mjm6+H2EEV9bWbEWSycnvbfaIY0nfCItU2W5aiKkejti9kYook9b132nzCy9yLBsF+p2+TavAeLJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:00:04.198735Z","bundle_sha256":"af5399f6032adcbcf2edcdc8485a6ee71286121b33cd34da4e4d37a4f19fa425"}}