{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JJSNZI5YTMJVZMHK5EQWBNAACF","short_pith_number":"pith:JJSNZI5Y","canonical_record":{"source":{"id":"1711.08869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-24T05:37:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c917c3dc14e0ff060c9fc3b390049a730d2f039fe6d3f1ba090c33dae7f701d","abstract_canon_sha256":"43e00dc6ec3885ebb01d9a88b5da68f1485305bd5cb612e8f366fd88dc869102"},"schema_version":"1.0"},"canonical_sha256":"4a64dca3b89b135cb0eae92160b40011727146b47cd370940fec8b4538cd75e6","source":{"kind":"arxiv","id":"1711.08869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08869","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08869v1","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08869","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"pith_short_12","alias_value":"JJSNZI5YTMJV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JJSNZI5YTMJVZMHK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JJSNZI5Y","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JJSNZI5YTMJVZMHK5EQWBNAACF","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-24T05:37:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c917c3dc14e0ff060c9fc3b390049a730d2f039fe6d3f1ba090c33dae7f701d","abstract_canon_sha256":"43e00dc6ec3885ebb01d9a88b5da68f1485305bd5cb612e8f366fd88dc869102"},"schema_version":"1.0"},"canonical_sha256":"4a64dca3b89b135cb0eae92160b40011727146b47cd370940fec8b4538cd75e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:41.906585Z","signature_b64":"r/WzGjaKRe4m8UQMMEgEh7uJdGyZjzGBcevv23AxRjownRd/LcIXxR4/XXHf+iEtjWBY1lJTRUubmozYT1qYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a64dca3b89b135cb0eae92160b40011727146b47cd370940fec8b4538cd75e6","last_reissued_at":"2026-05-18T00:29:41.905994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:41.905994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08869","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-18T00:29:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3SqpEK950nce1+VKTpX2k0xiva36LLV0TDXKE7hcEbpsGTesiAj0OSaldRKD8QLKXtH2CZxjkFw2ZIXJLg/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:16:35.655620Z"},"content_sha256":"5045cb8b9df05b4148520aeed0782b834665f3970095550c5e44aa92839b109c","schema_version":"1.0","event_id":"sha256:5045cb8b9df05b4148520aeed0782b834665f3970095550c5e44aa92839b109c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JJSNZI5YTMJVZMHK5EQWBNAACF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Code Rates of Fractional Repetition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Gopal Benerjee, Manish K Gupta","submitted_at":"2017-11-24T05:37:02Z","abstract_excerpt":"In \\textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \\textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \\textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08869","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-18T00:29:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5U0uPTXhljYNLcUy8ZpfMoIUIkX29/dHpuem5CVLsmyF9lwgCYDatUjjMTeT5ujHl40WRUeDYALG5CXlBVvWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:16:35.656394Z"},"content_sha256":"ec615937819dc79f1a2ac38654f468e4e5e110d8f688dec5cee8a6ac24735393","schema_version":"1.0","event_id":"sha256:ec615937819dc79f1a2ac38654f468e4e5e110d8f688dec5cee8a6ac24735393"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/bundle.json","state_url":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/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-31T18:16:35Z","links":{"resolver":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF","bundle":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/bundle.json","state":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JJSNZI5YTMJVZMHK5EQWBNAACF","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":"43e00dc6ec3885ebb01d9a88b5da68f1485305bd5cb612e8f366fd88dc869102","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-24T05:37:02Z","title_canon_sha256":"0c917c3dc14e0ff060c9fc3b390049a730d2f039fe6d3f1ba090c33dae7f701d"},"schema_version":"1.0","source":{"id":"1711.08869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08869","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08869v1","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08869","created_at":"2026-05-18T00:29:41Z"},{"alias_kind":"pith_short_12","alias_value":"JJSNZI5YTMJV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JJSNZI5YTMJVZMHK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JJSNZI5Y","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:ec615937819dc79f1a2ac38654f468e4e5e110d8f688dec5cee8a6ac24735393","target":"graph","created_at":"2026-05-18T00:29:41Z","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 \\textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \\textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \\textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained.","authors_text":"Krishna Gopal Benerjee, Manish K Gupta","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-24T05:37:02Z","title":"On Code Rates of Fractional Repetition Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08869","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:5045cb8b9df05b4148520aeed0782b834665f3970095550c5e44aa92839b109c","target":"record","created_at":"2026-05-18T00:29:41Z","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":"43e00dc6ec3885ebb01d9a88b5da68f1485305bd5cb612e8f366fd88dc869102","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-24T05:37:02Z","title_canon_sha256":"0c917c3dc14e0ff060c9fc3b390049a730d2f039fe6d3f1ba090c33dae7f701d"},"schema_version":"1.0","source":{"id":"1711.08869","kind":"arxiv","version":1}},"canonical_sha256":"4a64dca3b89b135cb0eae92160b40011727146b47cd370940fec8b4538cd75e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a64dca3b89b135cb0eae92160b40011727146b47cd370940fec8b4538cd75e6","first_computed_at":"2026-05-18T00:29:41.905994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:41.905994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r/WzGjaKRe4m8UQMMEgEh7uJdGyZjzGBcevv23AxRjownRd/LcIXxR4/XXHf+iEtjWBY1lJTRUubmozYT1qYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:41.906585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5045cb8b9df05b4148520aeed0782b834665f3970095550c5e44aa92839b109c","sha256:ec615937819dc79f1a2ac38654f468e4e5e110d8f688dec5cee8a6ac24735393"],"state_sha256":"c1e7c6803daa0415d36f474c0df0787d1be69fe3304375de423c0321bc5f4495"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z20qqCQFxhlTCIMsO1bK8QoyP4IsntKI02uEikSlCqPR7pf6HmdIS/GBSPWhcTBvL4s3tZwak+pRL1Rr9E4wBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:16:35.660359Z","bundle_sha256":"9c7b94bf7d133c698f0de3448dd70864409365a1cceb178e937e3f0c3a409bb6"}}