{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E4TY45ZPS2IWOEDET3J5MUYT6U","short_pith_number":"pith:E4TY45ZP","canonical_record":{"source":{"id":"1510.05064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-17T02:40:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"842ecc22d175b728bfa2f9a0438dc4d137480966067a4a199318dc34b56cf32e","abstract_canon_sha256":"e9386f1d024e1f1dd6f76d22818d9e5f280f67b934c858117acf876221bc87fc"},"schema_version":"1.0"},"canonical_sha256":"27278e772f96916710649ed3d65313f5095e93ea49b29dc5bb3cc9f908f5a835","source":{"kind":"arxiv","id":"1510.05064","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05064","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05064v3","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05064","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"E4TY45ZPS2IW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E4TY45ZPS2IWOEDE","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E4TY45ZP","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E4TY45ZPS2IWOEDET3J5MUYT6U","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-17T02:40:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"842ecc22d175b728bfa2f9a0438dc4d137480966067a4a199318dc34b56cf32e","abstract_canon_sha256":"e9386f1d024e1f1dd6f76d22818d9e5f280f67b934c858117acf876221bc87fc"},"schema_version":"1.0"},"canonical_sha256":"27278e772f96916710649ed3d65313f5095e93ea49b29dc5bb3cc9f908f5a835","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:26.232668Z","signature_b64":"zNowtvOnGxU3yiTHMXh7oPf5d/GKvfXJO4gSHtuGkJGJk9kYHCKbOPi705eiwYaVUxJNNJ6F/Vy81M/uXgBUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27278e772f96916710649ed3d65313f5095e93ea49b29dc5bb3cc9f908f5a835","last_reissued_at":"2026-05-18T00:32:26.232001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:26.232001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05064","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-18T00:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQnuB5ga1IGmuyWWlROJkfZvICdMkX4pgSGkEJNlj3N1Wa97vLdtWlUM20DTLiwjwg0BsoiSfIXsc7xNbfX9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:24:38.146098Z"},"content_sha256":"97d87538da5d1c5a3a7ccaf28cba998a85b83bfa4901019200f5014045f7e64c","schema_version":"1.0","event_id":"sha256:97d87538da5d1c5a3a7ccaf28cba998a85b83bfa4901019200f5014045f7e64c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E4TY45ZPS2IWOEDET3J5MUYT6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Placement Delivery Array Design in Centralized Coded Caching Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minquan Cheng, Qifa Yan, Qingchun Chen, Xiaohu Tang","submitted_at":"2015-10-17T02:40:19Z","abstract_excerpt":"Caching is a promising solution to satisfy the ever increasing demands for the multi-media traffics. In caching networks, coded caching is a recently proposed technique that achieves significant performance gains over the uncoded caching schemes. However, to implement the coded caching schemes, each file has to be split into $F$ packets, which usually increases exponentially with the number of users $K$. Thus, designing caching schemes that decrease the order of $F$ is meaningful for practical implementations. In this paper, by reviewing the Ali-Niesen caching scheme, the placement delivery ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05064","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-18T00:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQAol+MWZ7KNptxFTY78PyuR+b1nPTLGV8DG9mGpMVcE32A1K5NhApxhzaghT6+JZedHbCI6F6i+d9asOqQhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:24:38.146490Z"},"content_sha256":"acd6c156921ef772fce64e1fee2f91af606101414f5e2b8a448e83d4333102de","schema_version":"1.0","event_id":"sha256:acd6c156921ef772fce64e1fee2f91af606101414f5e2b8a448e83d4333102de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4TY45ZPS2IWOEDET3J5MUYT6U/bundle.json","state_url":"https://pith.science/pith/E4TY45ZPS2IWOEDET3J5MUYT6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4TY45ZPS2IWOEDET3J5MUYT6U/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-30T02:24:38Z","links":{"resolver":"https://pith.science/pith/E4TY45ZPS2IWOEDET3J5MUYT6U","bundle":"https://pith.science/pith/E4TY45ZPS2IWOEDET3J5MUYT6U/bundle.json","state":"https://pith.science/pith/E4TY45ZPS2IWOEDET3J5MUYT6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4TY45ZPS2IWOEDET3J5MUYT6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E4TY45ZPS2IWOEDET3J5MUYT6U","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":"e9386f1d024e1f1dd6f76d22818d9e5f280f67b934c858117acf876221bc87fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-17T02:40:19Z","title_canon_sha256":"842ecc22d175b728bfa2f9a0438dc4d137480966067a4a199318dc34b56cf32e"},"schema_version":"1.0","source":{"id":"1510.05064","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05064","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05064v3","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05064","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"E4TY45ZPS2IW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E4TY45ZPS2IWOEDE","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E4TY45ZP","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:acd6c156921ef772fce64e1fee2f91af606101414f5e2b8a448e83d4333102de","target":"graph","created_at":"2026-05-18T00:32:26Z","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":"Caching is a promising solution to satisfy the ever increasing demands for the multi-media traffics. In caching networks, coded caching is a recently proposed technique that achieves significant performance gains over the uncoded caching schemes. However, to implement the coded caching schemes, each file has to be split into $F$ packets, which usually increases exponentially with the number of users $K$. Thus, designing caching schemes that decrease the order of $F$ is meaningful for practical implementations. In this paper, by reviewing the Ali-Niesen caching scheme, the placement delivery ar","authors_text":"Minquan Cheng, Qifa Yan, Qingchun Chen, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-17T02:40:19Z","title":"On the Placement Delivery Array Design in Centralized Coded Caching Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05064","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:97d87538da5d1c5a3a7ccaf28cba998a85b83bfa4901019200f5014045f7e64c","target":"record","created_at":"2026-05-18T00:32:26Z","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":"e9386f1d024e1f1dd6f76d22818d9e5f280f67b934c858117acf876221bc87fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-17T02:40:19Z","title_canon_sha256":"842ecc22d175b728bfa2f9a0438dc4d137480966067a4a199318dc34b56cf32e"},"schema_version":"1.0","source":{"id":"1510.05064","kind":"arxiv","version":3}},"canonical_sha256":"27278e772f96916710649ed3d65313f5095e93ea49b29dc5bb3cc9f908f5a835","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27278e772f96916710649ed3d65313f5095e93ea49b29dc5bb3cc9f908f5a835","first_computed_at":"2026-05-18T00:32:26.232001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:26.232001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zNowtvOnGxU3yiTHMXh7oPf5d/GKvfXJO4gSHtuGkJGJk9kYHCKbOPi705eiwYaVUxJNNJ6F/Vy81M/uXgBUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:26.232668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05064","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97d87538da5d1c5a3a7ccaf28cba998a85b83bfa4901019200f5014045f7e64c","sha256:acd6c156921ef772fce64e1fee2f91af606101414f5e2b8a448e83d4333102de"],"state_sha256":"064c918b26a77451208a6936be5eb932c5f5d3cb1004bfad086bbbf07395e95d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drlMEyyP7qSFQKhttrCUg4LyBTaHprPCpLP0kS82mvKmXW/Ro2/s4VoTEJFCCVwAZpek5igbmgs62X34KrUeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:24:38.148886Z","bundle_sha256":"bd0151aa27649b05db2a91986f8feb9c02b14594e246730b268b6cbdb4843260"}}