{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5OM3MVSJ7ME74HAW7FIP64UXRS","short_pith_number":"pith:5OM3MVSJ","schema_version":"1.0","canonical_sha256":"eb99b65649fb09fe1c16f950ff72978ca9036c954df3578e1547fc0664b28b6d","source":{"kind":"arxiv","id":"1806.09095","version":1},"attestation_state":"computed","paper":{"title":"Graph-based Cooperative 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, Xiaohu You, Xiaoting Cui, Xuan Chen, Yanxiang Jiang","submitted_at":"2018-06-24T07:29:42Z","abstract_excerpt":"In this paper, the cooperative caching problem in fog radio access networks (F-RAN) is investigated. To maximize the incremental offloaded traffic, we formulate the clustering optimization problem with the consideration of cooperative caching and local content popularity, which falls into the scope of combinatorial programming. % and is NP-hard. We then propose an effective graph-based approach to solve this challenging problem. Firstly, a node graph is constructed with its vertex set representing the considered fog access points (F-APs) and its edge set reflecting the potential cooperations a"},"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.09095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-24T07:29:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a65e75156dad57987c2f20731b8fc837298830097e14fa6f17341ad32a083661","abstract_canon_sha256":"6af6592a6742dd594b9d6c3d85b72488f19b67905aa1f8f623913c3d5c25366d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:30.345196Z","signature_b64":"SToKcB6MahEacBzYcrpsyTyLApL0IjHMPSw3yZrF+LhBkAxU2eRSMJK4yCbm+G+PgCklkmNs+HO4L2ITiMcsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb99b65649fb09fe1c16f950ff72978ca9036c954df3578e1547fc0664b28b6d","last_reissued_at":"2026-05-18T00:12:30.344708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:30.344708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-based Cooperative 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, Xiaohu You, Xiaoting Cui, Xuan Chen, Yanxiang Jiang","submitted_at":"2018-06-24T07:29:42Z","abstract_excerpt":"In this paper, the cooperative caching problem in fog radio access networks (F-RAN) is investigated. To maximize the incremental offloaded traffic, we formulate the clustering optimization problem with the consideration of cooperative caching and local content popularity, which falls into the scope of combinatorial programming. % and is NP-hard. We then propose an effective graph-based approach to solve this challenging problem. Firstly, a node graph is constructed with its vertex set representing the considered fog access points (F-APs) and its edge set reflecting the potential cooperations a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09095","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.09095","created_at":"2026-05-18T00:12:30.344780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09095v1","created_at":"2026-05-18T00:12:30.344780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09095","created_at":"2026-05-18T00:12:30.344780+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OM3MVSJ7ME7","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OM3MVSJ7ME74HAW","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OM3MVSJ","created_at":"2026-05-18T12:32:08.215937+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/5OM3MVSJ7ME74HAW7FIP64UXRS","json":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS.json","graph_json":"https://pith.science/api/pith-number/5OM3MVSJ7ME74HAW7FIP64UXRS/graph.json","events_json":"https://pith.science/api/pith-number/5OM3MVSJ7ME74HAW7FIP64UXRS/events.json","paper":"https://pith.science/paper/5OM3MVSJ"},"agent_actions":{"view_html":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS","download_json":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS.json","view_paper":"https://pith.science/paper/5OM3MVSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09095&json=true","fetch_graph":"https://pith.science/api/pith-number/5OM3MVSJ7ME74HAW7FIP64UXRS/graph.json","fetch_events":"https://pith.science/api/pith-number/5OM3MVSJ7ME74HAW7FIP64UXRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS/action/storage_attestation","attest_author":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS/action/author_attestation","sign_citation":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS/action/citation_signature","submit_replication":"https://pith.science/pith/5OM3MVSJ7ME74HAW7FIP64UXRS/action/replication_record"}},"created_at":"2026-05-18T00:12:30.344780+00:00","updated_at":"2026-05-18T00:12:30.344780+00:00"}