{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YPXS76RFYIAQU4SFLSDFCFVJDI","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":"a7d7275dacc19560b8cc57b283e0744feec0a9a17ed683c9e018273128cd8525","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-13T13:07:05Z","title_canon_sha256":"9180b8220f79752d404c7695757cc44eac5e13123fc4059d9b7ad5e8c8a84770"},"schema_version":"1.0","source":{"id":"1901.04476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04476","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04476v1","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04476","created_at":"2026-05-17T23:56:22Z"},{"alias_kind":"pith_short_12","alias_value":"YPXS76RFYIAQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YPXS76RFYIAQU4SF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YPXS76RF","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fb95b4c5c030120f38fce4b8ccb016b7226d56c57568339fe749ac58b58db85d","target":"graph","created_at":"2026-05-17T23:56:22Z","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":"In this paper, we investigate the problem of asynchronous coded caching in fog radio access networks (F-RANs). To minimize the fronthaul load, the encoding set collapsing rule and encoding set partition method are proposed to establish the relationship between the coded-multicasting contents for asynchronous and synchronous coded caching. Furthermore, a decentralized asynchronous coded caching scheme is proposed, which provides asynchronous and synchronous transmission methods for different delay requirements. The closed-form expression of the fronthaul load is established for the special case","authors_text":"Fu-Chun Zheng, Mehdi Bennis, Wenlong Huang, Yanxiang Jiang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-13T13:07:05Z","title":"Decentralized Asynchronous Coded Caching Design and Performance Analysis in Fog Radio Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04476","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:5170577ccf7edb8551afda1b4dd73fb9319e2af7f4e927e4a300e0705d083750","target":"record","created_at":"2026-05-17T23:56:22Z","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":"a7d7275dacc19560b8cc57b283e0744feec0a9a17ed683c9e018273128cd8525","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-13T13:07:05Z","title_canon_sha256":"9180b8220f79752d404c7695757cc44eac5e13123fc4059d9b7ad5e8c8a84770"},"schema_version":"1.0","source":{"id":"1901.04476","kind":"arxiv","version":1}},"canonical_sha256":"c3ef2ffa25c2010a72455c865116a91a038684b176da74182903eb4c9835a3f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3ef2ffa25c2010a72455c865116a91a038684b176da74182903eb4c9835a3f3","first_computed_at":"2026-05-17T23:56:22.549247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:22.549247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nc7Nu1crMw3CtQnTFnWESY8gpUase3yQzGOXClWELmU0KZT1wE/sQuSkp7ppc5qENP+bBIBdFp7uddfb2SfODA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:22.549916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5170577ccf7edb8551afda1b4dd73fb9319e2af7f4e927e4a300e0705d083750","sha256:fb95b4c5c030120f38fce4b8ccb016b7226d56c57568339fe749ac58b58db85d"],"state_sha256":"abb380feb3569acfad959f5a23d577f6c3b0ae25ed245c6ede1f02bdf2e75d1d"}