{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JJSNZI5YTMJVZMHK5EQWBNAACF","short_pith_number":"pith:JJSNZI5Y","schema_version":"1.0","canonical_sha256":"4a64dca3b89b135cb0eae92160b40011727146b47cd370940fec8b4538cd75e6","source":{"kind":"arxiv","id":"1711.08869","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.08869","created_at":"2026-05-18T00:29:41.906114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08869v1","created_at":"2026-05-18T00:29:41.906114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08869","created_at":"2026-05-18T00:29:41.906114+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJSNZI5YTMJV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJSNZI5YTMJVZMHK","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJSNZI5Y","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF","json":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF.json","graph_json":"https://pith.science/api/pith-number/JJSNZI5YTMJVZMHK5EQWBNAACF/graph.json","events_json":"https://pith.science/api/pith-number/JJSNZI5YTMJVZMHK5EQWBNAACF/events.json","paper":"https://pith.science/paper/JJSNZI5Y"},"agent_actions":{"view_html":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF","download_json":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF.json","view_paper":"https://pith.science/paper/JJSNZI5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08869&json=true","fetch_graph":"https://pith.science/api/pith-number/JJSNZI5YTMJVZMHK5EQWBNAACF/graph.json","fetch_events":"https://pith.science/api/pith-number/JJSNZI5YTMJVZMHK5EQWBNAACF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/action/storage_attestation","attest_author":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/action/author_attestation","sign_citation":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/action/citation_signature","submit_replication":"https://pith.science/pith/JJSNZI5YTMJVZMHK5EQWBNAACF/action/replication_record"}},"created_at":"2026-05-18T00:29:41.906114+00:00","updated_at":"2026-05-18T00:29:41.906114+00:00"}