{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TPJW7P4IKKF2NVDEKTYKAYEB3R","short_pith_number":"pith:TPJW7P4I","canonical_record":{"source":{"id":"1710.10718","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T23:26:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f251196ce19a9e9c12d5c027da22f76e840f32f6a8b0c2627af51582408fe29","abstract_canon_sha256":"ccdef4badde0204e4bbac45d555275c7a6f03835ab37d247bc6879bc38c41f07"},"schema_version":"1.0"},"canonical_sha256":"9bd36fbf88528ba6d46454f0a06081dc7107e8d0506109fca380fc4b9d7beaf1","source":{"kind":"arxiv","id":"1710.10718","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10718","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10718v3","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10718","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"TPJW7P4IKKF2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPJW7P4IKKF2NVDE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPJW7P4I","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TPJW7P4IKKF2NVDEKTYKAYEB3R","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10718","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T23:26:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f251196ce19a9e9c12d5c027da22f76e840f32f6a8b0c2627af51582408fe29","abstract_canon_sha256":"ccdef4badde0204e4bbac45d555275c7a6f03835ab37d247bc6879bc38c41f07"},"schema_version":"1.0"},"canonical_sha256":"9bd36fbf88528ba6d46454f0a06081dc7107e8d0506109fca380fc4b9d7beaf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:02.735667Z","signature_b64":"jq4XhKTUMBz0bkJ5tMGiQgyHaYviiRwpIa4u/ODZiKTQW5VTzpcQ+aLrsXBnrnrdRxI9XCfeJ7HT3O+IcXGuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bd36fbf88528ba6d46454f0a06081dc7107e8d0506109fca380fc4b9d7beaf1","last_reissued_at":"2026-05-17T23:50:02.734996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:02.734996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10718","source_version":3,"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:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PsQAfMY16kjHoIEGjAmU8IGdJTJGvWSIP9T6dl/SqjamvXWIKTFOvjgdB3ISyt/8CH3QguwGjqMzKfiM+D0DDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:44:04.247649Z"},"content_sha256":"4fcd57edacaccc7d73200e74da62ec1d6001aee60d3f8965857d80fb2f5acbe4","schema_version":"1.0","event_id":"sha256:4fcd57edacaccc7d73200e74da62ec1d6001aee60d3f8965857d80fb2f5acbe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TPJW7P4IKKF2NVDEKTYKAYEB3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for Optimal Clique Cover Delivery in Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Ashutosh Nayyar, Seyed Mohammad Asghari, Yi Ouyang","submitted_at":"2017-10-29T23:26:04Z","abstract_excerpt":"Coded caching can significantly reduce the communication bandwidth requirement for satisfying users' demands by utilizing the multicasting gain among multiple users. Most existing works assume that the users follow the prescriptions for content placement made by the system. However, users may prefer to decide what files to cache. To address this issue, we consider a network consisting of a file server connected through a shared link to $K$ users, each equipped with a cache which has been already filled arbitrarily. Given an arbitrary content placement, the goal is to find a delivery strategy f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10718","kind":"arxiv","version":3},"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:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/yLj5y3+iVPckUJdNYZbKDpTW7lCZViRDwXfg7gS76C1d5/FaqGo+vh7TI12P5y2MkHZGXBTOmDZJKO77rBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:44:04.248335Z"},"content_sha256":"16b7a5a8966504ce6fe0a772b503de4342c132e7bb12ef43af311db7899306d1","schema_version":"1.0","event_id":"sha256:16b7a5a8966504ce6fe0a772b503de4342c132e7bb12ef43af311db7899306d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPJW7P4IKKF2NVDEKTYKAYEB3R/bundle.json","state_url":"https://pith.science/pith/TPJW7P4IKKF2NVDEKTYKAYEB3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPJW7P4IKKF2NVDEKTYKAYEB3R/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-28T20:44:04Z","links":{"resolver":"https://pith.science/pith/TPJW7P4IKKF2NVDEKTYKAYEB3R","bundle":"https://pith.science/pith/TPJW7P4IKKF2NVDEKTYKAYEB3R/bundle.json","state":"https://pith.science/pith/TPJW7P4IKKF2NVDEKTYKAYEB3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPJW7P4IKKF2NVDEKTYKAYEB3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TPJW7P4IKKF2NVDEKTYKAYEB3R","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":"ccdef4badde0204e4bbac45d555275c7a6f03835ab37d247bc6879bc38c41f07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T23:26:04Z","title_canon_sha256":"9f251196ce19a9e9c12d5c027da22f76e840f32f6a8b0c2627af51582408fe29"},"schema_version":"1.0","source":{"id":"1710.10718","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10718","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10718v3","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10718","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"TPJW7P4IKKF2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPJW7P4IKKF2NVDE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPJW7P4I","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:16b7a5a8966504ce6fe0a772b503de4342c132e7bb12ef43af311db7899306d1","target":"graph","created_at":"2026-05-17T23:50:02Z","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":"Coded caching can significantly reduce the communication bandwidth requirement for satisfying users' demands by utilizing the multicasting gain among multiple users. Most existing works assume that the users follow the prescriptions for content placement made by the system. However, users may prefer to decide what files to cache. To address this issue, we consider a network consisting of a file server connected through a shared link to $K$ users, each equipped with a cache which has been already filled arbitrarily. Given an arbitrary content placement, the goal is to find a delivery strategy f","authors_text":"A. Salman Avestimehr, Ashutosh Nayyar, Seyed Mohammad Asghari, Yi Ouyang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T23:26:04Z","title":"An Approximation Algorithm for Optimal Clique Cover Delivery in Coded Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10718","kind":"arxiv","version":3},"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:4fcd57edacaccc7d73200e74da62ec1d6001aee60d3f8965857d80fb2f5acbe4","target":"record","created_at":"2026-05-17T23:50:02Z","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":"ccdef4badde0204e4bbac45d555275c7a6f03835ab37d247bc6879bc38c41f07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T23:26:04Z","title_canon_sha256":"9f251196ce19a9e9c12d5c027da22f76e840f32f6a8b0c2627af51582408fe29"},"schema_version":"1.0","source":{"id":"1710.10718","kind":"arxiv","version":3}},"canonical_sha256":"9bd36fbf88528ba6d46454f0a06081dc7107e8d0506109fca380fc4b9d7beaf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bd36fbf88528ba6d46454f0a06081dc7107e8d0506109fca380fc4b9d7beaf1","first_computed_at":"2026-05-17T23:50:02.734996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:02.734996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jq4XhKTUMBz0bkJ5tMGiQgyHaYviiRwpIa4u/ODZiKTQW5VTzpcQ+aLrsXBnrnrdRxI9XCfeJ7HT3O+IcXGuDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:02.735667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10718","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fcd57edacaccc7d73200e74da62ec1d6001aee60d3f8965857d80fb2f5acbe4","sha256:16b7a5a8966504ce6fe0a772b503de4342c132e7bb12ef43af311db7899306d1"],"state_sha256":"44cbfaeea67ffc7f7dce125d915cd8f8c6abb897956e9ff9713ec4303da482de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9X3Nu/m63PKiLclWfFdhac6V1m892ACTFLyJH8ktZbyp6kC6deAAvALp67L1vEuUP8sMP8WQmADPJSgjiCXRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:44:04.251761Z","bundle_sha256":"631b26edea4087d3651452e1bd38702d24e34035a07cf4d1ebd426a4f8d76ece"}}