{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WXJC7ZH5IWUSZUFPWXW63OHEM3","short_pith_number":"pith:WXJC7ZH5","canonical_record":{"source":{"id":"1504.00553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T13:37:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a109a17035cc60faa093a32ebcad27bccad90f31d18f331d6d0c1f4fc01fb373","abstract_canon_sha256":"e4ca8d5a11029908d6b11a84461a14cb5b1b9b83a44b05f0f7e9800d2c59b92d"},"schema_version":"1.0"},"canonical_sha256":"b5d22fe4fd45a92cd0afb5ededb8e466dc890bdc6a397652ec655643c1876021","source":{"kind":"arxiv","id":"1504.00553","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00553","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00553v2","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00553","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"WXJC7ZH5IWUS","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WXJC7ZH5IWUSZUFP","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WXJC7ZH5","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WXJC7ZH5IWUSZUFPWXW63OHEM3","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T13:37:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a109a17035cc60faa093a32ebcad27bccad90f31d18f331d6d0c1f4fc01fb373","abstract_canon_sha256":"e4ca8d5a11029908d6b11a84461a14cb5b1b9b83a44b05f0f7e9800d2c59b92d"},"schema_version":"1.0"},"canonical_sha256":"b5d22fe4fd45a92cd0afb5ededb8e466dc890bdc6a397652ec655643c1876021","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.924341Z","signature_b64":"WzuUA/lASvRxmF7YnA+zXgYRW1VZkkpzA9kEnh4iQGOpyrQ9EhLQ/hgykOcf3/Ogp5j1tuMjWB0SCY3J9RdNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5d22fe4fd45a92cd0afb5ededb8e466dc890bdc6a397652ec655643c1876021","last_reissued_at":"2026-05-18T00:58:35.923486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.923486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00553","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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlMV+ZmE35Uur8dsGxH0r3fB+zqqAE0ehVvp0UvgGPu6nf5gSruc/rvGBkAuVMo0G9wsq8HtVM43GbI1N22uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:19:22.645053Z"},"content_sha256":"221972a297764f765120f9c6d25506f8cef5cb6b2e8079582e8833775799f61f","schema_version":"1.0","event_id":"sha256:221972a297764f765120f9c6d25506f8cef5cb6b2e8079582e8833775799f61f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WXJC7ZH5IWUSZUFPWXW63OHEM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-Theoretic Caching: Sequential Coding for Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chien-Yi Wang, Michael Gastpar, Sung Hoon Lim","submitted_at":"2015-04-02T13:37:10Z","abstract_excerpt":"Under the paradigm of caching, partial data is delivered before the actual requests of users are known. In this paper, this problem is modeled as a canonical distributed source coding problem with side information, where the side information represents the users' requests. For the single-user case, a single-letter characterization of the optimal rate region is established, and for several important special cases, closed-form solutions are given, including the scenario of uniformly distributed user requests. In this case, it is shown that the optimal caching strategy is closely related to total"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00553","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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Mm+GDQJWBmopZP97Lge2IzNp4yZaxrO9asiYcF1HQhlpCVXR0JDVW1siC1CQWaXIj5hnjI7oGCxEFH8BdvcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:19:22.645478Z"},"content_sha256":"9a0362b5fefe2e434a1793e476652c667ecee21e020e43d6233a67ab668be81a","schema_version":"1.0","event_id":"sha256:9a0362b5fefe2e434a1793e476652c667ecee21e020e43d6233a67ab668be81a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/bundle.json","state_url":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/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-28T23:19:22Z","links":{"resolver":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3","bundle":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/bundle.json","state":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WXJC7ZH5IWUSZUFPWXW63OHEM3","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":"e4ca8d5a11029908d6b11a84461a14cb5b1b9b83a44b05f0f7e9800d2c59b92d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T13:37:10Z","title_canon_sha256":"a109a17035cc60faa093a32ebcad27bccad90f31d18f331d6d0c1f4fc01fb373"},"schema_version":"1.0","source":{"id":"1504.00553","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00553","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00553v2","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00553","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"WXJC7ZH5IWUS","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WXJC7ZH5IWUSZUFP","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WXJC7ZH5","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:9a0362b5fefe2e434a1793e476652c667ecee21e020e43d6233a67ab668be81a","target":"graph","created_at":"2026-05-18T00:58:35Z","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":"Under the paradigm of caching, partial data is delivered before the actual requests of users are known. In this paper, this problem is modeled as a canonical distributed source coding problem with side information, where the side information represents the users' requests. For the single-user case, a single-letter characterization of the optimal rate region is established, and for several important special cases, closed-form solutions are given, including the scenario of uniformly distributed user requests. In this case, it is shown that the optimal caching strategy is closely related to total","authors_text":"Chien-Yi Wang, Michael Gastpar, Sung Hoon Lim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T13:37:10Z","title":"Information-Theoretic Caching: Sequential Coding for Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00553","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:221972a297764f765120f9c6d25506f8cef5cb6b2e8079582e8833775799f61f","target":"record","created_at":"2026-05-18T00:58:35Z","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":"e4ca8d5a11029908d6b11a84461a14cb5b1b9b83a44b05f0f7e9800d2c59b92d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-02T13:37:10Z","title_canon_sha256":"a109a17035cc60faa093a32ebcad27bccad90f31d18f331d6d0c1f4fc01fb373"},"schema_version":"1.0","source":{"id":"1504.00553","kind":"arxiv","version":2}},"canonical_sha256":"b5d22fe4fd45a92cd0afb5ededb8e466dc890bdc6a397652ec655643c1876021","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5d22fe4fd45a92cd0afb5ededb8e466dc890bdc6a397652ec655643c1876021","first_computed_at":"2026-05-18T00:58:35.923486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:35.923486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WzuUA/lASvRxmF7YnA+zXgYRW1VZkkpzA9kEnh4iQGOpyrQ9EhLQ/hgykOcf3/Ogp5j1tuMjWB0SCY3J9RdNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:35.924341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00553","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:221972a297764f765120f9c6d25506f8cef5cb6b2e8079582e8833775799f61f","sha256:9a0362b5fefe2e434a1793e476652c667ecee21e020e43d6233a67ab668be81a"],"state_sha256":"284a6d49c9714c96a1d68c5f8d8dfd96840036e7f2e1934c79a82fc2eeeafa92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0SuCdm2iKzUCnnhATGfIen3Idp3Eq0/Ue7vRbDIXatzlp7tb5Im0tGclmEwqIrlLexzZQ7XnBfU5KI0s11oDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:19:22.649408Z","bundle_sha256":"590fc4df2afb4938d4ffbc8ec54d988f140189b652014b3649add4c21e48b63e"}}