{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YO4TGC7VFK3JOKPNYPKWCGR6LK","short_pith_number":"pith:YO4TGC7V","schema_version":"1.0","canonical_sha256":"c3b9330bf52ab69729edc3d5611a3e5a9c244667d07ab4240975ee288cba51c6","source":{"kind":"arxiv","id":"1708.06650","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.06650","created_at":"2026-05-18T00:12:35.100096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06650v3","created_at":"2026-05-18T00:12:35.100096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06650","created_at":"2026-05-18T00:12:35.100096+00:00"},{"alias_kind":"pith_short_12","alias_value":"YO4TGC7VFK3J","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YO4TGC7VFK3JOKPN","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YO4TGC7V","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK","json":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK.json","graph_json":"https://pith.science/api/pith-number/YO4TGC7VFK3JOKPNYPKWCGR6LK/graph.json","events_json":"https://pith.science/api/pith-number/YO4TGC7VFK3JOKPNYPKWCGR6LK/events.json","paper":"https://pith.science/paper/YO4TGC7V"},"agent_actions":{"view_html":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK","download_json":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK.json","view_paper":"https://pith.science/paper/YO4TGC7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06650&json=true","fetch_graph":"https://pith.science/api/pith-number/YO4TGC7VFK3JOKPNYPKWCGR6LK/graph.json","fetch_events":"https://pith.science/api/pith-number/YO4TGC7VFK3JOKPNYPKWCGR6LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/action/storage_attestation","attest_author":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/action/author_attestation","sign_citation":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/action/citation_signature","submit_replication":"https://pith.science/pith/YO4TGC7VFK3JOKPNYPKWCGR6LK/action/replication_record"}},"created_at":"2026-05-18T00:12:35.100096+00:00","updated_at":"2026-05-18T00:12:35.100096+00:00"}