{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4FAMV3KLDV4T5HEQVPVZA5MUZP","short_pith_number":"pith:4FAMV3KL","canonical_record":{"source":{"id":"1601.06838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-25T22:38:03Z","cross_cats_sorted":[],"title_canon_sha256":"af9935e9a86031f21d890dd1b6c0683700dca7af032c1f92746afb7c654c9d42","abstract_canon_sha256":"68832a9994edb51ca2b75fcc5cac25200ddf6750cd79b13cebf72da1d147af2f"},"schema_version":"1.0"},"canonical_sha256":"e140caed4b1d793e9c90abeb907594cbd048414c72f0dd2be5165b4480cad1fa","source":{"kind":"arxiv","id":"1601.06838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06838","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06838v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06838","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"4FAMV3KLDV4T","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FAMV3KLDV4T5HEQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FAMV3KL","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4FAMV3KLDV4T5HEQVPVZA5MUZP","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-25T22:38:03Z","cross_cats_sorted":[],"title_canon_sha256":"af9935e9a86031f21d890dd1b6c0683700dca7af032c1f92746afb7c654c9d42","abstract_canon_sha256":"68832a9994edb51ca2b75fcc5cac25200ddf6750cd79b13cebf72da1d147af2f"},"schema_version":"1.0"},"canonical_sha256":"e140caed4b1d793e9c90abeb907594cbd048414c72f0dd2be5165b4480cad1fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.307002Z","signature_b64":"z9jIx4bjHy64jTrEx+Xgx0wzk/WtA3YRKrTWJhvZpILvQUQbCQ3gyDehuBb3QotW9nbY2ORF53P4kSCxhInMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e140caed4b1d793e9c90abeb907594cbd048414c72f0dd2be5165b4480cad1fa","last_reissued_at":"2026-05-18T00:58:57.306442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.306442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06838","source_version":1,"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:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"inM62MDSZbTj9zGbEt9zfld2IsA0H47oqRLu8j59BnXq/ghgs0wyRuIQysFAVlVm9NGDEg/DAS2/pyJA3oOqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:24:04.054741Z"},"content_sha256":"cf69d089febd06f39000c391bde26a1bf8534c60c9a8b8ab24d5d339650367c1","schema_version":"1.0","event_id":"sha256:cf69d089febd06f39000c391bde26a1bf8534c60c9a8b8ab24d5d339650367c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4FAMV3KLDV4T5HEQVPVZA5MUZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Utility Optimization Approach to Network Cache Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel Menasche, Don Towsley, Laurent Massoulie, Mostafa Dehghan, Y. C. Tay","submitted_at":"2016-01-25T22:38:03Z","abstract_excerpt":"In any caching system, the admission and eviction policies determine which contents are added and removed from a cache when a miss occurs. Usually, these policies are devised so as to mitigate staleness and increase the hit probability. Nonetheless, the utility of having a high hit probability can vary across contents. This occurs, for instance, when service level agreements must be met, or if certain contents are more difficult to obtain than others. In this paper, we propose utility-driven caching, where we associate with each content a utility, which is a function of the corresponding conte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06838","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"},"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:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0AlHqnSlxxjYwtbA4LHpD0K0OidbEWQjsyWmebIoZ3xaAqgVhBkDwPuIY0ttScv8MJwk9BzKttqOrsKDSyLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:24:04.055275Z"},"content_sha256":"be0b762a7a3af21ccfe2841c0843ed79d1d1c0223c85ea1fc1ef96d2e26abb7a","schema_version":"1.0","event_id":"sha256:be0b762a7a3af21ccfe2841c0843ed79d1d1c0223c85ea1fc1ef96d2e26abb7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FAMV3KLDV4T5HEQVPVZA5MUZP/bundle.json","state_url":"https://pith.science/pith/4FAMV3KLDV4T5HEQVPVZA5MUZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FAMV3KLDV4T5HEQVPVZA5MUZP/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-30T20:24:04Z","links":{"resolver":"https://pith.science/pith/4FAMV3KLDV4T5HEQVPVZA5MUZP","bundle":"https://pith.science/pith/4FAMV3KLDV4T5HEQVPVZA5MUZP/bundle.json","state":"https://pith.science/pith/4FAMV3KLDV4T5HEQVPVZA5MUZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FAMV3KLDV4T5HEQVPVZA5MUZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4FAMV3KLDV4T5HEQVPVZA5MUZP","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":"68832a9994edb51ca2b75fcc5cac25200ddf6750cd79b13cebf72da1d147af2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-25T22:38:03Z","title_canon_sha256":"af9935e9a86031f21d890dd1b6c0683700dca7af032c1f92746afb7c654c9d42"},"schema_version":"1.0","source":{"id":"1601.06838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06838","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06838v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06838","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"4FAMV3KLDV4T","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FAMV3KLDV4T5HEQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FAMV3KL","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:be0b762a7a3af21ccfe2841c0843ed79d1d1c0223c85ea1fc1ef96d2e26abb7a","target":"graph","created_at":"2026-05-18T00:58:57Z","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":"In any caching system, the admission and eviction policies determine which contents are added and removed from a cache when a miss occurs. Usually, these policies are devised so as to mitigate staleness and increase the hit probability. Nonetheless, the utility of having a high hit probability can vary across contents. This occurs, for instance, when service level agreements must be met, or if certain contents are more difficult to obtain than others. In this paper, we propose utility-driven caching, where we associate with each content a utility, which is a function of the corresponding conte","authors_text":"Daniel Menasche, Don Towsley, Laurent Massoulie, Mostafa Dehghan, Y. C. Tay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-25T22:38:03Z","title":"A Utility Optimization Approach to Network Cache Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06838","kind":"arxiv","version":1},"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:cf69d089febd06f39000c391bde26a1bf8534c60c9a8b8ab24d5d339650367c1","target":"record","created_at":"2026-05-18T00:58:57Z","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":"68832a9994edb51ca2b75fcc5cac25200ddf6750cd79b13cebf72da1d147af2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-25T22:38:03Z","title_canon_sha256":"af9935e9a86031f21d890dd1b6c0683700dca7af032c1f92746afb7c654c9d42"},"schema_version":"1.0","source":{"id":"1601.06838","kind":"arxiv","version":1}},"canonical_sha256":"e140caed4b1d793e9c90abeb907594cbd048414c72f0dd2be5165b4480cad1fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e140caed4b1d793e9c90abeb907594cbd048414c72f0dd2be5165b4480cad1fa","first_computed_at":"2026-05-18T00:58:57.306442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.306442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z9jIx4bjHy64jTrEx+Xgx0wzk/WtA3YRKrTWJhvZpILvQUQbCQ3gyDehuBb3QotW9nbY2ORF53P4kSCxhInMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.307002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf69d089febd06f39000c391bde26a1bf8534c60c9a8b8ab24d5d339650367c1","sha256:be0b762a7a3af21ccfe2841c0843ed79d1d1c0223c85ea1fc1ef96d2e26abb7a"],"state_sha256":"7cc54ae717aef09298416ec3e6f2cda8e156b654b4b8f9af35b27b014cbbe296"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBJCqO+QiNEBORyVQtIkDt82jYIFYWuaF6L4dGKQfKXLBs71XQ1mgxzhjPT/pYVn/U0IbOES/xVBsGOeL48qAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:24:04.057945Z","bundle_sha256":"196179eb799726142dff2fd6f6ff428be4b46de50c43d456ef975b88d449ed8f"}}