{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NHWN3E2PDXZFSDOV7MS7AZLK6B","short_pith_number":"pith:NHWN3E2P","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"},"canonical_sha256":"69ecdd934f1df2590dd5fb25f0656af059f855e05cbfc3a463ebc6bb149ee87e","source":{"kind":"arxiv","id":"1604.08230","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08230","created_at":"2026-05-18T00:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08230v2","created_at":"2026-05-18T00:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08230","created_at":"2026-05-18T00:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"NHWN3E2PDXZF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHWN3E2PDXZFSDOV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHWN3E2P","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NHWN3E2PDXZFSDOV7MS7AZLK6B","target":"record","payload":{"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"},"canonical_sha256":"69ecdd934f1df2590dd5fb25f0656af059f855e05cbfc3a463ebc6bb149ee87e","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"},"source_kind":"arxiv","source_id":"1604.08230","source_version":2,"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-18T00:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlSEX/kY+MFNHzPfHbwmPvehNpc5l8Mr9FvI157KefoyJueWFfM5u9T0peVoknUFRkFd7w5Sbvtr7cAmCaKFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:32:02.196793Z"},"content_sha256":"f36efe6029ad6970b207b7e39ebe0b81f3b9c25927946821089977e05dad478f","schema_version":"1.0","event_id":"sha256:f36efe6029ad6970b207b7e39ebe0b81f3b9c25927946821089977e05dad478f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NHWN3E2PDXZFSDOV7MS7AZLK6B","target":"graph","payload":{"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"},"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-18T00:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1vZ2ietrywgNe/4GZMnCfmJl4WU2A+gcMxrvlZAQ4rpmasDXT8vrYr4JLcPQSaM0B+rTaNY1ShgE015NXqNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:32:02.197429Z"},"content_sha256":"5e5da89cc728f200ec30809314ef76d7c449aac0ba4d5bace021ed66c383c1ae","schema_version":"1.0","event_id":"sha256:5e5da89cc728f200ec30809314ef76d7c449aac0ba4d5bace021ed66c383c1ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/bundle.json","state_url":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/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-07-07T06:32:02Z","links":{"resolver":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B","bundle":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/bundle.json","state":"https://pith.science/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHWN3E2PDXZFSDOV7MS7AZLK6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NHWN3E2PDXZFSDOV7MS7AZLK6B","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":"044a8cb9fcc85c5ad7190b4789ff6d8e4c712292bd4c33c1703676a7ac8280a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-27T20:30:25Z","title_canon_sha256":"3984e4e23145a2547146c3c3573043dafe08fd44a5be6feb0f08f9d247ad3659"},"schema_version":"1.0","source":{"id":"1604.08230","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08230","created_at":"2026-05-18T00:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08230v2","created_at":"2026-05-18T00:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08230","created_at":"2026-05-18T00:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"NHWN3E2PDXZF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHWN3E2PDXZFSDOV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHWN3E2P","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:5e5da89cc728f200ec30809314ef76d7c449aac0ba4d5bace021ed66c383c1ae","target":"graph","created_at":"2026-05-18T00:07:19Z","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":"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","authors_text":"Chih-Chun Wang, Imad Ahmad","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-27T20:30:25Z","title":"Flexible Fractional Repetition Codes for Distributed Storage Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08230","kind":"arxiv","version":2},"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:f36efe6029ad6970b207b7e39ebe0b81f3b9c25927946821089977e05dad478f","target":"record","created_at":"2026-05-18T00:07:19Z","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":"044a8cb9fcc85c5ad7190b4789ff6d8e4c712292bd4c33c1703676a7ac8280a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-27T20:30:25Z","title_canon_sha256":"3984e4e23145a2547146c3c3573043dafe08fd44a5be6feb0f08f9d247ad3659"},"schema_version":"1.0","source":{"id":"1604.08230","kind":"arxiv","version":2}},"canonical_sha256":"69ecdd934f1df2590dd5fb25f0656af059f855e05cbfc3a463ebc6bb149ee87e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69ecdd934f1df2590dd5fb25f0656af059f855e05cbfc3a463ebc6bb149ee87e","first_computed_at":"2026-05-18T00:07:19.039776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:19.039776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J2BMKiDslM4JHXZkMvolM+4aych6wZbJ0JhPJqloUqcDW2rhFAvXWwIrS+HxB+3IiIlx/I1euy+7R5SlW7B2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:19.040496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08230","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f36efe6029ad6970b207b7e39ebe0b81f3b9c25927946821089977e05dad478f","sha256:5e5da89cc728f200ec30809314ef76d7c449aac0ba4d5bace021ed66c383c1ae"],"state_sha256":"df140330324f5529f75d835e7daa59bc17ac26be39a066665629d4aab5846708"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mBb1/2yZk2wtUmLNUbqq6rfWEAy651jKhOq71/ROLPdDosvc7586HONOVOrHDiziz3fzo7keCQev/frZOocBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:32:02.201435Z","bundle_sha256":"fe0344452cd31a97efd3a3ee6fa14db4195ba4dc52cefa5711c34bd8fad390d8"}}