{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HQMKAYCKI3W7YCKHGIVRUHLNUJ","short_pith_number":"pith:HQMKAYCK","canonical_record":{"source":{"id":"1804.00807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T03:42:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eefc93f2a229b85e0219acf0d506af4340a80bc2560b93b98d0ca4b3ad303ac0","abstract_canon_sha256":"30d991e5225d69b3aa3c6591511c425002d7f853de0b128e5036a6e8f3b94e73"},"schema_version":"1.0"},"canonical_sha256":"3c18a0604a46edfc0947322b1a1d6da264d0c085a5198fcc5682831987c267df","source":{"kind":"arxiv","id":"1804.00807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00807","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00807v1","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00807","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"HQMKAYCKI3W7","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HQMKAYCKI3W7YCKH","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HQMKAYCK","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HQMKAYCKI3W7YCKHGIVRUHLNUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T03:42:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eefc93f2a229b85e0219acf0d506af4340a80bc2560b93b98d0ca4b3ad303ac0","abstract_canon_sha256":"30d991e5225d69b3aa3c6591511c425002d7f853de0b128e5036a6e8f3b94e73"},"schema_version":"1.0"},"canonical_sha256":"3c18a0604a46edfc0947322b1a1d6da264d0c085a5198fcc5682831987c267df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:32.101784Z","signature_b64":"DC3tsm2fbvutYi/Cf4odrbdMozGBiDHmc11J83WLfCE62Td/J/dOprfjRMN7iX8vv8qTwPOFiCjoj/UZWsSSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c18a0604a46edfc0947322b1a1d6da264d0c085a5198fcc5682831987c267df","last_reissued_at":"2026-05-18T00:19:32.101194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:32.101194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00807","source_version":1,"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:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1f42PJyu+o+IT5RQUw6tImDGuLAJsMWWFCnYqkB3GTLlGlVlSdGD9eg92PQ5UpuLj8r1TvV1dcEYKe751ebeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:40:58.613008Z"},"content_sha256":"2795dd3d54e652918cca3a0be314b983c3d0eed1779a92af814fb9836ed101cc","schema_version":"1.0","event_id":"sha256:2795dd3d54e652918cca3a0be314b983c3d0eed1779a92af814fb9836ed101cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HQMKAYCKI3W7YCKHGIVRUHLNUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ian Blake, Lutz Lampe, Seyed Ali Saberali","submitted_at":"2018-04-03T03:42:24Z","abstract_excerpt":"We investigate the problem of coded caching for nonuniform demands when the structured clique cover algorithm proposed by Maddah-Ali and Niesen for decentralized caching is used for delivery. We apply this algorithm to all user demands regardless of their request probabilities. This allows for coding among the files that have different request probabilities but makes the allocation of memory to different files challenging during the content placement phase. As our main contribution, we analytically characterize the optimal placement strategy that minimizes the expected delivery rate under a st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00807","kind":"arxiv","version":1},"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:19:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NTCGFYOL+Y0o0AOSQWH8rVSA6hqsQnHLlHGPUZwGM0g2OXgRNtDfgeZkvP6W7kfIyfGjpT0oYq0Vnf8Iu3PAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:40:58.613375Z"},"content_sha256":"bb7f168139da0237b9abc6ad5312494f9f16bed38ade0021216a8fd97e2794f2","schema_version":"1.0","event_id":"sha256:bb7f168139da0237b9abc6ad5312494f9f16bed38ade0021216a8fd97e2794f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQMKAYCKI3W7YCKHGIVRUHLNUJ/bundle.json","state_url":"https://pith.science/pith/HQMKAYCKI3W7YCKHGIVRUHLNUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQMKAYCKI3W7YCKHGIVRUHLNUJ/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-24T16:40:58Z","links":{"resolver":"https://pith.science/pith/HQMKAYCKI3W7YCKHGIVRUHLNUJ","bundle":"https://pith.science/pith/HQMKAYCKI3W7YCKHGIVRUHLNUJ/bundle.json","state":"https://pith.science/pith/HQMKAYCKI3W7YCKHGIVRUHLNUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQMKAYCKI3W7YCKHGIVRUHLNUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HQMKAYCKI3W7YCKHGIVRUHLNUJ","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":"30d991e5225d69b3aa3c6591511c425002d7f853de0b128e5036a6e8f3b94e73","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T03:42:24Z","title_canon_sha256":"eefc93f2a229b85e0219acf0d506af4340a80bc2560b93b98d0ca4b3ad303ac0"},"schema_version":"1.0","source":{"id":"1804.00807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00807","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00807v1","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00807","created_at":"2026-05-18T00:19:32Z"},{"alias_kind":"pith_short_12","alias_value":"HQMKAYCKI3W7","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HQMKAYCKI3W7YCKH","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HQMKAYCK","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:bb7f168139da0237b9abc6ad5312494f9f16bed38ade0021216a8fd97e2794f2","target":"graph","created_at":"2026-05-18T00:19:32Z","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 investigate the problem of coded caching for nonuniform demands when the structured clique cover algorithm proposed by Maddah-Ali and Niesen for decentralized caching is used for delivery. We apply this algorithm to all user demands regardless of their request probabilities. This allows for coding among the files that have different request probabilities but makes the allocation of memory to different files challenging during the content placement phase. As our main contribution, we analytically characterize the optimal placement strategy that minimizes the expected delivery rate under a st","authors_text":"Ian Blake, Lutz Lampe, Seyed Ali Saberali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T03:42:24Z","title":"Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00807","kind":"arxiv","version":1},"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:2795dd3d54e652918cca3a0be314b983c3d0eed1779a92af814fb9836ed101cc","target":"record","created_at":"2026-05-18T00:19:32Z","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":"30d991e5225d69b3aa3c6591511c425002d7f853de0b128e5036a6e8f3b94e73","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-03T03:42:24Z","title_canon_sha256":"eefc93f2a229b85e0219acf0d506af4340a80bc2560b93b98d0ca4b3ad303ac0"},"schema_version":"1.0","source":{"id":"1804.00807","kind":"arxiv","version":1}},"canonical_sha256":"3c18a0604a46edfc0947322b1a1d6da264d0c085a5198fcc5682831987c267df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c18a0604a46edfc0947322b1a1d6da264d0c085a5198fcc5682831987c267df","first_computed_at":"2026-05-18T00:19:32.101194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:32.101194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DC3tsm2fbvutYi/Cf4odrbdMozGBiDHmc11J83WLfCE62Td/J/dOprfjRMN7iX8vv8qTwPOFiCjoj/UZWsSSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:32.101784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2795dd3d54e652918cca3a0be314b983c3d0eed1779a92af814fb9836ed101cc","sha256:bb7f168139da0237b9abc6ad5312494f9f16bed38ade0021216a8fd97e2794f2"],"state_sha256":"cd0551fe6981625451157eaaa16f9a18e90bfc676d50848201201b9bfc9f22ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsbAbD2hxQ1z3NG0ENoAVYOPNn0DvKkkZPm2XzMa5dntPHVz0OJx7vOpCh/M8IQSAwy/0kDwBy2qZzWg/xK/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:40:58.615302Z","bundle_sha256":"c9ae778e78703d87d393dde09a2912065632d2e441ae9341bdd27446831eff96"}}