{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HYMI6UUFE7YEC56R5RIKX7BWEL","short_pith_number":"pith:HYMI6UUF","schema_version":"1.0","canonical_sha256":"3e188f528527f04177d1ec50abfc3622e436088bbcb1b4caaecedd25e933ffd2","source":{"kind":"arxiv","id":"1405.5390","version":1},"attestation_state":"computed","paper":{"title":"Many-to-Many Matching Games for Proactive Social-Caching in Wireless Small Cell Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Kenza Hamidouche, M\\'erouane Debbah, Walid Saad","submitted_at":"2014-05-21T12:06:13Z","abstract_excerpt":"In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many proble"},"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":"1405.5390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-21T12:06:13Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"39eb829a7e0fb3578729530e7958d4ddcfe643aa1936cf867d04ac4f51be0f75","abstract_canon_sha256":"1e7d0d23067a5aac9a021629145c28cfbc0dbf38ad0ddd7569892283e9c53663"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:23.945962Z","signature_b64":"GxHx6CfksQpeJl/o5XlWU3LDY0sbca+A0wxdBq/XQoa6LtVEWgZe5IdUC2ENW3NfUTQliKsnHfX+y7URAP2kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e188f528527f04177d1ec50abfc3622e436088bbcb1b4caaecedd25e933ffd2","last_reissued_at":"2026-05-18T02:51:23.945344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:23.945344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many-to-Many Matching Games for Proactive Social-Caching in Wireless Small Cell Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Kenza Hamidouche, M\\'erouane Debbah, Walid Saad","submitted_at":"2014-05-21T12:06:13Z","abstract_excerpt":"In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5390","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":"1405.5390","created_at":"2026-05-18T02:51:23.945428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5390v1","created_at":"2026-05-18T02:51:23.945428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5390","created_at":"2026-05-18T02:51:23.945428+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYMI6UUFE7YE","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYMI6UUFE7YEC56R","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYMI6UUF","created_at":"2026-05-18T12:28:33.132498+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/HYMI6UUFE7YEC56R5RIKX7BWEL","json":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL.json","graph_json":"https://pith.science/api/pith-number/HYMI6UUFE7YEC56R5RIKX7BWEL/graph.json","events_json":"https://pith.science/api/pith-number/HYMI6UUFE7YEC56R5RIKX7BWEL/events.json","paper":"https://pith.science/paper/HYMI6UUF"},"agent_actions":{"view_html":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL","download_json":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL.json","view_paper":"https://pith.science/paper/HYMI6UUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5390&json=true","fetch_graph":"https://pith.science/api/pith-number/HYMI6UUFE7YEC56R5RIKX7BWEL/graph.json","fetch_events":"https://pith.science/api/pith-number/HYMI6UUFE7YEC56R5RIKX7BWEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL/action/storage_attestation","attest_author":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL/action/author_attestation","sign_citation":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL/action/citation_signature","submit_replication":"https://pith.science/pith/HYMI6UUFE7YEC56R5RIKX7BWEL/action/replication_record"}},"created_at":"2026-05-18T02:51:23.945428+00:00","updated_at":"2026-05-18T02:51:23.945428+00:00"}