{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HKHEOLXQFJPG4LYZ4XCI42CMFG","short_pith_number":"pith:HKHEOLXQ","canonical_record":{"source":{"id":"1906.08602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-12T05:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"3158cfee0319672643749dc4eb5ee350c1feb9b356812c90f62572d775f54401","abstract_canon_sha256":"89c2c773fc1788e47ad3e7d123dbd427ef5151bcc1347b4b95a6331952c8155f"},"schema_version":"1.0"},"canonical_sha256":"3a8e472ef02a5e6e2f19e5c48e684c299c3ea52805c8349907c16d48a20fa298","source":{"kind":"arxiv","id":"1906.08602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08602","created_at":"2026-05-17T23:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08602v1","created_at":"2026-05-17T23:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08602","created_at":"2026-05-17T23:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"HKHEOLXQFJPG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HKHEOLXQFJPG4LYZ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HKHEOLXQ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HKHEOLXQFJPG4LYZ4XCI42CMFG","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-12T05:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"3158cfee0319672643749dc4eb5ee350c1feb9b356812c90f62572d775f54401","abstract_canon_sha256":"89c2c773fc1788e47ad3e7d123dbd427ef5151bcc1347b4b95a6331952c8155f"},"schema_version":"1.0"},"canonical_sha256":"3a8e472ef02a5e6e2f19e5c48e684c299c3ea52805c8349907c16d48a20fa298","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:51.961831Z","signature_b64":"OfvbCCRfXfyEtzJSyXzKAY7JlM30h5Zwj12jHt+TLl84CUjWWLneoW3jONB56aYkRArugyT4lV/mdyI53xgWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a8e472ef02a5e6e2f19e5c48e684c299c3ea52805c8349907c16d48a20fa298","last_reissued_at":"2026-05-17T23:42:51.961355Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:51.961355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08602","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-17T23:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhXgtKXadzgBrnkr0sLnr1Jmbo0jL1DQdxYf9Wg/YHdeLGMvWMqwldoJCXLPgW9qsoipKhkZQNS8h1dpyuSwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:21:53.524754Z"},"content_sha256":"f5ac8779055667ad8a2c24126b23d4e4ff27d531f40db2647e1bc3185b2c82dc","schema_version":"1.0","event_id":"sha256:f5ac8779055667ad8a2c24126b23d4e4ff27d531f40db2647e1bc3185b2c82dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HKHEOLXQFJPG4LYZ4XCI42CMFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Fault-Tolerant Erasure Codes for Scalable All-Flash Array Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David Donofrio, Jie Zhang, Jungyeon Yoon, Miryeong Kwon, Myoungsoo Jung, Nam Sung Kim, Sungjoon Koh","submitted_at":"2019-06-12T05:30:19Z","abstract_excerpt":"Large-scale systems with all-flash arrays have become increasingly common in many computing segments. To make such systems resilient, we can adopt erasure coding such as Reed-Solomon (RS) code as an alternative to replication because erasure coding incurs a significantly lower storage overhead than replication. To understand the impact of using erasure coding on the system performance and other system aspects such as CPU utilization and network traffic, we build a storage cluster that consists of approximately 100 processor cores with more than 50 high-performance solid-state drives (SSDs), an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08602","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-17T23:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ftooKS35aKiFUFyNmnakCVEs8Fp2VjZ/ppvEt28Mh3BrwrBKR/l5H6BK6o8FzNZ7z5e8l86PWf9XRmxKgT6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:21:53.525106Z"},"content_sha256":"77f79f98dbc4cdd2a6b77ab8bcc72cdb03ba7e1acffc3a633898b39b70f8d478","schema_version":"1.0","event_id":"sha256:77f79f98dbc4cdd2a6b77ab8bcc72cdb03ba7e1acffc3a633898b39b70f8d478"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKHEOLXQFJPG4LYZ4XCI42CMFG/bundle.json","state_url":"https://pith.science/pith/HKHEOLXQFJPG4LYZ4XCI42CMFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKHEOLXQFJPG4LYZ4XCI42CMFG/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-10T18:21:53Z","links":{"resolver":"https://pith.science/pith/HKHEOLXQFJPG4LYZ4XCI42CMFG","bundle":"https://pith.science/pith/HKHEOLXQFJPG4LYZ4XCI42CMFG/bundle.json","state":"https://pith.science/pith/HKHEOLXQFJPG4LYZ4XCI42CMFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKHEOLXQFJPG4LYZ4XCI42CMFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HKHEOLXQFJPG4LYZ4XCI42CMFG","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":"89c2c773fc1788e47ad3e7d123dbd427ef5151bcc1347b4b95a6331952c8155f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-12T05:30:19Z","title_canon_sha256":"3158cfee0319672643749dc4eb5ee350c1feb9b356812c90f62572d775f54401"},"schema_version":"1.0","source":{"id":"1906.08602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08602","created_at":"2026-05-17T23:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08602v1","created_at":"2026-05-17T23:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08602","created_at":"2026-05-17T23:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"HKHEOLXQFJPG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HKHEOLXQFJPG4LYZ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HKHEOLXQ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:77f79f98dbc4cdd2a6b77ab8bcc72cdb03ba7e1acffc3a633898b39b70f8d478","target":"graph","created_at":"2026-05-17T23:42:51Z","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":"Large-scale systems with all-flash arrays have become increasingly common in many computing segments. To make such systems resilient, we can adopt erasure coding such as Reed-Solomon (RS) code as an alternative to replication because erasure coding incurs a significantly lower storage overhead than replication. To understand the impact of using erasure coding on the system performance and other system aspects such as CPU utilization and network traffic, we build a storage cluster that consists of approximately 100 processor cores with more than 50 high-performance solid-state drives (SSDs), an","authors_text":"David Donofrio, Jie Zhang, Jungyeon Yoon, Miryeong Kwon, Myoungsoo Jung, Nam Sung Kim, Sungjoon Koh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-12T05:30:19Z","title":"Exploring Fault-Tolerant Erasure Codes for Scalable All-Flash Array Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08602","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:f5ac8779055667ad8a2c24126b23d4e4ff27d531f40db2647e1bc3185b2c82dc","target":"record","created_at":"2026-05-17T23:42:51Z","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":"89c2c773fc1788e47ad3e7d123dbd427ef5151bcc1347b4b95a6331952c8155f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-12T05:30:19Z","title_canon_sha256":"3158cfee0319672643749dc4eb5ee350c1feb9b356812c90f62572d775f54401"},"schema_version":"1.0","source":{"id":"1906.08602","kind":"arxiv","version":1}},"canonical_sha256":"3a8e472ef02a5e6e2f19e5c48e684c299c3ea52805c8349907c16d48a20fa298","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a8e472ef02a5e6e2f19e5c48e684c299c3ea52805c8349907c16d48a20fa298","first_computed_at":"2026-05-17T23:42:51.961355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:51.961355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OfvbCCRfXfyEtzJSyXzKAY7JlM30h5Zwj12jHt+TLl84CUjWWLneoW3jONB56aYkRArugyT4lV/mdyI53xgWAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:51.961831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5ac8779055667ad8a2c24126b23d4e4ff27d531f40db2647e1bc3185b2c82dc","sha256:77f79f98dbc4cdd2a6b77ab8bcc72cdb03ba7e1acffc3a633898b39b70f8d478"],"state_sha256":"70a649c6d48411934c364d90f7b5c7105ebccf077200dd74e1638d3f0ae8675a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYzcLVZ/D8L2CpH/6EPwOIQEiyZ7uT1cfMsOUFwaVuoSHDTBv61O8Gyn/i2R20m29qkXCtZyrV4d9Ly6uTouCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:21:53.527164Z","bundle_sha256":"581fd7b40369441a0e54c588d983f86995978295e356d270c4a182514779570e"}}