{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FS2CAFYWMBWMHSH52OLHHFMHUE","short_pith_number":"pith:FS2CAFYW","canonical_record":{"source":{"id":"1409.7626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-09-26T16:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"596c6768e5ba76d4174be17ef198f48e18e311f524dc6121f21d886230828426","abstract_canon_sha256":"9c29989ac3d46f14415233df847364bc38198a2ea8f6af2bd200670f81df09eb"},"schema_version":"1.0"},"canonical_sha256":"2cb4201716606cc3c8fdd396739587a1301db78fbbc945dd842dd84bf1721ae5","source":{"kind":"arxiv","id":"1409.7626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7626","created_at":"2026-05-18T01:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7626v1","created_at":"2026-05-18T01:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7626","created_at":"2026-05-18T01:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"FS2CAFYWMBWM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FS2CAFYWMBWMHSH5","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FS2CAFYW","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FS2CAFYWMBWMHSH52OLHHFMHUE","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-09-26T16:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"596c6768e5ba76d4174be17ef198f48e18e311f524dc6121f21d886230828426","abstract_canon_sha256":"9c29989ac3d46f14415233df847364bc38198a2ea8f6af2bd200670f81df09eb"},"schema_version":"1.0"},"canonical_sha256":"2cb4201716606cc3c8fdd396739587a1301db78fbbc945dd842dd84bf1721ae5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:45.200205Z","signature_b64":"q63kNXlFAoGrfcRqE1CjjmkSwxJYithBnGqlUbUY8e++k6iprOtoMS9pCoglaBe97R30lrMu3O/qSAxiqocLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cb4201716606cc3c8fdd396739587a1301db78fbbc945dd842dd84bf1721ae5","last_reissued_at":"2026-05-18T01:21:45.199575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:45.199575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7626","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:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfWXxKAj2JwYne+zqZWbwbg69Ke/9dGqR6tzQEqGv5tlROr3PYrli4/wpS9ZTGrKUgpCUj/HiIDfpCFZ9miUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:54:09.759659Z"},"content_sha256":"686c214ebe6cf79f743df4c6340e5cc3db863e53b7f566273d82c3b2c6c902b1","schema_version":"1.0","event_id":"sha256:686c214ebe6cf79f743df4c6340e5cc3db863e53b7f566273d82c3b2c6c902b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FS2CAFYWMBWMHSH52OLHHFMHUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Geographic Caching In Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anastasios Giovanidis, Bartlomiej Blaszczyszyn","submitted_at":"2014-09-26T16:28:04Z","abstract_excerpt":"In this work we consider the problem of an optimal geographic placement of content in wireless cellular networks modelled by Poisson point processes. Specifically, for the typical user requesting some particular content and whose popularity follows a given law (e.g. Zipf), we calculate the probability of finding the content cached in one of the base stations. Wireless coverage follows the usual signal-to-interference-and noise ratio (SINR) model, or some variants of it. We formulate and solve the problem of an optimal randomized content placement policy, to maximize the user's hit probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7626","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:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIkbud/JsdWLV4dGukPt4Qz3cVDcljpiZLvVWEKHRRAx5zoGFj5A4cZkcYdMwEDzxNyb1HHFJKNPzA+02Wy4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:54:09.760289Z"},"content_sha256":"8766d4956ae97d6d42055cabbabc94c504f93b16788f864aefd33e5110569efe","schema_version":"1.0","event_id":"sha256:8766d4956ae97d6d42055cabbabc94c504f93b16788f864aefd33e5110569efe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FS2CAFYWMBWMHSH52OLHHFMHUE/bundle.json","state_url":"https://pith.science/pith/FS2CAFYWMBWMHSH52OLHHFMHUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FS2CAFYWMBWMHSH52OLHHFMHUE/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-19T16:54:09Z","links":{"resolver":"https://pith.science/pith/FS2CAFYWMBWMHSH52OLHHFMHUE","bundle":"https://pith.science/pith/FS2CAFYWMBWMHSH52OLHHFMHUE/bundle.json","state":"https://pith.science/pith/FS2CAFYWMBWMHSH52OLHHFMHUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FS2CAFYWMBWMHSH52OLHHFMHUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FS2CAFYWMBWMHSH52OLHHFMHUE","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":"9c29989ac3d46f14415233df847364bc38198a2ea8f6af2bd200670f81df09eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-09-26T16:28:04Z","title_canon_sha256":"596c6768e5ba76d4174be17ef198f48e18e311f524dc6121f21d886230828426"},"schema_version":"1.0","source":{"id":"1409.7626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7626","created_at":"2026-05-18T01:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7626v1","created_at":"2026-05-18T01:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7626","created_at":"2026-05-18T01:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"FS2CAFYWMBWM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FS2CAFYWMBWMHSH5","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FS2CAFYW","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:8766d4956ae97d6d42055cabbabc94c504f93b16788f864aefd33e5110569efe","target":"graph","created_at":"2026-05-18T01:21:45Z","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 work we consider the problem of an optimal geographic placement of content in wireless cellular networks modelled by Poisson point processes. Specifically, for the typical user requesting some particular content and whose popularity follows a given law (e.g. Zipf), we calculate the probability of finding the content cached in one of the base stations. Wireless coverage follows the usual signal-to-interference-and noise ratio (SINR) model, or some variants of it. We formulate and solve the problem of an optimal randomized content placement policy, to maximize the user's hit probability.","authors_text":"Anastasios Giovanidis, Bartlomiej Blaszczyszyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-09-26T16:28:04Z","title":"Optimal Geographic Caching In Cellular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7626","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:686c214ebe6cf79f743df4c6340e5cc3db863e53b7f566273d82c3b2c6c902b1","target":"record","created_at":"2026-05-18T01:21:45Z","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":"9c29989ac3d46f14415233df847364bc38198a2ea8f6af2bd200670f81df09eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-09-26T16:28:04Z","title_canon_sha256":"596c6768e5ba76d4174be17ef198f48e18e311f524dc6121f21d886230828426"},"schema_version":"1.0","source":{"id":"1409.7626","kind":"arxiv","version":1}},"canonical_sha256":"2cb4201716606cc3c8fdd396739587a1301db78fbbc945dd842dd84bf1721ae5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cb4201716606cc3c8fdd396739587a1301db78fbbc945dd842dd84bf1721ae5","first_computed_at":"2026-05-18T01:21:45.199575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:45.199575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q63kNXlFAoGrfcRqE1CjjmkSwxJYithBnGqlUbUY8e++k6iprOtoMS9pCoglaBe97R30lrMu3O/qSAxiqocLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:45.200205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:686c214ebe6cf79f743df4c6340e5cc3db863e53b7f566273d82c3b2c6c902b1","sha256:8766d4956ae97d6d42055cabbabc94c504f93b16788f864aefd33e5110569efe"],"state_sha256":"c0b71ffd83d0d8f3062eae62a2ba3b5bfa6325d196c8602b94f185a1e7f09597"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PrJ7o5OnpJoPbYcbaKK2BZ/17eLDX1RlngvjOrCbA3fRBlTX4ZtVJtkCIVBFsVsjs4NpfPva/bRWi4QBiQcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:54:09.763580Z","bundle_sha256":"bc29e203d4e16714b093275285077f6beb6b83e14741faae064000823c35f9d4"}}