{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RTYI6B2M2VKT6MUD5ZM5TUPIRN","short_pith_number":"pith:RTYI6B2M","schema_version":"1.0","canonical_sha256":"8cf08f074cd5553f3283ee59d9d1e88b606643919f2b431f22573b52896b8ea8","source":{"kind":"arxiv","id":"1610.02318","version":2},"attestation_state":"computed","paper":{"title":"Gibbsian On-Line Distributed Content Caching Strategy for Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arpan Chattopadhyay, Bart{\\l}omiej B{\\l}aszczyszyn, H. Paul Keeler","submitted_at":"2016-10-07T15:09:47Z","abstract_excerpt":"We develop Gibbs sampling based techniques for learning the optimal content placement in a cellular network. A collection of base stations are scattered on the space, each having a cell (possibly overlapping with other cells). Mobile users request for downloads from a finite set of contents according to some popularity distribution. Each base station can store only a strict subset of the contents at a time; if a requested content is not available at any serving base station, it has to be downloaded from the backhaul. Thus, there arises the problem of optimal content placement which can minimiz"},"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":"1610.02318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-07T15:09:47Z","cross_cats_sorted":[],"title_canon_sha256":"d91f1cfdddac1f473c7b839fd3124b45c940c47ff158e7551cccb173a8f62b63","abstract_canon_sha256":"af73571c5524270a290abf37e910d8c20c1e7832678b8089a9b54b88a63a46e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:07.306203Z","signature_b64":"bp9gkOuBWmK+ZH5jAhkgfijjWmYg1hX37mWHDkr2kzVvXXGF1fdvwF0WYKA4zY0C/sNau6VKrxNaNWDFyCmMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cf08f074cd5553f3283ee59d9d1e88b606643919f2b431f22573b52896b8ea8","last_reissued_at":"2026-05-17T23:43:07.305686Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:07.305686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gibbsian On-Line Distributed Content Caching Strategy for Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arpan Chattopadhyay, Bart{\\l}omiej B{\\l}aszczyszyn, H. Paul Keeler","submitted_at":"2016-10-07T15:09:47Z","abstract_excerpt":"We develop Gibbs sampling based techniques for learning the optimal content placement in a cellular network. A collection of base stations are scattered on the space, each having a cell (possibly overlapping with other cells). Mobile users request for downloads from a finite set of contents according to some popularity distribution. Each base station can store only a strict subset of the contents at a time; if a requested content is not available at any serving base station, it has to be downloaded from the backhaul. Thus, there arises the problem of optimal content placement which can minimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02318","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.02318","created_at":"2026-05-17T23:43:07.305799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02318v2","created_at":"2026-05-17T23:43:07.305799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02318","created_at":"2026-05-17T23:43:07.305799+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTYI6B2M2VKT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTYI6B2M2VKT6MUD","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTYI6B2M","created_at":"2026-05-18T12:30:41.710351+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/RTYI6B2M2VKT6MUD5ZM5TUPIRN","json":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN.json","graph_json":"https://pith.science/api/pith-number/RTYI6B2M2VKT6MUD5ZM5TUPIRN/graph.json","events_json":"https://pith.science/api/pith-number/RTYI6B2M2VKT6MUD5ZM5TUPIRN/events.json","paper":"https://pith.science/paper/RTYI6B2M"},"agent_actions":{"view_html":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN","download_json":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN.json","view_paper":"https://pith.science/paper/RTYI6B2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02318&json=true","fetch_graph":"https://pith.science/api/pith-number/RTYI6B2M2VKT6MUD5ZM5TUPIRN/graph.json","fetch_events":"https://pith.science/api/pith-number/RTYI6B2M2VKT6MUD5ZM5TUPIRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/action/storage_attestation","attest_author":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/action/author_attestation","sign_citation":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/action/citation_signature","submit_replication":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/action/replication_record"}},"created_at":"2026-05-17T23:43:07.305799+00:00","updated_at":"2026-05-17T23:43:07.305799+00:00"}