{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A7IUPLLQCNR2FPDW4CRZNB73MW","short_pith_number":"pith:A7IUPLLQ","schema_version":"1.0","canonical_sha256":"07d147ad701363a2bc76e0a39687fb659045d51bb42497da550e5b3e232bae60","source":{"kind":"arxiv","id":"1307.8083","version":1},"attestation_state":"computed","paper":{"title":"TOFEC: Achieving Optimal Throughput-Delay Trade-off of Cloud Storage Using Erasure Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.PF"],"primary_cat":"cs.NI","authors_text":"Guanfeng Liang, Ulas C. Kozat","submitted_at":"2013-07-30T18:49:33Z","abstract_excerpt":"Our paper presents solutions using erasure coding, parallel connections to storage cloud and limited chunking (i.e., dividing the object into a few smaller segments) together to significantly improve the delay performance of uploading and downloading data in and out of cloud storage.\n  TOFEC is a strategy that helps front-end proxy adapt to level of workload by treating scalable cloud storage (e.g. Amazon S3) as a shared resource requiring admission control. Under light workloads, TOFEC creates more smaller chunks and uses more parallel connections per file, minimizing service delay. Under hea"},"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":"1307.8083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-30T18:49:33Z","cross_cats_sorted":["cs.IR","cs.PF"],"title_canon_sha256":"c0b88dc2c03cfc6a80c4f4f20bb7e8d044f16268691d298d9755fc85059854a9","abstract_canon_sha256":"48ff180518ccd364afabb6319de734d483b4dabc89a21c721ac3709de42a5700"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:37.709427Z","signature_b64":"xzDeObhjxqFR9M4KnEJLMnxNsA/NvXR2HzxEfYCQGtVkAoVeNhxc9h6Pucc/SyNSN7KAkb43ijNmyAnj3vuNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d147ad701363a2bc76e0a39687fb659045d51bb42497da550e5b3e232bae60","last_reissued_at":"2026-05-18T00:51:37.709001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:37.709001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TOFEC: Achieving Optimal Throughput-Delay Trade-off of Cloud Storage Using Erasure Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.PF"],"primary_cat":"cs.NI","authors_text":"Guanfeng Liang, Ulas C. Kozat","submitted_at":"2013-07-30T18:49:33Z","abstract_excerpt":"Our paper presents solutions using erasure coding, parallel connections to storage cloud and limited chunking (i.e., dividing the object into a few smaller segments) together to significantly improve the delay performance of uploading and downloading data in and out of cloud storage.\n  TOFEC is a strategy that helps front-end proxy adapt to level of workload by treating scalable cloud storage (e.g. Amazon S3) as a shared resource requiring admission control. Under light workloads, TOFEC creates more smaller chunks and uses more parallel connections per file, minimizing service delay. Under hea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8083","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":"1307.8083","created_at":"2026-05-18T00:51:37.709062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.8083v1","created_at":"2026-05-18T00:51:37.709062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8083","created_at":"2026-05-18T00:51:37.709062+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7IUPLLQCNR2","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7IUPLLQCNR2FPDW","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7IUPLLQ","created_at":"2026-05-18T12:27:38.830355+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/A7IUPLLQCNR2FPDW4CRZNB73MW","json":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW.json","graph_json":"https://pith.science/api/pith-number/A7IUPLLQCNR2FPDW4CRZNB73MW/graph.json","events_json":"https://pith.science/api/pith-number/A7IUPLLQCNR2FPDW4CRZNB73MW/events.json","paper":"https://pith.science/paper/A7IUPLLQ"},"agent_actions":{"view_html":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW","download_json":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW.json","view_paper":"https://pith.science/paper/A7IUPLLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.8083&json=true","fetch_graph":"https://pith.science/api/pith-number/A7IUPLLQCNR2FPDW4CRZNB73MW/graph.json","fetch_events":"https://pith.science/api/pith-number/A7IUPLLQCNR2FPDW4CRZNB73MW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW/action/storage_attestation","attest_author":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW/action/author_attestation","sign_citation":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW/action/citation_signature","submit_replication":"https://pith.science/pith/A7IUPLLQCNR2FPDW4CRZNB73MW/action/replication_record"}},"created_at":"2026-05-18T00:51:37.709062+00:00","updated_at":"2026-05-18T00:51:37.709062+00:00"}