{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q7OWJOZCYTINCGV7R2FTYYD7KU","short_pith_number":"pith:Q7OWJOZC","schema_version":"1.0","canonical_sha256":"87dd64bb22c4d0d11abf8e8b3c607f55186dbddde4f2624d3d93509ef9d225b5","source":{"kind":"arxiv","id":"1801.02594","version":1},"attestation_state":"computed","paper":{"title":"Utility Optimal Scheduling for Coded Caching in General Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asma Ghorbel, Mari Kobayashi, Richard Combes, Sheng Yang","submitted_at":"2018-01-08T18:13:20Z","abstract_excerpt":"We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand performs poorly especially in the regime of a large number of users due to a vanishing multicast rate. We overcome this detrimental effect by a careful design of opportunistic scheduling policies such that some utility function of the long-term average rates should be maximized while balancing fairness among users. In particular, we propose a threshold-based sc"},"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":"1801.02594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T18:13:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b59877a5bd807cbe8c99fc45bebf36c167def61c1152599b035c814ce8be915","abstract_canon_sha256":"8cdacfa9b1866f52b051e4650202c140613577806268042e701a41d1b707e8ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:07.165244Z","signature_b64":"4OmEZ3mAubHDNlatnN7Ow/f0BRwHsOPLBTazaFyryfUlgHLQ/9v8JHwomVbo9uqIElPVhrv/SiyNkpq0P2EDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87dd64bb22c4d0d11abf8e8b3c607f55186dbddde4f2624d3d93509ef9d225b5","last_reissued_at":"2026-05-18T00:26:07.164497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:07.164497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utility Optimal Scheduling for Coded Caching in General Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asma Ghorbel, Mari Kobayashi, Richard Combes, Sheng Yang","submitted_at":"2018-01-08T18:13:20Z","abstract_excerpt":"We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand performs poorly especially in the regime of a large number of users due to a vanishing multicast rate. We overcome this detrimental effect by a careful design of opportunistic scheduling policies such that some utility function of the long-term average rates should be maximized while balancing fairness among users. In particular, we propose a threshold-based sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02594","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.02594","created_at":"2026-05-18T00:26:07.164630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02594v1","created_at":"2026-05-18T00:26:07.164630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02594","created_at":"2026-05-18T00:26:07.164630+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7OWJOZCYTIN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7OWJOZCYTINCGV7","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7OWJOZC","created_at":"2026-05-18T12:32:46.962924+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/Q7OWJOZCYTINCGV7R2FTYYD7KU","json":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU.json","graph_json":"https://pith.science/api/pith-number/Q7OWJOZCYTINCGV7R2FTYYD7KU/graph.json","events_json":"https://pith.science/api/pith-number/Q7OWJOZCYTINCGV7R2FTYYD7KU/events.json","paper":"https://pith.science/paper/Q7OWJOZC"},"agent_actions":{"view_html":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU","download_json":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU.json","view_paper":"https://pith.science/paper/Q7OWJOZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02594&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7OWJOZCYTINCGV7R2FTYYD7KU/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7OWJOZCYTINCGV7R2FTYYD7KU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU/action/storage_attestation","attest_author":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU/action/author_attestation","sign_citation":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU/action/citation_signature","submit_replication":"https://pith.science/pith/Q7OWJOZCYTINCGV7R2FTYYD7KU/action/replication_record"}},"created_at":"2026-05-18T00:26:07.164630+00:00","updated_at":"2026-05-18T00:26:07.164630+00:00"}