{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UWPMW7T2ZF4SU2G456STEEBFVF","short_pith_number":"pith:UWPMW7T2","schema_version":"1.0","canonical_sha256":"a59ecb7e7ac9792a68dcefa5321025a96c35c7292011bce96dc1c8c2cc60a271","source":{"kind":"arxiv","id":"2207.09035","version":2},"attestation_state":"computed","paper":{"title":"PackCache: An Online Cost-driven Data Caching Algorithm in the Cloud","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Chengzhong Xu, Dong Huang, Hao Dai, Jiashu Wu, Yang Wang, Yong Zhang","submitted_at":"2022-07-19T02:59:32Z","abstract_excerpt":"In this paper, we study a data caching problem in the cloud environment, where multiple frequently co-utilised data items could be packed as a single item being transferred to serve a sequence of data requests dynamically with reduced cost. To this end, we propose an online algorithm with respect to a homogeneous cost model, called PackCache, that can leverage the FP-Tree technique to mine those frequently co-utilised data items for packing whereby the incoming requests could be cost-effectively served online by exploiting the concept of anticipatory caching. We show the algorithm is 2\\alpha c"},"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":"2207.09035","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-19T02:59:32Z","cross_cats_sorted":["cs.DC","cs.NI"],"title_canon_sha256":"224ac63363980703e96aad583cebff8e39659b840e0e699cc8ff9f9c5dec4948","abstract_canon_sha256":"e88cf31daffb2ae487587da0e9d300d35882099458fe31f706a509b488b9482b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:46:15.411250Z","signature_b64":"ibkO5yuGtZZCp/3iKBt68ab/WSJQEqfjchir1DIVbqNCT5xcTxvQtloUsdWM4LYRx8QzqPfFpriPTbMKZoJjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a59ecb7e7ac9792a68dcefa5321025a96c35c7292011bce96dc1c8c2cc60a271","last_reissued_at":"2026-07-05T04:46:15.410821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:46:15.410821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PackCache: An Online Cost-driven Data Caching Algorithm in the Cloud","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Chengzhong Xu, Dong Huang, Hao Dai, Jiashu Wu, Yang Wang, Yong Zhang","submitted_at":"2022-07-19T02:59:32Z","abstract_excerpt":"In this paper, we study a data caching problem in the cloud environment, where multiple frequently co-utilised data items could be packed as a single item being transferred to serve a sequence of data requests dynamically with reduced cost. To this end, we propose an online algorithm with respect to a homogeneous cost model, called PackCache, that can leverage the FP-Tree technique to mine those frequently co-utilised data items for packing whereby the incoming requests could be cost-effectively served online by exploiting the concept of anticipatory caching. We show the algorithm is 2\\alpha c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09035","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.09035/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.09035","created_at":"2026-07-05T04:46:15.410879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.09035v2","created_at":"2026-07-05T04:46:15.410879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09035","created_at":"2026-07-05T04:46:15.410879+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWPMW7T2ZF4S","created_at":"2026-07-05T04:46:15.410879+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWPMW7T2ZF4SU2G4","created_at":"2026-07-05T04:46:15.410879+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWPMW7T2","created_at":"2026-07-05T04:46:15.410879+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/UWPMW7T2ZF4SU2G456STEEBFVF","json":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF.json","graph_json":"https://pith.science/api/pith-number/UWPMW7T2ZF4SU2G456STEEBFVF/graph.json","events_json":"https://pith.science/api/pith-number/UWPMW7T2ZF4SU2G456STEEBFVF/events.json","paper":"https://pith.science/paper/UWPMW7T2"},"agent_actions":{"view_html":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF","download_json":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF.json","view_paper":"https://pith.science/paper/UWPMW7T2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.09035&json=true","fetch_graph":"https://pith.science/api/pith-number/UWPMW7T2ZF4SU2G456STEEBFVF/graph.json","fetch_events":"https://pith.science/api/pith-number/UWPMW7T2ZF4SU2G456STEEBFVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF/action/storage_attestation","attest_author":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF/action/author_attestation","sign_citation":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF/action/citation_signature","submit_replication":"https://pith.science/pith/UWPMW7T2ZF4SU2G456STEEBFVF/action/replication_record"}},"created_at":"2026-07-05T04:46:15.410879+00:00","updated_at":"2026-07-05T04:46:15.410879+00:00"}