{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3KKOB4H4YFPD3IUII2TM3TUVN7","short_pith_number":"pith:3KKOB4H4","canonical_record":{"source":{"id":"1601.06383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T13:36:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f7f87db22b3271d8af0e60027ef50f6b33d65008cd69c8009caa5b7bc60b01d","abstract_canon_sha256":"6bcc0afdd445f7fbfe6865bea97ef1004b9777ffe05f2d41f243cf0922d3f991"},"schema_version":"1.0"},"canonical_sha256":"da94e0f0fcc15e3da28846a6cdce956fcba6667764c72313dea9c1267d7f735c","source":{"kind":"arxiv","id":"1601.06383","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06383","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06383v2","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06383","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"3KKOB4H4YFPD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3KKOB4H4YFPD3IUI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3KKOB4H4","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3KKOB4H4YFPD3IUII2TM3TUVN7","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T13:36:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f7f87db22b3271d8af0e60027ef50f6b33d65008cd69c8009caa5b7bc60b01d","abstract_canon_sha256":"6bcc0afdd445f7fbfe6865bea97ef1004b9777ffe05f2d41f243cf0922d3f991"},"schema_version":"1.0"},"canonical_sha256":"da94e0f0fcc15e3da28846a6cdce956fcba6667764c72313dea9c1267d7f735c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:46.677506Z","signature_b64":"o4fzeeich+Gv14bPOO5oLNdBA4g+4DRDgHJwiG6CJmfN1noWiid4w0aCxi9rNmvTOhcJA5p5RaKlbGkOUDagDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da94e0f0fcc15e3da28846a6cdce956fcba6667764c72313dea9c1267d7f735c","last_reissued_at":"2026-05-18T01:21:46.676821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:46.676821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06383","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-18T01:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQK51Ob54NlDDcUXVQ2iQHnUrcD16lBac7sCfFFm30wpBbO3qqdYigCBZQ5szB6Yx3nCd/HVConz4WNhWvuRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:57:52.340095Z"},"content_sha256":"1b73cfd9733b91ed46797b95a103a3b4be5c7aee81c1858b563d2924492d85b0","schema_version":"1.0","event_id":"sha256:1b73cfd9733b91ed46797b95a103a3b4be5c7aee81c1858b563d2924492d85b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3KKOB4H4YFPD3IUII2TM3TUVN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Caching with More Users than Files","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Kai Wan, Pablo Piantanida","submitted_at":"2016-01-24T13:36:36Z","abstract_excerpt":"Caching appears to be an efficient way to reduce peak hour network traffic congestion by storing some content at the user's cache without knowledge of later demands. Recently, Maddah-Ali and Niesen proposed a two-phase, placement and delivery phase, coded caching strategy for centralized systems (where coordination among users is possible in the placement phase), and for decentralized systems. This paper investigates the same setup under the further assumption that the number of users is larger than the number of files. By using the same uncoded placement strategy of Maddah-Ali and Niesen, a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06383","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-18T01:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mN1XUSoIxzbPwl1wZhNvN0D7nuDf1lIvRKLF5wvD4Ev1UryO5vsmNhUasnDMcG0ydlVB7osO5d7ADiD8+E86Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:57:52.340829Z"},"content_sha256":"2cb01465e81c42d0a06338c8040e7a855c39d3aa302c1bc33bd3bf15c6cb3643","schema_version":"1.0","event_id":"sha256:2cb01465e81c42d0a06338c8040e7a855c39d3aa302c1bc33bd3bf15c6cb3643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KKOB4H4YFPD3IUII2TM3TUVN7/bundle.json","state_url":"https://pith.science/pith/3KKOB4H4YFPD3IUII2TM3TUVN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KKOB4H4YFPD3IUII2TM3TUVN7/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-23T08:57:52Z","links":{"resolver":"https://pith.science/pith/3KKOB4H4YFPD3IUII2TM3TUVN7","bundle":"https://pith.science/pith/3KKOB4H4YFPD3IUII2TM3TUVN7/bundle.json","state":"https://pith.science/pith/3KKOB4H4YFPD3IUII2TM3TUVN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KKOB4H4YFPD3IUII2TM3TUVN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3KKOB4H4YFPD3IUII2TM3TUVN7","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":"6bcc0afdd445f7fbfe6865bea97ef1004b9777ffe05f2d41f243cf0922d3f991","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T13:36:36Z","title_canon_sha256":"9f7f87db22b3271d8af0e60027ef50f6b33d65008cd69c8009caa5b7bc60b01d"},"schema_version":"1.0","source":{"id":"1601.06383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06383","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06383v2","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06383","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"3KKOB4H4YFPD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3KKOB4H4YFPD3IUI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3KKOB4H4","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:2cb01465e81c42d0a06338c8040e7a855c39d3aa302c1bc33bd3bf15c6cb3643","target":"graph","created_at":"2026-05-18T01:21: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":"Caching appears to be an efficient way to reduce peak hour network traffic congestion by storing some content at the user's cache without knowledge of later demands. Recently, Maddah-Ali and Niesen proposed a two-phase, placement and delivery phase, coded caching strategy for centralized systems (where coordination among users is possible in the placement phase), and for decentralized systems. This paper investigates the same setup under the further assumption that the number of users is larger than the number of files. By using the same uncoded placement strategy of Maddah-Ali and Niesen, a n","authors_text":"Daniela Tuninetti, Kai Wan, Pablo Piantanida","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T13:36:36Z","title":"On Caching with More Users than Files"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06383","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:1b73cfd9733b91ed46797b95a103a3b4be5c7aee81c1858b563d2924492d85b0","target":"record","created_at":"2026-05-18T01:21: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":"6bcc0afdd445f7fbfe6865bea97ef1004b9777ffe05f2d41f243cf0922d3f991","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T13:36:36Z","title_canon_sha256":"9f7f87db22b3271d8af0e60027ef50f6b33d65008cd69c8009caa5b7bc60b01d"},"schema_version":"1.0","source":{"id":"1601.06383","kind":"arxiv","version":2}},"canonical_sha256":"da94e0f0fcc15e3da28846a6cdce956fcba6667764c72313dea9c1267d7f735c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da94e0f0fcc15e3da28846a6cdce956fcba6667764c72313dea9c1267d7f735c","first_computed_at":"2026-05-18T01:21:46.676821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:46.676821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o4fzeeich+Gv14bPOO5oLNdBA4g+4DRDgHJwiG6CJmfN1noWiid4w0aCxi9rNmvTOhcJA5p5RaKlbGkOUDagDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:46.677506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b73cfd9733b91ed46797b95a103a3b4be5c7aee81c1858b563d2924492d85b0","sha256:2cb01465e81c42d0a06338c8040e7a855c39d3aa302c1bc33bd3bf15c6cb3643"],"state_sha256":"21a4ebf4d877df3e097a742add70bc337b5a7918e71c6c09775c8fd95586302f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0n/CzTC1NQTUvVenuC+9jfhcdSW+UJ0XNwFMuu+AcUZpKhdmgd30m0OTz8AZ3dPxTgMq/W3hxWQ1jJKE8sTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:57:52.344758Z","bundle_sha256":"37f6a10a2d9642d368ba43a432764c3f5acf6203dce95f4857e14a81de03b2c5"}}