{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WBRGE2PMD3V3MOYH6OHTNV6OGB","short_pith_number":"pith:WBRGE2PM","canonical_record":{"source":{"id":"1702.04323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-14T18:21:31Z","cross_cats_sorted":[],"title_canon_sha256":"a9bed7729cb6864278a76f26d713908c595690a07b532379c2da7b8761123f15","abstract_canon_sha256":"8aaa8c06f6e7e45642f4d58f167ba0256ef798cbaafba40c250bc6a3feb116d0"},"schema_version":"1.0"},"canonical_sha256":"b0626269ec1eebb63b07f38f36d7ce305f70e8ee665278576984247c8940b5fc","source":{"kind":"arxiv","id":"1702.04323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04323","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04323v1","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04323","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"WBRGE2PMD3V3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WBRGE2PMD3V3MOYH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WBRGE2PM","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WBRGE2PMD3V3MOYH6OHTNV6OGB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-14T18:21:31Z","cross_cats_sorted":[],"title_canon_sha256":"a9bed7729cb6864278a76f26d713908c595690a07b532379c2da7b8761123f15","abstract_canon_sha256":"8aaa8c06f6e7e45642f4d58f167ba0256ef798cbaafba40c250bc6a3feb116d0"},"schema_version":"1.0"},"canonical_sha256":"b0626269ec1eebb63b07f38f36d7ce305f70e8ee665278576984247c8940b5fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:43.479365Z","signature_b64":"G6sh0CZp+EKlKrLXPyMERGAyLZD5/5N1X3AxcX8K0KKLo70ldy84bYXOtN4c9vzRPgWY0IPWGmU+L8cQAuwDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0626269ec1eebb63b07f38f36d7ce305f70e8ee665278576984247c8940b5fc","last_reissued_at":"2026-05-18T00:50:43.478754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:43.478754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04323","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:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1jcU+SGzRPl+f7CxMF0Hr9KQBs66UL5yMArCG22yT3Jv4sDOvZK6B89OFp1hZ1S/KLJnpUjSxEoFc5zwWiQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:59:47.648038Z"},"content_sha256":"d3de917d4829fcbe81f1e45a509abbb4978ac95d5e6c9a6e3a4e3a3814071539","schema_version":"1.0","event_id":"sha256:d3de917d4829fcbe81f1e45a509abbb4978ac95d5e6c9a6e3a4e3a3814071539"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WBRGE2PMD3V3MOYH6OHTNV6OGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Don't cry over spilled records: Memory elasticity of data-parallel applications and its application to cluster scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aunn Raza, Calin Iorgulescu, Florin Dinu, Wajih Ul Hassan, Willy Zwaenepoel","submitted_at":"2017-02-14T18:21:31Z","abstract_excerpt":"Understanding the performance of data-parallel workloads when resource-constrained has significant practical importance but unfortunately has received only limited attention. This paper identifies, quantifies and demonstrates memory elasticity, an intrinsic property of data-parallel tasks. Memory elasticity allows tasks to run with significantly less memory that they would ideally want while only paying a moderate performance penalty. For example, we find that given as little as 10% of ideal memory, PageRank and NutchIndexing Hadoop reducers become only 1.2x/1.75x and 1.08x slower. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04323","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:50:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1oIZuXM9c223QYtKVhpLHIvqCgc7XgD+KqU2zU+CWkHFObwP1452kBpv0qpbRRYb2Zr7vDiWjdtzs8zEzP8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:59:47.648404Z"},"content_sha256":"9343a5a10f42e7b37d36f6ffe31bb7e785ccccd90b1bc12829d919f8e2ba599f","schema_version":"1.0","event_id":"sha256:9343a5a10f42e7b37d36f6ffe31bb7e785ccccd90b1bc12829d919f8e2ba599f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBRGE2PMD3V3MOYH6OHTNV6OGB/bundle.json","state_url":"https://pith.science/pith/WBRGE2PMD3V3MOYH6OHTNV6OGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBRGE2PMD3V3MOYH6OHTNV6OGB/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-08T13:59:47Z","links":{"resolver":"https://pith.science/pith/WBRGE2PMD3V3MOYH6OHTNV6OGB","bundle":"https://pith.science/pith/WBRGE2PMD3V3MOYH6OHTNV6OGB/bundle.json","state":"https://pith.science/pith/WBRGE2PMD3V3MOYH6OHTNV6OGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBRGE2PMD3V3MOYH6OHTNV6OGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WBRGE2PMD3V3MOYH6OHTNV6OGB","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":"8aaa8c06f6e7e45642f4d58f167ba0256ef798cbaafba40c250bc6a3feb116d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-14T18:21:31Z","title_canon_sha256":"a9bed7729cb6864278a76f26d713908c595690a07b532379c2da7b8761123f15"},"schema_version":"1.0","source":{"id":"1702.04323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04323","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04323v1","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04323","created_at":"2026-05-18T00:50:43Z"},{"alias_kind":"pith_short_12","alias_value":"WBRGE2PMD3V3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WBRGE2PMD3V3MOYH","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WBRGE2PM","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:9343a5a10f42e7b37d36f6ffe31bb7e785ccccd90b1bc12829d919f8e2ba599f","target":"graph","created_at":"2026-05-18T00:50:43Z","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":"Understanding the performance of data-parallel workloads when resource-constrained has significant practical importance but unfortunately has received only limited attention. This paper identifies, quantifies and demonstrates memory elasticity, an intrinsic property of data-parallel tasks. Memory elasticity allows tasks to run with significantly less memory that they would ideally want while only paying a moderate performance penalty. For example, we find that given as little as 10% of ideal memory, PageRank and NutchIndexing Hadoop reducers become only 1.2x/1.75x and 1.08x slower. We show tha","authors_text":"Aunn Raza, Calin Iorgulescu, Florin Dinu, Wajih Ul Hassan, Willy Zwaenepoel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-14T18:21:31Z","title":"Don't cry over spilled records: Memory elasticity of data-parallel applications and its application to cluster scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04323","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:d3de917d4829fcbe81f1e45a509abbb4978ac95d5e6c9a6e3a4e3a3814071539","target":"record","created_at":"2026-05-18T00:50:43Z","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":"8aaa8c06f6e7e45642f4d58f167ba0256ef798cbaafba40c250bc6a3feb116d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-14T18:21:31Z","title_canon_sha256":"a9bed7729cb6864278a76f26d713908c595690a07b532379c2da7b8761123f15"},"schema_version":"1.0","source":{"id":"1702.04323","kind":"arxiv","version":1}},"canonical_sha256":"b0626269ec1eebb63b07f38f36d7ce305f70e8ee665278576984247c8940b5fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0626269ec1eebb63b07f38f36d7ce305f70e8ee665278576984247c8940b5fc","first_computed_at":"2026-05-18T00:50:43.478754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:43.478754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6sh0CZp+EKlKrLXPyMERGAyLZD5/5N1X3AxcX8K0KKLo70ldy84bYXOtN4c9vzRPgWY0IPWGmU+L8cQAuwDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:43.479365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3de917d4829fcbe81f1e45a509abbb4978ac95d5e6c9a6e3a4e3a3814071539","sha256:9343a5a10f42e7b37d36f6ffe31bb7e785ccccd90b1bc12829d919f8e2ba599f"],"state_sha256":"076e38d67fa09f647d0100c8d5ceaea12bc5af5ddbc4cbdf4fc9b339cd1e1ba7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BECrBfwfd7mNjs7WVNiJv6vfpkQmh1qANET4Hi47NinLynbFrankcXwVO8XAgebjXLjd1rxexXmlGGbjTWDSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:59:47.650476Z","bundle_sha256":"50c2d1ece4371439e63a7f820bf706d02f0f7e39ad0c910a73a456673cdd8f70"}}