{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DXYSLUPVHNNXV3ZKRDXGORQGBI","short_pith_number":"pith:DXYSLUPV","canonical_record":{"source":{"id":"1905.05368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T02:57:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7547a067f3809f14e8ab6ad07e763b67954e5488fb923c3886840788b609d867","abstract_canon_sha256":"06ade1e90b179cf8a2b65b47eb1acf0f3fd7404cbb5319d92dffd79271fcf943"},"schema_version":"1.0"},"canonical_sha256":"1df125d1f53b5b7aef2a88ee6746060a02c0996095e09c55b0f5964fcf38bf79","source":{"kind":"arxiv","id":"1905.05368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05368","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05368v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05368","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"DXYSLUPVHNNX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DXYSLUPVHNNXV3ZK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DXYSLUPV","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DXYSLUPVHNNXV3ZKRDXGORQGBI","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T02:57:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7547a067f3809f14e8ab6ad07e763b67954e5488fb923c3886840788b609d867","abstract_canon_sha256":"06ade1e90b179cf8a2b65b47eb1acf0f3fd7404cbb5319d92dffd79271fcf943"},"schema_version":"1.0"},"canonical_sha256":"1df125d1f53b5b7aef2a88ee6746060a02c0996095e09c55b0f5964fcf38bf79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.722310Z","signature_b64":"9k1Bg0je0e5iiQqM55rJlK3sbSURlofWKJKT+yEquDYaw7Rmq4NYyBqxDVoYfbYyBzxIp1h5EVGOqW+qjCZYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df125d1f53b5b7aef2a88ee6746060a02c0996095e09c55b0f5964fcf38bf79","last_reissued_at":"2026-05-17T23:46:16.721836Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.721836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05368","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-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kg1I6ourDAfguKuzT4vtGpeOnbSjBzF/stv4ormgl95HGGnzJuHbh2NfH4Gq3vccfsZdQUj86FGfAxD80afBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:34:41.169396Z"},"content_sha256":"cbe66d05840a4be9e330dce11251042d99b005c8ce2f182ade06a50179efd817","schema_version":"1.0","event_id":"sha256:cbe66d05840a4be9e330dce11251042d99b005c8ce2f182ade06a50179efd817"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DXYSLUPVHNNXV3ZKRDXGORQGBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning for Matching Game in Cooperative D2D Communication with Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Hu, Hui Feng, Tao Yang, Yiling Yuan","submitted_at":"2019-05-14T02:57:06Z","abstract_excerpt":"This paper considers a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist cellular users (CUs) in exchange for the opportunities to use licensed spectrum. Based on the interaction of each D2D pair and each CU, we formulate the pairing problem between multiple cues and multiple D2D pairs as a one-to-one matching game. Unlike most existing works, we consider a realistic scenario with incomplete channel information. Thus, each CU lacks enough information to establish its preference over D2D pairs. Therefore, traditional matching algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05368","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-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqjSank8J2syCL5VpelQ1z5l+fb3NzqrrbeGjZB+mEKDIJt7aT8+1VtZSsa7P5EyAZ/S5cY01rKI253EmFwiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:34:41.170086Z"},"content_sha256":"ac8cd665decbc3e59933c619422eaf9f5ceb5dceef5e8063fd176436b5ff49f9","schema_version":"1.0","event_id":"sha256:ac8cd665decbc3e59933c619422eaf9f5ceb5dceef5e8063fd176436b5ff49f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXYSLUPVHNNXV3ZKRDXGORQGBI/bundle.json","state_url":"https://pith.science/pith/DXYSLUPVHNNXV3ZKRDXGORQGBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXYSLUPVHNNXV3ZKRDXGORQGBI/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-30T05:34:41Z","links":{"resolver":"https://pith.science/pith/DXYSLUPVHNNXV3ZKRDXGORQGBI","bundle":"https://pith.science/pith/DXYSLUPVHNNXV3ZKRDXGORQGBI/bundle.json","state":"https://pith.science/pith/DXYSLUPVHNNXV3ZKRDXGORQGBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXYSLUPVHNNXV3ZKRDXGORQGBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DXYSLUPVHNNXV3ZKRDXGORQGBI","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":"06ade1e90b179cf8a2b65b47eb1acf0f3fd7404cbb5319d92dffd79271fcf943","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T02:57:06Z","title_canon_sha256":"7547a067f3809f14e8ab6ad07e763b67954e5488fb923c3886840788b609d867"},"schema_version":"1.0","source":{"id":"1905.05368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05368","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05368v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05368","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"DXYSLUPVHNNX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DXYSLUPVHNNXV3ZK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DXYSLUPV","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:ac8cd665decbc3e59933c619422eaf9f5ceb5dceef5e8063fd176436b5ff49f9","target":"graph","created_at":"2026-05-17T23:46:16Z","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 paper considers a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist cellular users (CUs) in exchange for the opportunities to use licensed spectrum. Based on the interaction of each D2D pair and each CU, we formulate the pairing problem between multiple cues and multiple D2D pairs as a one-to-one matching game. Unlike most existing works, we consider a realistic scenario with incomplete channel information. Thus, each CU lacks enough information to establish its preference over D2D pairs. Therefore, traditional matching algor","authors_text":"Bo Hu, Hui Feng, Tao Yang, Yiling Yuan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T02:57:06Z","title":"Learning for Matching Game in Cooperative D2D Communication with Incomplete Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05368","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:cbe66d05840a4be9e330dce11251042d99b005c8ce2f182ade06a50179efd817","target":"record","created_at":"2026-05-17T23:46:16Z","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":"06ade1e90b179cf8a2b65b47eb1acf0f3fd7404cbb5319d92dffd79271fcf943","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T02:57:06Z","title_canon_sha256":"7547a067f3809f14e8ab6ad07e763b67954e5488fb923c3886840788b609d867"},"schema_version":"1.0","source":{"id":"1905.05368","kind":"arxiv","version":1}},"canonical_sha256":"1df125d1f53b5b7aef2a88ee6746060a02c0996095e09c55b0f5964fcf38bf79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1df125d1f53b5b7aef2a88ee6746060a02c0996095e09c55b0f5964fcf38bf79","first_computed_at":"2026-05-17T23:46:16.721836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:16.721836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9k1Bg0je0e5iiQqM55rJlK3sbSURlofWKJKT+yEquDYaw7Rmq4NYyBqxDVoYfbYyBzxIp1h5EVGOqW+qjCZYBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:16.722310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbe66d05840a4be9e330dce11251042d99b005c8ce2f182ade06a50179efd817","sha256:ac8cd665decbc3e59933c619422eaf9f5ceb5dceef5e8063fd176436b5ff49f9"],"state_sha256":"04df8611eaefb88a16126029eb6e23a3be9915c6308374a3d040640e8709edfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpXHI/31+ZWcvbM3jvdQd2kklrCb0Ss7NE9b0wQ9hXX9fQ+toBISlmwR9tGLAKvBcf/xNYVTNJl4JCSpbj5rCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:34:41.173881Z","bundle_sha256":"23259e0b5d9cd24e89c6e390289a790ed065245c011051398a26ba4ac4260109"}}