{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K52ABEG5C73G32DA4TKOBQVKOP","short_pith_number":"pith:K52ABEG5","canonical_record":{"source":{"id":"1708.07941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-26T07:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"6c2270916c2f07d36412e8bbaa8322226def121228fc29ba2fb7f94e31fda6fa","abstract_canon_sha256":"0a93c2f7d457a48f65807829d9b4099474facd0754864386cb03b8bdd96161a6"},"schema_version":"1.0"},"canonical_sha256":"57740090dd17f66de860e4d4e0c2aa73e354eb3c8c0848aecbe02f621d6e190c","source":{"kind":"arxiv","id":"1708.07941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07941","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07941v1","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07941","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"K52ABEG5C73G","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K52ABEG5C73G32DA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K52ABEG5","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K52ABEG5C73G32DA4TKOBQVKOP","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-26T07:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"6c2270916c2f07d36412e8bbaa8322226def121228fc29ba2fb7f94e31fda6fa","abstract_canon_sha256":"0a93c2f7d457a48f65807829d9b4099474facd0754864386cb03b8bdd96161a6"},"schema_version":"1.0"},"canonical_sha256":"57740090dd17f66de860e4d4e0c2aa73e354eb3c8c0848aecbe02f621d6e190c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:37.560701Z","signature_b64":"KIv9Tzu4iniLvF1TDcBedn/1pcbvlzV58XtThRm1k2l58cZ2ZG7gPThFqJjv+2ktrZzKzxcNyjSrZAi0DzUfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57740090dd17f66de860e4d4e0c2aa73e354eb3c8c0848aecbe02f621d6e190c","last_reissued_at":"2026-05-18T00:36:37.559663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:37.559663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07941","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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJ6pig2Zz8Bpc2mJpQAzR0am97ZaADyKbT/QqEYQ/6+XghGlaD79KjA0a8S29kTdqe+YsRBnoFVBfypmQACWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:50:50.335970Z"},"content_sha256":"cd3f4f671d21bba4a2586dd94157480e93081fad477be9a41bb139626cf77e8a","schema_version":"1.0","event_id":"sha256:cd3f4f671d21bba4a2586dd94157480e93081fad477be9a41bb139626cf77e8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K52ABEG5C73G32DA4TKOBQVKOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LERC: Coordinated Cache Management for Data-Parallel Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jun Zhang, Khaled B. Letaief, Wei Wang, Yinghao Yu","submitted_at":"2017-08-26T07:03:01Z","abstract_excerpt":"Memory caches are being aggressively used in today's data-parallel frameworks such as Spark, Tez and Storm. By caching input and intermediate data in memory, compute tasks can witness speedup by orders of magnitude. To maximize the chance of in-memory data access, existing cache algorithms, be it recency- or frequency-based, settle on cache hit ratio as the optimization objective. However, unlike the conventional belief, we show in this paper that simply pursuing a higher cache hit ratio of individual data blocks does not necessarily translate into faster task completion in data-parallel envir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07941","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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWRvZFga1qKNSqXnskCO92Ogb/4YqXaZmtEe69yKFwJTHhA1giGda6yYufXJmhP/nIiLVYOMl4lnjpB0mEUqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:50:50.336354Z"},"content_sha256":"b2cfb2d4a651f01c8b720c4bdac7cf6d19443f984e947735bcdc4abe8c78d1ae","schema_version":"1.0","event_id":"sha256:b2cfb2d4a651f01c8b720c4bdac7cf6d19443f984e947735bcdc4abe8c78d1ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K52ABEG5C73G32DA4TKOBQVKOP/bundle.json","state_url":"https://pith.science/pith/K52ABEG5C73G32DA4TKOBQVKOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K52ABEG5C73G32DA4TKOBQVKOP/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-05-31T20:50:50Z","links":{"resolver":"https://pith.science/pith/K52ABEG5C73G32DA4TKOBQVKOP","bundle":"https://pith.science/pith/K52ABEG5C73G32DA4TKOBQVKOP/bundle.json","state":"https://pith.science/pith/K52ABEG5C73G32DA4TKOBQVKOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K52ABEG5C73G32DA4TKOBQVKOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K52ABEG5C73G32DA4TKOBQVKOP","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":"0a93c2f7d457a48f65807829d9b4099474facd0754864386cb03b8bdd96161a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-26T07:03:01Z","title_canon_sha256":"6c2270916c2f07d36412e8bbaa8322226def121228fc29ba2fb7f94e31fda6fa"},"schema_version":"1.0","source":{"id":"1708.07941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07941","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07941v1","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07941","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"K52ABEG5C73G","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K52ABEG5C73G32DA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K52ABEG5","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:b2cfb2d4a651f01c8b720c4bdac7cf6d19443f984e947735bcdc4abe8c78d1ae","target":"graph","created_at":"2026-05-18T00:36:37Z","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":"Memory caches are being aggressively used in today's data-parallel frameworks such as Spark, Tez and Storm. By caching input and intermediate data in memory, compute tasks can witness speedup by orders of magnitude. To maximize the chance of in-memory data access, existing cache algorithms, be it recency- or frequency-based, settle on cache hit ratio as the optimization objective. However, unlike the conventional belief, we show in this paper that simply pursuing a higher cache hit ratio of individual data blocks does not necessarily translate into faster task completion in data-parallel envir","authors_text":"Jun Zhang, Khaled B. Letaief, Wei Wang, Yinghao Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-26T07:03:01Z","title":"LERC: Coordinated Cache Management for Data-Parallel Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07941","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:cd3f4f671d21bba4a2586dd94157480e93081fad477be9a41bb139626cf77e8a","target":"record","created_at":"2026-05-18T00:36:37Z","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":"0a93c2f7d457a48f65807829d9b4099474facd0754864386cb03b8bdd96161a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-26T07:03:01Z","title_canon_sha256":"6c2270916c2f07d36412e8bbaa8322226def121228fc29ba2fb7f94e31fda6fa"},"schema_version":"1.0","source":{"id":"1708.07941","kind":"arxiv","version":1}},"canonical_sha256":"57740090dd17f66de860e4d4e0c2aa73e354eb3c8c0848aecbe02f621d6e190c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57740090dd17f66de860e4d4e0c2aa73e354eb3c8c0848aecbe02f621d6e190c","first_computed_at":"2026-05-18T00:36:37.559663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:37.559663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KIv9Tzu4iniLvF1TDcBedn/1pcbvlzV58XtThRm1k2l58cZ2ZG7gPThFqJjv+2ktrZzKzxcNyjSrZAi0DzUfCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:37.560701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd3f4f671d21bba4a2586dd94157480e93081fad477be9a41bb139626cf77e8a","sha256:b2cfb2d4a651f01c8b720c4bdac7cf6d19443f984e947735bcdc4abe8c78d1ae"],"state_sha256":"4f1ac17bfc2139a00421d0cefec8e7b0ee860e2cf1373abd046acf6844052b6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5+CBW058WPL+RXXJz4XK/yk7+ajDILTTbRwf2qTa4HoZDfadE2TSBZ9FFvBK6RUqlVIK9YBYnvjPY+MUgjGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:50:50.339720Z","bundle_sha256":"89c83cb59d3b1fd7643d522db9e3b42355b1fff307dd1606fe3c2d053456cd8a"}}