{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OIWZ7QLXVO7IXRYSXFBXCBYIAE","short_pith_number":"pith:OIWZ7QLX","canonical_record":{"source":{"id":"1405.1963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:31:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"39140358123e3af7261ed34342aae8eb1111b2ef9115ecae73fc8d1a06c9dca6","abstract_canon_sha256":"8f882a77172756ecec525f53d1852c8b44425fbce2946591afb6d2d19385e151"},"schema_version":"1.0"},"canonical_sha256":"722d9fc177abbe8bc712b94371070801150e57cb7cd958943c305de82c2e2aa3","source":{"kind":"arxiv","id":"1405.1963","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1963","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1963v2","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1963","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"OIWZ7QLXVO7I","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OIWZ7QLXVO7IXRYS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OIWZ7QLX","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OIWZ7QLXVO7IXRYSXFBXCBYIAE","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:31:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"39140358123e3af7261ed34342aae8eb1111b2ef9115ecae73fc8d1a06c9dca6","abstract_canon_sha256":"8f882a77172756ecec525f53d1852c8b44425fbce2946591afb6d2d19385e151"},"schema_version":"1.0"},"canonical_sha256":"722d9fc177abbe8bc712b94371070801150e57cb7cd958943c305de82c2e2aa3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.486016Z","signature_b64":"bsLHDtugk8nSaiuBjQZ7KIcVegZVH49UglXUsVgy+HYPWrdweL6d3QCzN1dul1e4BS/JYi+6z7nxCAWZvwL1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722d9fc177abbe8bc712b94371070801150e57cb7cd958943c305de82c2e2aa3","last_reissued_at":"2026-05-18T00:58:41.485507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.485507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1963","source_version":2,"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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cT5uzNAjpDmZYSL0lms+Yq/FIhXrP6QOBv/kwN2Tz+bDGMX4dg+hqP2/XCpDtAMo8O2KS0X2vtvvyXWzNfXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:05:52.004193Z"},"content_sha256":"4f8147579715fe0b93532c61d03b485dd5b82f6c916a95c8caa0c88c17bff474","schema_version":"1.0","event_id":"sha256:4f8147579715fe0b93532c61d03b485dd5b82f6c916a95c8caa0c88c17bff474"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OIWZ7QLXVO7IXRYSXFBXCBYIAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Interference-Aware Energy-Efficient Resource Allocation for Device-to-Device Communications Underlaying Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Jun Wu, Kaoru Ota, Mianxiong Dong, Takuro Sato, Zhenyu Zhou","submitted_at":"2014-05-03T14:31:38Z","abstract_excerpt":"The introduction of device-to-device (D2D) into cellular networks poses many new challenges in the resource allocation design due to the co-channel interference caused by spectrum reuse and limited battery life of user equipments (UEs). In this paper, we propose a distributed interference-aware energy-efficient resource allocation algorithm to maximize each UE's energy efficiency (EE) subject to its specific quality of service (QoS) and maximum transmission power constraints. We model the resource allocation problem as a noncooperative game, in which each player is self-interested and wants to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1963","kind":"arxiv","version":2},"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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e95ITtikLmXViPEpamxkyLIOp9sKgViVieB+AXT3zXX7eqRn02PM5hhQjFC6qhSgD5BxTIXernTxYy5EfUX8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:05:52.004562Z"},"content_sha256":"2ef6d0ad7ab74538e03b585ba896b38c827d4b65da32d08734af49f5db7ef945","schema_version":"1.0","event_id":"sha256:2ef6d0ad7ab74538e03b585ba896b38c827d4b65da32d08734af49f5db7ef945"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIWZ7QLXVO7IXRYSXFBXCBYIAE/bundle.json","state_url":"https://pith.science/pith/OIWZ7QLXVO7IXRYSXFBXCBYIAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIWZ7QLXVO7IXRYSXFBXCBYIAE/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-19T21:05:52Z","links":{"resolver":"https://pith.science/pith/OIWZ7QLXVO7IXRYSXFBXCBYIAE","bundle":"https://pith.science/pith/OIWZ7QLXVO7IXRYSXFBXCBYIAE/bundle.json","state":"https://pith.science/pith/OIWZ7QLXVO7IXRYSXFBXCBYIAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIWZ7QLXVO7IXRYSXFBXCBYIAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OIWZ7QLXVO7IXRYSXFBXCBYIAE","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":"8f882a77172756ecec525f53d1852c8b44425fbce2946591afb6d2d19385e151","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:31:38Z","title_canon_sha256":"39140358123e3af7261ed34342aae8eb1111b2ef9115ecae73fc8d1a06c9dca6"},"schema_version":"1.0","source":{"id":"1405.1963","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1963","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1963v2","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1963","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"OIWZ7QLXVO7I","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OIWZ7QLXVO7IXRYS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OIWZ7QLX","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:2ef6d0ad7ab74538e03b585ba896b38c827d4b65da32d08734af49f5db7ef945","target":"graph","created_at":"2026-05-18T00:58:41Z","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 introduction of device-to-device (D2D) into cellular networks poses many new challenges in the resource allocation design due to the co-channel interference caused by spectrum reuse and limited battery life of user equipments (UEs). In this paper, we propose a distributed interference-aware energy-efficient resource allocation algorithm to maximize each UE's energy efficiency (EE) subject to its specific quality of service (QoS) and maximum transmission power constraints. We model the resource allocation problem as a noncooperative game, in which each player is self-interested and wants to","authors_text":"Jun Wu, Kaoru Ota, Mianxiong Dong, Takuro Sato, Zhenyu Zhou","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:31:38Z","title":"Distributed Interference-Aware Energy-Efficient Resource Allocation for Device-to-Device Communications Underlaying Cellular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1963","kind":"arxiv","version":2},"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:4f8147579715fe0b93532c61d03b485dd5b82f6c916a95c8caa0c88c17bff474","target":"record","created_at":"2026-05-18T00:58:41Z","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":"8f882a77172756ecec525f53d1852c8b44425fbce2946591afb6d2d19385e151","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:31:38Z","title_canon_sha256":"39140358123e3af7261ed34342aae8eb1111b2ef9115ecae73fc8d1a06c9dca6"},"schema_version":"1.0","source":{"id":"1405.1963","kind":"arxiv","version":2}},"canonical_sha256":"722d9fc177abbe8bc712b94371070801150e57cb7cd958943c305de82c2e2aa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"722d9fc177abbe8bc712b94371070801150e57cb7cd958943c305de82c2e2aa3","first_computed_at":"2026-05-18T00:58:41.485507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.485507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsLHDtugk8nSaiuBjQZ7KIcVegZVH49UglXUsVgy+HYPWrdweL6d3QCzN1dul1e4BS/JYi+6z7nxCAWZvwL1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.486016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1963","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f8147579715fe0b93532c61d03b485dd5b82f6c916a95c8caa0c88c17bff474","sha256:2ef6d0ad7ab74538e03b585ba896b38c827d4b65da32d08734af49f5db7ef945"],"state_sha256":"ade967cec0a999c4624e14c8735c0d473d87f46c6ab372c4d08cccd497ff78e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAQBO0CRKbpCZubUGCckclrIRg876llNZYKv5yLFQ9BaVg0HQX/z6aAg+K6QtGp4dkxEXuLqGfIeFZpY7oU8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T21:05:52.006522Z","bundle_sha256":"5371037904c358ea88cd043bf87d82f1b2e46eeac770df9d54f4061b16e578af"}}