{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YO4TGC7VFK3JOKPNYPKWCGR6LK","short_pith_number":"pith:YO4TGC7V","canonical_record":{"source":{"id":"1708.06650","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T14:40:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c314cceed525a2ec6a445e74bc28bcc2e1242460bf7d6ebb142f6742c748ab2","abstract_canon_sha256":"e1eae9b92bb96784f7cc4c721c45d3dba6dab5c47b78b589a8574e30f9ae4970"},"schema_version":"1.0"},"canonical_sha256":"c3b9330bf52ab69729edc3d5611a3e5a9c244667d07ab4240975ee288cba51c6","source":{"kind":"arxiv","id":"1708.06650","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06650","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06650v3","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06650","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"YO4TGC7VFK3J","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YO4TGC7VFK3JOKPN","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YO4TGC7V","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YO4TGC7VFK3JOKPNYPKWCGR6LK","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06650","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T14:40:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c314cceed525a2ec6a445e74bc28bcc2e1242460bf7d6ebb142f6742c748ab2","abstract_canon_sha256":"e1eae9b92bb96784f7cc4c721c45d3dba6dab5c47b78b589a8574e30f9ae4970"},"schema_version":"1.0"},"canonical_sha256":"c3b9330bf52ab69729edc3d5611a3e5a9c244667d07ab4240975ee288cba51c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:35.100592Z","signature_b64":"9qkbtHBw0CmiPHdqUgiDb0n3k8qrgzINnnSMp+u26kVGKVdyVO6WNN3t+ma0BTpAo9tU/mbKb/VntyC4iBBgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3b9330bf52ab69729edc3d5611a3e5a9c244667d07ab4240975ee288cba51c6","last_reissued_at":"2026-05-18T00:12:35.100002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:35.100002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06650","source_version":3,"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:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDu4jfbY6u8FTYvAagQoLhibYbubCJVm8AEqZlWTmwvq9XPc2gC80Kmu9W20mt3lpHSHdn5YFcU7xDOGTxjNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:45:14.919780Z"},"content_sha256":"fcc3caacf70f562bbc0293a10e7a4060eced14bbaf2d76455272951a5cfcc855","schema_version":"1.0","event_id":"sha256:fcc3caacf70f562bbc0293a10e7a4060eced14bbaf2d76455272951a5cfcc855"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YO4TGC7VFK3JOKPNYPKWCGR6LK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of Coded Caching Schemes with Flexible Memory Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jing Jiang, Minquan Cheng, Qifa Yan, Xiaohu Tang","submitted_at":"2017-08-22T14:40:00Z","abstract_excerpt":"Coded caching scheme recently has become quite popular in the wireless network due to its effectively reducing the transmission amount (denote such an amount by $R$) during peak traffic times. However to realize a coded caching scheme, each file must be divided into $F$ packets which usually increases the computation complexity of a coded caching scheme. So we prefer to construct a caching scheme that decreases the order of $F$ for practical implementations.\n  In this paper, we construct four classes of new schemes where two classes can significantly reduce the value of $F$ by increasing a lit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06650","kind":"arxiv","version":3},"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:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NhMy9Tghomm+vU/mf9Nfc9C7/pDKii6QlT9rdoA7rB/SRdnn08rvjoAlA++IyxArq3MG3Fd4yui5IIcdrW2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:45:14.920206Z"},"content_sha256":"4ae54a9f47559d0d39e22933d00b362f709117c8980df1b4c1b2b76e246835ee","schema_version":"1.0","event_id":"sha256:4ae54a9f47559d0d39e22933d00b362f709117c8980df1b4c1b2b76e246835ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/bundle.json","state_url":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/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-05-30T19:45:14Z","links":{"resolver":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK","bundle":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/bundle.json","state":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YO4TGC7VFK3JOKPNYPKWCGR6LK","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":"e1eae9b92bb96784f7cc4c721c45d3dba6dab5c47b78b589a8574e30f9ae4970","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T14:40:00Z","title_canon_sha256":"3c314cceed525a2ec6a445e74bc28bcc2e1242460bf7d6ebb142f6742c748ab2"},"schema_version":"1.0","source":{"id":"1708.06650","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06650","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06650v3","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06650","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"YO4TGC7VFK3J","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YO4TGC7VFK3JOKPN","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YO4TGC7V","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:4ae54a9f47559d0d39e22933d00b362f709117c8980df1b4c1b2b76e246835ee","target":"graph","created_at":"2026-05-18T00:12:35Z","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 scheme recently has become quite popular in the wireless network due to its effectively reducing the transmission amount (denote such an amount by $R$) during peak traffic times. However to realize a coded caching scheme, each file must be divided into $F$ packets which usually increases the computation complexity of a coded caching scheme. So we prefer to construct a caching scheme that decreases the order of $F$ for practical implementations.\n  In this paper, we construct four classes of new schemes where two classes can significantly reduce the value of $F$ by increasing a lit","authors_text":"Jing Jiang, Minquan Cheng, Qifa Yan, Xiaohu Tang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T14:40:00Z","title":"Constructions of Coded Caching Schemes with Flexible Memory Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06650","kind":"arxiv","version":3},"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:fcc3caacf70f562bbc0293a10e7a4060eced14bbaf2d76455272951a5cfcc855","target":"record","created_at":"2026-05-18T00:12:35Z","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":"e1eae9b92bb96784f7cc4c721c45d3dba6dab5c47b78b589a8574e30f9ae4970","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-22T14:40:00Z","title_canon_sha256":"3c314cceed525a2ec6a445e74bc28bcc2e1242460bf7d6ebb142f6742c748ab2"},"schema_version":"1.0","source":{"id":"1708.06650","kind":"arxiv","version":3}},"canonical_sha256":"c3b9330bf52ab69729edc3d5611a3e5a9c244667d07ab4240975ee288cba51c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3b9330bf52ab69729edc3d5611a3e5a9c244667d07ab4240975ee288cba51c6","first_computed_at":"2026-05-18T00:12:35.100002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:35.100002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9qkbtHBw0CmiPHdqUgiDb0n3k8qrgzINnnSMp+u26kVGKVdyVO6WNN3t+ma0BTpAo9tU/mbKb/VntyC4iBBgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:35.100592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06650","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcc3caacf70f562bbc0293a10e7a4060eced14bbaf2d76455272951a5cfcc855","sha256:4ae54a9f47559d0d39e22933d00b362f709117c8980df1b4c1b2b76e246835ee"],"state_sha256":"7115560c47437a99d35f9b5fb5b89e884b2a380e4d693d839b7d0e87f2284867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wqDFSsZ9MBNJ9Iy7t1UYl0TB6Mcf2kWeQQBiB7WVCXH2oCUIUGj3hGh+62bijnDA8Gke2TpPFBb+XWpF/EcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:45:14.922868Z","bundle_sha256":"1756c427538b7d70e25f2a5b96378cb3e9d5c682490c706d4158611a840c5208"}}