{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LXROI23ZRDT4AD76U6RMM5SJMP","short_pith_number":"pith:LXROI23Z","schema_version":"1.0","canonical_sha256":"5de2e46b7988e7c00ffea7a2c6764963d1ca5de10b3bf311627c75aa24eba330","source":{"kind":"arxiv","id":"1704.08625","version":1},"attestation_state":"computed","paper":{"title":"Optimal Geographic Caching in Cellular Networks with Linear Content Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bart{\\l}omiej B{\\l}aszczyszyn, Jocelyne Elias","submitted_at":"2017-04-27T15:45:36Z","abstract_excerpt":"We state and solve a problem of the optimal geographic caching of content in cellular networks, where linear combinations of contents are stored in the caches of base stations. We consider a general content popularity distribution and a general distribution of the number of stations covering the typical location in the network. We are looking for a policy of content caching maximizing the probability of serving the typical content request from the caches of covering stations. The problem has a special form of monotone sub-modular set function maximization. Using dynamic programming, we find a "},"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":"1704.08625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-27T15:45:36Z","cross_cats_sorted":[],"title_canon_sha256":"a4c977f904d8f52c3990f299e422eef633286ca1355695447505a1c56458189a","abstract_canon_sha256":"747cb89860d9f63a640c0f7b1ab00208782303829fabe5c61dcc16c19820fac3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.295296Z","signature_b64":"ILq5ydtcyitWzappfUXbU0L07rTvyGx3FEPYIDg2XNG4EzyW9Tgk1ATsf0g3lSGHVR1djkqtTNOAi/mJdkBvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5de2e46b7988e7c00ffea7a2c6764963d1ca5de10b3bf311627c75aa24eba330","last_reissued_at":"2026-05-18T00:45:27.294869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.294869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Geographic Caching in Cellular Networks with Linear Content Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bart{\\l}omiej B{\\l}aszczyszyn, Jocelyne Elias","submitted_at":"2017-04-27T15:45:36Z","abstract_excerpt":"We state and solve a problem of the optimal geographic caching of content in cellular networks, where linear combinations of contents are stored in the caches of base stations. We consider a general content popularity distribution and a general distribution of the number of stations covering the typical location in the network. We are looking for a policy of content caching maximizing the probability of serving the typical content request from the caches of covering stations. The problem has a special form of monotone sub-modular set function maximization. Using dynamic programming, we find a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08625","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":"1704.08625","created_at":"2026-05-18T00:45:27.294937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08625v1","created_at":"2026-05-18T00:45:27.294937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08625","created_at":"2026-05-18T00:45:27.294937+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXROI23ZRDT4","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXROI23ZRDT4AD76","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXROI23Z","created_at":"2026-05-18T12:31:28.150371+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/LXROI23ZRDT4AD76U6RMM5SJMP","json":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP.json","graph_json":"https://pith.science/api/pith-number/LXROI23ZRDT4AD76U6RMM5SJMP/graph.json","events_json":"https://pith.science/api/pith-number/LXROI23ZRDT4AD76U6RMM5SJMP/events.json","paper":"https://pith.science/paper/LXROI23Z"},"agent_actions":{"view_html":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP","download_json":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP.json","view_paper":"https://pith.science/paper/LXROI23Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08625&json=true","fetch_graph":"https://pith.science/api/pith-number/LXROI23ZRDT4AD76U6RMM5SJMP/graph.json","fetch_events":"https://pith.science/api/pith-number/LXROI23ZRDT4AD76U6RMM5SJMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP/action/storage_attestation","attest_author":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP/action/author_attestation","sign_citation":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP/action/citation_signature","submit_replication":"https://pith.science/pith/LXROI23ZRDT4AD76U6RMM5SJMP/action/replication_record"}},"created_at":"2026-05-18T00:45:27.294937+00:00","updated_at":"2026-05-18T00:45:27.294937+00:00"}