{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:F6VBXTGUSZQ3WX7BGGXUJKBI7M","short_pith_number":"pith:F6VBXTGU","canonical_record":{"source":{"id":"1508.05175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-21T04:49:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"26d30517c9da570b008d076fde9284fdac92af6511f4d1925241b95963bca815","abstract_canon_sha256":"dc294a75ef80753bb861ea051bede03beadd7015f631a33c17f2c451f9460403"},"schema_version":"1.0"},"canonical_sha256":"2faa1bccd49661bb5fe131af44a828fb00535ea9edc0aee7c116f93901a0169e","source":{"kind":"arxiv","id":"1508.05175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05175","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05175v1","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05175","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"F6VBXTGUSZQ3","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F6VBXTGUSZQ3WX7B","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F6VBXTGU","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:F6VBXTGUSZQ3WX7BGGXUJKBI7M","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-21T04:49:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"26d30517c9da570b008d076fde9284fdac92af6511f4d1925241b95963bca815","abstract_canon_sha256":"dc294a75ef80753bb861ea051bede03beadd7015f631a33c17f2c451f9460403"},"schema_version":"1.0"},"canonical_sha256":"2faa1bccd49661bb5fe131af44a828fb00535ea9edc0aee7c116f93901a0169e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:56.513962Z","signature_b64":"WEqXHIZMx6jiOpLw0EZ8nxph0KZjkQPWxQcE75ST36qnK1AmYbBOblU21AunD/vIOMK9Yrm+eqN4I4OQBAuyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2faa1bccd49661bb5fe131af44a828fb00535ea9edc0aee7c116f93901a0169e","last_reissued_at":"2026-05-18T01:34:56.513233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:56.513233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05175","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:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JIpppFxWhxUHwCdUrv+q6GpQDRDMwqh9XxLbp9OHRaxa4bYmrK9G/qxbED9MTs+wqVJTX+xsx0l3JScceVjdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:04:45.097104Z"},"content_sha256":"78cd59ef88c4a41819e713a218f59dd8c9d7367b5658b1195b7acfe952c98b34","schema_version":"1.0","event_id":"sha256:78cd59ef88c4a41819e713a218f59dd8c9d7367b5658b1195b7acfe952c98b34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:F6VBXTGUSZQ3WX7BGGXUJKBI7M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Length Analysis of Caching-Aided Coded Multicasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Antonia M.Tulino, Jaime Llorca, Karthikeyan Shanmugam, Mingyue Ji","submitted_at":"2015-08-21T04:49:06Z","abstract_excerpt":"In this work, we study a noiseless broadcast link serving $K$ users whose requests arise from a library of $N$ files. Every user is equipped with a cache of size $M$ files each. It has been shown that by splitting all the files into packets and placing individual packets in a random independent manner across all the caches, it requires at most $N/M$ file transmissions for any set of demands from the library. The achievable delivery scheme involves linearly combining packets of different files following a greedy clique cover solution to the underlying index coding problem. This remarkable multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05175","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:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYbH6hXFGB86OEtFij7nc8UfVlKTKjimvSi9eJLUOszDu+B/G2ssubD01T4MilONwHh0S5/Wcc2VK1jgvAQsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:04:45.097486Z"},"content_sha256":"5358057ada474f62d19880124a69acd5160e0a3087185696bc07a6e6572ae54e","schema_version":"1.0","event_id":"sha256:5358057ada474f62d19880124a69acd5160e0a3087185696bc07a6e6572ae54e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/bundle.json","state_url":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/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-19T17:04:45Z","links":{"resolver":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M","bundle":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/bundle.json","state":"https://pith.science/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6VBXTGUSZQ3WX7BGGXUJKBI7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F6VBXTGUSZQ3WX7BGGXUJKBI7M","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":"dc294a75ef80753bb861ea051bede03beadd7015f631a33c17f2c451f9460403","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-21T04:49:06Z","title_canon_sha256":"26d30517c9da570b008d076fde9284fdac92af6511f4d1925241b95963bca815"},"schema_version":"1.0","source":{"id":"1508.05175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05175","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05175v1","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05175","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"F6VBXTGUSZQ3","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F6VBXTGUSZQ3WX7B","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F6VBXTGU","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:5358057ada474f62d19880124a69acd5160e0a3087185696bc07a6e6572ae54e","target":"graph","created_at":"2026-05-18T01:34:56Z","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":"In this work, we study a noiseless broadcast link serving $K$ users whose requests arise from a library of $N$ files. Every user is equipped with a cache of size $M$ files each. It has been shown that by splitting all the files into packets and placing individual packets in a random independent manner across all the caches, it requires at most $N/M$ file transmissions for any set of demands from the library. The achievable delivery scheme involves linearly combining packets of different files following a greedy clique cover solution to the underlying index coding problem. This remarkable multi","authors_text":"Alexandros G. Dimakis, Antonia M.Tulino, Jaime Llorca, Karthikeyan Shanmugam, Mingyue Ji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-21T04:49:06Z","title":"Finite Length Analysis of Caching-Aided Coded Multicasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05175","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:78cd59ef88c4a41819e713a218f59dd8c9d7367b5658b1195b7acfe952c98b34","target":"record","created_at":"2026-05-18T01:34:56Z","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":"dc294a75ef80753bb861ea051bede03beadd7015f631a33c17f2c451f9460403","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-21T04:49:06Z","title_canon_sha256":"26d30517c9da570b008d076fde9284fdac92af6511f4d1925241b95963bca815"},"schema_version":"1.0","source":{"id":"1508.05175","kind":"arxiv","version":1}},"canonical_sha256":"2faa1bccd49661bb5fe131af44a828fb00535ea9edc0aee7c116f93901a0169e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2faa1bccd49661bb5fe131af44a828fb00535ea9edc0aee7c116f93901a0169e","first_computed_at":"2026-05-18T01:34:56.513233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:56.513233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WEqXHIZMx6jiOpLw0EZ8nxph0KZjkQPWxQcE75ST36qnK1AmYbBOblU21AunD/vIOMK9Yrm+eqN4I4OQBAuyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:56.513962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78cd59ef88c4a41819e713a218f59dd8c9d7367b5658b1195b7acfe952c98b34","sha256:5358057ada474f62d19880124a69acd5160e0a3087185696bc07a6e6572ae54e"],"state_sha256":"01da236a2ffcc8c72c1c2715f0252a140fb4e1eec1e4d4ae975ed43c1e23191c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBBmhzm+i9X3tKb4/kBI4pawOq/UR8PBU1gnj9GQbQ8jbfwdAKya0LFqguljGJUxL0py/idcMv+yHQFPkRwSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T17:04:45.100017Z","bundle_sha256":"59038d9733f79c68cd1b8dd2e7d276d830895cc654e4d23860b2837d49149da7"}}