{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NPKWCH5N6MIKYTTALZFOGA4JDP","short_pith_number":"pith:NPKWCH5N","schema_version":"1.0","canonical_sha256":"6bd5611fadf310ac4e605e4ae303891bef216bcc12af12427a2515b0943c792e","source":{"kind":"arxiv","id":"1703.08337","version":1},"attestation_state":"computed","paper":{"title":"Taming Tail Latency for Erasure-coded, Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Abubakr O. Al-Abbasi, Jingxian Fan, Tian Lan, Vaneet Aggarwal","submitted_at":"2017-03-24T10:09:03Z","abstract_excerpt":"Distributed storage systems are known to be susceptible to long tails in response time. In modern online storage systems such as Bing, Facebook, and Amazon, the long tails of the service latency are of particular concern. with 99.9th percentile response times being orders of magnitude worse than the mean. As erasure codes emerge as a popular technique to achieve high data reliability in distributed storage while attaining space efficiency, taming tail latency still remains an open problem due to the lack of mathematical models for analyzing such systems. To this end, we propose a framework for"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.08337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-24T10:09:03Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"4c6b967379f38720a6f393d89fe45bb7a16ac3f0c21e518a4ca9b7175486f135","abstract_canon_sha256":"d283106858b72bfe923f8a4ec7bf05b8f9fda64f4ba4de594167321424f2ab95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:31.974831Z","signature_b64":"YS7QOew+hAOVeFvA9B5YAtSz4Wv56/r/nMAGkvvV2SGX9KlGHgfpuHegwR0430VnyhubE2h56sfwp0+HO2CwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bd5611fadf310ac4e605e4ae303891bef216bcc12af12427a2515b0943c792e","last_reissued_at":"2026-05-18T00:45:31.974365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:31.974365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Taming Tail Latency for Erasure-coded, Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Abubakr O. Al-Abbasi, Jingxian Fan, Tian Lan, Vaneet Aggarwal","submitted_at":"2017-03-24T10:09:03Z","abstract_excerpt":"Distributed storage systems are known to be susceptible to long tails in response time. In modern online storage systems such as Bing, Facebook, and Amazon, the long tails of the service latency are of particular concern. with 99.9th percentile response times being orders of magnitude worse than the mean. As erasure codes emerge as a popular technique to achieve high data reliability in distributed storage while attaining space efficiency, taming tail latency still remains an open problem due to the lack of mathematical models for analyzing such systems. To this end, we propose a framework for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08337","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.08337","created_at":"2026-05-18T00:45:31.974465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08337v1","created_at":"2026-05-18T00:45:31.974465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08337","created_at":"2026-05-18T00:45:31.974465+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPKWCH5N6MIK","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPKWCH5N6MIKYTTA","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPKWCH5N","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP","json":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP.json","graph_json":"https://pith.science/api/pith-number/NPKWCH5N6MIKYTTALZFOGA4JDP/graph.json","events_json":"https://pith.science/api/pith-number/NPKWCH5N6MIKYTTALZFOGA4JDP/events.json","paper":"https://pith.science/paper/NPKWCH5N"},"agent_actions":{"view_html":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP","download_json":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP.json","view_paper":"https://pith.science/paper/NPKWCH5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08337&json=true","fetch_graph":"https://pith.science/api/pith-number/NPKWCH5N6MIKYTTALZFOGA4JDP/graph.json","fetch_events":"https://pith.science/api/pith-number/NPKWCH5N6MIKYTTALZFOGA4JDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP/action/storage_attestation","attest_author":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP/action/author_attestation","sign_citation":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP/action/citation_signature","submit_replication":"https://pith.science/pith/NPKWCH5N6MIKYTTALZFOGA4JDP/action/replication_record"}},"created_at":"2026-05-18T00:45:31.974465+00:00","updated_at":"2026-05-18T00:45:31.974465+00:00"}