{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZMGW4B53E27FKR4WW7TRQVVOWX","short_pith_number":"pith:ZMGW4B53","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"},"canonical_sha256":"cb0d6e07bb26be554796b7e71856aeb5c41b94600c5333a60058db3549ba511d","source":{"kind":"arxiv","id":"2007.07475","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07475","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07475v2","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07475","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZMGW4B53E27F","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"pith_short_16","alias_value":"ZMGW4B53E27FKR4W","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"pith_short_8","alias_value":"ZMGW4B53","created_at":"2026-07-05T04:11:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZMGW4B53E27FKR4WW7TRQVVOWX","target":"record","payload":{"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"},"canonical_sha256":"cb0d6e07bb26be554796b7e71856aeb5c41b94600c5333a60058db3549ba511d","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"},"source_kind":"arxiv","source_id":"2007.07475","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-05T04:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8b3YNOSdN6ZUAyrQg8A3WYmDByINibI2bI8f0Ff1B7pkCwCKqI0toEuIwdsp1H31KRtk7oR+dSfoUKmp1f+XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:10:56.259098Z"},"content_sha256":"a84993c360433edbb243e288b77d9ac99a2c6360712759c9433380c40924b6ec","schema_version":"1.0","event_id":"sha256:a84993c360433edbb243e288b77d9ac99a2c6360712759c9433380c40924b6ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZMGW4B53E27FKR4WW7TRQVVOWX","target":"graph","payload":{"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"},"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-05T04:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8i8l/vzJ+zJXfQJgegHfwjEOY+Jn9XOrvyvXQf+RqIjxtKBKaTEh/5BjwzTR3OwIW26J+Tk5nmCFRgcWdPuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:10:56.260020Z"},"content_sha256":"b7684ea6df8135b867daa9b0198641fee8fada86a6123a69bce0a7599f6b23fe","schema_version":"1.0","event_id":"sha256:b7684ea6df8135b867daa9b0198641fee8fada86a6123a69bce0a7599f6b23fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/bundle.json","state_url":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/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-16T20:10:56Z","links":{"resolver":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX","bundle":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/bundle.json","state":"https://pith.science/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMGW4B53E27FKR4WW7TRQVVOWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZMGW4B53E27FKR4WW7TRQVVOWX","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":"b193e2024409e2e39cdd1c0c13888e2427dcdc1eb60828b5ae3fa4ff23744173","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-15T04:37:37Z","title_canon_sha256":"8ad90c2bd6aadf09e067cd5f5510351542b177390e06c12ab414102efebb1b51"},"schema_version":"1.0","source":{"id":"2007.07475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.07475","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"2007.07475v2","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.07475","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZMGW4B53E27F","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"pith_short_16","alias_value":"ZMGW4B53E27FKR4W","created_at":"2026-07-05T04:11:23Z"},{"alias_kind":"pith_short_8","alias_value":"ZMGW4B53","created_at":"2026-07-05T04:11:23Z"}],"graph_snapshots":[{"event_id":"sha256:b7684ea6df8135b867daa9b0198641fee8fada86a6123a69bce0a7599f6b23fe","target":"graph","created_at":"2026-07-05T04:11:23Z","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/2007.07475/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrew Thangaraj, Pradeep Kiran Sarvepalli, V R Aravind","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-15T04:37:37Z","title":"Lifting Constructions of PDAs for Coded Caching with Linear Subpacketization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.07475","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:a84993c360433edbb243e288b77d9ac99a2c6360712759c9433380c40924b6ec","target":"record","created_at":"2026-07-05T04:11:23Z","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":"b193e2024409e2e39cdd1c0c13888e2427dcdc1eb60828b5ae3fa4ff23744173","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-15T04:37:37Z","title_canon_sha256":"8ad90c2bd6aadf09e067cd5f5510351542b177390e06c12ab414102efebb1b51"},"schema_version":"1.0","source":{"id":"2007.07475","kind":"arxiv","version":2}},"canonical_sha256":"cb0d6e07bb26be554796b7e71856aeb5c41b94600c5333a60058db3549ba511d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb0d6e07bb26be554796b7e71856aeb5c41b94600c5333a60058db3549ba511d","first_computed_at":"2026-07-05T04:11:23.300864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:11:23.300864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OkIuNJp/5vIds2V4WKmCMUVRsSLg70sEv+eGLzYyGL8do96ChX+ySxTscOLWrDayDt4iqtg4SmR1iDChL/WaBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:11:23.301394Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.07475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a84993c360433edbb243e288b77d9ac99a2c6360712759c9433380c40924b6ec","sha256:b7684ea6df8135b867daa9b0198641fee8fada86a6123a69bce0a7599f6b23fe"],"state_sha256":"a9122ee5336d515e63eda443276377f8989ed743182d541626321eda4dd2b7b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rII61ej/p5AjZgx/AZkmWnOXLQaagdsZ3IhRSYWZksobtdn5a80uvatWije/dKUGzsZvKoW6q0Y9bII6gulmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:10:56.276120Z","bundle_sha256":"a8c5c860135877ac0295e985cf80e88e9f31b81c3236d6fa3b58a2381164036b"}}