{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OHAF5PC2W3HKWQQB3LHVIT5I6R","short_pith_number":"pith:OHAF5PC2","canonical_record":{"source":{"id":"1810.06017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-14T11:29:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2269470cba639c6578c146196c9a5935f78063318fda6ea10a8191dd57e222e2","abstract_canon_sha256":"0718dcc777681178b1213c81c6bb9997f49321ca9da45f763455f263dec6abbd"},"schema_version":"1.0"},"canonical_sha256":"71c05ebc5ab6ceab4201dacf544fa8f45fbc168d703a0a223bca1e15e54b6ba7","source":{"kind":"arxiv","id":"1810.06017","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06017","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06017v2","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06017","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"OHAF5PC2W3HK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OHAF5PC2W3HKWQQB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OHAF5PC2","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OHAF5PC2W3HKWQQB3LHVIT5I6R","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-14T11:29:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2269470cba639c6578c146196c9a5935f78063318fda6ea10a8191dd57e222e2","abstract_canon_sha256":"0718dcc777681178b1213c81c6bb9997f49321ca9da45f763455f263dec6abbd"},"schema_version":"1.0"},"canonical_sha256":"71c05ebc5ab6ceab4201dacf544fa8f45fbc168d703a0a223bca1e15e54b6ba7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:59.265716Z","signature_b64":"AYzNMgsNkm9D7366NbZhLluNkm8l3rUBm0V9MXt5gcpPSagnqGv8ZNsHWptQGkMiLiyK4Fil43G+PZ8SJMj5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71c05ebc5ab6ceab4201dacf544fa8f45fbc168d703a0a223bca1e15e54b6ba7","last_reissued_at":"2026-05-18T00:02:59.265137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:59.265137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06017","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-05-18T00:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOXwNO4MgsSpx5Vnvs6qpkVIXTOMsS8YJaBdLqV2tZ0pQlVSqMuF+n4iEGNm5UGcUqF69P+MJVInMJtXjVh8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:53:00.520178Z"},"content_sha256":"9c121ffbff479cba3caabfeb029f2e6db0618946fe6b0a48295f27f56d6c18a0","schema_version":"1.0","event_id":"sha256:9c121ffbff479cba3caabfeb029f2e6db0618946fe6b0a48295f27f56d6c18a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OHAF5PC2W3HKWQQB3LHVIT5I6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Coded Caching Scheme for Centralized Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Li, Minquan Cheng, Ruizhong Wei, Xiaohu Tang","submitted_at":"2018-10-14T11:29:25Z","abstract_excerpt":"Coded caching systems have been widely studied to reduce the data transmission during the peak traffic time. In practice, two important parameters of a coded caching system should be considered, i.e., the rate which is the maximum amount of the data transmission during the peak traffic time, and the subpacketization level, the number of divided packets of each file when we implement a coded caching scheme. We prefer to design a scheme with rate and packet number as small as possible since they reflect the transmission efficiency and complexity of the caching scheme, respectively.\n  In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06017","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":""},"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-18T00:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFQZEB4kZPzgzU1WvIQkRaOuTIwZvE+RDrgnY3ePAomLn+LZB9zEDI+mPvJ9hAEUMTFBk0ZCofKRC1qn5VuCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:53:00.520529Z"},"content_sha256":"79e59a85a1942d68e7b9893e4f53678a56742ebff7d8bdf197520ecd84155cf2","schema_version":"1.0","event_id":"sha256:79e59a85a1942d68e7b9893e4f53678a56742ebff7d8bdf197520ecd84155cf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHAF5PC2W3HKWQQB3LHVIT5I6R/bundle.json","state_url":"https://pith.science/pith/OHAF5PC2W3HKWQQB3LHVIT5I6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHAF5PC2W3HKWQQB3LHVIT5I6R/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-02T23:53:00Z","links":{"resolver":"https://pith.science/pith/OHAF5PC2W3HKWQQB3LHVIT5I6R","bundle":"https://pith.science/pith/OHAF5PC2W3HKWQQB3LHVIT5I6R/bundle.json","state":"https://pith.science/pith/OHAF5PC2W3HKWQQB3LHVIT5I6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHAF5PC2W3HKWQQB3LHVIT5I6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OHAF5PC2W3HKWQQB3LHVIT5I6R","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":"0718dcc777681178b1213c81c6bb9997f49321ca9da45f763455f263dec6abbd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-14T11:29:25Z","title_canon_sha256":"2269470cba639c6578c146196c9a5935f78063318fda6ea10a8191dd57e222e2"},"schema_version":"1.0","source":{"id":"1810.06017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06017","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06017v2","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06017","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"OHAF5PC2W3HK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OHAF5PC2W3HKWQQB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OHAF5PC2","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:79e59a85a1942d68e7b9893e4f53678a56742ebff7d8bdf197520ecd84155cf2","target":"graph","created_at":"2026-05-18T00:02:59Z","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":"Coded caching systems have been widely studied to reduce the data transmission during the peak traffic time. In practice, two important parameters of a coded caching system should be considered, i.e., the rate which is the maximum amount of the data transmission during the peak traffic time, and the subpacketization level, the number of divided packets of each file when we implement a coded caching scheme. We prefer to design a scheme with rate and packet number as small as possible since they reflect the transmission efficiency and complexity of the caching scheme, respectively.\n  In this pap","authors_text":"Jie Li, Minquan Cheng, Ruizhong Wei, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-14T11:29:25Z","title":"Linear Coded Caching Scheme for Centralized Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06017","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:9c121ffbff479cba3caabfeb029f2e6db0618946fe6b0a48295f27f56d6c18a0","target":"record","created_at":"2026-05-18T00:02:59Z","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":"0718dcc777681178b1213c81c6bb9997f49321ca9da45f763455f263dec6abbd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-14T11:29:25Z","title_canon_sha256":"2269470cba639c6578c146196c9a5935f78063318fda6ea10a8191dd57e222e2"},"schema_version":"1.0","source":{"id":"1810.06017","kind":"arxiv","version":2}},"canonical_sha256":"71c05ebc5ab6ceab4201dacf544fa8f45fbc168d703a0a223bca1e15e54b6ba7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71c05ebc5ab6ceab4201dacf544fa8f45fbc168d703a0a223bca1e15e54b6ba7","first_computed_at":"2026-05-18T00:02:59.265137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:59.265137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYzNMgsNkm9D7366NbZhLluNkm8l3rUBm0V9MXt5gcpPSagnqGv8ZNsHWptQGkMiLiyK4Fil43G+PZ8SJMj5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:59.265716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c121ffbff479cba3caabfeb029f2e6db0618946fe6b0a48295f27f56d6c18a0","sha256:79e59a85a1942d68e7b9893e4f53678a56742ebff7d8bdf197520ecd84155cf2"],"state_sha256":"3497554a8d8b987289f33b0dbdc3dd08f894a85a38b9fccfdf458731e2da7c09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DD8+vI77rndqpaOxCTMTvy7GkIu+jrCaKNth10UFUdAATzaqvBbp7a9huHCmfzfx3m//JEOwcGzfnxPUC+VBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:53:00.522537Z","bundle_sha256":"09d82dc47014ddc44ed16a3d2ee3516ebfabea7d5aa047f78dd7928213c13653"}}