{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X4AF4DEPGFVMRYZ43MNQVUZ374","short_pith_number":"pith:X4AF4DEP","canonical_record":{"source":{"id":"1901.03188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T23:38:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6944529c38b523af53cfe5c0efff4e1526e6cfec064553064c739d0234fdf237","abstract_canon_sha256":"542044d7535d87b86aa31f52e33150ff838f4aa55c54bb8410598f212b98575f"},"schema_version":"1.0"},"canonical_sha256":"bf005e0c8f316ac8e33cdb1b0ad33bff25722ab2a450fb05ee9f1b1da16833da","source":{"kind":"arxiv","id":"1901.03188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03188","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03188v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03188","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"X4AF4DEPGFVM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X4AF4DEPGFVMRYZ4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X4AF4DEP","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X4AF4DEPGFVMRYZ43MNQVUZ374","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T23:38:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6944529c38b523af53cfe5c0efff4e1526e6cfec064553064c739d0234fdf237","abstract_canon_sha256":"542044d7535d87b86aa31f52e33150ff838f4aa55c54bb8410598f212b98575f"},"schema_version":"1.0"},"canonical_sha256":"bf005e0c8f316ac8e33cdb1b0ad33bff25722ab2a450fb05ee9f1b1da16833da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.290797Z","signature_b64":"b8Q7DMFr3ppKju8QQCccrtJkOIYzRrKxXXHE3LkgcuBH5ViItmUKVKw00XNZ4T8Nmil5KnRgJW2YDdZ8Yac7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf005e0c8f316ac8e33cdb1b0ad33bff25722ab2a450fb05ee9f1b1da16833da","last_reissued_at":"2026-05-17T23:56:35.290099Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.290099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03188","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-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bO6zhTZyuKIkMaUuGi3P+oR+hOq5umi+2pUhHKLdbDjQWs3Oh+8yQdJLOSgKWQd0OA0fW1NMRqUFpna9Nrt6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:23:54.930727Z"},"content_sha256":"a5274b8260d9946b196ddbc0da62776a36bfd07e50d4c3f33250417edf0c2ba8","schema_version":"1.0","event_id":"sha256:a5274b8260d9946b196ddbc0da62776a36bfd07e50d4c3f33250417edf0c2ba8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X4AF4DEPGFVMRYZ43MNQVUZ374","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anoop Thomas, B. Sundar Rajan, Nujoom Sageer Karat, Spandan Dey","submitted_at":"2019-01-08T23:38:07Z","abstract_excerpt":"Classical coded caching setting avails each user to have one dedicated cache. This is generalized to a more general shared cache scheme and the exact expression for the worst case rate was derived in [E. Parrinello, A. Unsal, P. Elia,  \"Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching,\" available on arXiv:1811.06247 [cs.IT], Nov. 2018]. For this case, an optimal linear error correcting delivery scheme is proposed and an expression for the peak rate is established for the same. Furthermore, a new delivery scheme is proposed, which gives an improved rate for the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03188","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-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Dmw3ZtIKS/aRCC3nZVw/CvlSOZ22AF+sl0kGZz8HjXUV1EYlTCTIyzogkz7Nydhv+FIlMQqWQjyuNDtCn/QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:23:54.931373Z"},"content_sha256":"720a68b7acf3cc828a48cb900ef9b4cf38ec71dab59cffe63785dd69251118bc","schema_version":"1.0","event_id":"sha256:720a68b7acf3cc828a48cb900ef9b4cf38ec71dab59cffe63785dd69251118bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4AF4DEPGFVMRYZ43MNQVUZ374/bundle.json","state_url":"https://pith.science/pith/X4AF4DEPGFVMRYZ43MNQVUZ374/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4AF4DEPGFVMRYZ43MNQVUZ374/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-04T23:23:54Z","links":{"resolver":"https://pith.science/pith/X4AF4DEPGFVMRYZ43MNQVUZ374","bundle":"https://pith.science/pith/X4AF4DEPGFVMRYZ43MNQVUZ374/bundle.json","state":"https://pith.science/pith/X4AF4DEPGFVMRYZ43MNQVUZ374/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4AF4DEPGFVMRYZ43MNQVUZ374/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X4AF4DEPGFVMRYZ43MNQVUZ374","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":"542044d7535d87b86aa31f52e33150ff838f4aa55c54bb8410598f212b98575f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T23:38:07Z","title_canon_sha256":"6944529c38b523af53cfe5c0efff4e1526e6cfec064553064c739d0234fdf237"},"schema_version":"1.0","source":{"id":"1901.03188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03188","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03188v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03188","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"X4AF4DEPGFVM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X4AF4DEPGFVMRYZ4","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X4AF4DEP","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:720a68b7acf3cc828a48cb900ef9b4cf38ec71dab59cffe63785dd69251118bc","target":"graph","created_at":"2026-05-17T23:56: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":"Classical coded caching setting avails each user to have one dedicated cache. This is generalized to a more general shared cache scheme and the exact expression for the worst case rate was derived in [E. Parrinello, A. Unsal, P. Elia,  \"Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching,\" available on arXiv:1811.06247 [cs.IT], Nov. 2018]. For this case, an optimal linear error correcting delivery scheme is proposed and an expression for the peak rate is established for the same. Furthermore, a new delivery scheme is proposed, which gives an improved rate for the c","authors_text":"Anoop Thomas, B. Sundar Rajan, Nujoom Sageer Karat, Spandan Dey","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T23:38:07Z","title":"An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03188","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:a5274b8260d9946b196ddbc0da62776a36bfd07e50d4c3f33250417edf0c2ba8","target":"record","created_at":"2026-05-17T23:56: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":"542044d7535d87b86aa31f52e33150ff838f4aa55c54bb8410598f212b98575f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T23:38:07Z","title_canon_sha256":"6944529c38b523af53cfe5c0efff4e1526e6cfec064553064c739d0234fdf237"},"schema_version":"1.0","source":{"id":"1901.03188","kind":"arxiv","version":1}},"canonical_sha256":"bf005e0c8f316ac8e33cdb1b0ad33bff25722ab2a450fb05ee9f1b1da16833da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf005e0c8f316ac8e33cdb1b0ad33bff25722ab2a450fb05ee9f1b1da16833da","first_computed_at":"2026-05-17T23:56:35.290099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:35.290099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b8Q7DMFr3ppKju8QQCccrtJkOIYzRrKxXXHE3LkgcuBH5ViItmUKVKw00XNZ4T8Nmil5KnRgJW2YDdZ8Yac7DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:35.290797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5274b8260d9946b196ddbc0da62776a36bfd07e50d4c3f33250417edf0c2ba8","sha256:720a68b7acf3cc828a48cb900ef9b4cf38ec71dab59cffe63785dd69251118bc"],"state_sha256":"e033e96fe93a5c1fbcdf347fc1f481a355062a2f9947e884e184f17dfcfc2659"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srm9JrIXbqvbeZEpqiX63ft4+uZUPnZycx1W3v6NBlY+tR3FxnO7mXgirIlwiO38Xw0r8ko+zUUFCkIks42eCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:23:54.934639Z","bundle_sha256":"ed29b32700b19bf8d8105bc1338a1e10b29388bc12d732d72c40afd9a58fd7f5"}}