{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2O2RC7C7MKGANMKVYSO7UCCCJH","short_pith_number":"pith:2O2RC7C7","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"},"canonical_sha256":"d3b5117c5f628c06b155c49dfa084249e8319ec1086543a4b760b982b193772d","source":{"kind":"arxiv","id":"2402.07188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07188","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07188v2","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07188","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"pith_short_12","alias_value":"2O2RC7C7MKGA","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"pith_short_16","alias_value":"2O2RC7C7MKGANMKV","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"pith_short_8","alias_value":"2O2RC7C7","created_at":"2026-07-05T07:49:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2O2RC7C7MKGANMKVYSO7UCCCJH","target":"record","payload":{"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"},"canonical_sha256":"d3b5117c5f628c06b155c49dfa084249e8319ec1086543a4b760b982b193772d","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"},"source_kind":"arxiv","source_id":"2402.07188","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-07-05T07:49:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMqY1RBO5n61f0WjzYX9QGvT9+vgKedtk9Hm84+l1g1eqkIPj+k2iXgBbkgNV44/1DLTGVLxGNNhCWTUSf2sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:47:15.067006Z"},"content_sha256":"209543e24539de7dd281c36acc64538785b29f72f3054d88414f2db6af691c1b","schema_version":"1.0","event_id":"sha256:209543e24539de7dd281c36acc64538785b29f72f3054d88414f2db6af691c1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2O2RC7C7MKGANMKVYSO7UCCCJH","target":"graph","payload":{"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"},"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-07-05T07:49:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HMCY/ISKYVPbmZxnq/63qgOVFDaDTJzjbYFVpIYdOF44u9GX3/F2fkpuDvGF/jd2fwhOxa7cFFnZeCCByF2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:47:15.068033Z"},"content_sha256":"dc9bd0114e009edd0a312ea2ad76673b2b4fda08a9fc0eccc410602f5c933689","schema_version":"1.0","event_id":"sha256:dc9bd0114e009edd0a312ea2ad76673b2b4fda08a9fc0eccc410602f5c933689"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/bundle.json","state_url":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/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-08-13T11:47:15Z","links":{"resolver":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH","bundle":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/bundle.json","state":"https://pith.science/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2O2RC7C7MKGANMKVYSO7UCCCJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2O2RC7C7MKGANMKVYSO7UCCCJH","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":"c16f65d6c08357b6b86bb2ef4755f6984abfb95f53fdc59e081bf34d3ef63c10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-11T12:51:38Z","title_canon_sha256":"bc778db9b2a7877ebee85c6a853feeafd576dd3c367c191b1b6456a292770e27"},"schema_version":"1.0","source":{"id":"2402.07188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07188","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07188v2","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07188","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"pith_short_12","alias_value":"2O2RC7C7MKGA","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"pith_short_16","alias_value":"2O2RC7C7MKGANMKV","created_at":"2026-07-05T07:49:17Z"},{"alias_kind":"pith_short_8","alias_value":"2O2RC7C7","created_at":"2026-07-05T07:49:17Z"}],"graph_snapshots":[{"event_id":"sha256:dc9bd0114e009edd0a312ea2ad76673b2b4fda08a9fc0eccc410602f5c933689","target":"graph","created_at":"2026-07-05T07:49:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.07188/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"B. Sundar Rajan, Rashid Ummer N.T.","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-11T12:51:38Z","title":"Optimal Placement Delivery Arrays from $t$-Designs with Application to Hierarchical Coded Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07188","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:209543e24539de7dd281c36acc64538785b29f72f3054d88414f2db6af691c1b","target":"record","created_at":"2026-07-05T07:49:17Z","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":"c16f65d6c08357b6b86bb2ef4755f6984abfb95f53fdc59e081bf34d3ef63c10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-02-11T12:51:38Z","title_canon_sha256":"bc778db9b2a7877ebee85c6a853feeafd576dd3c367c191b1b6456a292770e27"},"schema_version":"1.0","source":{"id":"2402.07188","kind":"arxiv","version":2}},"canonical_sha256":"d3b5117c5f628c06b155c49dfa084249e8319ec1086543a4b760b982b193772d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3b5117c5f628c06b155c49dfa084249e8319ec1086543a4b760b982b193772d","first_computed_at":"2026-07-05T07:49:17.894937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:49:17.894937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+6wmN16xwvROH47v6FqwwW6uW27QsSkoSnwrvyvIj0aLhFfo1zphd7ANL3wAN5hJ4fCTNKxM8Eur48KoZpD5CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:49:17.895351Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.07188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:209543e24539de7dd281c36acc64538785b29f72f3054d88414f2db6af691c1b","sha256:dc9bd0114e009edd0a312ea2ad76673b2b4fda08a9fc0eccc410602f5c933689"],"state_sha256":"4dbe9aed9e0e8203d821944e33ba8962e132dee1491406dca276a42278a50990"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vDV6fH6MbvNDCsp5qdEG+GTLmQyE7JpUmrk1g6hNuUFEvyiqz96JdtXU1JltxmEbTzmQqF0/6oZbLvkp/6KCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:47:15.081758Z","bundle_sha256":"c9102c0a871b0b381160399c0b8524cf8992a7d4e8f12ef33c79d0697099f907"}}