{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J32J35WJUATEFVBBC7NMRBRJRQ","short_pith_number":"pith:J32J35WJ","schema_version":"1.0","canonical_sha256":"4ef49df6c9a02642d42117dac886298c1208d8b2643d72a53def9b2508415298","source":{"kind":"arxiv","id":"1806.09094","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Asynchronous Coded Caching in Fog-RAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fu-Chun Zheng, Haris Gacanin, Mehdi Bennis, Wenlong Huang, Xiaohu You, Yanxiang Jiang","submitted_at":"2018-06-24T07:07:07Z","abstract_excerpt":"In this paper, we investigate asynchronous coded caching in fog radio access networks (F-RAN). 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 in 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 simulation results show that our proposed scheme creates considerable coded-multicasting opportun"},"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":"1806.09094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T07:07:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c76dc842f80e5152357a92d2699185784efad677ba34a5e1cb1a239726f9064","abstract_canon_sha256":"a546bf3d6b547ba04aaec795cd7b550e84c39565c0971efaf7578166c40b083b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:30.352433Z","signature_b64":"8JYzOrUPKKgo6zKfPdOoDUpS895PqTNVVHazGS6ej34bKZNEEF9rMzjwTjJ8K+JLuk371z23komsiMusKsm0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef49df6c9a02642d42117dac886298c1208d8b2643d72a53def9b2508415298","last_reissued_at":"2026-05-18T00:12:30.351746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:30.351746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Asynchronous Coded Caching in Fog-RAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fu-Chun Zheng, Haris Gacanin, Mehdi Bennis, Wenlong Huang, Xiaohu You, Yanxiang Jiang","submitted_at":"2018-06-24T07:07:07Z","abstract_excerpt":"In this paper, we investigate asynchronous coded caching in fog radio access networks (F-RAN). 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 in 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 simulation results show that our proposed scheme creates considerable coded-multicasting opportun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09094","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":"1806.09094","created_at":"2026-05-18T00:12:30.351861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09094v1","created_at":"2026-05-18T00:12:30.351861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09094","created_at":"2026-05-18T00:12:30.351861+00:00"},{"alias_kind":"pith_short_12","alias_value":"J32J35WJUATE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J32J35WJUATEFVBB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J32J35WJ","created_at":"2026-05-18T12:32:31.084164+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/J32J35WJUATEFVBBC7NMRBRJRQ","json":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ.json","graph_json":"https://pith.science/api/pith-number/J32J35WJUATEFVBBC7NMRBRJRQ/graph.json","events_json":"https://pith.science/api/pith-number/J32J35WJUATEFVBBC7NMRBRJRQ/events.json","paper":"https://pith.science/paper/J32J35WJ"},"agent_actions":{"view_html":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ","download_json":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ.json","view_paper":"https://pith.science/paper/J32J35WJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09094&json=true","fetch_graph":"https://pith.science/api/pith-number/J32J35WJUATEFVBBC7NMRBRJRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/J32J35WJUATEFVBBC7NMRBRJRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/action/storage_attestation","attest_author":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/action/author_attestation","sign_citation":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/action/citation_signature","submit_replication":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/action/replication_record"}},"created_at":"2026-05-18T00:12:30.351861+00:00","updated_at":"2026-05-18T00:12:30.351861+00:00"}