{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VTT2L7WAPSFPZBS3CY7GX4JK2Z","short_pith_number":"pith:VTT2L7WA","schema_version":"1.0","canonical_sha256":"ace7a5fec07c8afc865b163e6bf12ad652c9b7a7006d1cb9304c1ebfdb8ed475","source":{"kind":"arxiv","id":"1903.01858","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Caching in Fog Radio Access Networks: A Graph-based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fu-Chun Zheng, Mehdi Bennis, Xiaoting Cui, Yanxiang Jiang","submitted_at":"2019-03-05T14:36:18Z","abstract_excerpt":"In this paper, cooperative caching is investigated in fog radio access networks (F-RAN). To maximize the offloaded traffic, cooperative caching optimization problem is formulated. By analyzing the relationship between clustering and cooperation and utilizing the solutions of the knapsack problems, the above challenging optimization problem is transformed into a clustering subproblem and a content placement subproblem. To further reduce complexity, we propose an effective graph-based approach to solve the two subproblems. In the graph-based clustering approach, a node graph and a weighted graph"},"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":"1903.01858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-05T14:36:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1bcf1ee64bd3208ce028f36accbf57c541ff42bbe1f544d8cf793cffc464cab5","abstract_canon_sha256":"09722106b505d210da75bb8dfff3f8b8794250c3e9e9ac3accff62138d0eeb31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.557238Z","signature_b64":"fDA3lWXryPcEBS5C/W1q0fkIlA6ick9tdAhX/SXatx4L2mYmXohqWRPjPXvnE4sEPj5DmxK2u6Ku2P8cF6AsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace7a5fec07c8afc865b163e6bf12ad652c9b7a7006d1cb9304c1ebfdb8ed475","last_reissued_at":"2026-05-17T23:51:59.556838Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.556838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Caching in Fog Radio Access Networks: A Graph-based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fu-Chun Zheng, Mehdi Bennis, Xiaoting Cui, Yanxiang Jiang","submitted_at":"2019-03-05T14:36:18Z","abstract_excerpt":"In this paper, cooperative caching is investigated in fog radio access networks (F-RAN). To maximize the offloaded traffic, cooperative caching optimization problem is formulated. By analyzing the relationship between clustering and cooperation and utilizing the solutions of the knapsack problems, the above challenging optimization problem is transformed into a clustering subproblem and a content placement subproblem. To further reduce complexity, we propose an effective graph-based approach to solve the two subproblems. In the graph-based clustering approach, a node graph and a weighted graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01858","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":"1903.01858","created_at":"2026-05-17T23:51:59.556895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01858v1","created_at":"2026-05-17T23:51:59.556895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01858","created_at":"2026-05-17T23:51:59.556895+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTT2L7WAPSFP","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTT2L7WAPSFPZBS3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTT2L7WA","created_at":"2026-05-18T12:33:30.264802+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/VTT2L7WAPSFPZBS3CY7GX4JK2Z","json":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z.json","graph_json":"https://pith.science/api/pith-number/VTT2L7WAPSFPZBS3CY7GX4JK2Z/graph.json","events_json":"https://pith.science/api/pith-number/VTT2L7WAPSFPZBS3CY7GX4JK2Z/events.json","paper":"https://pith.science/paper/VTT2L7WA"},"agent_actions":{"view_html":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z","download_json":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z.json","view_paper":"https://pith.science/paper/VTT2L7WA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01858&json=true","fetch_graph":"https://pith.science/api/pith-number/VTT2L7WAPSFPZBS3CY7GX4JK2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/VTT2L7WAPSFPZBS3CY7GX4JK2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z/action/storage_attestation","attest_author":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z/action/author_attestation","sign_citation":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z/action/citation_signature","submit_replication":"https://pith.science/pith/VTT2L7WAPSFPZBS3CY7GX4JK2Z/action/replication_record"}},"created_at":"2026-05-17T23:51:59.556895+00:00","updated_at":"2026-05-17T23:51:59.556895+00:00"}