{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RTYI6B2M2VKT6MUD5ZM5TUPIRN","short_pith_number":"pith:RTYI6B2M","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"},"canonical_sha256":"8cf08f074cd5553f3283ee59d9d1e88b606643919f2b431f22573b52896b8ea8","source":{"kind":"arxiv","id":"1610.02318","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02318","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02318v2","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02318","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"RTYI6B2M2VKT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTYI6B2M2VKT6MUD","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTYI6B2M","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RTYI6B2M2VKT6MUD5ZM5TUPIRN","target":"record","payload":{"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"},"canonical_sha256":"8cf08f074cd5553f3283ee59d9d1e88b606643919f2b431f22573b52896b8ea8","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"},"source_kind":"arxiv","source_id":"1610.02318","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-17T23:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pj+lxpUogJbOE/hqk3oBwa7x+P/oDs5oSSAvy3bpGcD8I6hiym8svRAJoY1yjUKrVwCTGDiOWydwCRlUN5mTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:21:20.470643Z"},"content_sha256":"a2913e58a13d2d73ca7a6b8fae35694f76e63055c37e66072951375d7a07749b","schema_version":"1.0","event_id":"sha256:a2913e58a13d2d73ca7a6b8fae35694f76e63055c37e66072951375d7a07749b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RTYI6B2M2VKT6MUD5ZM5TUPIRN","target":"graph","payload":{"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"},"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-17T23:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdy/pWj7JXyPRtB6ytXr+UYvAH4Nsb+knMTBNn4zhiyVc8sgyfTBRsg2ycEEIWUyrmY4+KJfxJFb4/BkhwEVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:21:20.470985Z"},"content_sha256":"6cfee0ce0aaee7f283b56edca9300e886393445b5efa218c7dc4c79b6503c59b","schema_version":"1.0","event_id":"sha256:6cfee0ce0aaee7f283b56edca9300e886393445b5efa218c7dc4c79b6503c59b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/bundle.json","state_url":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/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-28T07:21:20Z","links":{"resolver":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN","bundle":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/bundle.json","state":"https://pith.science/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTYI6B2M2VKT6MUD5ZM5TUPIRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RTYI6B2M2VKT6MUD5ZM5TUPIRN","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":"af73571c5524270a290abf37e910d8c20c1e7832678b8089a9b54b88a63a46e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-07T15:09:47Z","title_canon_sha256":"d91f1cfdddac1f473c7b839fd3124b45c940c47ff158e7551cccb173a8f62b63"},"schema_version":"1.0","source":{"id":"1610.02318","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02318","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02318v2","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02318","created_at":"2026-05-17T23:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"RTYI6B2M2VKT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RTYI6B2M2VKT6MUD","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RTYI6B2M","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:6cfee0ce0aaee7f283b56edca9300e886393445b5efa218c7dc4c79b6503c59b","target":"graph","created_at":"2026-05-17T23:43:07Z","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":"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","authors_text":"Arpan Chattopadhyay, Bart{\\l}omiej B{\\l}aszczyszyn, H. Paul Keeler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-07T15:09:47Z","title":"Gibbsian On-Line Distributed Content Caching Strategy for Cellular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02318","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:a2913e58a13d2d73ca7a6b8fae35694f76e63055c37e66072951375d7a07749b","target":"record","created_at":"2026-05-17T23:43:07Z","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":"af73571c5524270a290abf37e910d8c20c1e7832678b8089a9b54b88a63a46e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-07T15:09:47Z","title_canon_sha256":"d91f1cfdddac1f473c7b839fd3124b45c940c47ff158e7551cccb173a8f62b63"},"schema_version":"1.0","source":{"id":"1610.02318","kind":"arxiv","version":2}},"canonical_sha256":"8cf08f074cd5553f3283ee59d9d1e88b606643919f2b431f22573b52896b8ea8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cf08f074cd5553f3283ee59d9d1e88b606643919f2b431f22573b52896b8ea8","first_computed_at":"2026-05-17T23:43:07.305686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:07.305686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bp9gkOuBWmK+ZH5jAhkgfijjWmYg1hX37mWHDkr2kzVvXXGF1fdvwF0WYKA4zY0C/sNau6VKrxNaNWDFyCmMAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:07.306203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02318","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2913e58a13d2d73ca7a6b8fae35694f76e63055c37e66072951375d7a07749b","sha256:6cfee0ce0aaee7f283b56edca9300e886393445b5efa218c7dc4c79b6503c59b"],"state_sha256":"a27e8f31b62afbee43a464d6632067903944152bbdc13b029761b342dce51069"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9orX5d2eo/BZLkt0c2g5tQ2+AHjgjJadwfI5qNhwwjHGG3UgGeafPdybr3hoWZiTmalifov5x06JHxqourD9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:21:20.472927Z","bundle_sha256":"f661bd905da6f0fb7aeb1d7334a99db4945ef5c939db2c5b8276a0e711bf17ff"}}