{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:57XGTUNB3UZRIALCGHRCOBXE5P","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":"964c5e4c24a6af36cd94f83f7f6a199108df07a489efd05405ca1a83d509a95f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T14:52:00Z","title_canon_sha256":"2faca2ad3c58523f9552f4014ffeda3f45d414b8693fca749d86a83bb7bc7e51"},"schema_version":"1.0","source":{"id":"1408.5780","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5780","created_at":"2026-05-18T01:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5780v2","created_at":"2026-05-18T01:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5780","created_at":"2026-05-18T01:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"57XGTUNB3UZR","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"57XGTUNB3UZRIALC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"57XGTUNB","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:c612cf52d4fd390cdb316bfe35512d9185b7f8c8c06f3c03305b7f23506da3da","target":"graph","created_at":"2026-05-18T01:21:13Z","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 are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from the surviving nodes. In our work, we present constructions of FR codes based on Steiner systems and resolvable combinatorial designs such as affine geometries, Hadamard designs and mutually orthogonal Latin squares. The failure resilience of our codes can be varied in a simple manner. We construct codes with normalized repair bandwidth ($\\beta$) strictly la","authors_text":"Aditya Ramamoorthy, Oktay Olmez","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T14:52:00Z","title":"Fractional repetition codes with flexible repair from combinatorial designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5780","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:4a6963d1db86a3d158627e5a120afe2744860272055a406c1b5be9db64945da3","target":"record","created_at":"2026-05-18T01:21:13Z","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":"964c5e4c24a6af36cd94f83f7f6a199108df07a489efd05405ca1a83d509a95f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T14:52:00Z","title_canon_sha256":"2faca2ad3c58523f9552f4014ffeda3f45d414b8693fca749d86a83bb7bc7e51"},"schema_version":"1.0","source":{"id":"1408.5780","kind":"arxiv","version":2}},"canonical_sha256":"efee69d1a1dd3314016231e22706e4ebcf0cdb6ed95f523759a0e48836e98cfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efee69d1a1dd3314016231e22706e4ebcf0cdb6ed95f523759a0e48836e98cfe","first_computed_at":"2026-05-18T01:21:13.793901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:13.793901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GzEptN+/m3nwEtm4PdjzL+yRbh79OCX2vdaVVy8ZxzL3cX15uPrfJVnTpXvLSZmaYIaZ3LcmETDn5US5OaxwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:13.794552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5780","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a6963d1db86a3d158627e5a120afe2744860272055a406c1b5be9db64945da3","sha256:c612cf52d4fd390cdb316bfe35512d9185b7f8c8c06f3c03305b7f23506da3da"],"state_sha256":"dbc4a448c4b9fc1dbaf2943e75c8b1769f973a8f1d73c2533c686573785a9a4e"}