{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5IQZNPMAM3GJPQFUPUAOYADIJG","short_pith_number":"pith:5IQZNPMA","canonical_record":{"source":{"id":"1608.03989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-13T14:43:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1442d6d73ca2a3ccd70f8d4426087f5d5f23260ab151c80d14bd3466dc3fbbb","abstract_canon_sha256":"e7505adf0c5a8c83e3c55c93eeca919c9b1dfc5674eb8291436e717954ca204d"},"schema_version":"1.0"},"canonical_sha256":"ea2196bd8066cc97c0b47d00ec006849932dc2a53f9c6b7eff74e36d539cddc1","source":{"kind":"arxiv","id":"1608.03989","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03989","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03989v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03989","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"5IQZNPMAM3GJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5IQZNPMAM3GJPQFU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5IQZNPMA","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5IQZNPMAM3GJPQFUPUAOYADIJG","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-13T14:43:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1442d6d73ca2a3ccd70f8d4426087f5d5f23260ab151c80d14bd3466dc3fbbb","abstract_canon_sha256":"e7505adf0c5a8c83e3c55c93eeca919c9b1dfc5674eb8291436e717954ca204d"},"schema_version":"1.0"},"canonical_sha256":"ea2196bd8066cc97c0b47d00ec006849932dc2a53f9c6b7eff74e36d539cddc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:04.491264Z","signature_b64":"Dk97p8ZnIejufWtAE38OYYtFQAKoeMadDop7cX8+Nym6s6Tvbpde+YhWfYPCVzvZqkE2i3ZxMGx2IuHOC//uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea2196bd8066cc97c0b47d00ec006849932dc2a53f9c6b7eff74e36d539cddc1","last_reissued_at":"2026-05-18T01:09:04.490227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:04.490227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03989","source_version":1,"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-05-18T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1FsRE4saPnisRN5dIoD9pnsNTo4f1kmc7UxomYu7ZcDi7eb2INXSOvi4TPYSO1CHRKazr0m39eSuQxSDx1ELCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:08:30.855511Z"},"content_sha256":"851655ef99a1b8f5aca20ab1086ec217128c04f1a73e6f5b875d865cff6f61eb","schema_version":"1.0","event_id":"sha256:851655ef99a1b8f5aca20ab1086ec217128c04f1a73e6f5b875d865cff6f61eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5IQZNPMAM3GJPQFUPUAOYADIJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Centralized coded caching schemes: A hypergraph theoretical approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chong Shangguan, Gennian Ge, Yiwei Zhang","submitted_at":"2016-08-13T14:43:58Z","abstract_excerpt":"The centralized coded caching scheme is a technique proposed by Maddah-Ali and Niesen as a solution to reduce the network burden in peak times in a wireless system. Later Yan et al. reformulated the problem as designing a corresponding placement delivery array, and proposed two new schemes from this perspective. These schemes above significantly reduce the transmission rate $R$, compared with the uncoded caching scheme. However, to implement the new schemes, each file should be cut into $F$ pieces, where $F$ increases exponentially with the number of users $K$. Such constraint is obviously inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03989","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:09:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1AqjGHegJ8wXg7E4qQTC6/BR0a5N5jawGd0EkR8/xOsSkbp/O3yfRA7Im0/+ZPbqjtQulM0wo9sj1xuW3OfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:08:30.855854Z"},"content_sha256":"7866889d91215a566fd938fc25653527656e58c16424a51e4796d6740b07da0b","schema_version":"1.0","event_id":"sha256:7866889d91215a566fd938fc25653527656e58c16424a51e4796d6740b07da0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IQZNPMAM3GJPQFUPUAOYADIJG/bundle.json","state_url":"https://pith.science/pith/5IQZNPMAM3GJPQFUPUAOYADIJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IQZNPMAM3GJPQFUPUAOYADIJG/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-06-02T11:08:30Z","links":{"resolver":"https://pith.science/pith/5IQZNPMAM3GJPQFUPUAOYADIJG","bundle":"https://pith.science/pith/5IQZNPMAM3GJPQFUPUAOYADIJG/bundle.json","state":"https://pith.science/pith/5IQZNPMAM3GJPQFUPUAOYADIJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IQZNPMAM3GJPQFUPUAOYADIJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5IQZNPMAM3GJPQFUPUAOYADIJG","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":"e7505adf0c5a8c83e3c55c93eeca919c9b1dfc5674eb8291436e717954ca204d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-13T14:43:58Z","title_canon_sha256":"e1442d6d73ca2a3ccd70f8d4426087f5d5f23260ab151c80d14bd3466dc3fbbb"},"schema_version":"1.0","source":{"id":"1608.03989","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03989","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03989v1","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03989","created_at":"2026-05-18T01:09:04Z"},{"alias_kind":"pith_short_12","alias_value":"5IQZNPMAM3GJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5IQZNPMAM3GJPQFU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5IQZNPMA","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7866889d91215a566fd938fc25653527656e58c16424a51e4796d6740b07da0b","target":"graph","created_at":"2026-05-18T01:09:04Z","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"},"paper":{"abstract_excerpt":"The centralized coded caching scheme is a technique proposed by Maddah-Ali and Niesen as a solution to reduce the network burden in peak times in a wireless system. Later Yan et al. reformulated the problem as designing a corresponding placement delivery array, and proposed two new schemes from this perspective. These schemes above significantly reduce the transmission rate $R$, compared with the uncoded caching scheme. However, to implement the new schemes, each file should be cut into $F$ pieces, where $F$ increases exponentially with the number of users $K$. Such constraint is obviously inf","authors_text":"Chong Shangguan, Gennian Ge, Yiwei Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-13T14:43:58Z","title":"Centralized coded caching schemes: A hypergraph theoretical approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03989","kind":"arxiv","version":1},"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:851655ef99a1b8f5aca20ab1086ec217128c04f1a73e6f5b875d865cff6f61eb","target":"record","created_at":"2026-05-18T01:09:04Z","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":"e7505adf0c5a8c83e3c55c93eeca919c9b1dfc5674eb8291436e717954ca204d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-13T14:43:58Z","title_canon_sha256":"e1442d6d73ca2a3ccd70f8d4426087f5d5f23260ab151c80d14bd3466dc3fbbb"},"schema_version":"1.0","source":{"id":"1608.03989","kind":"arxiv","version":1}},"canonical_sha256":"ea2196bd8066cc97c0b47d00ec006849932dc2a53f9c6b7eff74e36d539cddc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea2196bd8066cc97c0b47d00ec006849932dc2a53f9c6b7eff74e36d539cddc1","first_computed_at":"2026-05-18T01:09:04.490227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:04.490227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dk97p8ZnIejufWtAE38OYYtFQAKoeMadDop7cX8+Nym6s6Tvbpde+YhWfYPCVzvZqkE2i3ZxMGx2IuHOC//uAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:04.491264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03989","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:851655ef99a1b8f5aca20ab1086ec217128c04f1a73e6f5b875d865cff6f61eb","sha256:7866889d91215a566fd938fc25653527656e58c16424a51e4796d6740b07da0b"],"state_sha256":"020d6815f1ff01ee3a9a98f6878659245f21ffa6c9ab397b10c86150399ee860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oR55LSv/2FPDz/r5afoHdDvyar9OOVZlma75IkpS1+26VtB+zrwgVPEIKJm4l84oLaxLtYswPxBaipzEKmDxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:08:30.857695Z","bundle_sha256":"002350101723046748f7cebe896e7452a2fe71ff4870806a50908bdf63fe6f21"}}