{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QRYI6KNJMSPETUBARLLZNIGHUV","short_pith_number":"pith:QRYI6KNJ","canonical_record":{"source":{"id":"1102.3493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T04:31:27Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"a0e831706bbee886d5f64e6627b3f5560b153f01a89cf835ae0b96411c97d028","abstract_canon_sha256":"716d44c4dd6adff18f3e5fe5cd1580b673d2333b990d06cf68016827ea4ecd65"},"schema_version":"1.0"},"canonical_sha256":"84708f29a9649e49d0208ad796a0c7a5489b0bd49d18f4b004d44a892e729b16","source":{"kind":"arxiv","id":"1102.3493","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3493","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3493v2","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3493","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QRYI6KNJMSPE","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QRYI6KNJMSPETUBA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QRYI6KNJ","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QRYI6KNJMSPETUBARLLZNIGHUV","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T04:31:27Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"a0e831706bbee886d5f64e6627b3f5560b153f01a89cf835ae0b96411c97d028","abstract_canon_sha256":"716d44c4dd6adff18f3e5fe5cd1580b673d2333b990d06cf68016827ea4ecd65"},"schema_version":"1.0"},"canonical_sha256":"84708f29a9649e49d0208ad796a0c7a5489b0bd49d18f4b004d44a892e729b16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:06.824040Z","signature_b64":"MF9zVeYbpo1HKooOUqVYeo2G8C5ObNQIabk5i3FuPX7D6Vr/9dBHDb2FuD88ClAMZ8wxKOEU+SRkfbr6XBrkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84708f29a9649e49d0208ad796a0c7a5489b0bd49d18f4b004d44a892e729b16","last_reissued_at":"2026-05-18T04:04:06.821758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:06.821758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3493","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-18T04:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7Tl3ut9ZW0sknyBPMOclWaNPj3TdeDOVd9Xw124ZPH540TGdVX6dT2gmXYu+uauLG3AVy6+LhJuS6ViPcqABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:31:09.900296Z"},"content_sha256":"3aa29f5f7421d2b66882172ead4ffbdc827e4f9a2ed6d0e159178e7f0df61879","schema_version":"1.0","event_id":"sha256:3aa29f5f7421d2b66882172ead4ffbdc827e4f9a2ed6d0e159178e7f0df61879"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QRYI6KNJMSPETUBARLLZNIGHUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable constructions of fractional repetition codes in distributed storage systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"John Gill, Joseph C. Koo","submitted_at":"2011-02-17T04:31:27Z","abstract_excerpt":"In distributed storage systems built using commodity hardware, it is necessary to have data redundancy in order to ensure system reliability. In such systems, it is also often desirable to be able to quickly repair storage nodes that fail. We consider a scheme--introduced by El Rouayheb and Ramchandran--which uses combinatorial block design in order to design storage systems that enable efficient (and exact) node repair. In this work, we investigate systems where node sizes may be much larger than replication degrees, and explicitly provide algorithms for constructing these storage designs. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3493","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-18T04:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VoVYdPXu8zN+X9V1Ie8oJJTBKV3KX6hoxo8zN/iuGDQrJv/isAM1GdkiCSkpz0oYqC9lZ7GAcrs7u8ORzw/XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:31:09.900797Z"},"content_sha256":"f94d083e6c47dceeddce041028a84a4300a52faf01a18880f0e343eaf3610aa0","schema_version":"1.0","event_id":"sha256:f94d083e6c47dceeddce041028a84a4300a52faf01a18880f0e343eaf3610aa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRYI6KNJMSPETUBARLLZNIGHUV/bundle.json","state_url":"https://pith.science/pith/QRYI6KNJMSPETUBARLLZNIGHUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRYI6KNJMSPETUBARLLZNIGHUV/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-06-25T21:31:09Z","links":{"resolver":"https://pith.science/pith/QRYI6KNJMSPETUBARLLZNIGHUV","bundle":"https://pith.science/pith/QRYI6KNJMSPETUBARLLZNIGHUV/bundle.json","state":"https://pith.science/pith/QRYI6KNJMSPETUBARLLZNIGHUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRYI6KNJMSPETUBARLLZNIGHUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QRYI6KNJMSPETUBARLLZNIGHUV","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":"716d44c4dd6adff18f3e5fe5cd1580b673d2333b990d06cf68016827ea4ecd65","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T04:31:27Z","title_canon_sha256":"a0e831706bbee886d5f64e6627b3f5560b153f01a89cf835ae0b96411c97d028"},"schema_version":"1.0","source":{"id":"1102.3493","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3493","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3493v2","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3493","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QRYI6KNJMSPE","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QRYI6KNJMSPETUBA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QRYI6KNJ","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:f94d083e6c47dceeddce041028a84a4300a52faf01a18880f0e343eaf3610aa0","target":"graph","created_at":"2026-05-18T04:04:06Z","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":"In distributed storage systems built using commodity hardware, it is necessary to have data redundancy in order to ensure system reliability. In such systems, it is also often desirable to be able to quickly repair storage nodes that fail. We consider a scheme--introduced by El Rouayheb and Ramchandran--which uses combinatorial block design in order to design storage systems that enable efficient (and exact) node repair. In this work, we investigate systems where node sizes may be much larger than replication degrees, and explicitly provide algorithms for constructing these storage designs. Ou","authors_text":"John Gill, Joseph C. Koo","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T04:31:27Z","title":"Scalable constructions of fractional repetition codes in distributed storage systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3493","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:3aa29f5f7421d2b66882172ead4ffbdc827e4f9a2ed6d0e159178e7f0df61879","target":"record","created_at":"2026-05-18T04:04:06Z","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":"716d44c4dd6adff18f3e5fe5cd1580b673d2333b990d06cf68016827ea4ecd65","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T04:31:27Z","title_canon_sha256":"a0e831706bbee886d5f64e6627b3f5560b153f01a89cf835ae0b96411c97d028"},"schema_version":"1.0","source":{"id":"1102.3493","kind":"arxiv","version":2}},"canonical_sha256":"84708f29a9649e49d0208ad796a0c7a5489b0bd49d18f4b004d44a892e729b16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84708f29a9649e49d0208ad796a0c7a5489b0bd49d18f4b004d44a892e729b16","first_computed_at":"2026-05-18T04:04:06.821758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:06.821758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MF9zVeYbpo1HKooOUqVYeo2G8C5ObNQIabk5i3FuPX7D6Vr/9dBHDb2FuD88ClAMZ8wxKOEU+SRkfbr6XBrkCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:06.824040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3493","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aa29f5f7421d2b66882172ead4ffbdc827e4f9a2ed6d0e159178e7f0df61879","sha256:f94d083e6c47dceeddce041028a84a4300a52faf01a18880f0e343eaf3610aa0"],"state_sha256":"0fbf8c2b63fd6e922ce632b71d3fa05622064694e88f4bc969335904f26c47c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7UPrWcQIYSZl3GIUWR91ar7Kq5ylKOROx1sBM3v3zsJXsThR6dJqMLNDvNjL7vYIKC6maYbp5DtsZ4/ttVsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:31:09.903389Z","bundle_sha256":"dcd9d3019c519c73bb10e6d3e2babc8b83e03c277b67fbe168ecf407006f76aa"}}