{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VDPX4UWAE5ITVHJ5ASXHCX63F6","short_pith_number":"pith:VDPX4UWA","canonical_record":{"source":{"id":"1502.03124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T21:23:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b4fb51f4cd6aafb310babb496c78b481b96afd306b3286365b503fbf805bcf4","abstract_canon_sha256":"7a5c37327ec200500d1112e8a8f1bd410c772b96a17e90ba7451a0e6159250bd"},"schema_version":"1.0"},"canonical_sha256":"a8df7e52c027513a9d3d04ae715fdb2f92d23bb7644e8d797a8f0da1a0eaaa45","source":{"kind":"arxiv","id":"1502.03124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03124","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03124v1","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03124","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"VDPX4UWAE5IT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VDPX4UWAE5ITVHJ5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VDPX4UWA","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VDPX4UWAE5ITVHJ5ASXHCX63F6","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T21:23:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b4fb51f4cd6aafb310babb496c78b481b96afd306b3286365b503fbf805bcf4","abstract_canon_sha256":"7a5c37327ec200500d1112e8a8f1bd410c772b96a17e90ba7451a0e6159250bd"},"schema_version":"1.0"},"canonical_sha256":"a8df7e52c027513a9d3d04ae715fdb2f92d23bb7644e8d797a8f0da1a0eaaa45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:20.497284Z","signature_b64":"bVmcR1MWhHQIfa2dgBCzP68a2nUe2jTaIm/q1ZN5aAooRcbJLa4z39tdn6E9PU1ibaxTC+FRghoZGk6kU8IWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8df7e52c027513a9d3d04ae715fdb2f92d23bb7644e8d797a8f0da1a0eaaa45","last_reissued_at":"2026-05-18T02:27:20.496608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:20.496608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03124","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-18T02:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"riHf1bTHmg9KyHv9wF5EYbYquu/1BSf7IlMahC+yhPQDHLv6Ip7gBZuJi+HyDrG01IoflN3js5uB/+ZTJt+CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:05:44.112742Z"},"content_sha256":"aa019bc63ed1bdc708822878c7fcee35912719ea87f0ab4e0c37e835fc2782e1","schema_version":"1.0","event_id":"sha256:aa019bc63ed1bdc708822878c7fcee35912719ea87f0ab4e0c37e835fc2782e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VDPX4UWAE5ITVHJ5ASXHCX63F6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Order-Optimal Rate of Caching and Coded Multicasting with Random Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia M. Tulino, Giuseppe Caire, Jaime Llorca, Mingyue Ji","submitted_at":"2015-02-10T21:23:45Z","abstract_excerpt":"We consider the canonical {\\em shared link network} formed by a source node, hosting a library of $m$ information messages (files), connected via a noiseless common link to $n$ destination nodes (users), each with a cache of size M files. Users request files at random and independently, according to a given a-priori demand distribution $\\qv$. A coding scheme for this network consists of a caching placement (i.e., a mapping of the library files into the user caches) and delivery scheme (i.e., a mapping for the library files and user demands into a common multicast codeword) such that, after the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03124","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-18T02:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bLKNZ9nfNPXW6sSbYDQS1uDX0PrlH2M5CHMCw+FOZeWpMCetnszdvl/AJ7gFXbkP5L6hLfy0oufFsp3/+7WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:05:44.113216Z"},"content_sha256":"6a323df1e69815a2ce305463a1ea2677734281c35cc6bee078d1fbfa712578df","schema_version":"1.0","event_id":"sha256:6a323df1e69815a2ce305463a1ea2677734281c35cc6bee078d1fbfa712578df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDPX4UWAE5ITVHJ5ASXHCX63F6/bundle.json","state_url":"https://pith.science/pith/VDPX4UWAE5ITVHJ5ASXHCX63F6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDPX4UWAE5ITVHJ5ASXHCX63F6/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-30T05:05:44Z","links":{"resolver":"https://pith.science/pith/VDPX4UWAE5ITVHJ5ASXHCX63F6","bundle":"https://pith.science/pith/VDPX4UWAE5ITVHJ5ASXHCX63F6/bundle.json","state":"https://pith.science/pith/VDPX4UWAE5ITVHJ5ASXHCX63F6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDPX4UWAE5ITVHJ5ASXHCX63F6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VDPX4UWAE5ITVHJ5ASXHCX63F6","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":"7a5c37327ec200500d1112e8a8f1bd410c772b96a17e90ba7451a0e6159250bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T21:23:45Z","title_canon_sha256":"7b4fb51f4cd6aafb310babb496c78b481b96afd306b3286365b503fbf805bcf4"},"schema_version":"1.0","source":{"id":"1502.03124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03124","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03124v1","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03124","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"VDPX4UWAE5IT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VDPX4UWAE5ITVHJ5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VDPX4UWA","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:6a323df1e69815a2ce305463a1ea2677734281c35cc6bee078d1fbfa712578df","target":"graph","created_at":"2026-05-18T02:27:20Z","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 the canonical {\\em shared link network} formed by a source node, hosting a library of $m$ information messages (files), connected via a noiseless common link to $n$ destination nodes (users), each with a cache of size M files. Users request files at random and independently, according to a given a-priori demand distribution $\\qv$. A coding scheme for this network consists of a caching placement (i.e., a mapping of the library files into the user caches) and delivery scheme (i.e., a mapping for the library files and user demands into a common multicast codeword) such that, after the","authors_text":"Antonia M. 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-02-10T21:23:45Z","title":"Order-Optimal Rate of Caching and Coded Multicasting with Random Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03124","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:aa019bc63ed1bdc708822878c7fcee35912719ea87f0ab4e0c37e835fc2782e1","target":"record","created_at":"2026-05-18T02:27:20Z","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":"7a5c37327ec200500d1112e8a8f1bd410c772b96a17e90ba7451a0e6159250bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T21:23:45Z","title_canon_sha256":"7b4fb51f4cd6aafb310babb496c78b481b96afd306b3286365b503fbf805bcf4"},"schema_version":"1.0","source":{"id":"1502.03124","kind":"arxiv","version":1}},"canonical_sha256":"a8df7e52c027513a9d3d04ae715fdb2f92d23bb7644e8d797a8f0da1a0eaaa45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8df7e52c027513a9d3d04ae715fdb2f92d23bb7644e8d797a8f0da1a0eaaa45","first_computed_at":"2026-05-18T02:27:20.496608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:20.496608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bVmcR1MWhHQIfa2dgBCzP68a2nUe2jTaIm/q1ZN5aAooRcbJLa4z39tdn6E9PU1ibaxTC+FRghoZGk6kU8IWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:20.497284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa019bc63ed1bdc708822878c7fcee35912719ea87f0ab4e0c37e835fc2782e1","sha256:6a323df1e69815a2ce305463a1ea2677734281c35cc6bee078d1fbfa712578df"],"state_sha256":"10674e7cc7e32027ff23bbbb00ca2ce069ce87ea4973a31d18a427cd4bd3f35e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pns/pRVLt3HoN+a00DQTMHvmYy0+78tgZhVFC8RvS/6vgX3LAWSRDxVzmIzqAmDxNN6/aLqzgOQtv4yHipPCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:05:44.115822Z","bundle_sha256":"2ef5dba3aaac1a6daefa2751ffd2f6b4e947654698bc1c32bd98e42b2257f8d0"}}