{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WQZGMNJ3XVLHELCMZZMOYFNFLV","short_pith_number":"pith:WQZGMNJ3","canonical_record":{"source":{"id":"1512.00547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-02T02:39:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fb08e7b512c2f7316f47347a65f0de1b87d409ff24ac6d91d6710d62b686283c","abstract_canon_sha256":"547da4d0aa5c849a38d6203ce9c7461874f705bd1ddbc9c1a76c7177111cb0a5"},"schema_version":"1.0"},"canonical_sha256":"b43266353bbd56722c4cce58ec15a55d5f4a360a175cc4815a98118613f9e80f","source":{"kind":"arxiv","id":"1512.00547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00547","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00547v1","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00547","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"WQZGMNJ3XVLH","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WQZGMNJ3XVLHELCM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WQZGMNJ3","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WQZGMNJ3XVLHELCMZZMOYFNFLV","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-02T02:39:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fb08e7b512c2f7316f47347a65f0de1b87d409ff24ac6d91d6710d62b686283c","abstract_canon_sha256":"547da4d0aa5c849a38d6203ce9c7461874f705bd1ddbc9c1a76c7177111cb0a5"},"schema_version":"1.0"},"canonical_sha256":"b43266353bbd56722c4cce58ec15a55d5f4a360a175cc4815a98118613f9e80f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.017091Z","signature_b64":"hKxV8urdY2VG5gnQWecLLx9PkPDQcYKMzGQgd4SakniEkfzDZj9Z5LfqYg9VERFZx/G/rhkSHVyGcwwIympVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b43266353bbd56722c4cce58ec15a55d5f4a360a175cc4815a98118613f9e80f","last_reissued_at":"2026-05-18T01:25:24.016599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.016599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00547","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-18T01:25:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTND7Pzzs9OmeF65aXCiNu0UOWimTkXyTc1nE2abZeE5VMMSTBCQ/5S4hztJW4kqnH8sc6Cj6FhUFv03W2PFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:29:59.737587Z"},"content_sha256":"b754108fd94a085db94f1b5876b1abd92c4e4a08158c7ed816695ab47d179605","schema_version":"1.0","event_id":"sha256:b754108fd94a085db94f1b5876b1abd92c4e4a08158c7ed816695ab47d179605"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WQZGMNJ3XVLHELCMZZMOYFNFLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context-Aware D2D Peer Selection for Load Distribution in LTE Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Fatemeh Afghah, Niloofar Bahadori, Nima Namvar","submitted_at":"2015-12-02T02:39:49Z","abstract_excerpt":"In this paper we propose a novel context-aware approach for resource allocation in device to device (D2D) communication networks which exploits context information about the users velocity and size of their demanded data to decide whether their traffic load can be transferred to D2D tier and which D2D users should be paired. The problem is modeled as a matching game with externalities and a novel algorithm is proposed to solve the game which converges to a stable matching between the D2D users. Simulation results demonstrate the effectiveness of our model in offloading the cellular networks tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00547","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-18T01:25:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJ0wh67U5m9hl1uUrcnvPnHYDspl6VmQFjQjQZERViVjEt2roP4fxAadxnc8KnbVw5VpNx6yjdeMG07KpdesDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:29:59.738069Z"},"content_sha256":"3b053ff0397832b2557d29bef321703dcc3215d5d639db9c5a614091b2b37fc7","schema_version":"1.0","event_id":"sha256:3b053ff0397832b2557d29bef321703dcc3215d5d639db9c5a614091b2b37fc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQZGMNJ3XVLHELCMZZMOYFNFLV/bundle.json","state_url":"https://pith.science/pith/WQZGMNJ3XVLHELCMZZMOYFNFLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQZGMNJ3XVLHELCMZZMOYFNFLV/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-31T11:29:59Z","links":{"resolver":"https://pith.science/pith/WQZGMNJ3XVLHELCMZZMOYFNFLV","bundle":"https://pith.science/pith/WQZGMNJ3XVLHELCMZZMOYFNFLV/bundle.json","state":"https://pith.science/pith/WQZGMNJ3XVLHELCMZZMOYFNFLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQZGMNJ3XVLHELCMZZMOYFNFLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WQZGMNJ3XVLHELCMZZMOYFNFLV","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":"547da4d0aa5c849a38d6203ce9c7461874f705bd1ddbc9c1a76c7177111cb0a5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-02T02:39:49Z","title_canon_sha256":"fb08e7b512c2f7316f47347a65f0de1b87d409ff24ac6d91d6710d62b686283c"},"schema_version":"1.0","source":{"id":"1512.00547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00547","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00547v1","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00547","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"WQZGMNJ3XVLH","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WQZGMNJ3XVLHELCM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WQZGMNJ3","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:3b053ff0397832b2557d29bef321703dcc3215d5d639db9c5a614091b2b37fc7","target":"graph","created_at":"2026-05-18T01:25:24Z","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 propose a novel context-aware approach for resource allocation in device to device (D2D) communication networks which exploits context information about the users velocity and size of their demanded data to decide whether their traffic load can be transferred to D2D tier and which D2D users should be paired. The problem is modeled as a matching game with externalities and a novel algorithm is proposed to solve the game which converges to a stable matching between the D2D users. Simulation results demonstrate the effectiveness of our model in offloading the cellular networks tr","authors_text":"Fatemeh Afghah, Niloofar Bahadori, Nima Namvar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-02T02:39:49Z","title":"Context-Aware D2D Peer Selection for Load Distribution in LTE Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00547","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:b754108fd94a085db94f1b5876b1abd92c4e4a08158c7ed816695ab47d179605","target":"record","created_at":"2026-05-18T01:25:24Z","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":"547da4d0aa5c849a38d6203ce9c7461874f705bd1ddbc9c1a76c7177111cb0a5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-02T02:39:49Z","title_canon_sha256":"fb08e7b512c2f7316f47347a65f0de1b87d409ff24ac6d91d6710d62b686283c"},"schema_version":"1.0","source":{"id":"1512.00547","kind":"arxiv","version":1}},"canonical_sha256":"b43266353bbd56722c4cce58ec15a55d5f4a360a175cc4815a98118613f9e80f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b43266353bbd56722c4cce58ec15a55d5f4a360a175cc4815a98118613f9e80f","first_computed_at":"2026-05-18T01:25:24.016599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:24.016599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hKxV8urdY2VG5gnQWecLLx9PkPDQcYKMzGQgd4SakniEkfzDZj9Z5LfqYg9VERFZx/G/rhkSHVyGcwwIympVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:24.017091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b754108fd94a085db94f1b5876b1abd92c4e4a08158c7ed816695ab47d179605","sha256:3b053ff0397832b2557d29bef321703dcc3215d5d639db9c5a614091b2b37fc7"],"state_sha256":"672058e2aab9ad003f671a7f4ae18ffa86aed350e34e3c7b8dd758d97f2e5688"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0C1MUwssDzR3Yod9uca0Z6ruCPuQvD3rgFHhxpHJERCG8Qn8rIqJcwBJGDinbis3X9p1r5YjusvXd7zeFJ4fAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:29:59.743363Z","bundle_sha256":"9ef4c6cdfb9abaa4148ffc43bde5c14d32c2cff22b4f899d3a628d21fc6665b7"}}