{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WT7YEH5EYDWDLYZ6CBECUNERXX","short_pith_number":"pith:WT7YEH5E","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"},"canonical_sha256":"b4ff821fa4c0ec35e33e10482a3491bdcb7ea85f9aedd1580acac726d977296e","source":{"kind":"arxiv","id":"1709.06462","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06462","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06462v3","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06462","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"WT7YEH5EYDWD","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WT7YEH5EYDWDLYZ6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WT7YEH5E","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WT7YEH5EYDWDLYZ6CBECUNERXX","target":"record","payload":{"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"},"canonical_sha256":"b4ff821fa4c0ec35e33e10482a3491bdcb7ea85f9aedd1580acac726d977296e","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"},"source_kind":"arxiv","source_id":"1709.06462","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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Y8v6FoXBc5tRuXAcPrs9vv603/WQlNVM+I9yRsPFOcNEFiofQEeGHvhvR7A8Tt42rp0j0EW4g8jdX/SE7kmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:06:42.526795Z"},"content_sha256":"8cd3f5d41dfe86887a5b11c453c74b611435e546972b2e369de7de7849c2a6ea","schema_version":"1.0","event_id":"sha256:8cd3f5d41dfe86887a5b11c453c74b611435e546972b2e369de7de7849c2a6ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WT7YEH5EYDWDLYZ6CBECUNERXX","target":"graph","payload":{"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"},"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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vRMft+7M/Gn2GKV3LXLY3pqsuc7/hKw29TghcYOGJfuK14iLGoZU4BfXYVLRZ2wjON0DuP3KcisHLLrRIV0ICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:06:42.527468Z"},"content_sha256":"492de2df37a0ede5eef6ff0e438448d7a0baf9cf56be15e7f2eb50a23fe9a488","schema_version":"1.0","event_id":"sha256:492de2df37a0ede5eef6ff0e438448d7a0baf9cf56be15e7f2eb50a23fe9a488"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/bundle.json","state_url":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/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-25T21:06:42Z","links":{"resolver":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX","bundle":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/bundle.json","state":"https://pith.science/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WT7YEH5EYDWDLYZ6CBECUNERXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WT7YEH5EYDWDLYZ6CBECUNERXX","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":"07942784f1d2ea6e54cf08b753364a60a9a50f27cd6fea4c583aabc5e033ea6d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-19T14:41:01Z","title_canon_sha256":"f4723ff77264fc085cbe5dbdecd6fc7a8cc932716ade3ef1b9c51664d330d075"},"schema_version":"1.0","source":{"id":"1709.06462","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06462","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06462v3","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06462","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"WT7YEH5EYDWD","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WT7YEH5EYDWDLYZ6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WT7YEH5E","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:492de2df37a0ede5eef6ff0e438448d7a0baf9cf56be15e7f2eb50a23fe9a488","target":"graph","created_at":"2026-05-18T00:11:18Z","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":"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","authors_text":"Giuseppe Caire, Hui Liu, Sian Jin, Ying Cui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-19T14:41:01Z","title":"Uncoded Placement Optimization for Coded Delivery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06462","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:8cd3f5d41dfe86887a5b11c453c74b611435e546972b2e369de7de7849c2a6ea","target":"record","created_at":"2026-05-18T00:11:18Z","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":"07942784f1d2ea6e54cf08b753364a60a9a50f27cd6fea4c583aabc5e033ea6d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-19T14:41:01Z","title_canon_sha256":"f4723ff77264fc085cbe5dbdecd6fc7a8cc932716ade3ef1b9c51664d330d075"},"schema_version":"1.0","source":{"id":"1709.06462","kind":"arxiv","version":3}},"canonical_sha256":"b4ff821fa4c0ec35e33e10482a3491bdcb7ea85f9aedd1580acac726d977296e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4ff821fa4c0ec35e33e10482a3491bdcb7ea85f9aedd1580acac726d977296e","first_computed_at":"2026-05-18T00:11:18.655213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:18.655213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izoaVFKwCYK2CH2CgNdDizFbNoNhBgIXBV+4tu8ziMMrFHsGDyxwEgIjXyacR3it+1zO3IhNIrTovYCYCORMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:18.655929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06462","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cd3f5d41dfe86887a5b11c453c74b611435e546972b2e369de7de7849c2a6ea","sha256:492de2df37a0ede5eef6ff0e438448d7a0baf9cf56be15e7f2eb50a23fe9a488"],"state_sha256":"a30bc3155a76e7534fce1de859eb60b0f09f847e6bee02202c7f514b9f8f6815"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbUofC5t1KpdGLouYjLgGFhN0C9yh3MdhyPoFaGcH8lmgpPynAr5YMGW52bWbWMO6CJqPiiShpP1BlsGdazmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:06:42.531371Z","bundle_sha256":"41676f83523713fcb65f7b0f31d6395fa3185942e36c1ccf09d37a004c60d123"}}