{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2AYZEJZNP5KQK4ETGGZHNYDTK6","short_pith_number":"pith:2AYZEJZN","canonical_record":{"source":{"id":"1801.07367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-23T01:48:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4194db0ebbf9e192e4c9edd1d90be16cbe80f97c50c95382845c0b8cc7efda31","abstract_canon_sha256":"9a0f3acd850b7f9749d28f327f8129333ca16b7420965a2c546c63aa0664b717"},"schema_version":"1.0"},"canonical_sha256":"d03192272d7f5505709331b276e07357bc0253d8c3ba92e5eae7e8e5ff804bc0","source":{"kind":"arxiv","id":"1801.07367","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07367","created_at":"2026-05-18T00:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07367v2","created_at":"2026-05-18T00:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07367","created_at":"2026-05-18T00:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"2AYZEJZNP5KQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2AYZEJZNP5KQK4ET","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2AYZEJZN","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2AYZEJZNP5KQK4ETGGZHNYDTK6","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-23T01:48:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4194db0ebbf9e192e4c9edd1d90be16cbe80f97c50c95382845c0b8cc7efda31","abstract_canon_sha256":"9a0f3acd850b7f9749d28f327f8129333ca16b7420965a2c546c63aa0664b717"},"schema_version":"1.0"},"canonical_sha256":"d03192272d7f5505709331b276e07357bc0253d8c3ba92e5eae7e8e5ff804bc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:53.142678Z","signature_b64":"ya+ij7jaKn9BKEPIFac23LzaHE7cDqYXLAXqVS41cA7vH6LmGr6p+Z44T8LYNfKpD5p15gMQfa+X4kGGh3oHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03192272d7f5505709331b276e07357bc0253d8c3ba92e5eae7e8e5ff804bc0","last_reissued_at":"2026-05-18T00:19:53.141919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:53.141919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07367","source_version":2,"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-18T00:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"foMdeUqUFGI7pLhThk3oAgNjMlWdNH1sRyOQYxns6qrj5gb0LxIisz1/Vc1pejhpWmaW2nUTCQKiqemH08YmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:56:38.561499Z"},"content_sha256":"b7e72fe6846d70dc62df37f62203610d393ad8bfeb75312cb65351c59ac5917e","schema_version":"1.0","event_id":"sha256:b7e72fe6846d70dc62df37f62203610d393ad8bfeb75312cb65351c59ac5917e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2AYZEJZNP5KQK4ETGGZHNYDTK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mean-Field Game Theoretic Edge Caching in Ultra-Dense Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Hyesung Kim, Jihong Park, Mehdi Bennis, M\\'erouane Debbah, Seong-Lyun Kim","submitted_at":"2018-01-23T01:48:26Z","abstract_excerpt":"This paper investigates a cellular edge caching problem under a very large number of small base stations (SBSs) and users. In this ultra-dense edge caching network (UDCN), conventional caching algorithms are inapplicable as their complexity increases with the number of small base stations (SBSs). Furthermore, the performance of UDCN is highly sensitive to the dynamics of user demand and inter-SBS interference. To overcome such difficulties, we propose a distributed caching algorithm under a stochastic geometric network model, as well as a spatio-temporal user demand model that characterizes th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07367","kind":"arxiv","version":2},"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-18T00:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X33SDif9iVas3mBO+KFZNrgcl1cdTTe9JDYpR9GxzRXc0IDotgxFjFWLvGbIw4t1iNTE0+50ejNwSfl/xo/VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:56:38.562194Z"},"content_sha256":"ca7b2a4019b573f4f8e543402cb2065c7d32b124123a685d8f93c2f4218130d9","schema_version":"1.0","event_id":"sha256:ca7b2a4019b573f4f8e543402cb2065c7d32b124123a685d8f93c2f4218130d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2AYZEJZNP5KQK4ETGGZHNYDTK6/bundle.json","state_url":"https://pith.science/pith/2AYZEJZNP5KQK4ETGGZHNYDTK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2AYZEJZNP5KQK4ETGGZHNYDTK6/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-04T00:56:38Z","links":{"resolver":"https://pith.science/pith/2AYZEJZNP5KQK4ETGGZHNYDTK6","bundle":"https://pith.science/pith/2AYZEJZNP5KQK4ETGGZHNYDTK6/bundle.json","state":"https://pith.science/pith/2AYZEJZNP5KQK4ETGGZHNYDTK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2AYZEJZNP5KQK4ETGGZHNYDTK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2AYZEJZNP5KQK4ETGGZHNYDTK6","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":"9a0f3acd850b7f9749d28f327f8129333ca16b7420965a2c546c63aa0664b717","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-23T01:48:26Z","title_canon_sha256":"4194db0ebbf9e192e4c9edd1d90be16cbe80f97c50c95382845c0b8cc7efda31"},"schema_version":"1.0","source":{"id":"1801.07367","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07367","created_at":"2026-05-18T00:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07367v2","created_at":"2026-05-18T00:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07367","created_at":"2026-05-18T00:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"2AYZEJZNP5KQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2AYZEJZNP5KQK4ET","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2AYZEJZN","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:ca7b2a4019b573f4f8e543402cb2065c7d32b124123a685d8f93c2f4218130d9","target":"graph","created_at":"2026-05-18T00:19:53Z","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 investigates a cellular edge caching problem under a very large number of small base stations (SBSs) and users. In this ultra-dense edge caching network (UDCN), conventional caching algorithms are inapplicable as their complexity increases with the number of small base stations (SBSs). Furthermore, the performance of UDCN is highly sensitive to the dynamics of user demand and inter-SBS interference. To overcome such difficulties, we propose a distributed caching algorithm under a stochastic geometric network model, as well as a spatio-temporal user demand model that characterizes th","authors_text":"Hyesung Kim, Jihong Park, Mehdi Bennis, M\\'erouane Debbah, Seong-Lyun Kim","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-23T01:48:26Z","title":"Mean-Field Game Theoretic Edge Caching in Ultra-Dense Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07367","kind":"arxiv","version":2},"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:b7e72fe6846d70dc62df37f62203610d393ad8bfeb75312cb65351c59ac5917e","target":"record","created_at":"2026-05-18T00:19:53Z","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":"9a0f3acd850b7f9749d28f327f8129333ca16b7420965a2c546c63aa0664b717","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-23T01:48:26Z","title_canon_sha256":"4194db0ebbf9e192e4c9edd1d90be16cbe80f97c50c95382845c0b8cc7efda31"},"schema_version":"1.0","source":{"id":"1801.07367","kind":"arxiv","version":2}},"canonical_sha256":"d03192272d7f5505709331b276e07357bc0253d8c3ba92e5eae7e8e5ff804bc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d03192272d7f5505709331b276e07357bc0253d8c3ba92e5eae7e8e5ff804bc0","first_computed_at":"2026-05-18T00:19:53.141919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:53.141919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ya+ij7jaKn9BKEPIFac23LzaHE7cDqYXLAXqVS41cA7vH6LmGr6p+Z44T8LYNfKpD5p15gMQfa+X4kGGh3oHCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:53.142678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07367","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e72fe6846d70dc62df37f62203610d393ad8bfeb75312cb65351c59ac5917e","sha256:ca7b2a4019b573f4f8e543402cb2065c7d32b124123a685d8f93c2f4218130d9"],"state_sha256":"8b066b2789c6c86e0ec307a90116b467b53f3353f9ced02b3cad95e00513a433"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sB2962i2qfztoGZ+xvwAELgN7mF/sA9p8I4i2mY6NXs1+JicfTYhKTP4/xrtvr8wMsDI12vXjjdUudAF1DuhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:56:38.565878Z","bundle_sha256":"bfcd95ceb403fe588757ad143619ee3edca3825de063d64154aef3e7a675085d"}}