{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KKC5N5RII6OWRQHTFNCGQ7CR3B","short_pith_number":"pith:KKC5N5RI","canonical_record":{"source":{"id":"1511.07542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:20:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b00789380a4c79f8a931e97148c1e7cae8e355d79e224a4c506a7ae3b403c63d","abstract_canon_sha256":"4a7a2dd33e2f45a5d4ac80fb62f850b5380d5c4bf957987b84ac1cf9ed38b6a0"},"schema_version":"1.0"},"canonical_sha256":"5285d6f628479d68c0f32b44687c51d85d7c7952cf0732e15c2950a4fa0bc906","source":{"kind":"arxiv","id":"1511.07542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07542","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07542v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07542","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"KKC5N5RII6OW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KKC5N5RII6OWRQHT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KKC5N5RI","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KKC5N5RII6OWRQHTFNCGQ7CR3B","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:20:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b00789380a4c79f8a931e97148c1e7cae8e355d79e224a4c506a7ae3b403c63d","abstract_canon_sha256":"4a7a2dd33e2f45a5d4ac80fb62f850b5380d5c4bf957987b84ac1cf9ed38b6a0"},"schema_version":"1.0"},"canonical_sha256":"5285d6f628479d68c0f32b44687c51d85d7c7952cf0732e15c2950a4fa0bc906","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.459932Z","signature_b64":"uNO8gx7b6aHjtZ6We0pGQ3GkGSSOcXma5hPjKPtGv61hm3IOqEvONfj3PO4TOVsdpIwTCqHg29ySGaAeNsyTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5285d6f628479d68c0f32b44687c51d85d7c7952cf0732e15c2950a4fa0bc906","last_reissued_at":"2026-05-18T01:26:04.459391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.459391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07542","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:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAEOHRs5zNKYezOwLH2z40DQBNSaYiR0+TmaPEXHFdImM0H2AUGDbmE6L6Ziw+K94P/qhZM4ljBSCr1r/5DNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:58.388144Z"},"content_sha256":"7dfd3c0a74570b3ef2d117ff90d92d30f3389a557132e9f38efff394e8c79721","schema_version":"1.0","event_id":"sha256:7dfd3c0a74570b3ef2d117ff90d92d30f3389a557132e9f38efff394e8c79721"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KKC5N5RII6OWRQHTFNCGQ7CR3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Caching-Aided Coded Multicasting with Multiple Random Requests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Tulino, Giuseppe Caire, Jaime Llorca, Mingyue Ji","submitted_at":"2015-11-24T02:20:47Z","abstract_excerpt":"The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the shared link caching network, in which a single source with access to a file library communicates with multiple users, each having the capability to store segments (packets) of the library files, over a shared multicast link. Each user requests one file from the library according to a common demand distribution and the server sends a coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible average codeword length to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07542","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:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22rkqnvH5RKM8P3wtLZqr110u1HPF8llhSEYfMpI/00H4THMhccoLy6WiH/RLh0n2mZ/KNkEuQEF/G+CKB/TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:58.388680Z"},"content_sha256":"40266d03e4a0aa28ea52767030eae247008cb1104e73f08c3964db63cd7e4e49","schema_version":"1.0","event_id":"sha256:40266d03e4a0aa28ea52767030eae247008cb1104e73f08c3964db63cd7e4e49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKC5N5RII6OWRQHTFNCGQ7CR3B/bundle.json","state_url":"https://pith.science/pith/KKC5N5RII6OWRQHTFNCGQ7CR3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKC5N5RII6OWRQHTFNCGQ7CR3B/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-30T04:15:58Z","links":{"resolver":"https://pith.science/pith/KKC5N5RII6OWRQHTFNCGQ7CR3B","bundle":"https://pith.science/pith/KKC5N5RII6OWRQHTFNCGQ7CR3B/bundle.json","state":"https://pith.science/pith/KKC5N5RII6OWRQHTFNCGQ7CR3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKC5N5RII6OWRQHTFNCGQ7CR3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KKC5N5RII6OWRQHTFNCGQ7CR3B","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":"4a7a2dd33e2f45a5d4ac80fb62f850b5380d5c4bf957987b84ac1cf9ed38b6a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:20:47Z","title_canon_sha256":"b00789380a4c79f8a931e97148c1e7cae8e355d79e224a4c506a7ae3b403c63d"},"schema_version":"1.0","source":{"id":"1511.07542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07542","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07542v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07542","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"KKC5N5RII6OW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KKC5N5RII6OWRQHT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KKC5N5RI","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:40266d03e4a0aa28ea52767030eae247008cb1104e73f08c3964db63cd7e4e49","target":"graph","created_at":"2026-05-18T01:26:04Z","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":"The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the shared link caching network, in which a single source with access to a file library communicates with multiple users, each having the capability to store segments (packets) of the library files, over a shared multicast link. Each user requests one file from the library according to a common demand distribution and the server sends a coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible average codeword length to ","authors_text":"Antonia Tulino, Giuseppe Caire, Jaime Llorca, Mingyue Ji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:20:47Z","title":"Caching-Aided Coded Multicasting with Multiple Random Requests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07542","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:7dfd3c0a74570b3ef2d117ff90d92d30f3389a557132e9f38efff394e8c79721","target":"record","created_at":"2026-05-18T01:26:04Z","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":"4a7a2dd33e2f45a5d4ac80fb62f850b5380d5c4bf957987b84ac1cf9ed38b6a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:20:47Z","title_canon_sha256":"b00789380a4c79f8a931e97148c1e7cae8e355d79e224a4c506a7ae3b403c63d"},"schema_version":"1.0","source":{"id":"1511.07542","kind":"arxiv","version":1}},"canonical_sha256":"5285d6f628479d68c0f32b44687c51d85d7c7952cf0732e15c2950a4fa0bc906","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5285d6f628479d68c0f32b44687c51d85d7c7952cf0732e15c2950a4fa0bc906","first_computed_at":"2026-05-18T01:26:04.459391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:04.459391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uNO8gx7b6aHjtZ6We0pGQ3GkGSSOcXma5hPjKPtGv61hm3IOqEvONfj3PO4TOVsdpIwTCqHg29ySGaAeNsyTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:04.459932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dfd3c0a74570b3ef2d117ff90d92d30f3389a557132e9f38efff394e8c79721","sha256:40266d03e4a0aa28ea52767030eae247008cb1104e73f08c3964db63cd7e4e49"],"state_sha256":"5e1a107607aae7c73fb29910c0e8cf52cbafdbefeb38aecf3ab459bbedc1cd96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOVAAFPGlxiF+0TKJVASEKXOMGgdY1aGyi0aG6dJd3ihEiVSTDHi7DE4uYayTI9JoDSi4Sy7TrdIHPlTnY73Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:15:58.391745Z","bundle_sha256":"c7fbbd8b2e35383ac1836450ddcd9ae0979c5ca1d4e80f5bc0fac9672ac90160"}}