{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WT7YEH5EYDWDLYZ6CBECUNERXX","short_pith_number":"pith:WT7YEH5E","schema_version":"1.0","canonical_sha256":"b4ff821fa4c0ec35e33e10482a3491bdcb7ea85f9aedd1580acac726d977296e","source":{"kind":"arxiv","id":"1709.06462","version":3},"attestation_state":"computed","paper":{"title":"Uncoded Placement Optimization for Coded Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Hui Liu, Sian Jin, Ying Cui","submitted_at":"2017-09-19T14:41:01Z","abstract_excerpt":"We consider the classical coded caching problem as defined by Maddah-Ali and Niesen, where a server with a library of $N$ files of equal size is connected to $K$ users via a shared error-free link. Each user is equipped with a cache with capacity of $M$ files. The goal is to design a static content placement and delivery scheme such that the average load over the shared link is minimized. We first present a class of centralized coded caching schemes consisting of a general content placement strategy specified by a file partition parameter, enabling efficient and flexible content placement, and"},"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":"1709.06462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-19T14:41:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4723ff77264fc085cbe5dbdecd6fc7a8cc932716ade3ef1b9c51664d330d075","abstract_canon_sha256":"07942784f1d2ea6e54cf08b753364a60a9a50f27cd6fea4c583aabc5e033ea6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:18.655929Z","signature_b64":"izoaVFKwCYK2CH2CgNdDizFbNoNhBgIXBV+4tu8ziMMrFHsGDyxwEgIjXyacR3it+1zO3IhNIrTovYCYCORMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4ff821fa4c0ec35e33e10482a3491bdcb7ea85f9aedd1580acac726d977296e","last_reissued_at":"2026-05-18T00:11:18.655213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:18.655213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncoded Placement Optimization for Coded Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Hui Liu, Sian Jin, Ying Cui","submitted_at":"2017-09-19T14:41:01Z","abstract_excerpt":"We consider the classical coded caching problem as defined by Maddah-Ali and Niesen, where a server with a library of $N$ files of equal size is connected to $K$ users via a shared error-free link. Each user is equipped with a cache with capacity of $M$ files. The goal is to design a static content placement and delivery scheme such that the average load over the shared link is minimized. We first present a class of centralized coded caching schemes consisting of a general content placement strategy specified by a file partition parameter, enabling efficient and flexible content placement, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06462","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":"1709.06462","created_at":"2026-05-18T00:11:18.655330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06462v3","created_at":"2026-05-18T00:11:18.655330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06462","created_at":"2026-05-18T00:11:18.655330+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT7YEH5EYDWD","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT7YEH5EYDWDLYZ6","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT7YEH5E","created_at":"2026-05-18T12:31:53.515858+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/WT7YEH5EYDWDLYZ6CBECUNERXX","json":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX.json","graph_json":"https://pith.science/api/pith-number/WT7YEH5EYDWDLYZ6CBECUNERXX/graph.json","events_json":"https://pith.science/api/pith-number/WT7YEH5EYDWDLYZ6CBECUNERXX/events.json","paper":"https://pith.science/paper/WT7YEH5E"},"agent_actions":{"view_html":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX","download_json":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX.json","view_paper":"https://pith.science/paper/WT7YEH5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06462&json=true","fetch_graph":"https://pith.science/api/pith-number/WT7YEH5EYDWDLYZ6CBECUNERXX/graph.json","fetch_events":"https://pith.science/api/pith-number/WT7YEH5EYDWDLYZ6CBECUNERXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/action/storage_attestation","attest_author":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/action/author_attestation","sign_citation":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/action/citation_signature","submit_replication":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/action/replication_record"}},"created_at":"2026-05-18T00:11:18.655330+00:00","updated_at":"2026-05-18T00:11:18.655330+00:00"}