{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I4RT4DKULWXYXPVV2WQCV5OMGH","short_pith_number":"pith:I4RT4DKU","schema_version":"1.0","canonical_sha256":"47233e0d545daf8bbeb5d5a02af5cc31fb640df639985a684af16657b1b602e4","source":{"kind":"arxiv","id":"1607.06044","version":2},"attestation_state":"computed","paper":{"title":"Tail Index for a Distributed Storage System with Pareto File Size Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Tian Lan, Vaneet Aggarwal","submitted_at":"2016-07-20T17:51:16Z","abstract_excerpt":"Distributed storage systems often employ erasure codes to achieve high data reliability while attaining space efficiency. Such storage systems are known to be susceptible to long tails in response time. It has been shown that in modern online applications such as Bing, Facebook, and Amazon, the long tail of latency is of particular concern, with $99.9$th percentile response times that are orders of magnitude worse than the mean. Taming tail latency is very challenging in erasure-coded storage systems since quantify tail latency (i.e., $x$th-percentile latency for arbitrary $x\\in[0,1]$) has bee"},"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":"1607.06044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-20T17:51:16Z","cross_cats_sorted":["cs.DC","cs.NI","math.IT"],"title_canon_sha256":"be8ed7c412b50ec15c700756361dbc847aa91bba5e5606f74b38890b0e2642aa","abstract_canon_sha256":"2764034d9268b3626da4a10098cd563dc281f1c8b9996470796b91f87836fa35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:42.210721Z","signature_b64":"G8QRdnTGuM2do4dYIbXaeyvmTnop0d6smPKVvwtIwJs5nRnvbauBCqluFTsMCKmOxo9VbhKscw0CnrmvNrAxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47233e0d545daf8bbeb5d5a02af5cc31fb640df639985a684af16657b1b602e4","last_reissued_at":"2026-05-18T00:38:42.210221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:42.210221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tail Index for a Distributed Storage System with Pareto File Size Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Tian Lan, Vaneet Aggarwal","submitted_at":"2016-07-20T17:51:16Z","abstract_excerpt":"Distributed storage systems often employ erasure codes to achieve high data reliability while attaining space efficiency. Such storage systems are known to be susceptible to long tails in response time. It has been shown that in modern online applications such as Bing, Facebook, and Amazon, the long tail of latency is of particular concern, with $99.9$th percentile response times that are orders of magnitude worse than the mean. Taming tail latency is very challenging in erasure-coded storage systems since quantify tail latency (i.e., $x$th-percentile latency for arbitrary $x\\in[0,1]$) has bee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06044","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.06044","created_at":"2026-05-18T00:38:42.210292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06044v2","created_at":"2026-05-18T00:38:42.210292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06044","created_at":"2026-05-18T00:38:42.210292+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4RT4DKULWXY","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4RT4DKULWXYXPVV","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4RT4DKU","created_at":"2026-05-18T12:30:22.444734+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/I4RT4DKULWXYXPVV2WQCV5OMGH","json":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH.json","graph_json":"https://pith.science/api/pith-number/I4RT4DKULWXYXPVV2WQCV5OMGH/graph.json","events_json":"https://pith.science/api/pith-number/I4RT4DKULWXYXPVV2WQCV5OMGH/events.json","paper":"https://pith.science/paper/I4RT4DKU"},"agent_actions":{"view_html":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH","download_json":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH.json","view_paper":"https://pith.science/paper/I4RT4DKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06044&json=true","fetch_graph":"https://pith.science/api/pith-number/I4RT4DKULWXYXPVV2WQCV5OMGH/graph.json","fetch_events":"https://pith.science/api/pith-number/I4RT4DKULWXYXPVV2WQCV5OMGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH/action/storage_attestation","attest_author":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH/action/author_attestation","sign_citation":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH/action/citation_signature","submit_replication":"https://pith.science/pith/I4RT4DKULWXYXPVV2WQCV5OMGH/action/replication_record"}},"created_at":"2026-05-18T00:38:42.210292+00:00","updated_at":"2026-05-18T00:38:42.210292+00:00"}