{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6NLUODJ5JRTSNGMWY4TSODOIY7","short_pith_number":"pith:6NLUODJ5","canonical_record":{"source":{"id":"1402.2479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-11T13:03:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"14f95deea9e98e011cd62a56ea19474edf55cb1a4a12e7a7255406ced7d5d001","abstract_canon_sha256":"16a35d02a8d9e8182111425a222e52a825f50650d46132efb6a4199a809eda31"},"schema_version":"1.0"},"canonical_sha256":"f357470d3d4c67269996c727270dc8c7ffac848f66ab0aa434131455bbfbf3d0","source":{"kind":"arxiv","id":"1402.2479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2479","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2479v1","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2479","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"6NLUODJ5JRTS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6NLUODJ5JRTSNGMW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6NLUODJ5","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6NLUODJ5JRTSNGMWY4TSODOIY7","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-11T13:03:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"14f95deea9e98e011cd62a56ea19474edf55cb1a4a12e7a7255406ced7d5d001","abstract_canon_sha256":"16a35d02a8d9e8182111425a222e52a825f50650d46132efb6a4199a809eda31"},"schema_version":"1.0"},"canonical_sha256":"f357470d3d4c67269996c727270dc8c7ffac848f66ab0aa434131455bbfbf3d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:19.648483Z","signature_b64":"P3N72+TOAEcLCG0MTuS5QdqlxlEDTz78Cdc0Z+wAxSzY7LRC4ZBLJZV7bQJNdLk9Xh9IypOJCOl8LjqfZF1yAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f357470d3d4c67269996c727270dc8c7ffac848f66ab0aa434131455bbfbf3d0","last_reissued_at":"2026-05-18T02:59:19.647696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:19.647696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2479","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:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNtuvF3r8pg+7zBcsXjR2OEvyox4Idc+qA5oi8R0Gy0s4gt+b/LItadfNiEO++6WxwJdKfxpv5vYV07ffjjDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:45:45.307384Z"},"content_sha256":"f77c04082191bfa69f782360765557415988f8fd7b8892ed9a44de1952c1a754","schema_version":"1.0","event_id":"sha256:f77c04082191bfa69f782360765557415988f8fd7b8892ed9a44de1952c1a754"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6NLUODJ5JRTSNGMWY4TSODOIY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.GT","authors_text":"Lingyang Song, Walid Saad, Zengfeng Zhang, Zhu Han","submitted_at":"2014-02-11T13:03:54Z","abstract_excerpt":"In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a novel approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing work which assumes that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as a coalition formation game with overlapping coalitions. In this game, each small cell base station can choose to participate in one or mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2479","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:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xj7GANbYsr0yOiiZ7qulHgvqst0wRENkzpGoflZRnsloDjsFPKyiEpZHfYnFasQyTFBn2LPksWBp0OuID4h5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:45:45.307733Z"},"content_sha256":"12b4bf1cc5f7a1d99b05f3be2824423260ae03f040a12151de718b1f24ec1bc1","schema_version":"1.0","event_id":"sha256:12b4bf1cc5f7a1d99b05f3be2824423260ae03f040a12151de718b1f24ec1bc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NLUODJ5JRTSNGMWY4TSODOIY7/bundle.json","state_url":"https://pith.science/pith/6NLUODJ5JRTSNGMWY4TSODOIY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NLUODJ5JRTSNGMWY4TSODOIY7/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-02T12:45:45Z","links":{"resolver":"https://pith.science/pith/6NLUODJ5JRTSNGMWY4TSODOIY7","bundle":"https://pith.science/pith/6NLUODJ5JRTSNGMWY4TSODOIY7/bundle.json","state":"https://pith.science/pith/6NLUODJ5JRTSNGMWY4TSODOIY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NLUODJ5JRTSNGMWY4TSODOIY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6NLUODJ5JRTSNGMWY4TSODOIY7","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":"16a35d02a8d9e8182111425a222e52a825f50650d46132efb6a4199a809eda31","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-11T13:03:54Z","title_canon_sha256":"14f95deea9e98e011cd62a56ea19474edf55cb1a4a12e7a7255406ced7d5d001"},"schema_version":"1.0","source":{"id":"1402.2479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2479","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2479v1","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2479","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"6NLUODJ5JRTS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6NLUODJ5JRTSNGMW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6NLUODJ5","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:12b4bf1cc5f7a1d99b05f3be2824423260ae03f040a12151de718b1f24ec1bc1","target":"graph","created_at":"2026-05-18T02:59:19Z","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 paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a novel approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing work which assumes that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as a coalition formation game with overlapping coalitions. In this game, each small cell base station can choose to participate in one or mor","authors_text":"Lingyang Song, Walid Saad, Zengfeng Zhang, Zhu Han","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-11T13:03:54Z","title":"Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2479","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:f77c04082191bfa69f782360765557415988f8fd7b8892ed9a44de1952c1a754","target":"record","created_at":"2026-05-18T02:59:19Z","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":"16a35d02a8d9e8182111425a222e52a825f50650d46132efb6a4199a809eda31","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-02-11T13:03:54Z","title_canon_sha256":"14f95deea9e98e011cd62a56ea19474edf55cb1a4a12e7a7255406ced7d5d001"},"schema_version":"1.0","source":{"id":"1402.2479","kind":"arxiv","version":1}},"canonical_sha256":"f357470d3d4c67269996c727270dc8c7ffac848f66ab0aa434131455bbfbf3d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f357470d3d4c67269996c727270dc8c7ffac848f66ab0aa434131455bbfbf3d0","first_computed_at":"2026-05-18T02:59:19.647696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:19.647696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3N72+TOAEcLCG0MTuS5QdqlxlEDTz78Cdc0Z+wAxSzY7LRC4ZBLJZV7bQJNdLk9Xh9IypOJCOl8LjqfZF1yAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:19.648483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f77c04082191bfa69f782360765557415988f8fd7b8892ed9a44de1952c1a754","sha256:12b4bf1cc5f7a1d99b05f3be2824423260ae03f040a12151de718b1f24ec1bc1"],"state_sha256":"9a56c913e2ad3ccf818f780c1d6734dd287a44168b5705e479d8cc512f5767d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vjg4n+ladD81+OvFy0kql2bFns8EDHhP4tprNxeM3K9VcaWSUJiATlRFK+gxUGQQZqpy+Hu7v/qAd3n6TxV7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:45:45.309812Z","bundle_sha256":"2f16b333a39af5753b790de8a9ebef312266423b6c45f63b5043a1de70a7d312"}}