{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5FSEUEGNEAEYYKYUPYSGKC7JLU","short_pith_number":"pith:5FSEUEGN","canonical_record":{"source":{"id":"2106.00480","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-06-01T13:34:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"39b2bab8b0068e37b5799f69512caa5550f9d1de05ce1cec677d6fd8cf62ba01","abstract_canon_sha256":"f08a5aef55084b1d8cd1ad9ddaaf8049ac2b4c6f89dda4933091c64c49aaaca6"},"schema_version":"1.0"},"canonical_sha256":"e9644a10cd20098c2b147e24650be95d06441c32e3d28d58e94bcb3ff52e8244","source":{"kind":"arxiv","id":"2106.00480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00480","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00480v2","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00480","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"pith_short_12","alias_value":"5FSEUEGNEAEY","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"pith_short_16","alias_value":"5FSEUEGNEAEYYKYU","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"pith_short_8","alias_value":"5FSEUEGN","created_at":"2026-07-05T03:46:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5FSEUEGNEAEYYKYUPYSGKC7JLU","target":"record","payload":{"canonical_record":{"source":{"id":"2106.00480","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-06-01T13:34:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"39b2bab8b0068e37b5799f69512caa5550f9d1de05ce1cec677d6fd8cf62ba01","abstract_canon_sha256":"f08a5aef55084b1d8cd1ad9ddaaf8049ac2b4c6f89dda4933091c64c49aaaca6"},"schema_version":"1.0"},"canonical_sha256":"e9644a10cd20098c2b147e24650be95d06441c32e3d28d58e94bcb3ff52e8244","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:02.343102Z","signature_b64":"2zY9D6NNrQoHxkR2GLWvxnwtTDsdSpa716p0CONTpfO3KTDEnn8PTeppdeBoIXGanetBf5ksRvGCaAax6UPVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9644a10cd20098c2b147e24650be95d06441c32e3d28d58e94bcb3ff52e8244","last_reissued_at":"2026-07-05T03:46:02.342676Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:02.342676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.00480","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-05T03:46:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxT6yibvCQZwZLuQWY/yk+ZyU8uVFXTZdoUDsT9QKqcX2JRVQJxJEhFm0TSrOH9YAVPhyjHQ6QBBmvh0o5lsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T22:52:13.914134Z"},"content_sha256":"18d38d54c8c208bb9623019264e9521dfb91500c8a4c293afc3e6485c6b9267e","schema_version":"1.0","event_id":"sha256:18d38d54c8c208bb9623019264e9521dfb91500c8a4c293afc3e6485c6b9267e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5FSEUEGNEAEYYKYUPYSGKC7JLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of Placement Delivery Arrays for Coded Caching with Small Subpacketizations and Flexible Memory Sizes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congduan Li, Li Chen, Minquan Cheng, Xianzhang Wu","submitted_at":"2021-06-01T13:34:00Z","abstract_excerpt":"Coded caching is an emerging technique to reduce the data transmission load during the peak-traffic times. In such a scheme, each file in the data center or library is usually divided into a number of packets to pursue a low broadcasting rate based on the designed placements at each user's cache. However, the implementation complexity of this scheme increases as the number of packets increases. It is crucial to design a scheme with a small subpacketization level, while maintaining a relatively low transmission rate. It is known that the design of caches in users (i.e., the placement phase) and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00480","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/2106.00480/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-05T03:46:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W45lA05UYemIqDWSwGGBF8ftlmZtftwviM7DREpf7EPqpkvhcHOhedBY+In+nc5AKEkckktit0gdC3+dDXyWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T22:52:13.914521Z"},"content_sha256":"6a9893b564adcfab2b82ed7e1d7a4c709785d69ad592657a64cf1190fb861dbc","schema_version":"1.0","event_id":"sha256:6a9893b564adcfab2b82ed7e1d7a4c709785d69ad592657a64cf1190fb861dbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FSEUEGNEAEYYKYUPYSGKC7JLU/bundle.json","state_url":"https://pith.science/pith/5FSEUEGNEAEYYKYUPYSGKC7JLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FSEUEGNEAEYYKYUPYSGKC7JLU/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-01T22:52:13Z","links":{"resolver":"https://pith.science/pith/5FSEUEGNEAEYYKYUPYSGKC7JLU","bundle":"https://pith.science/pith/5FSEUEGNEAEYYKYUPYSGKC7JLU/bundle.json","state":"https://pith.science/pith/5FSEUEGNEAEYYKYUPYSGKC7JLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FSEUEGNEAEYYKYUPYSGKC7JLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5FSEUEGNEAEYYKYUPYSGKC7JLU","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":"f08a5aef55084b1d8cd1ad9ddaaf8049ac2b4c6f89dda4933091c64c49aaaca6","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-06-01T13:34:00Z","title_canon_sha256":"39b2bab8b0068e37b5799f69512caa5550f9d1de05ce1cec677d6fd8cf62ba01"},"schema_version":"1.0","source":{"id":"2106.00480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00480","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00480v2","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00480","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"pith_short_12","alias_value":"5FSEUEGNEAEY","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"pith_short_16","alias_value":"5FSEUEGNEAEYYKYU","created_at":"2026-07-05T03:46:02Z"},{"alias_kind":"pith_short_8","alias_value":"5FSEUEGN","created_at":"2026-07-05T03:46:02Z"}],"graph_snapshots":[{"event_id":"sha256:6a9893b564adcfab2b82ed7e1d7a4c709785d69ad592657a64cf1190fb861dbc","target":"graph","created_at":"2026-07-05T03:46:02Z","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/2106.00480/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coded caching is an emerging technique to reduce the data transmission load during the peak-traffic times. In such a scheme, each file in the data center or library is usually divided into a number of packets to pursue a low broadcasting rate based on the designed placements at each user's cache. However, the implementation complexity of this scheme increases as the number of packets increases. It is crucial to design a scheme with a small subpacketization level, while maintaining a relatively low transmission rate. It is known that the design of caches in users (i.e., the placement phase) and","authors_text":"Congduan Li, Li Chen, Minquan Cheng, Xianzhang Wu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-06-01T13:34:00Z","title":"Design of Placement Delivery Arrays for Coded Caching with Small Subpacketizations and Flexible Memory Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00480","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:18d38d54c8c208bb9623019264e9521dfb91500c8a4c293afc3e6485c6b9267e","target":"record","created_at":"2026-07-05T03:46:02Z","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":"f08a5aef55084b1d8cd1ad9ddaaf8049ac2b4c6f89dda4933091c64c49aaaca6","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-06-01T13:34:00Z","title_canon_sha256":"39b2bab8b0068e37b5799f69512caa5550f9d1de05ce1cec677d6fd8cf62ba01"},"schema_version":"1.0","source":{"id":"2106.00480","kind":"arxiv","version":2}},"canonical_sha256":"e9644a10cd20098c2b147e24650be95d06441c32e3d28d58e94bcb3ff52e8244","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9644a10cd20098c2b147e24650be95d06441c32e3d28d58e94bcb3ff52e8244","first_computed_at":"2026-07-05T03:46:02.342676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:46:02.342676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2zY9D6NNrQoHxkR2GLWvxnwtTDsdSpa716p0CONTpfO3KTDEnn8PTeppdeBoIXGanetBf5ksRvGCaAax6UPVAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:46:02.343102Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.00480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18d38d54c8c208bb9623019264e9521dfb91500c8a4c293afc3e6485c6b9267e","sha256:6a9893b564adcfab2b82ed7e1d7a4c709785d69ad592657a64cf1190fb861dbc"],"state_sha256":"eeb0ad77adb28c9eacde43b926ebd0adb7a3a3e2e3e39fbc4c769e0294b165c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWJO4j18FLpSG4xu4U2sZZUY3uhbJVy+Vz5PMUpL3YW+9KHRMCMTF8vZluOdJnY7+k2qkVxNqPU13Vd7adcfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T22:52:13.916978Z","bundle_sha256":"a4c5179866247afc65516c4fd16d212e5f30e1257ef53029dfaba298238c97ab"}}