{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WXJC7ZH5IWUSZUFPWXW63OHEM3","short_pith_number":"pith:WXJC7ZH5","schema_version":"1.0","canonical_sha256":"b5d22fe4fd45a92cd0afb5ededb8e466dc890bdc6a397652ec655643c1876021","source":{"kind":"arxiv","id":"1504.00553","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.00553","created_at":"2026-05-18T00:58:35.923620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00553v2","created_at":"2026-05-18T00:58:35.923620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00553","created_at":"2026-05-18T00:58:35.923620+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXJC7ZH5IWUS","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXJC7ZH5IWUSZUFP","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXJC7ZH5","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3","json":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3.json","graph_json":"https://pith.science/api/pith-number/WXJC7ZH5IWUSZUFPWXW63OHEM3/graph.json","events_json":"https://pith.science/api/pith-number/WXJC7ZH5IWUSZUFPWXW63OHEM3/events.json","paper":"https://pith.science/paper/WXJC7ZH5"},"agent_actions":{"view_html":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3","download_json":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3.json","view_paper":"https://pith.science/paper/WXJC7ZH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00553&json=true","fetch_graph":"https://pith.science/api/pith-number/WXJC7ZH5IWUSZUFPWXW63OHEM3/graph.json","fetch_events":"https://pith.science/api/pith-number/WXJC7ZH5IWUSZUFPWXW63OHEM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/action/storage_attestation","attest_author":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/action/author_attestation","sign_citation":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/action/citation_signature","submit_replication":"https://pith.science/pith/WXJC7ZH5IWUSZUFPWXW63OHEM3/action/replication_record"}},"created_at":"2026-05-18T00:58:35.923620+00:00","updated_at":"2026-05-18T00:58:35.923620+00:00"}