{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CV7HZQ7KIN6WVS5E3NEKLCR2LJ","short_pith_number":"pith:CV7HZQ7K","schema_version":"1.0","canonical_sha256":"157e7cc3ea437d6acba4db48a58a3a5a5cf633188822378b98de34ae66259b74","source":{"kind":"arxiv","id":"1602.07623","version":1},"attestation_state":"computed","paper":{"title":"Spatial multi-LRU Caching for Wireless Networks with Coverage Overlaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Anastasios Giovanidis, Apostolos Avranas","submitted_at":"2016-02-24T18:08:43Z","abstract_excerpt":"This article introduces a novel family of decentralised caching policies, applicable to wireless networks with finite storage at the edge-nodes (stations). These policies are based on the Least-Recently-Used replacement principle, and are, here, referred to as spatial multi-LRU. Based on these, cache inventories are updated in a way that provides content diversity to users who are covered by, and thus have access to, more than one station. Two variations are proposed, namely the multi-LRU-One and -All, which differ in the number of replicas inserted in the involved caches. By introducing spati"},"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":"1602.07623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-02-24T18:08:43Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"eb85b95f0f9a413482c975a83f54bf6753b976beab1c4768cebda6e741b2d276","abstract_canon_sha256":"4db534475944c95fc78b14dee6252edcf427ff53e0b6af52be8b48ee007e41ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:12.194973Z","signature_b64":"whDW778qPGpx4DNn8I0O++u98PJSjE8tJWfEWmg8gdSXNMLQs3zzuxTO6UnqdrFlYLwzfzK7KxVL62QCiAn9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"157e7cc3ea437d6acba4db48a58a3a5a5cf633188822378b98de34ae66259b74","last_reissued_at":"2026-05-18T01:12:12.194586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:12.194586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial multi-LRU Caching for Wireless Networks with Coverage Overlaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Anastasios Giovanidis, Apostolos Avranas","submitted_at":"2016-02-24T18:08:43Z","abstract_excerpt":"This article introduces a novel family of decentralised caching policies, applicable to wireless networks with finite storage at the edge-nodes (stations). These policies are based on the Least-Recently-Used replacement principle, and are, here, referred to as spatial multi-LRU. Based on these, cache inventories are updated in a way that provides content diversity to users who are covered by, and thus have access to, more than one station. Two variations are proposed, namely the multi-LRU-One and -All, which differ in the number of replicas inserted in the involved caches. By introducing spati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07623","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":"1602.07623","created_at":"2026-05-18T01:12:12.194643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07623v1","created_at":"2026-05-18T01:12:12.194643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07623","created_at":"2026-05-18T01:12:12.194643+00:00"},{"alias_kind":"pith_short_12","alias_value":"CV7HZQ7KIN6W","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CV7HZQ7KIN6WVS5E","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CV7HZQ7K","created_at":"2026-05-18T12:30:09.641336+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/CV7HZQ7KIN6WVS5E3NEKLCR2LJ","json":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ.json","graph_json":"https://pith.science/api/pith-number/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/graph.json","events_json":"https://pith.science/api/pith-number/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/events.json","paper":"https://pith.science/paper/CV7HZQ7K"},"agent_actions":{"view_html":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ","download_json":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ.json","view_paper":"https://pith.science/paper/CV7HZQ7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07623&json=true","fetch_graph":"https://pith.science/api/pith-number/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/action/storage_attestation","attest_author":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/action/author_attestation","sign_citation":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/action/citation_signature","submit_replication":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/action/replication_record"}},"created_at":"2026-05-18T01:12:12.194643+00:00","updated_at":"2026-05-18T01:12:12.194643+00:00"}