{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R7PSRBJLIPTJTGSUFNFEUZS52C","short_pith_number":"pith:R7PSRBJL","canonical_record":{"source":{"id":"1401.4734","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-19T20:26:50Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"fa6f11743556f0293a240662e72c0d3370dfd72ac4307f78b01f2260c3fd70b5","abstract_canon_sha256":"6929f4c69bc127d033d70cf503a8907114f8a894c6e9686cf49f72544c32e612"},"schema_version":"1.0"},"canonical_sha256":"8fdf28852b43e6999a542b4a4a665dd0be45647027d7adf2cc420beeae92b14b","source":{"kind":"arxiv","id":"1401.4734","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4734","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4734v3","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4734","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"R7PSRBJLIPTJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7PSRBJLIPTJTGSU","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7PSRBJL","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R7PSRBJLIPTJTGSUFNFEUZS52C","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4734","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-19T20:26:50Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"fa6f11743556f0293a240662e72c0d3370dfd72ac4307f78b01f2260c3fd70b5","abstract_canon_sha256":"6929f4c69bc127d033d70cf503a8907114f8a894c6e9686cf49f72544c32e612"},"schema_version":"1.0"},"canonical_sha256":"8fdf28852b43e6999a542b4a4a665dd0be45647027d7adf2cc420beeae92b14b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:01.663189Z","signature_b64":"aOCXpMDBRltrlUh1jERsXwBnKuaxUc+Geap8G7Dd+3DXr7xPe+M9YXRyHcRaLf2xDXGK4XasBzHUG49SiQPyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fdf28852b43e6999a542b4a4a665dd0be45647027d7adf2cc420beeae92b14b","last_reissued_at":"2026-05-18T02:29:01.662605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:01.662605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4734","source_version":3,"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-18T02:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PDEg9t+8OEBZ0z3yQI9ivrap5YJ+A7qC8Lg2ch5k243B+XcWmXd2h36wGbsWgOWnRUur10am2a0wVjdK6cyFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:25:17.107450Z"},"content_sha256":"03ccffac44b8d01c5b4a7be27c7ff17a0d139e701403c1dc037d40bce4ebbd8d","schema_version":"1.0","event_id":"sha256:03ccffac44b8d01c5b4a7be27c7ff17a0d139e701403c1dc037d40bce4ebbd8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R7PSRBJLIPTJTGSUFNFEUZS52C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Fractional Repetition Codes based on Graphs and Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Natalia Silberstein, Tuvi Etzion","submitted_at":"2014-01-19T20:26:50Z","abstract_excerpt":"Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded exact repairs having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating (MBR) codes, where a random set of a certain size of available nodes is used for a node repair, the repairs with FR codes are table based. This usually allows to store more data compared to MBR codes. In this work, we consider bounds on the fractional repetition capacity, which is the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain these bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4734","kind":"arxiv","version":3},"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-18T02:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/B114hARdQnkeZ1jEolcRvQHJuZftINixtS1QUFwSFYEUpwk0lEFyENYLGYB3Xvly2zGrxfuuF2KUhNzXW6lDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:25:17.107809Z"},"content_sha256":"4817e0e0ae27039ba17cfa23777b1b909e21de1201554414a20b7e3cfe5ed334","schema_version":"1.0","event_id":"sha256:4817e0e0ae27039ba17cfa23777b1b909e21de1201554414a20b7e3cfe5ed334"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7PSRBJLIPTJTGSUFNFEUZS52C/bundle.json","state_url":"https://pith.science/pith/R7PSRBJLIPTJTGSUFNFEUZS52C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7PSRBJLIPTJTGSUFNFEUZS52C/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-30T15:25:17Z","links":{"resolver":"https://pith.science/pith/R7PSRBJLIPTJTGSUFNFEUZS52C","bundle":"https://pith.science/pith/R7PSRBJLIPTJTGSUFNFEUZS52C/bundle.json","state":"https://pith.science/pith/R7PSRBJLIPTJTGSUFNFEUZS52C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7PSRBJLIPTJTGSUFNFEUZS52C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R7PSRBJLIPTJTGSUFNFEUZS52C","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":"6929f4c69bc127d033d70cf503a8907114f8a894c6e9686cf49f72544c32e612","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-19T20:26:50Z","title_canon_sha256":"fa6f11743556f0293a240662e72c0d3370dfd72ac4307f78b01f2260c3fd70b5"},"schema_version":"1.0","source":{"id":"1401.4734","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4734","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4734v3","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4734","created_at":"2026-05-18T02:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"R7PSRBJLIPTJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7PSRBJLIPTJTGSU","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7PSRBJL","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:4817e0e0ae27039ba17cfa23777b1b909e21de1201554414a20b7e3cfe5ed334","target":"graph","created_at":"2026-05-18T02:29:01Z","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":"Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded exact repairs having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating (MBR) codes, where a random set of a certain size of available nodes is used for a node repair, the repairs with FR codes are table based. This usually allows to store more data compared to MBR codes. In this work, we consider bounds on the fractional repetition capacity, which is the maximum amount of data that can be stored using an FR code. Optimal FR codes which attain these bou","authors_text":"Natalia Silberstein, Tuvi Etzion","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-19T20:26:50Z","title":"Optimal Fractional Repetition Codes based on Graphs and Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4734","kind":"arxiv","version":3},"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:03ccffac44b8d01c5b4a7be27c7ff17a0d139e701403c1dc037d40bce4ebbd8d","target":"record","created_at":"2026-05-18T02:29:01Z","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":"6929f4c69bc127d033d70cf503a8907114f8a894c6e9686cf49f72544c32e612","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-19T20:26:50Z","title_canon_sha256":"fa6f11743556f0293a240662e72c0d3370dfd72ac4307f78b01f2260c3fd70b5"},"schema_version":"1.0","source":{"id":"1401.4734","kind":"arxiv","version":3}},"canonical_sha256":"8fdf28852b43e6999a542b4a4a665dd0be45647027d7adf2cc420beeae92b14b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fdf28852b43e6999a542b4a4a665dd0be45647027d7adf2cc420beeae92b14b","first_computed_at":"2026-05-18T02:29:01.662605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:01.662605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aOCXpMDBRltrlUh1jERsXwBnKuaxUc+Geap8G7Dd+3DXr7xPe+M9YXRyHcRaLf2xDXGK4XasBzHUG49SiQPyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:01.663189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4734","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03ccffac44b8d01c5b4a7be27c7ff17a0d139e701403c1dc037d40bce4ebbd8d","sha256:4817e0e0ae27039ba17cfa23777b1b909e21de1201554414a20b7e3cfe5ed334"],"state_sha256":"99be3641c2ea98dbd41efbe0dad2a819913638b83733b269fb1d4e1c880c75ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yD9+1vcBEoAdLwiHRhz3MWJAmgGKhZN2wDbUowL/C3qFIPJehmeT3wFAaeoWo23FyY1sJ7ragfi5s3qdFKAxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:25:17.110411Z","bundle_sha256":"48080455c1969ca965a33baafce2c7d700e29ac48461a1380cf64fb88a026f2e"}}