{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GI6SG6XNALKWWXY345FEUMRKHJ","short_pith_number":"pith:GI6SG6XN","canonical_record":{"source":{"id":"1611.04213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-14T00:25:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e76c264516410737e6589a0ff7c25c10c6e96108dbb44bede410cda356ba6e2","abstract_canon_sha256":"acf31da542cd85b52686cf9f1c68532abb93f571e8e4badefa86f6d752bda675"},"schema_version":"1.0"},"canonical_sha256":"323d237aed02d56b5f1be74a4a322a3a559d99886d76f7675945063dc393a001","source":{"kind":"arxiv","id":"1611.04213","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04213","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04213v2","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04213","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"GI6SG6XNALKW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GI6SG6XNALKWWXY3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GI6SG6XN","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GI6SG6XNALKWWXY345FEUMRKHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-14T00:25:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e76c264516410737e6589a0ff7c25c10c6e96108dbb44bede410cda356ba6e2","abstract_canon_sha256":"acf31da542cd85b52686cf9f1c68532abb93f571e8e4badefa86f6d752bda675"},"schema_version":"1.0"},"canonical_sha256":"323d237aed02d56b5f1be74a4a322a3a559d99886d76f7675945063dc393a001","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:11.995915Z","signature_b64":"G56Rl1fx/aPO2IXcYEqsZl34xhDJoxiW8VGUzmZx+Y6TFdGF8ZtrVK3Oirif3alB03xx6XPn3ZwG5nolNnKODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323d237aed02d56b5f1be74a4a322a3a559d99886d76f7675945063dc393a001","last_reissued_at":"2026-05-18T00:53:11.995412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:11.995412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04213","source_version":2,"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:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHvjZb79RFjrnpdHGpMCbwlUGfszgSrwqF/hwAiZrH8wu5xPkQwL60P3cp5nftRfa6KupRm31JQPr130vXXEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:38:58.257956Z"},"content_sha256":"bd96f89c62d3ca1f0737c22d4e5cb615c6ba15c40760dc25c54387e62902bf1f","schema_version":"1.0","event_id":"sha256:bd96f89c62d3ca1f0737c22d4e5cb615c6ba15c40760dc25c54387e62902bf1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GI6SG6XNALKWWXY345FEUMRKHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Optimal Placement Delivery Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haitao Cao, Jing Jiang, Minquan Cheng, Qifa Yan, Xiaohu Tang","submitted_at":"2016-11-14T00:25:01Z","abstract_excerpt":"In wireless networks, coded caching is an effective technique to reduce network congestion during peak traffic times. Recently, a new concept called placement delivery array (PDA) was proposed to characterize the coded caching scheme. So far, only one class of PDAs by Maddah-Ali and Niesen is known to be optimal. In this paper, we mainly focus on constructing optimal PDAs. Firstly, we derive some lower bounds. Next, we present several infinite classes of PDAs, which are shown to be optimal with respect to the new bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04213","kind":"arxiv","version":2},"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:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEAFBg5nT7fva93lGdpCFW2u4uAGf98jYg+rQ+n5IGpNzErxRy2CWl6sEKTmHQMpSAIebonLT4O++qm6QoxADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:38:58.258613Z"},"content_sha256":"bc2d53bb2e54405365a3e541ea3b58f10db99815a470b95f38a22844e024aa58","schema_version":"1.0","event_id":"sha256:bc2d53bb2e54405365a3e541ea3b58f10db99815a470b95f38a22844e024aa58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI6SG6XNALKWWXY345FEUMRKHJ/bundle.json","state_url":"https://pith.science/pith/GI6SG6XNALKWWXY345FEUMRKHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI6SG6XNALKWWXY345FEUMRKHJ/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-30T21:38:58Z","links":{"resolver":"https://pith.science/pith/GI6SG6XNALKWWXY345FEUMRKHJ","bundle":"https://pith.science/pith/GI6SG6XNALKWWXY345FEUMRKHJ/bundle.json","state":"https://pith.science/pith/GI6SG6XNALKWWXY345FEUMRKHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI6SG6XNALKWWXY345FEUMRKHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GI6SG6XNALKWWXY345FEUMRKHJ","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":"acf31da542cd85b52686cf9f1c68532abb93f571e8e4badefa86f6d752bda675","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-14T00:25:01Z","title_canon_sha256":"9e76c264516410737e6589a0ff7c25c10c6e96108dbb44bede410cda356ba6e2"},"schema_version":"1.0","source":{"id":"1611.04213","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04213","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04213v2","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04213","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"GI6SG6XNALKW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GI6SG6XNALKWWXY3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GI6SG6XN","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:bc2d53bb2e54405365a3e541ea3b58f10db99815a470b95f38a22844e024aa58","target":"graph","created_at":"2026-05-18T00:53:11Z","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 wireless networks, coded caching is an effective technique to reduce network congestion during peak traffic times. Recently, a new concept called placement delivery array (PDA) was proposed to characterize the coded caching scheme. So far, only one class of PDAs by Maddah-Ali and Niesen is known to be optimal. In this paper, we mainly focus on constructing optimal PDAs. Firstly, we derive some lower bounds. Next, we present several infinite classes of PDAs, which are shown to be optimal with respect to the new bounds.","authors_text":"Haitao Cao, Jing Jiang, Minquan Cheng, Qifa Yan, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-14T00:25:01Z","title":"The Optimal Placement Delivery Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04213","kind":"arxiv","version":2},"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:bd96f89c62d3ca1f0737c22d4e5cb615c6ba15c40760dc25c54387e62902bf1f","target":"record","created_at":"2026-05-18T00:53:11Z","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":"acf31da542cd85b52686cf9f1c68532abb93f571e8e4badefa86f6d752bda675","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-14T00:25:01Z","title_canon_sha256":"9e76c264516410737e6589a0ff7c25c10c6e96108dbb44bede410cda356ba6e2"},"schema_version":"1.0","source":{"id":"1611.04213","kind":"arxiv","version":2}},"canonical_sha256":"323d237aed02d56b5f1be74a4a322a3a559d99886d76f7675945063dc393a001","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323d237aed02d56b5f1be74a4a322a3a559d99886d76f7675945063dc393a001","first_computed_at":"2026-05-18T00:53:11.995412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:11.995412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G56Rl1fx/aPO2IXcYEqsZl34xhDJoxiW8VGUzmZx+Y6TFdGF8ZtrVK3Oirif3alB03xx6XPn3ZwG5nolNnKODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:11.995915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04213","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd96f89c62d3ca1f0737c22d4e5cb615c6ba15c40760dc25c54387e62902bf1f","sha256:bc2d53bb2e54405365a3e541ea3b58f10db99815a470b95f38a22844e024aa58"],"state_sha256":"101f480ef0123c44320126a69af91f96385598d2b096649b40aef2dc81243a67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OW2UclCuMkay//JLBcMpvuT8yJ0v1AtvleWkApncaQZvEJ9xl1fk4CrBaHPVpmOq1lUKVLBnI7cfW9UxlCf8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:38:58.261989Z","bundle_sha256":"c4b97bbc5cbc9ca3921111a62c8bd7b2209a05c0cdfdb718211da560c0c36235"}}