{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MSIYGXGDJFNEGKMQSHIH4ACYK3","short_pith_number":"pith:MSIYGXGD","schema_version":"1.0","canonical_sha256":"6491835cc3495a43299091d07e005856ca6ffbe7b148fe91e68909d92e1bcff6","source":{"kind":"arxiv","id":"1211.2065","version":1},"attestation_state":"computed","paper":{"title":"Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.GT","authors_text":"Bingli Jiao, Chen Xu, Lingyang Song, Qun Zhao, Xiang Cheng, Xiaoli Wang, Zhu Han","submitted_at":"2012-11-09T07:59:50Z","abstract_excerpt":"Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain b"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1211.2065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T07:59:50Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"e21af158ec65f71dae977c7d58a2ac3e49f963e324805e9c00ee84ba57ca4ad6","abstract_canon_sha256":"e3413db64faea3750f10a23ab0bbcf62e127df2db2a0205a27bdd3b3880c0eda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.805702Z","signature_b64":"FojqKSldooXdqoF0WB/Oxf/pRl2pgWUXczefc7aS7CW+hUytvgrHm2RW9PafHA+O0Oqf3ScyTR66Srfked35Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6491835cc3495a43299091d07e005856ca6ffbe7b148fe91e68909d92e1bcff6","last_reissued_at":"2026-05-18T00:58:42.805249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.805249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.GT","authors_text":"Bingli Jiao, Chen Xu, Lingyang Song, Qun Zhao, Xiang Cheng, Xiaoli Wang, Zhu Han","submitted_at":"2012-11-09T07:59:50Z","abstract_excerpt":"Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2065","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.2065","created_at":"2026-05-18T00:58:42.805333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2065v1","created_at":"2026-05-18T00:58:42.805333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2065","created_at":"2026-05-18T00:58:42.805333+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSIYGXGDJFNE","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSIYGXGDJFNEGKMQ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSIYGXGD","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3","json":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3.json","graph_json":"https://pith.science/api/pith-number/MSIYGXGDJFNEGKMQSHIH4ACYK3/graph.json","events_json":"https://pith.science/api/pith-number/MSIYGXGDJFNEGKMQSHIH4ACYK3/events.json","paper":"https://pith.science/paper/MSIYGXGD"},"agent_actions":{"view_html":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3","download_json":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3.json","view_paper":"https://pith.science/paper/MSIYGXGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2065&json=true","fetch_graph":"https://pith.science/api/pith-number/MSIYGXGDJFNEGKMQSHIH4ACYK3/graph.json","fetch_events":"https://pith.science/api/pith-number/MSIYGXGDJFNEGKMQSHIH4ACYK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/action/storage_attestation","attest_author":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/action/author_attestation","sign_citation":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/action/citation_signature","submit_replication":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/action/replication_record"}},"created_at":"2026-05-18T00:58:42.805333+00:00","updated_at":"2026-05-18T00:58:42.805333+00:00"}