{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6XIGQ7BQA6OMIBRCEZSAPMM2WS","short_pith_number":"pith:6XIGQ7BQ","canonical_record":{"source":{"id":"1704.04465","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-14T16:09:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2edfe6d4c28c59f20353cc756a749c779cb83cd20fadb7408e1972573640ecd1","abstract_canon_sha256":"6a805ad95676c36addd40ada79a1acb7fc505deb91928183f4c9e6cb03d7175d"},"schema_version":"1.0"},"canonical_sha256":"f5d0687c30079cc40622266407b19ab482596b8fddd4ef0c3ef3431e66082e42","source":{"kind":"arxiv","id":"1704.04465","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04465","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04465v4","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04465","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"6XIGQ7BQA6OM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XIGQ7BQA6OMIBRC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XIGQ7BQ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6XIGQ7BQA6OMIBRCEZSAPMM2WS","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04465","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-14T16:09:38Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2edfe6d4c28c59f20353cc756a749c779cb83cd20fadb7408e1972573640ecd1","abstract_canon_sha256":"6a805ad95676c36addd40ada79a1acb7fc505deb91928183f4c9e6cb03d7175d"},"schema_version":"1.0"},"canonical_sha256":"f5d0687c30079cc40622266407b19ab482596b8fddd4ef0c3ef3431e66082e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:46.170999Z","signature_b64":"22O+HkoVzw93hCr4WtXyxRHPcHdWxcP22Ar+8Ptt+gAzIhA4PPpW29jGLFPVXRfgwNG7WKmq+UPT9Wc1+3SPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5d0687c30079cc40622266407b19ab482596b8fddd4ef0c3ef3431e66082e42","last_reissued_at":"2026-05-18T00:29:46.170448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:46.170448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04465","source_version":4,"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:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZRpIZR4bPdSWQDgVfA4IwCo6lEr9JQ/BK9jaor7+Ll/IH9q4zPyZWc/waQB2GWyv19ykkhgZjg5XD1hSsVMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:39:48.978577Z"},"content_sha256":"224d3daec69c10034b430ea5e382795479fdb00b4a3b383279a52aa040025539","schema_version":"1.0","event_id":"sha256:224d3daec69c10034b430ea5e382795479fdb00b4a3b383279a52aa040025539"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6XIGQ7BQA6OMIBRCEZSAPMM2WS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Berksan Serbetci, Jasper Goseling, Konstantin Avrachenkov","submitted_at":"2017-04-14T16:09:38Z","abstract_excerpt":"We consider caching in cellular networks in which each base station is equipped with a cache that can store a limited number of files. The popularity of the files is known and the goal is to place files in the caches such that the probability that a user at an arbitrary location in the plane will find the file that she requires in one of the covering caches is maximized.\n  We develop distributed asynchronous algorithms for deciding which contents to store in which cache. Such cooperative algorithms require communication only between caches with overlapping coverage areas and can operate in asy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04465","kind":"arxiv","version":4},"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:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laRnft6A6XieNmzvlFfglJfPEuIKI5CNNsysjEzwA8dart8eJmPzLN7Z9TLL1tpX3r1BfOdiF8UgaNbE8NRiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:39:48.978915Z"},"content_sha256":"94148e57d66bc9ffc6746adcc2a347dc65e45640f89fee4a24263c510f3fd528","schema_version":"1.0","event_id":"sha256:94148e57d66bc9ffc6746adcc2a347dc65e45640f89fee4a24263c510f3fd528"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XIGQ7BQA6OMIBRCEZSAPMM2WS/bundle.json","state_url":"https://pith.science/pith/6XIGQ7BQA6OMIBRCEZSAPMM2WS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XIGQ7BQA6OMIBRCEZSAPMM2WS/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-07-09T03:39:48Z","links":{"resolver":"https://pith.science/pith/6XIGQ7BQA6OMIBRCEZSAPMM2WS","bundle":"https://pith.science/pith/6XIGQ7BQA6OMIBRCEZSAPMM2WS/bundle.json","state":"https://pith.science/pith/6XIGQ7BQA6OMIBRCEZSAPMM2WS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XIGQ7BQA6OMIBRCEZSAPMM2WS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6XIGQ7BQA6OMIBRCEZSAPMM2WS","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":"6a805ad95676c36addd40ada79a1acb7fc505deb91928183f4c9e6cb03d7175d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-14T16:09:38Z","title_canon_sha256":"2edfe6d4c28c59f20353cc756a749c779cb83cd20fadb7408e1972573640ecd1"},"schema_version":"1.0","source":{"id":"1704.04465","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04465","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04465v4","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04465","created_at":"2026-05-18T00:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"6XIGQ7BQA6OM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XIGQ7BQA6OMIBRC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XIGQ7BQ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:94148e57d66bc9ffc6746adcc2a347dc65e45640f89fee4a24263c510f3fd528","target":"graph","created_at":"2026-05-18T00:29:46Z","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 consider caching in cellular networks in which each base station is equipped with a cache that can store a limited number of files. The popularity of the files is known and the goal is to place files in the caches such that the probability that a user at an arbitrary location in the plane will find the file that she requires in one of the covering caches is maximized.\n  We develop distributed asynchronous algorithms for deciding which contents to store in which cache. Such cooperative algorithms require communication only between caches with overlapping coverage areas and can operate in asy","authors_text":"Berksan Serbetci, Jasper Goseling, Konstantin Avrachenkov","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-14T16:09:38Z","title":"A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04465","kind":"arxiv","version":4},"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:224d3daec69c10034b430ea5e382795479fdb00b4a3b383279a52aa040025539","target":"record","created_at":"2026-05-18T00:29:46Z","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":"6a805ad95676c36addd40ada79a1acb7fc505deb91928183f4c9e6cb03d7175d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-14T16:09:38Z","title_canon_sha256":"2edfe6d4c28c59f20353cc756a749c779cb83cd20fadb7408e1972573640ecd1"},"schema_version":"1.0","source":{"id":"1704.04465","kind":"arxiv","version":4}},"canonical_sha256":"f5d0687c30079cc40622266407b19ab482596b8fddd4ef0c3ef3431e66082e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5d0687c30079cc40622266407b19ab482596b8fddd4ef0c3ef3431e66082e42","first_computed_at":"2026-05-18T00:29:46.170448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:46.170448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"22O+HkoVzw93hCr4WtXyxRHPcHdWxcP22Ar+8Ptt+gAzIhA4PPpW29jGLFPVXRfgwNG7WKmq+UPT9Wc1+3SPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:46.170999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04465","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:224d3daec69c10034b430ea5e382795479fdb00b4a3b383279a52aa040025539","sha256:94148e57d66bc9ffc6746adcc2a347dc65e45640f89fee4a24263c510f3fd528"],"state_sha256":"abc6a6e5fa3b9b3ff4182e046caf09e2fd851ead4a5ff8d12b69682ab1649dc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wg/BmNWzEKF0ql6N63z0prb+eFApxACWlfcSh1G4BUhSue3xfelFegJNv9kRSw5tB2O3/Xn4OJvPhkL034j7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:39:48.980705Z","bundle_sha256":"4e3c52cea6b251de237a9e98d21b5e7c91da87e0db355df44e59429c79171201"}}