{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CV7HZQ7KIN6WVS5E3NEKLCR2LJ","short_pith_number":"pith:CV7HZQ7K","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"},"canonical_sha256":"157e7cc3ea437d6acba4db48a58a3a5a5cf633188822378b98de34ae66259b74","source":{"kind":"arxiv","id":"1602.07623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07623","created_at":"2026-05-18T01:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07623v1","created_at":"2026-05-18T01:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07623","created_at":"2026-05-18T01:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"CV7HZQ7KIN6W","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CV7HZQ7KIN6WVS5E","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CV7HZQ7K","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CV7HZQ7KIN6WVS5E3NEKLCR2LJ","target":"record","payload":{"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"},"canonical_sha256":"157e7cc3ea437d6acba4db48a58a3a5a5cf633188822378b98de34ae66259b74","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"},"source_kind":"arxiv","source_id":"1602.07623","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:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xup2sXaFfASWpZ8E8vr114nc4YQHp0u1Ah3pWjdLmE4b910A2NVTMrUp9NWtGH2eSgZzlSn8oauV1tCiQyR1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:09:36.440543Z"},"content_sha256":"87ba3941835d212e05283c9ce73019a0792b42f8409af48074557fc773536033","schema_version":"1.0","event_id":"sha256:87ba3941835d212e05283c9ce73019a0792b42f8409af48074557fc773536033"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CV7HZQ7KIN6WVS5E3NEKLCR2LJ","target":"graph","payload":{"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"},"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:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVhdFVc/c8qSm7AP2K9pLQi3t+kZrocfhg2od+Z7JGAViTYKkYA1bqJ9QcogVN3BjpULAtBtb6BOij1BJzieCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:09:36.440885Z"},"content_sha256":"af0125c212e219e630a79d8095fa3bba2f355be43d76c9ca581dc22b5e9d02a7","schema_version":"1.0","event_id":"sha256:af0125c212e219e630a79d8095fa3bba2f355be43d76c9ca581dc22b5e9d02a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/bundle.json","state_url":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/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-23T05:09:36Z","links":{"resolver":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ","bundle":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/bundle.json","state":"https://pith.science/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CV7HZQ7KIN6WVS5E3NEKLCR2LJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CV7HZQ7KIN6WVS5E3NEKLCR2LJ","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":"4db534475944c95fc78b14dee6252edcf427ff53e0b6af52be8b48ee007e41ca","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-02-24T18:08:43Z","title_canon_sha256":"eb85b95f0f9a413482c975a83f54bf6753b976beab1c4768cebda6e741b2d276"},"schema_version":"1.0","source":{"id":"1602.07623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07623","created_at":"2026-05-18T01:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07623v1","created_at":"2026-05-18T01:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07623","created_at":"2026-05-18T01:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"CV7HZQ7KIN6W","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CV7HZQ7KIN6WVS5E","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CV7HZQ7K","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:af0125c212e219e630a79d8095fa3bba2f355be43d76c9ca581dc22b5e9d02a7","target":"graph","created_at":"2026-05-18T01:12:12Z","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 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","authors_text":"Anastasios Giovanidis, Apostolos Avranas","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-02-24T18:08:43Z","title":"Spatial multi-LRU Caching for Wireless Networks with Coverage Overlaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07623","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:87ba3941835d212e05283c9ce73019a0792b42f8409af48074557fc773536033","target":"record","created_at":"2026-05-18T01:12:12Z","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":"4db534475944c95fc78b14dee6252edcf427ff53e0b6af52be8b48ee007e41ca","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-02-24T18:08:43Z","title_canon_sha256":"eb85b95f0f9a413482c975a83f54bf6753b976beab1c4768cebda6e741b2d276"},"schema_version":"1.0","source":{"id":"1602.07623","kind":"arxiv","version":1}},"canonical_sha256":"157e7cc3ea437d6acba4db48a58a3a5a5cf633188822378b98de34ae66259b74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"157e7cc3ea437d6acba4db48a58a3a5a5cf633188822378b98de34ae66259b74","first_computed_at":"2026-05-18T01:12:12.194586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:12.194586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"whDW778qPGpx4DNn8I0O++u98PJSjE8tJWfEWmg8gdSXNMLQs3zzuxTO6UnqdrFlYLwzfzK7KxVL62QCiAn9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:12.194973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87ba3941835d212e05283c9ce73019a0792b42f8409af48074557fc773536033","sha256:af0125c212e219e630a79d8095fa3bba2f355be43d76c9ca581dc22b5e9d02a7"],"state_sha256":"a3010b86d62d12a93d2c487621110c0f5aab9e9499a6026b8887559f65f7ea8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzZ3Pz0wopWPZcv699mMRfwZ2q6S1930uGwSh77l++1Ae0nHMUdt0C1wYPebBJHhe+MP//hbsCpHRNFNQjL2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:09:36.442793Z","bundle_sha256":"76fe2fef086ffe648025556995a311bffc9a71a93b17b3de001d39b9e4123e6e"}}