{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I7OB3Q3KIVZHSGO4VWLGXRJSSY","short_pith_number":"pith:I7OB3Q3K","canonical_record":{"source":{"id":"1609.07817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-25T23:57:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d27d977dff2cb3e2e83a461660118c0b1b1f8a8126d79d97a72c2db85e2257f","abstract_canon_sha256":"8099bc8873bec012a0680370b7bd82ec7861613c1f60fd6c19bbfd4a9323f4e6"},"schema_version":"1.0"},"canonical_sha256":"47dc1dc36a45727919dcad966bc532963e3866de434316b623fdaf2f2100d6af","source":{"kind":"arxiv","id":"1609.07817","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07817","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07817v3","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07817","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"I7OB3Q3KIVZH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I7OB3Q3KIVZHSGO4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I7OB3Q3K","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I7OB3Q3KIVZHSGO4VWLGXRJSSY","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-25T23:57:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5d27d977dff2cb3e2e83a461660118c0b1b1f8a8126d79d97a72c2db85e2257f","abstract_canon_sha256":"8099bc8873bec012a0680370b7bd82ec7861613c1f60fd6c19bbfd4a9323f4e6"},"schema_version":"1.0"},"canonical_sha256":"47dc1dc36a45727919dcad966bc532963e3866de434316b623fdaf2f2100d6af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:52.504024Z","signature_b64":"B1P13rGcNW3qSXyL681mR8mDMw6XJn/tbGZibivqQF4nmiT6UL5nKpjtJnwFerbRt60mNiIomnqhwif/NF7ODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47dc1dc36a45727919dcad966bc532963e3866de434316b623fdaf2f2100d6af","last_reissued_at":"2026-05-17T23:53:52.503452Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:52.503452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07817","source_version":3,"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-17T23:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tGnalYSQCq+0ZorBdNpIIgIfYem3ot9wB7dAjj1RM076ELQ3MiC9c1MCkq87STAig60xspzrb6O89DLBR6LVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:21:33.498086Z"},"content_sha256":"3143b8f4d12ca6ad2eefb4081464c23c831b2f71c56ccefce0dc34593d851daa","schema_version":"1.0","event_id":"sha256:3143b8f4d12ca6ad2eefb4081464c23c831b2f71c56ccefce0dc34593d851daa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I7OB3Q3KIVZHSGO4VWLGXRJSSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Exact Rate-Memory Tradeoff for Caching with Uncoded Prefetching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","submitted_at":"2016-09-25T23:57:27Z","abstract_excerpt":"We consider a basic cache network, in which a single server is connected to multiple users via a shared bottleneck link. The server has a database of files (content). Each user has an isolated memory that can be used to cache content in a prefetching phase. In a following delivery phase, each user requests a file from the database, and the server needs to deliver users' demands as efficiently as possible by taking into account their cache contents. We focus on an important and commonly used class of prefetching schemes, where the caches are filled with uncoded data. We provide the exact charac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07817","kind":"arxiv","version":3},"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-17T23:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8vcAefgDgk81FQcD+hUAQCCYlfPrRfqwxJGxC/gA36A19epw336bFC70bxFFbIDjs3xvqW6d9cwFVzxU3pyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:21:33.498793Z"},"content_sha256":"da42befe4c2bd41a47f3c4f94b6867d6a49d8741c97b6001ca8d5cbd97e1b612","schema_version":"1.0","event_id":"sha256:da42befe4c2bd41a47f3c4f94b6867d6a49d8741c97b6001ca8d5cbd97e1b612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7OB3Q3KIVZHSGO4VWLGXRJSSY/bundle.json","state_url":"https://pith.science/pith/I7OB3Q3KIVZHSGO4VWLGXRJSSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7OB3Q3KIVZHSGO4VWLGXRJSSY/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-27T19:21:33Z","links":{"resolver":"https://pith.science/pith/I7OB3Q3KIVZHSGO4VWLGXRJSSY","bundle":"https://pith.science/pith/I7OB3Q3KIVZHSGO4VWLGXRJSSY/bundle.json","state":"https://pith.science/pith/I7OB3Q3KIVZHSGO4VWLGXRJSSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7OB3Q3KIVZHSGO4VWLGXRJSSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I7OB3Q3KIVZHSGO4VWLGXRJSSY","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":"8099bc8873bec012a0680370b7bd82ec7861613c1f60fd6c19bbfd4a9323f4e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-25T23:57:27Z","title_canon_sha256":"5d27d977dff2cb3e2e83a461660118c0b1b1f8a8126d79d97a72c2db85e2257f"},"schema_version":"1.0","source":{"id":"1609.07817","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07817","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07817v3","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07817","created_at":"2026-05-17T23:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"I7OB3Q3KIVZH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I7OB3Q3KIVZHSGO4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I7OB3Q3K","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:da42befe4c2bd41a47f3c4f94b6867d6a49d8741c97b6001ca8d5cbd97e1b612","target":"graph","created_at":"2026-05-17T23:53:52Z","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":"We consider a basic cache network, in which a single server is connected to multiple users via a shared bottleneck link. The server has a database of files (content). Each user has an isolated memory that can be used to cache content in a prefetching phase. In a following delivery phase, each user requests a file from the database, and the server needs to deliver users' demands as efficiently as possible by taking into account their cache contents. We focus on an important and commonly used class of prefetching schemes, where the caches are filled with uncoded data. We provide the exact charac","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-25T23:57:27Z","title":"The Exact Rate-Memory Tradeoff for Caching with Uncoded Prefetching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07817","kind":"arxiv","version":3},"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:3143b8f4d12ca6ad2eefb4081464c23c831b2f71c56ccefce0dc34593d851daa","target":"record","created_at":"2026-05-17T23:53:52Z","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":"8099bc8873bec012a0680370b7bd82ec7861613c1f60fd6c19bbfd4a9323f4e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-25T23:57:27Z","title_canon_sha256":"5d27d977dff2cb3e2e83a461660118c0b1b1f8a8126d79d97a72c2db85e2257f"},"schema_version":"1.0","source":{"id":"1609.07817","kind":"arxiv","version":3}},"canonical_sha256":"47dc1dc36a45727919dcad966bc532963e3866de434316b623fdaf2f2100d6af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47dc1dc36a45727919dcad966bc532963e3866de434316b623fdaf2f2100d6af","first_computed_at":"2026-05-17T23:53:52.503452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:52.503452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B1P13rGcNW3qSXyL681mR8mDMw6XJn/tbGZibivqQF4nmiT6UL5nKpjtJnwFerbRt60mNiIomnqhwif/NF7ODw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:52.504024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07817","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3143b8f4d12ca6ad2eefb4081464c23c831b2f71c56ccefce0dc34593d851daa","sha256:da42befe4c2bd41a47f3c4f94b6867d6a49d8741c97b6001ca8d5cbd97e1b612"],"state_sha256":"11d338d1cdfa6bc18aec7813abbb9bbb08d24acae7f6f4dee00979c33f8a10e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUwOXw525hQwtC5pEdt8oM3LVmYuakIDGzOIBeF/LmA3EIG51RphXh8vPVs3ytWKF+2d1op0qmYKUD4MopMtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:21:33.502222Z","bundle_sha256":"01c89a2c114cebee3145b29b5763f5ae5ceac4a718a4215f2a59c35df96abd0d"}}