{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NEIH6YPZ5GZBGVZBN3XOAUYOFR","short_pith_number":"pith:NEIH6YPZ","canonical_record":{"source":{"id":"1210.2110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T22:05:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f6d27dd602206f7673f105c6322388c6615a2587638694b09ccbaf27af1ef77","abstract_canon_sha256":"e801413da00e7d294daba15e5f38f24f5e88f0ab8b924c59b6695d099f1bdef4"},"schema_version":"1.0"},"canonical_sha256":"69107f61f9e9b21357216eeee0530e2c7825fab7f256aecd60ab7c560df9ab28","source":{"kind":"arxiv","id":"1210.2110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2110","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2110v1","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2110","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"NEIH6YPZ5GZB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NEIH6YPZ5GZBGVZB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NEIH6YPZ","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NEIH6YPZ5GZBGVZBN3XOAUYOFR","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T22:05:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f6d27dd602206f7673f105c6322388c6615a2587638694b09ccbaf27af1ef77","abstract_canon_sha256":"e801413da00e7d294daba15e5f38f24f5e88f0ab8b924c59b6695d099f1bdef4"},"schema_version":"1.0"},"canonical_sha256":"69107f61f9e9b21357216eeee0530e2c7825fab7f256aecd60ab7c560df9ab28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:38.283349Z","signature_b64":"C2jRI/8cxkA9DBaFtnGoBmmTdV8u7JZzAYsjDFSMdjt5U6nu+XMC3LbA09O6epWDKFPQms9pa1IHoBIOsefXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69107f61f9e9b21357216eeee0530e2c7825fab7f256aecd60ab7c560df9ab28","last_reissued_at":"2026-05-18T03:40:38.282622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:38.282622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2110","source_version":1,"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-18T03:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4nfy9TLk3ZdsR2ArYJJ37/b/y9/pSSrd3heaHv+4efMtsgCaI+ubUS8Bc/zB1T58lhN485DTwfwcq4Tu1h5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:16:24.591397Z"},"content_sha256":"13d4aa584fcbee6d0362f84a317dbf98be4d093c361758e3c24d1e98bf2300b2","schema_version":"1.0","event_id":"sha256:13d4aa584fcbee6d0362f84a317dbf98be4d093c361758e3c24d1e98bf2300b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NEIH6YPZ5GZBGVZBN3XOAUYOFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repairable Replication-based Storage Systems Using Resolvable Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Oktay Olmez","submitted_at":"2012-10-07T22:05:05Z","abstract_excerpt":"We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in prior work and consist of an outer MDS code followed by an inner fractional repetition (FR) code where copies of the coded symbols are placed on the storage nodes. The main challenge in this domain is the design of the inner FR code.\n  In our work, we consider generalizations of FR codes, by establishing their connection with a family of combinatorial struct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2110","kind":"arxiv","version":1},"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-18T03:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NF6syO3kFV8zwkfT6BIEOVPNQm5CYO1Gk2s9hsS5RwsRALUS0e4j6d613xibNOlkmVw6sZZAQLjPcmTl53+UBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:16:24.592018Z"},"content_sha256":"c091c683f4ac8589db949f3b35ac1ef87386969b07accc4a6b7c60b16afc8dfc","schema_version":"1.0","event_id":"sha256:c091c683f4ac8589db949f3b35ac1ef87386969b07accc4a6b7c60b16afc8dfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEIH6YPZ5GZBGVZBN3XOAUYOFR/bundle.json","state_url":"https://pith.science/pith/NEIH6YPZ5GZBGVZBN3XOAUYOFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEIH6YPZ5GZBGVZBN3XOAUYOFR/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-08T03:16:24Z","links":{"resolver":"https://pith.science/pith/NEIH6YPZ5GZBGVZBN3XOAUYOFR","bundle":"https://pith.science/pith/NEIH6YPZ5GZBGVZBN3XOAUYOFR/bundle.json","state":"https://pith.science/pith/NEIH6YPZ5GZBGVZBN3XOAUYOFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEIH6YPZ5GZBGVZBN3XOAUYOFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NEIH6YPZ5GZBGVZBN3XOAUYOFR","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":"e801413da00e7d294daba15e5f38f24f5e88f0ab8b924c59b6695d099f1bdef4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T22:05:05Z","title_canon_sha256":"8f6d27dd602206f7673f105c6322388c6615a2587638694b09ccbaf27af1ef77"},"schema_version":"1.0","source":{"id":"1210.2110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2110","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2110v1","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2110","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"NEIH6YPZ5GZB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NEIH6YPZ5GZBGVZB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NEIH6YPZ","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:c091c683f4ac8589db949f3b35ac1ef87386969b07accc4a6b7c60b16afc8dfc","target":"graph","created_at":"2026-05-18T03:40:38Z","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":"We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in prior work and consist of an outer MDS code followed by an inner fractional repetition (FR) code where copies of the coded symbols are placed on the storage nodes. The main challenge in this domain is the design of the inner FR code.\n  In our work, we consider generalizations of FR codes, by establishing their connection with a family of combinatorial struct","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":"2012-10-07T22:05:05Z","title":"Repairable Replication-based Storage Systems Using Resolvable Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2110","kind":"arxiv","version":1},"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:13d4aa584fcbee6d0362f84a317dbf98be4d093c361758e3c24d1e98bf2300b2","target":"record","created_at":"2026-05-18T03:40:38Z","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":"e801413da00e7d294daba15e5f38f24f5e88f0ab8b924c59b6695d099f1bdef4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-07T22:05:05Z","title_canon_sha256":"8f6d27dd602206f7673f105c6322388c6615a2587638694b09ccbaf27af1ef77"},"schema_version":"1.0","source":{"id":"1210.2110","kind":"arxiv","version":1}},"canonical_sha256":"69107f61f9e9b21357216eeee0530e2c7825fab7f256aecd60ab7c560df9ab28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69107f61f9e9b21357216eeee0530e2c7825fab7f256aecd60ab7c560df9ab28","first_computed_at":"2026-05-18T03:40:38.282622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:38.282622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2jRI/8cxkA9DBaFtnGoBmmTdV8u7JZzAYsjDFSMdjt5U6nu+XMC3LbA09O6epWDKFPQms9pa1IHoBIOsefXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:38.283349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13d4aa584fcbee6d0362f84a317dbf98be4d093c361758e3c24d1e98bf2300b2","sha256:c091c683f4ac8589db949f3b35ac1ef87386969b07accc4a6b7c60b16afc8dfc"],"state_sha256":"1ec766e92f3d40d5821a8c731a4cd9508eee9563afc26b1dede90be78daed7d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8Kp/m2vq8eGK2gv4pEgp+3VIxuYp0RtM4QheLNsTA81o61DRkOEUdZ91SuzkEv13qw3RhWm1cNVRWvGuHKFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:16:24.596453Z","bundle_sha256":"d88e892faeec83ded0cffacc4b897854727dd7658be04fbbde265c7acf208665"}}