{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MSIYGXGDJFNEGKMQSHIH4ACYK3","short_pith_number":"pith:MSIYGXGD","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"},"canonical_sha256":"6491835cc3495a43299091d07e005856ca6ffbe7b148fe91e68909d92e1bcff6","source":{"kind":"arxiv","id":"1211.2065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2065","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2065v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2065","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"MSIYGXGDJFNE","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MSIYGXGDJFNEGKMQ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MSIYGXGD","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MSIYGXGDJFNEGKMQSHIH4ACYK3","target":"record","payload":{"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"},"canonical_sha256":"6491835cc3495a43299091d07e005856ca6ffbe7b148fe91e68909d92e1bcff6","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"},"source_kind":"arxiv","source_id":"1211.2065","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otYCOwwB+cF1ULiq6Ui3SbNgnt5L5GhrWzd1xMk1A4U1UhKD2zrOiHq8eJv479idE8aL4Yu03ttauTN05W2eBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:27:55.962983Z"},"content_sha256":"d99d3971957d7098d1f73529a8e803c837b975ad45b7986d601d54e3b6a455d4","schema_version":"1.0","event_id":"sha256:d99d3971957d7098d1f73529a8e803c837b975ad45b7986d601d54e3b6a455d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MSIYGXGDJFNEGKMQSHIH4ACYK3","target":"graph","payload":{"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"},"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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcHIVgH+tA2q5zMqwTdQvQPMzvR1K+VuNqbQhij5SvHWzfSkhaaKiQfmFvAsa52MkfcMUWZMRGFXZENyOWy8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:27:55.963335Z"},"content_sha256":"4a01cabda409550c6fc62a723879450c19b544c85ba2c3326d54932ff228f827","schema_version":"1.0","event_id":"sha256:4a01cabda409550c6fc62a723879450c19b544c85ba2c3326d54932ff228f827"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/bundle.json","state_url":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/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-01T09:27:55Z","links":{"resolver":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3","bundle":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/bundle.json","state":"https://pith.science/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSIYGXGDJFNEGKMQSHIH4ACYK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MSIYGXGDJFNEGKMQSHIH4ACYK3","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":"e3413db64faea3750f10a23ab0bbcf62e127df2db2a0205a27bdd3b3880c0eda","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T07:59:50Z","title_canon_sha256":"e21af158ec65f71dae977c7d58a2ac3e49f963e324805e9c00ee84ba57ca4ad6"},"schema_version":"1.0","source":{"id":"1211.2065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2065","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2065v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2065","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"MSIYGXGDJFNE","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MSIYGXGDJFNEGKMQ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MSIYGXGD","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:4a01cabda409550c6fc62a723879450c19b544c85ba2c3326d54932ff228f827","target":"graph","created_at":"2026-05-18T00:58:42Z","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":"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","authors_text":"Bingli Jiao, Chen Xu, Lingyang Song, Qun Zhao, Xiang Cheng, Xiaoli Wang, Zhu Han","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T07:59:50Z","title":"Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2065","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:d99d3971957d7098d1f73529a8e803c837b975ad45b7986d601d54e3b6a455d4","target":"record","created_at":"2026-05-18T00:58:42Z","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":"e3413db64faea3750f10a23ab0bbcf62e127df2db2a0205a27bdd3b3880c0eda","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T07:59:50Z","title_canon_sha256":"e21af158ec65f71dae977c7d58a2ac3e49f963e324805e9c00ee84ba57ca4ad6"},"schema_version":"1.0","source":{"id":"1211.2065","kind":"arxiv","version":1}},"canonical_sha256":"6491835cc3495a43299091d07e005856ca6ffbe7b148fe91e68909d92e1bcff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6491835cc3495a43299091d07e005856ca6ffbe7b148fe91e68909d92e1bcff6","first_computed_at":"2026-05-18T00:58:42.805249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.805249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FojqKSldooXdqoF0WB/Oxf/pRl2pgWUXczefc7aS7CW+hUytvgrHm2RW9PafHA+O0Oqf3ScyTR66Srfked35Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.805702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d99d3971957d7098d1f73529a8e803c837b975ad45b7986d601d54e3b6a455d4","sha256:4a01cabda409550c6fc62a723879450c19b544c85ba2c3326d54932ff228f827"],"state_sha256":"f093da919d25b75040e7fbf0673c5522778ed7eb33350d023c3751159bf2e721"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzOJ0HBFyLJSBztAo1x/VJev7aBk0xprSpvRf1zApGWDsJAU0j5glYOOBGST1CziJMXz0XChsc/RCCQd2kh2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:27:55.965219Z","bundle_sha256":"e5900e99ceec52e7579ad8fe7a603dfd1bc49d1db7f0e6db3d44bdf75b866744"}}