{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2WPGHYUGVNQFIHOLRKXL5SQTC5","short_pith_number":"pith:2WPGHYUG","canonical_record":{"source":{"id":"1404.4975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-19T17:25:55Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"bbb419dd8be075f941ee8c12d99e46cf5b10b9bfab5c43a9bd957dfd26de42a7","abstract_canon_sha256":"cc9084d63ac405794fddeb34b7d36d554ae0b728fcd2786cf050b2f790f780c2"},"schema_version":"1.0"},"canonical_sha256":"d59e63e286ab60541dcb8aaebeca13174d0a2062e04bf58aadc286cc00e3201e","source":{"kind":"arxiv","id":"1404.4975","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4975","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4975v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4975","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"2WPGHYUGVNQF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2WPGHYUGVNQFIHOL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2WPGHYUG","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2WPGHYUGVNQFIHOLRKXL5SQTC5","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-19T17:25:55Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"bbb419dd8be075f941ee8c12d99e46cf5b10b9bfab5c43a9bd957dfd26de42a7","abstract_canon_sha256":"cc9084d63ac405794fddeb34b7d36d554ae0b728fcd2786cf050b2f790f780c2"},"schema_version":"1.0"},"canonical_sha256":"d59e63e286ab60541dcb8aaebeca13174d0a2062e04bf58aadc286cc00e3201e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.310876Z","signature_b64":"ZDEkc7BDwuchd9KpAGJFwVr1xun8o+MfK9lgB1zmaDDfu0TzrIh4t4zVDzDMPun60/HftqU82KA89A70q+sjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d59e63e286ab60541dcb8aaebeca13174d0a2062e04bf58aadc286cc00e3201e","last_reissued_at":"2026-05-18T00:38:44.310187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.310187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4975","source_version":2,"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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rIUQmlQsVN8sPUwVULKDUa5Gs7aKeR6RdQeaa/aVseNcKw027hmNiLdVrswzrV6nZs0Cj3Eb/AECXg/6IBbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:49:10.396873Z"},"content_sha256":"83235be084d1eec6d5eb23167e50ff724ce5ce9f1abb66c7cb1dc7f0210ea94c","schema_version":"1.0","event_id":"sha256:83235be084d1eec6d5eb23167e50ff724ce5ce9f1abb66c7cb1dc7f0210ea94c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2WPGHYUGVNQFIHOLRKXL5SQTC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Latency and Cost Optimization for Erasure-coded Data Center Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.DC","authors_text":"Tian Lan, Vaneet Aggarwal, Yih-Farn R Chen, Yu Xiang","submitted_at":"2014-04-19T17:25:55Z","abstract_excerpt":"Modern distributed storage systems offer large capacity to satisfy the exponentially increasing need of storage space. They often use erasure codes to protect against disk and node failures to increase reliability, while trying to meet the latency requirements of the applications and clients. This paper provides an insightful upper bound on the average service delay of such erasure-coded storage with arbitrary service time distribution and consisting of multiple heterogeneous files. Not only does the result supersede known delay bounds that only work for a single file or homogeneous files, it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4975","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":""},"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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aw2/u8DxwCAb8cDmimuN6hb0jCgaede6k9AeLqOClBF6pPUmxX+LPmehS5fmnRaSm9WxIpAzp8/3ptbB0Fr0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:49:10.397535Z"},"content_sha256":"d3a6eb63832d516c9265b9117ad8361d9dfb2ee841c7d00d32d8d57ec2f6c456","schema_version":"1.0","event_id":"sha256:d3a6eb63832d516c9265b9117ad8361d9dfb2ee841c7d00d32d8d57ec2f6c456"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WPGHYUGVNQFIHOLRKXL5SQTC5/bundle.json","state_url":"https://pith.science/pith/2WPGHYUGVNQFIHOLRKXL5SQTC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WPGHYUGVNQFIHOLRKXL5SQTC5/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-08T16:49:10Z","links":{"resolver":"https://pith.science/pith/2WPGHYUGVNQFIHOLRKXL5SQTC5","bundle":"https://pith.science/pith/2WPGHYUGVNQFIHOLRKXL5SQTC5/bundle.json","state":"https://pith.science/pith/2WPGHYUGVNQFIHOLRKXL5SQTC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WPGHYUGVNQFIHOLRKXL5SQTC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2WPGHYUGVNQFIHOLRKXL5SQTC5","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":"cc9084d63ac405794fddeb34b7d36d554ae0b728fcd2786cf050b2f790f780c2","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-19T17:25:55Z","title_canon_sha256":"bbb419dd8be075f941ee8c12d99e46cf5b10b9bfab5c43a9bd957dfd26de42a7"},"schema_version":"1.0","source":{"id":"1404.4975","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4975","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4975v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4975","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"2WPGHYUGVNQF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2WPGHYUGVNQFIHOL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2WPGHYUG","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:d3a6eb63832d516c9265b9117ad8361d9dfb2ee841c7d00d32d8d57ec2f6c456","target":"graph","created_at":"2026-05-18T00:38:44Z","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":"Modern distributed storage systems offer large capacity to satisfy the exponentially increasing need of storage space. They often use erasure codes to protect against disk and node failures to increase reliability, while trying to meet the latency requirements of the applications and clients. This paper provides an insightful upper bound on the average service delay of such erasure-coded storage with arbitrary service time distribution and consisting of multiple heterogeneous files. Not only does the result supersede known delay bounds that only work for a single file or homogeneous files, it ","authors_text":"Tian Lan, Vaneet Aggarwal, Yih-Farn R Chen, Yu Xiang","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-19T17:25:55Z","title":"Joint Latency and Cost Optimization for Erasure-coded Data Center Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4975","kind":"arxiv","version":2},"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:83235be084d1eec6d5eb23167e50ff724ce5ce9f1abb66c7cb1dc7f0210ea94c","target":"record","created_at":"2026-05-18T00:38:44Z","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":"cc9084d63ac405794fddeb34b7d36d554ae0b728fcd2786cf050b2f790f780c2","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-19T17:25:55Z","title_canon_sha256":"bbb419dd8be075f941ee8c12d99e46cf5b10b9bfab5c43a9bd957dfd26de42a7"},"schema_version":"1.0","source":{"id":"1404.4975","kind":"arxiv","version":2}},"canonical_sha256":"d59e63e286ab60541dcb8aaebeca13174d0a2062e04bf58aadc286cc00e3201e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d59e63e286ab60541dcb8aaebeca13174d0a2062e04bf58aadc286cc00e3201e","first_computed_at":"2026-05-18T00:38:44.310187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.310187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZDEkc7BDwuchd9KpAGJFwVr1xun8o+MfK9lgB1zmaDDfu0TzrIh4t4zVDzDMPun60/HftqU82KA89A70q+sjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.310876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4975","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83235be084d1eec6d5eb23167e50ff724ce5ce9f1abb66c7cb1dc7f0210ea94c","sha256:d3a6eb63832d516c9265b9117ad8361d9dfb2ee841c7d00d32d8d57ec2f6c456"],"state_sha256":"03dbdaa82751c854698cdceba0ac364a5c2a633f1ceed1d912b4ca885d31cb00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUvASK1sIENUbX84NHCTxbqrslH8BXkQj39GiEPvDRGNZBJE+omv7HcNH5GKk50GbIQK48SwqyxZi1wyYp81Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:49:10.401234Z","bundle_sha256":"90a0a5b404ce1b1a4f287e93572dcc0bb0b7960f593ac28f38918886aa65cab3"}}