{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OPSHKQGCL2PPXDIJEVJKM6KATT","short_pith_number":"pith:OPSHKQGC","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"},"canonical_sha256":"73e47540c25e9efb8d092552a679409cdf86f2dc9bc71d0938457576803604c0","source":{"kind":"arxiv","id":"1202.1359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1359","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1359v1","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1359","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"OPSHKQGCL2PP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OPSHKQGCL2PPXDIJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OPSHKQGC","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OPSHKQGCL2PPXDIJEVJKM6KATT","target":"record","payload":{"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"},"canonical_sha256":"73e47540c25e9efb8d092552a679409cdf86f2dc9bc71d0938457576803604c0","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"},"source_kind":"arxiv","source_id":"1202.1359","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-18T04:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGzVWaz7R9H4WcmlPS8E4T1Mx6+rXqqBVSifImda7/IPapTQnXhoPUm57BD/AkLdOIjmevLRBk1Jq4S+Q18ACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:51:32.990267Z"},"content_sha256":"87e90f4553b9e4ebd9afa9e40c3eb735ec498bcbeb9b17ab177fa11e87068d9f","schema_version":"1.0","event_id":"sha256:87e90f4553b9e4ebd9afa9e40c3eb735ec498bcbeb9b17ab177fa11e87068d9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OPSHKQGCL2PPXDIJEVJKM6KATT","target":"graph","payload":{"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"},"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-18T04:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmEcaahQvaPTVJdovciSjE/mI2jNOBL0oYU9XwZUNsY4ivkMHpkUZECkNariqJYo7VMpW7EvXcwlFeahwE/TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:51:32.990629Z"},"content_sha256":"d8d44ab1d2ed05c762e2fcc9b6d90a538536b4919fa24bb7393a52448c1d70f5","schema_version":"1.0","event_id":"sha256:d8d44ab1d2ed05c762e2fcc9b6d90a538536b4919fa24bb7393a52448c1d70f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/bundle.json","state_url":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/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-05-28T11:51:32Z","links":{"resolver":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT","bundle":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/bundle.json","state":"https://pith.science/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPSHKQGCL2PPXDIJEVJKM6KATT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OPSHKQGCL2PPXDIJEVJKM6KATT","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":"a1dfb9f02712c3b756224bfd5a2f7ac7482fb36cacc102562c89a31f7a507eff","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-07T07:21:33Z","title_canon_sha256":"3cdd769a905e943d8df2f860268d25c8f0a1603a7024817add78af45b77a26ce"},"schema_version":"1.0","source":{"id":"1202.1359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1359","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1359v1","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1359","created_at":"2026-05-18T04:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"OPSHKQGCL2PP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OPSHKQGCL2PPXDIJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OPSHKQGC","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:d8d44ab1d2ed05c762e2fcc9b6d90a538536b4919fa24bb7393a52448c1d70f5","target":"graph","created_at":"2026-05-18T04:02:53Z","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":"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","authors_text":"Hao Zhang, Kannan Ramchandran, Longbo Huang, Sameer Pawar","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-07T07:21:33Z","title":"Codes Can Reduce Queueing Delay in Data Centers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1359","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:87e90f4553b9e4ebd9afa9e40c3eb735ec498bcbeb9b17ab177fa11e87068d9f","target":"record","created_at":"2026-05-18T04:02:53Z","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":"a1dfb9f02712c3b756224bfd5a2f7ac7482fb36cacc102562c89a31f7a507eff","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-07T07:21:33Z","title_canon_sha256":"3cdd769a905e943d8df2f860268d25c8f0a1603a7024817add78af45b77a26ce"},"schema_version":"1.0","source":{"id":"1202.1359","kind":"arxiv","version":1}},"canonical_sha256":"73e47540c25e9efb8d092552a679409cdf86f2dc9bc71d0938457576803604c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73e47540c25e9efb8d092552a679409cdf86f2dc9bc71d0938457576803604c0","first_computed_at":"2026-05-18T04:02:53.582895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:53.582895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6XjG/gKaw2QaHCZqAAEEtLJagYNcW35IvxNdJ3fca0zzI+QRt/29TqsLuzzzSHyNMAcRYCFu9CiYiNkKsRLcCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:53.583747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87e90f4553b9e4ebd9afa9e40c3eb735ec498bcbeb9b17ab177fa11e87068d9f","sha256:d8d44ab1d2ed05c762e2fcc9b6d90a538536b4919fa24bb7393a52448c1d70f5"],"state_sha256":"4ee533fa66421262b178391a952b09ea4b94a8a6a26321d749f1c92d4ce11fb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjtGS7iVyscoOKOlwlCQscJNdYpAsPxc6oIDvu0PTEhwu4AA/me5MBMMXRuxCNawRPFBu1v4aT7T5W5wTghbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:51:32.992596Z","bundle_sha256":"8bcb81fdcc98fb6afde1ac093461a402ab34471f56da2f741a72cbabcff1bd07"}}