{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NHWN3E2PDXZFSDOV7MS7AZLK6B","short_pith_number":"pith:NHWN3E2P","schema_version":"1.0","canonical_sha256":"69ecdd934f1df2590dd5fb25f0656af059f855e05cbfc3a463ebc6bb149ee87e","source":{"kind":"arxiv","id":"1604.08230","version":2},"attestation_state":"computed","paper":{"title":"Flexible Fractional Repetition Codes for Distributed Storage Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Imad Ahmad","submitted_at":"2016-04-27T20:30:25Z","abstract_excerpt":"Consider the following fundamental question of distributed storage networks: Given any arbitrary $(n,k,d)$ values, whether there exists an intelligent helper selection scheme (assuming unlimited memory and computing power) that can strictly improve the storage-bandwidth (S-B) tradeoff. Ahmad et al. 18' answered this question by proving that for a subset of $(n,k,d)$ values, no helper selection scheme can ever improve the S-B tradeoff, and for the $(n,k,d)$ not in that subset, a new scheme called family helper selection (FHS) can strictly improve the S-B tradeoff over a blind helper selection s"},"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":"1604.08230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-27T20:30:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3984e4e23145a2547146c3c3573043dafe08fd44a5be6feb0f08f9d247ad3659","abstract_canon_sha256":"044a8cb9fcc85c5ad7190b4789ff6d8e4c712292bd4c33c1703676a7ac8280a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:19.040496Z","signature_b64":"J2BMKiDslM4JHXZkMvolM+4aych6wZbJ0JhPJqloUqcDW2rhFAvXWwIrS+HxB+3IiIlx/I1euy+7R5SlW7B2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69ecdd934f1df2590dd5fb25f0656af059f855e05cbfc3a463ebc6bb149ee87e","last_reissued_at":"2026-05-18T00:07:19.039776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:19.039776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Fractional Repetition Codes for Distributed Storage Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Imad Ahmad","submitted_at":"2016-04-27T20:30:25Z","abstract_excerpt":"Consider the following fundamental question of distributed storage networks: Given any arbitrary $(n,k,d)$ values, whether there exists an intelligent helper selection scheme (assuming unlimited memory and computing power) that can strictly improve the storage-bandwidth (S-B) tradeoff. Ahmad et al. 18' answered this question by proving that for a subset of $(n,k,d)$ values, no helper selection scheme can ever improve the S-B tradeoff, and for the $(n,k,d)$ not in that subset, a new scheme called family helper selection (FHS) can strictly improve the S-B tradeoff over a blind helper selection s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08230","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":"1604.08230","created_at":"2026-05-18T00:07:19.039890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08230v2","created_at":"2026-05-18T00:07:19.039890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08230","created_at":"2026-05-18T00:07:19.039890+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHWN3E2PDXZF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHWN3E2PDXZFSDOV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHWN3E2P","created_at":"2026-05-18T12:30:32.724797+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/NHWN3E2PDXZFSDOV7MS7AZLK6B","json":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B.json","graph_json":"https://pith.science/api/pith-number/NHWN3E2PDXZFSDOV7MS7AZLK6B/graph.json","events_json":"https://pith.science/api/pith-number/NHWN3E2PDXZFSDOV7MS7AZLK6B/events.json","paper":"https://pith.science/paper/NHWN3E2P"},"agent_actions":{"view_html":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B","download_json":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B.json","view_paper":"https://pith.science/paper/NHWN3E2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08230&json=true","fetch_graph":"https://pith.science/api/pith-number/NHWN3E2PDXZFSDOV7MS7AZLK6B/graph.json","fetch_events":"https://pith.science/api/pith-number/NHWN3E2PDXZFSDOV7MS7AZLK6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/action/storage_attestation","attest_author":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/action/author_attestation","sign_citation":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/action/citation_signature","submit_replication":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/action/replication_record"}},"created_at":"2026-05-18T00:07:19.039890+00:00","updated_at":"2026-05-18T00:07:19.039890+00:00"}