{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OPSHKQGCL2PPXDIJEVJKM6KATT","short_pith_number":"pith:OPSHKQGC","schema_version":"1.0","canonical_sha256":"73e47540c25e9efb8d092552a679409cdf86f2dc9bc71d0938457576803604c0","source":{"kind":"arxiv","id":"1202.1359","version":1},"attestation_state":"computed","paper":{"title":"Codes Can Reduce Queueing Delay in Data Centers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Hao Zhang, Kannan Ramchandran, Longbo Huang, Sameer Pawar","submitted_at":"2012-02-07T07:21:33Z","abstract_excerpt":"In this paper, we quantify how much codes can reduce the data retrieval latency in storage systems. By combining a simple linear code with a novel request scheduling algorithm, which we call Blocking-one Scheduling (BoS), we show analytically that it is possible to reduce data retrieval delay by up to 17% over currently popular replication-based strategies. Although in this work we focus on a simplified setting where the storage system stores a single content, the methodology developed can be applied to more general settings with multiple contents. The results also offer insightful guidance to"},"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":"1202.1359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-07T07:21:33Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"3cdd769a905e943d8df2f860268d25c8f0a1603a7024817add78af45b77a26ce","abstract_canon_sha256":"a1dfb9f02712c3b756224bfd5a2f7ac7482fb36cacc102562c89a31f7a507eff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:53.583747Z","signature_b64":"6XjG/gKaw2QaHCZqAAEEtLJagYNcW35IvxNdJ3fca0zzI+QRt/29TqsLuzzzSHyNMAcRYCFu9CiYiNkKsRLcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e47540c25e9efb8d092552a679409cdf86f2dc9bc71d0938457576803604c0","last_reissued_at":"2026-05-18T04:02:53.582895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:53.582895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes Can Reduce Queueing Delay in Data Centers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Hao Zhang, Kannan Ramchandran, Longbo Huang, Sameer Pawar","submitted_at":"2012-02-07T07:21:33Z","abstract_excerpt":"In this paper, we quantify how much codes can reduce the data retrieval latency in storage systems. By combining a simple linear code with a novel request scheduling algorithm, which we call Blocking-one Scheduling (BoS), we show analytically that it is possible to reduce data retrieval delay by up to 17% over currently popular replication-based strategies. Although in this work we focus on a simplified setting where the storage system stores a single content, the methodology developed can be applied to more general settings with multiple contents. The results also offer insightful guidance to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1359","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":"1202.1359","created_at":"2026-05-18T04:02:53.583025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1359v1","created_at":"2026-05-18T04:02:53.583025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1359","created_at":"2026-05-18T04:02:53.583025+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPSHKQGCL2PP","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPSHKQGCL2PPXDIJ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPSHKQGC","created_at":"2026-05-18T12:27:16.716162+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/OPSHKQGCL2PPXDIJEVJKM6KATT","json":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT.json","graph_json":"https://pith.science/api/pith-number/OPSHKQGCL2PPXDIJEVJKM6KATT/graph.json","events_json":"https://pith.science/api/pith-number/OPSHKQGCL2PPXDIJEVJKM6KATT/events.json","paper":"https://pith.science/paper/OPSHKQGC"},"agent_actions":{"view_html":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT","download_json":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT.json","view_paper":"https://pith.science/paper/OPSHKQGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1359&json=true","fetch_graph":"https://pith.science/api/pith-number/OPSHKQGCL2PPXDIJEVJKM6KATT/graph.json","fetch_events":"https://pith.science/api/pith-number/OPSHKQGCL2PPXDIJEVJKM6KATT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/action/storage_attestation","attest_author":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/action/author_attestation","sign_citation":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/action/citation_signature","submit_replication":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/action/replication_record"}},"created_at":"2026-05-18T04:02:53.583025+00:00","updated_at":"2026-05-18T04:02:53.583025+00:00"}