{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RXWLYDKIUCGJTOF5QZFJZQ7LHN","short_pith_number":"pith:RXWLYDKI","canonical_record":{"source":{"id":"1602.01959","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-05T09:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"e88a4217fad6b194f05201e13f7b14462592751543596416bb70be7da9e7b94c","abstract_canon_sha256":"99e61bb1fda68421c0af2c6e2c76e6811447521eeff63c174c1c668673034fc4"},"schema_version":"1.0"},"canonical_sha256":"8decbc0d48a08c99b8bd864a9cc3eb3b6fd1d79bb335484c5986e583e84c9889","source":{"kind":"arxiv","id":"1602.01959","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01959","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01959v3","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01959","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"RXWLYDKIUCGJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RXWLYDKIUCGJTOF5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RXWLYDKI","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RXWLYDKIUCGJTOF5QZFJZQ7LHN","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01959","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-05T09:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"e88a4217fad6b194f05201e13f7b14462592751543596416bb70be7da9e7b94c","abstract_canon_sha256":"99e61bb1fda68421c0af2c6e2c76e6811447521eeff63c174c1c668673034fc4"},"schema_version":"1.0"},"canonical_sha256":"8decbc0d48a08c99b8bd864a9cc3eb3b6fd1d79bb335484c5986e583e84c9889","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:17.370083Z","signature_b64":"uywF5cg5D/Mq0lWjJPQu0t0dXJ+u7STxnSrwRIbOTjwIsW9NhU83iGzFjvLGcb6fccff2WdeuP1aNMFMk5AIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8decbc0d48a08c99b8bd864a9cc3eb3b6fd1d79bb335484c5986e583e84c9889","last_reissued_at":"2026-05-18T01:14:17.369466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:17.369466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01959","source_version":3,"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-18T01:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqhKUz4y+GkDFSkNkz8RGWQA7H8UDEnjB8lp4INauQNmBw1YvoaU8l0CXOpqP54bagZLjEEUXKbciesyv8bLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:23:59.644081Z"},"content_sha256":"808378b217c207ecec41f475928894a76a18f774dd99712132489c81bc4b47c1","schema_version":"1.0","event_id":"sha256:808378b217c207ecec41f475928894a76a18f774dd99712132489c81bc4b47c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RXWLYDKIUCGJTOF5QZFJZQ7LHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lifetime-Based Memory Management for Distributed Data Processing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cheng Pei, Hai Jin, Ligang He, Lu Lu, Xiong Zhang, Xuanhua Shi, Yongluan Zhou, Yuanzhen Geng","submitted_at":"2016-02-05T09:13:00Z","abstract_excerpt":"In-memory caching of intermediate data and eager combining of data in shuffle buffers have been shown to be very effective in minimizing the re-computation and I/O cost in distributed data processing systems like Spark and Flink. However, it has also been widely reported that these techniques would create a large amount of long-living data objects in the heap, which may quickly saturate the garbage collector, especially when handling a large dataset, and hence would limit the scalability of the system. To eliminate this problem, we propose a lifetime-based memory management framework, which, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01959","kind":"arxiv","version":3},"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-18T01:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3ApkhVhuHtza/u+Kv7qSdTlvGOHStNXJ93Rw2E+4fh2lGFzNdu5OV6r8ltMFBpK7y/1kNllITS+rSw6nFMTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:23:59.644792Z"},"content_sha256":"005477e6a84714ab25d79c9e46aaa488a849bdab95fc2dae7f370fc33431e792","schema_version":"1.0","event_id":"sha256:005477e6a84714ab25d79c9e46aaa488a849bdab95fc2dae7f370fc33431e792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXWLYDKIUCGJTOF5QZFJZQ7LHN/bundle.json","state_url":"https://pith.science/pith/RXWLYDKIUCGJTOF5QZFJZQ7LHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXWLYDKIUCGJTOF5QZFJZQ7LHN/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-10T15:23:59Z","links":{"resolver":"https://pith.science/pith/RXWLYDKIUCGJTOF5QZFJZQ7LHN","bundle":"https://pith.science/pith/RXWLYDKIUCGJTOF5QZFJZQ7LHN/bundle.json","state":"https://pith.science/pith/RXWLYDKIUCGJTOF5QZFJZQ7LHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXWLYDKIUCGJTOF5QZFJZQ7LHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RXWLYDKIUCGJTOF5QZFJZQ7LHN","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":"99e61bb1fda68421c0af2c6e2c76e6811447521eeff63c174c1c668673034fc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-05T09:13:00Z","title_canon_sha256":"e88a4217fad6b194f05201e13f7b14462592751543596416bb70be7da9e7b94c"},"schema_version":"1.0","source":{"id":"1602.01959","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01959","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01959v3","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01959","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"RXWLYDKIUCGJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RXWLYDKIUCGJTOF5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RXWLYDKI","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:005477e6a84714ab25d79c9e46aaa488a849bdab95fc2dae7f370fc33431e792","target":"graph","created_at":"2026-05-18T01:14:17Z","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-memory caching of intermediate data and eager combining of data in shuffle buffers have been shown to be very effective in minimizing the re-computation and I/O cost in distributed data processing systems like Spark and Flink. However, it has also been widely reported that these techniques would create a large amount of long-living data objects in the heap, which may quickly saturate the garbage collector, especially when handling a large dataset, and hence would limit the scalability of the system. To eliminate this problem, we propose a lifetime-based memory management framework, which, b","authors_text":"Cheng Pei, Hai Jin, Ligang He, Lu Lu, Xiong Zhang, Xuanhua Shi, Yongluan Zhou, Yuanzhen Geng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-05T09:13:00Z","title":"Lifetime-Based Memory Management for Distributed Data Processing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01959","kind":"arxiv","version":3},"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:808378b217c207ecec41f475928894a76a18f774dd99712132489c81bc4b47c1","target":"record","created_at":"2026-05-18T01:14:17Z","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":"99e61bb1fda68421c0af2c6e2c76e6811447521eeff63c174c1c668673034fc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-05T09:13:00Z","title_canon_sha256":"e88a4217fad6b194f05201e13f7b14462592751543596416bb70be7da9e7b94c"},"schema_version":"1.0","source":{"id":"1602.01959","kind":"arxiv","version":3}},"canonical_sha256":"8decbc0d48a08c99b8bd864a9cc3eb3b6fd1d79bb335484c5986e583e84c9889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8decbc0d48a08c99b8bd864a9cc3eb3b6fd1d79bb335484c5986e583e84c9889","first_computed_at":"2026-05-18T01:14:17.369466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:17.369466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uywF5cg5D/Mq0lWjJPQu0t0dXJ+u7STxnSrwRIbOTjwIsW9NhU83iGzFjvLGcb6fccff2WdeuP1aNMFMk5AIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:17.370083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01959","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:808378b217c207ecec41f475928894a76a18f774dd99712132489c81bc4b47c1","sha256:005477e6a84714ab25d79c9e46aaa488a849bdab95fc2dae7f370fc33431e792"],"state_sha256":"20213298ca5c14e9fbcc326f626cd7bc91838488ed67f46491874f2d3172604b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTkTnVDrAO96LK6wkXxhhp/bYvn01wVY076dobGSwzkZ/AhEQBdkCsLD4l9IVuAO9+bDtD4+3vgT5HyOeGeDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:23:59.648450Z","bundle_sha256":"567b3b9af25e5a5680fe1d61b9f562f0105459c08bc05dcfd7fbc02ceb80913c"}}