{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2O2RC7C7MKGANMKVYSO7UCCCJH","short_pith_number":"pith:2O2RC7C7","schema_version":"1.0","canonical_sha256":"d3b5117c5f628c06b155c49dfa084249e8319ec1086543a4b760b982b193772d","source":{"kind":"arxiv","id":"2402.07188","version":2},"attestation_state":"computed","paper":{"title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Rashid Ummer N.T.","submitted_at":"2024-02-11T12:51:38Z","abstract_excerpt":"Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) achieves an optimal transmission rate $R$ under uncoded placement but requires a subpacketization level $F$ which increases exponentially with the number of users $K$ where the number of files $N \\geq K$. Placement delivery array (PDA) was proposed as a tool to design coded caching schemes with reduced subpacketization level by Yan \\textit{et al.} in \\cite{YCT}. This paper proposes two novel classes of PDA constructions from combinatorial $t$-designs that achieve an improved transmission rate for a given low subpacketizatio"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.07188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-11T12:51:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc778db9b2a7877ebee85c6a853feeafd576dd3c367c191b1b6456a292770e27","abstract_canon_sha256":"c16f65d6c08357b6b86bb2ef4755f6984abfb95f53fdc59e081bf34d3ef63c10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:49:17.895351Z","signature_b64":"+6wmN16xwvROH47v6FqwwW6uW27QsSkoSnwrvyvIj0aLhFfo1zphd7ANL3wAN5hJ4fCTNKxM8Eur48KoZpD5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3b5117c5f628c06b155c49dfa084249e8319ec1086543a4b760b982b193772d","last_reissued_at":"2026-07-05T07:49:17.894937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:49:17.894937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Rashid Ummer N.T.","submitted_at":"2024-02-11T12:51:38Z","abstract_excerpt":"Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) achieves an optimal transmission rate $R$ under uncoded placement but requires a subpacketization level $F$ which increases exponentially with the number of users $K$ where the number of files $N \\geq K$. Placement delivery array (PDA) was proposed as a tool to design coded caching schemes with reduced subpacketization level by Yan \\textit{et al.} in \\cite{YCT}. This paper proposes two novel classes of PDA constructions from combinatorial $t$-designs that achieve an improved transmission rate for a given low subpacketizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07188","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.07188/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.07188","created_at":"2026-07-05T07:49:17.894990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07188v2","created_at":"2026-07-05T07:49:17.894990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07188","created_at":"2026-07-05T07:49:17.894990+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O2RC7C7MKGA","created_at":"2026-07-05T07:49:17.894990+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O2RC7C7MKGANMKV","created_at":"2026-07-05T07:49:17.894990+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O2RC7C7","created_at":"2026-07-05T07:49:17.894990+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.00727","citing_title":"On Hierarchical Coded Caching with Offline Users","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH","json":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH.json","graph_json":"https://pith.science/api/pith-number/2O2RC7C7MKGANMKVYSO7UCCCJH/graph.json","events_json":"https://pith.science/api/pith-number/2O2RC7C7MKGANMKVYSO7UCCCJH/events.json","paper":"https://pith.science/paper/2O2RC7C7"},"agent_actions":{"view_html":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH","download_json":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH.json","view_paper":"https://pith.science/paper/2O2RC7C7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07188&json=true","fetch_graph":"https://pith.science/api/pith-number/2O2RC7C7MKGANMKVYSO7UCCCJH/graph.json","fetch_events":"https://pith.science/api/pith-number/2O2RC7C7MKGANMKVYSO7UCCCJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/action/storage_attestation","attest_author":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/action/author_attestation","sign_citation":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/action/citation_signature","submit_replication":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/action/replication_record"}},"created_at":"2026-07-05T07:49:17.894990+00:00","updated_at":"2026-07-05T07:49:17.894990+00:00"}