{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZMGW4B53E27FKR4WW7TRQVVOWX","short_pith_number":"pith:ZMGW4B53","schema_version":"1.0","canonical_sha256":"cb0d6e07bb26be554796b7e71856aeb5c41b94600c5333a60058db3549ba511d","source":{"kind":"arxiv","id":"2007.07475","version":2},"attestation_state":"computed","paper":{"title":"Lifting Constructions of PDAs for Coded Caching with Linear Subpacketization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Pradeep Kiran Sarvepalli, V R Aravind","submitted_at":"2020-07-15T04:37:37Z","abstract_excerpt":"Coded caching is a technique where multicasting and coding opportunities are utilized to achieve better rate-memory tradeoff in cached networks. A crucial parameter in coded caching is subpacketization, which is the number of parts a file is to be split into for coding purposes. The original Maddah-Ali-Niesen scheme has order-optimal rate at a subpacketization growing exponentially with the number of users. In contrast, placement and delivery schemes in coded caching, designed using placement delivery arrays (PDAs), can have linear subpacketization with a penalty in rate. In this work, we prop"},"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":"2007.07475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-15T04:37:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ad90c2bd6aadf09e067cd5f5510351542b177390e06c12ab414102efebb1b51","abstract_canon_sha256":"b193e2024409e2e39cdd1c0c13888e2427dcdc1eb60828b5ae3fa4ff23744173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:23.301394Z","signature_b64":"OkIuNJp/5vIds2V4WKmCMUVRsSLg70sEv+eGLzYyGL8do96ChX+ySxTscOLWrDayDt4iqtg4SmR1iDChL/WaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb0d6e07bb26be554796b7e71856aeb5c41b94600c5333a60058db3549ba511d","last_reissued_at":"2026-07-05T04:11:23.300864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:23.300864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lifting Constructions of PDAs for Coded Caching with Linear Subpacketization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Pradeep Kiran Sarvepalli, V R Aravind","submitted_at":"2020-07-15T04:37:37Z","abstract_excerpt":"Coded caching is a technique where multicasting and coding opportunities are utilized to achieve better rate-memory tradeoff in cached networks. A crucial parameter in coded caching is subpacketization, which is the number of parts a file is to be split into for coding purposes. The original Maddah-Ali-Niesen scheme has order-optimal rate at a subpacketization growing exponentially with the number of users. In contrast, placement and delivery schemes in coded caching, designed using placement delivery arrays (PDAs), can have linear subpacketization with a penalty in rate. In this work, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07475","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/2007.07475/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":"2007.07475","created_at":"2026-07-05T04:11:23.300916+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.07475v2","created_at":"2026-07-05T04:11:23.300916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07475","created_at":"2026-07-05T04:11:23.300916+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMGW4B53E27F","created_at":"2026-07-05T04:11:23.300916+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMGW4B53E27FKR4W","created_at":"2026-07-05T04:11:23.300916+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMGW4B53","created_at":"2026-07-05T04:11:23.300916+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05865","citing_title":"A framework of constructing placement delivery arrays for centralized coded caching","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX","json":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX.json","graph_json":"https://pith.science/api/pith-number/ZMGW4B53E27FKR4WW7TRQVVOWX/graph.json","events_json":"https://pith.science/api/pith-number/ZMGW4B53E27FKR4WW7TRQVVOWX/events.json","paper":"https://pith.science/paper/ZMGW4B53"},"agent_actions":{"view_html":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX","download_json":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX.json","view_paper":"https://pith.science/paper/ZMGW4B53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.07475&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMGW4B53E27FKR4WW7TRQVVOWX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMGW4B53E27FKR4WW7TRQVVOWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/action/storage_attestation","attest_author":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/action/author_attestation","sign_citation":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/action/citation_signature","submit_replication":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/action/replication_record"}},"created_at":"2026-07-05T04:11:23.300916+00:00","updated_at":"2026-07-05T04:11:23.300916+00:00"}