{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:43VIBZNAF6LJFN5XR2C4FELVCO","short_pith_number":"pith:43VIBZNA","schema_version":"1.0","canonical_sha256":"e6ea80e5a02f9692b7b78e85c2917513849d71dc1e1e06aee70321966ce23807","source":{"kind":"arxiv","id":"1804.06489","version":1},"attestation_state":"computed","paper":{"title":"Simplex Queues for Hot-Data Download","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Elie Najm, Emina Soljanin, Mehmet Fatih Aktas","submitted_at":"2018-04-17T22:26:48Z","abstract_excerpt":"In cloud storage systems, hot data is usually replicated over multiple nodes in order to accommodate simultaneous access by multiple users as well as increase the fault tolerance of the system. Recent cloud storage research has proposed using availability codes, which is a special class of erasure codes, as a more storage efficient way to store hot data. These codes enable data recovery from multiple, small disjoint groups of servers. The number of the recovery groups is referred to as the availability and the size of each group as the locality of the code. Until now, we have very limited know"},"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":"1804.06489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-17T22:26:48Z","cross_cats_sorted":["cs.PF","math.IT"],"title_canon_sha256":"331bed99881cb66d521a574cf099ce63100a9fdb666c62ac045515c3474f1a02","abstract_canon_sha256":"59b7b91dbaa866706c8fce251e3e5c7082284197886d14fe22cac8884dd281d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:06.480677Z","signature_b64":"Ak7W6cTvPwuLrdOJQWUSrdq3HrlxGzwMSsywd+ShpJmB4iE0G8ur+mbJqtCURNZhLvI9raTnvE0/WI1ftwitCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6ea80e5a02f9692b7b78e85c2917513849d71dc1e1e06aee70321966ce23807","last_reissued_at":"2026-05-18T00:18:06.480079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:06.480079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplex Queues for Hot-Data Download","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Elie Najm, Emina Soljanin, Mehmet Fatih Aktas","submitted_at":"2018-04-17T22:26:48Z","abstract_excerpt":"In cloud storage systems, hot data is usually replicated over multiple nodes in order to accommodate simultaneous access by multiple users as well as increase the fault tolerance of the system. Recent cloud storage research has proposed using availability codes, which is a special class of erasure codes, as a more storage efficient way to store hot data. These codes enable data recovery from multiple, small disjoint groups of servers. The number of the recovery groups is referred to as the availability and the size of each group as the locality of the code. Until now, we have very limited know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06489","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":"1804.06489","created_at":"2026-05-18T00:18:06.480168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06489v1","created_at":"2026-05-18T00:18:06.480168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06489","created_at":"2026-05-18T00:18:06.480168+00:00"},{"alias_kind":"pith_short_12","alias_value":"43VIBZNAF6LJ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"43VIBZNAF6LJFN5X","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"43VIBZNA","created_at":"2026-05-18T12:32:05.422762+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/43VIBZNAF6LJFN5XR2C4FELVCO","json":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO.json","graph_json":"https://pith.science/api/pith-number/43VIBZNAF6LJFN5XR2C4FELVCO/graph.json","events_json":"https://pith.science/api/pith-number/43VIBZNAF6LJFN5XR2C4FELVCO/events.json","paper":"https://pith.science/paper/43VIBZNA"},"agent_actions":{"view_html":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO","download_json":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO.json","view_paper":"https://pith.science/paper/43VIBZNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06489&json=true","fetch_graph":"https://pith.science/api/pith-number/43VIBZNAF6LJFN5XR2C4FELVCO/graph.json","fetch_events":"https://pith.science/api/pith-number/43VIBZNAF6LJFN5XR2C4FELVCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO/action/storage_attestation","attest_author":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO/action/author_attestation","sign_citation":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO/action/citation_signature","submit_replication":"https://pith.science/pith/43VIBZNAF6LJFN5XR2C4FELVCO/action/replication_record"}},"created_at":"2026-05-18T00:18:06.480168+00:00","updated_at":"2026-05-18T00:18:06.480168+00:00"}