{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J32J35WJUATEFVBBC7NMRBRJRQ","short_pith_number":"pith:J32J35WJ","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"},"canonical_sha256":"4ef49df6c9a02642d42117dac886298c1208d8b2643d72a53def9b2508415298","source":{"kind":"arxiv","id":"1806.09094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09094","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09094v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09094","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"J32J35WJUATE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J32J35WJUATEFVBB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J32J35WJ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J32J35WJUATEFVBBC7NMRBRJRQ","target":"record","payload":{"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"},"canonical_sha256":"4ef49df6c9a02642d42117dac886298c1208d8b2643d72a53def9b2508415298","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"},"source_kind":"arxiv","source_id":"1806.09094","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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB2KgkjSSUciiFoqW7DrAWlVG7PlM0UU0xN17seJtz6pOkukGDRdye2TCBctseAM0DkbKX7W9SPYr2040SlkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:39:12.479081Z"},"content_sha256":"44ef4bda9986d46f4561b2f9d0191b7b2ab9d0f25b9577d55e88e1a9540086da","schema_version":"1.0","event_id":"sha256:44ef4bda9986d46f4561b2f9d0191b7b2ab9d0f25b9577d55e88e1a9540086da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J32J35WJUATEFVBBC7NMRBRJRQ","target":"graph","payload":{"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"},"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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U57P7AHJfHsFFU/5KqLCp3Z8Id3yYnwfUvur5QpVl1Mrsz/vLKj5fZc02Em0WXw6mHSVf653mUVl+DAacqWdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:39:12.479469Z"},"content_sha256":"eb2e350892c6cc7f6724b614ede5f689c149c09da0a377226586f332b220fd8a","schema_version":"1.0","event_id":"sha256:eb2e350892c6cc7f6724b614ede5f689c149c09da0a377226586f332b220fd8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/bundle.json","state_url":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J32J35WJUATEFVBBC7NMRBRJRQ/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-01T14:39:12Z","links":{"resolver":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ","bundle":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/bundle.json","state":"https://pith.science/pith/J32J35WJUATEFVBBC7NMRBRJRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J32J35WJUATEFVBBC7NMRBRJRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J32J35WJUATEFVBBC7NMRBRJRQ","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":"a546bf3d6b547ba04aaec795cd7b550e84c39565c0971efaf7578166c40b083b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T07:07:07Z","title_canon_sha256":"1c76dc842f80e5152357a92d2699185784efad677ba34a5e1cb1a239726f9064"},"schema_version":"1.0","source":{"id":"1806.09094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09094","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09094v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09094","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"J32J35WJUATE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J32J35WJUATEFVBB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J32J35WJ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:eb2e350892c6cc7f6724b614ede5f689c149c09da0a377226586f332b220fd8a","target":"graph","created_at":"2026-05-18T00:12:30Z","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 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","authors_text":"Fu-Chun Zheng, Haris Gacanin, Mehdi Bennis, Wenlong Huang, Xiaohu You, Yanxiang Jiang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T07:07:07Z","title":"Decentralized Asynchronous Coded Caching in Fog-RAN"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09094","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:44ef4bda9986d46f4561b2f9d0191b7b2ab9d0f25b9577d55e88e1a9540086da","target":"record","created_at":"2026-05-18T00:12:30Z","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":"a546bf3d6b547ba04aaec795cd7b550e84c39565c0971efaf7578166c40b083b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T07:07:07Z","title_canon_sha256":"1c76dc842f80e5152357a92d2699185784efad677ba34a5e1cb1a239726f9064"},"schema_version":"1.0","source":{"id":"1806.09094","kind":"arxiv","version":1}},"canonical_sha256":"4ef49df6c9a02642d42117dac886298c1208d8b2643d72a53def9b2508415298","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ef49df6c9a02642d42117dac886298c1208d8b2643d72a53def9b2508415298","first_computed_at":"2026-05-18T00:12:30.351746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:30.351746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8JYzOrUPKKgo6zKfPdOoDUpS895PqTNVVHazGS6ej34bKZNEEF9rMzjwTjJ8K+JLuk371z23komsiMusKsm0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:30.352433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44ef4bda9986d46f4561b2f9d0191b7b2ab9d0f25b9577d55e88e1a9540086da","sha256:eb2e350892c6cc7f6724b614ede5f689c149c09da0a377226586f332b220fd8a"],"state_sha256":"f2f8ce98c27d3c2f2751973ea47696eaa681ce338d7a03490d843fda9061abfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bth/bLhctEsj4/XNFWTy3eJBZQ7kd1toZsFOb70/GfFbxGg2irC/nKAHpZBrJo0MFcdtDfDhVI1gcw/YdLqRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:39:12.481547Z","bundle_sha256":"216c67ec1f404c21ddd3c83d4cc8df05e7566b44fd272e94a36d1759e076b18a"}}