{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VCIIMG4TUV57NOXNZABPLMLYTJ","short_pith_number":"pith:VCIIMG4T","canonical_record":{"source":{"id":"1605.01993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T16:17:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0fd3837378412fca2f317e531f3a5e1f32c746a4618482cfafb05146bfd8a50e","abstract_canon_sha256":"5e4d26c8fdf68070a5f2ff48ee02340f61a7c72774b7bfa476a83d33646d3092"},"schema_version":"1.0"},"canonical_sha256":"a890861b93a57bf6baedc802f5b1789a4c4b010ee63a1fce2da98a672d6e37d4","source":{"kind":"arxiv","id":"1605.01993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01993","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01993v1","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01993","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"VCIIMG4TUV57","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VCIIMG4TUV57NOXN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VCIIMG4T","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VCIIMG4TUV57NOXNZABPLMLYTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T16:17:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0fd3837378412fca2f317e531f3a5e1f32c746a4618482cfafb05146bfd8a50e","abstract_canon_sha256":"5e4d26c8fdf68070a5f2ff48ee02340f61a7c72774b7bfa476a83d33646d3092"},"schema_version":"1.0"},"canonical_sha256":"a890861b93a57bf6baedc802f5b1789a4c4b010ee63a1fce2da98a672d6e37d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:30.703270Z","signature_b64":"weocjX2hUotr3oHPLzHc49V7lvdpN/zoTCskhDwe3oZqoIvibR9jm+ZOJUKaNKeItxVtSbCSaW652mCtxbqFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a890861b93a57bf6baedc802f5b1789a4c4b010ee63a1fce2da98a672d6e37d4","last_reissued_at":"2026-05-18T01:15:30.702582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:30.702582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01993","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-18T01:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nJtywznjlEw3cqo3FXbthe8bKEUZUabDRBiQsPcjh34kaODuSENs2vZU9hgidZTJ2Y6FRTi8sZS4CfdNYO/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:26.722387Z"},"content_sha256":"74e3d1b9a77ddbc8146434197d18488d4f84cbf2e206d8902a0112bf23c0c0c9","schema_version":"1.0","event_id":"sha256:74e3d1b9a77ddbc8146434197d18488d4f84cbf2e206d8902a0112bf23c0c0c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VCIIMG4TUV57NOXNZABPLMLYTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Caching for a Large Number Of Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Deniz Gunduz, Mohammad Mohammadi Amiri, Qianqian Yang","submitted_at":"2016-05-06T16:17:19Z","abstract_excerpt":"Information theoretic analysis of a coded caching system is considered, in which a server with a database of N equal-size files, each F bits long, serves K users. Each user is assumed to have a local cache that can store M files, i.e., capacity of MF bits. Proactive caching to user terminals is considered, in which the caches are filled by the server in advance during the placement phase, without knowing the user requests. Each user requests a single file, and all the requests are satisfied simultaneously through a shared error-free link during the delivery phase.\n  First, centralized coded ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01993","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-18T01:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qf2umwJCdnCwcWIwmpugwdvTcwBJP0I1Nyf0vV39nsXaSwdxAQMdgQYb8zMnIIMdZS9lFXhY15OD2jGvGmcOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:31:26.722761Z"},"content_sha256":"9b57abcdbff7dc44619fc5ad2b63f09773615cac3d90b30e8950358808cfe6dc","schema_version":"1.0","event_id":"sha256:9b57abcdbff7dc44619fc5ad2b63f09773615cac3d90b30e8950358808cfe6dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCIIMG4TUV57NOXNZABPLMLYTJ/bundle.json","state_url":"https://pith.science/pith/VCIIMG4TUV57NOXNZABPLMLYTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCIIMG4TUV57NOXNZABPLMLYTJ/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-03T01:31:26Z","links":{"resolver":"https://pith.science/pith/VCIIMG4TUV57NOXNZABPLMLYTJ","bundle":"https://pith.science/pith/VCIIMG4TUV57NOXNZABPLMLYTJ/bundle.json","state":"https://pith.science/pith/VCIIMG4TUV57NOXNZABPLMLYTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCIIMG4TUV57NOXNZABPLMLYTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VCIIMG4TUV57NOXNZABPLMLYTJ","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":"5e4d26c8fdf68070a5f2ff48ee02340f61a7c72774b7bfa476a83d33646d3092","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T16:17:19Z","title_canon_sha256":"0fd3837378412fca2f317e531f3a5e1f32c746a4618482cfafb05146bfd8a50e"},"schema_version":"1.0","source":{"id":"1605.01993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01993","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01993v1","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01993","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"VCIIMG4TUV57","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VCIIMG4TUV57NOXN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VCIIMG4T","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:9b57abcdbff7dc44619fc5ad2b63f09773615cac3d90b30e8950358808cfe6dc","target":"graph","created_at":"2026-05-18T01:15:30Z","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":"Information theoretic analysis of a coded caching system is considered, in which a server with a database of N equal-size files, each F bits long, serves K users. Each user is assumed to have a local cache that can store M files, i.e., capacity of MF bits. Proactive caching to user terminals is considered, in which the caches are filled by the server in advance during the placement phase, without knowing the user requests. Each user requests a single file, and all the requests are satisfied simultaneously through a shared error-free link during the delivery phase.\n  First, centralized coded ca","authors_text":"Deniz Gunduz, Mohammad Mohammadi Amiri, Qianqian Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T16:17:19Z","title":"Coded Caching for a Large Number Of Users"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01993","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:74e3d1b9a77ddbc8146434197d18488d4f84cbf2e206d8902a0112bf23c0c0c9","target":"record","created_at":"2026-05-18T01:15:30Z","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":"5e4d26c8fdf68070a5f2ff48ee02340f61a7c72774b7bfa476a83d33646d3092","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T16:17:19Z","title_canon_sha256":"0fd3837378412fca2f317e531f3a5e1f32c746a4618482cfafb05146bfd8a50e"},"schema_version":"1.0","source":{"id":"1605.01993","kind":"arxiv","version":1}},"canonical_sha256":"a890861b93a57bf6baedc802f5b1789a4c4b010ee63a1fce2da98a672d6e37d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a890861b93a57bf6baedc802f5b1789a4c4b010ee63a1fce2da98a672d6e37d4","first_computed_at":"2026-05-18T01:15:30.702582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:30.702582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"weocjX2hUotr3oHPLzHc49V7lvdpN/zoTCskhDwe3oZqoIvibR9jm+ZOJUKaNKeItxVtSbCSaW652mCtxbqFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:30.703270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74e3d1b9a77ddbc8146434197d18488d4f84cbf2e206d8902a0112bf23c0c0c9","sha256:9b57abcdbff7dc44619fc5ad2b63f09773615cac3d90b30e8950358808cfe6dc"],"state_sha256":"aca853badff8549c41bb49f7b15f7158a3c8287870aa5379385c26bbe27d6176"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1Rr3RsDlBWuboXO8fuXeApsTwJdHt5qu4NXbvA8xfLNH/cAOobuwUYrx2Y4RtaSsKJeQ7aPQXe/MvgEgibmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:31:26.724818Z","bundle_sha256":"d26d6a7a1b503e6f2fc8fd3cc2b899c3d30318076cfa5e41b2d260c3388e40ae"}}