{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SSR3WH5CH5OS7MZF3KROA3DJSM","short_pith_number":"pith:SSR3WH5C","schema_version":"1.0","canonical_sha256":"94a3bb1fa23f5d2fb325daa2e06c69932487ba99ad1e8a99e14671d3b4e561d8","source":{"kind":"arxiv","id":"1609.03106","version":1},"attestation_state":"computed","paper":{"title":"On Some Universally Good Fractional Repetition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Manish K. Gupta, Shreyansh A. Prajapati","submitted_at":"2016-09-11T01:12:44Z","abstract_excerpt":"Data storage in Distributed Storage Systems (DSSs) is a multidimensional optimization problem. Using network coding, one wants to provide reliability, scalability, security, reduced storage overhead, reduced bandwidth for repair and minimal disk I/O etc. in such systems. Regenerating codes have been used to optimize some of these parameters, where a file can be reconstructed by contacting any k nodes in the system and in case of node failure it can be repaired by using any d nodes in the system. This was further generalized to Fractional repetition (FR) codes (a smart replication of encoded pa"},"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":"1609.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-11T01:12:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"933228a59fc495e468f708ce03c5a5ef631489dea42ab3931083c90476163e2d","abstract_canon_sha256":"53580a2e93ce7bba7044cad9cae38b1bb480dcc19f1936cb7806ea2f4f36b48f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:47.761256Z","signature_b64":"4WgOO4EYcCl9onWI8q6rrdlzBV+MgOh4oK5gQRNNm4M+FFEY5LdK37gU4YtIzBuMom7znoYynDD2zSLzAi4BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a3bb1fa23f5d2fb325daa2e06c69932487ba99ad1e8a99e14671d3b4e561d8","last_reissued_at":"2026-05-18T01:04:47.760752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:47.760752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Some Universally Good Fractional Repetition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Manish K. Gupta, Shreyansh A. Prajapati","submitted_at":"2016-09-11T01:12:44Z","abstract_excerpt":"Data storage in Distributed Storage Systems (DSSs) is a multidimensional optimization problem. Using network coding, one wants to provide reliability, scalability, security, reduced storage overhead, reduced bandwidth for repair and minimal disk I/O etc. in such systems. Regenerating codes have been used to optimize some of these parameters, where a file can be reconstructed by contacting any k nodes in the system and in case of node failure it can be repaired by using any d nodes in the system. This was further generalized to Fractional repetition (FR) codes (a smart replication of encoded pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03106","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":"1609.03106","created_at":"2026-05-18T01:04:47.760830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03106v1","created_at":"2026-05-18T01:04:47.760830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03106","created_at":"2026-05-18T01:04:47.760830+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSR3WH5CH5OS","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSR3WH5CH5OS7MZF","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSR3WH5C","created_at":"2026-05-18T12:30:44.179134+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/SSR3WH5CH5OS7MZF3KROA3DJSM","json":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM.json","graph_json":"https://pith.science/api/pith-number/SSR3WH5CH5OS7MZF3KROA3DJSM/graph.json","events_json":"https://pith.science/api/pith-number/SSR3WH5CH5OS7MZF3KROA3DJSM/events.json","paper":"https://pith.science/paper/SSR3WH5C"},"agent_actions":{"view_html":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM","download_json":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM.json","view_paper":"https://pith.science/paper/SSR3WH5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03106&json=true","fetch_graph":"https://pith.science/api/pith-number/SSR3WH5CH5OS7MZF3KROA3DJSM/graph.json","fetch_events":"https://pith.science/api/pith-number/SSR3WH5CH5OS7MZF3KROA3DJSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/action/storage_attestation","attest_author":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/action/author_attestation","sign_citation":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/action/citation_signature","submit_replication":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/action/replication_record"}},"created_at":"2026-05-18T01:04:47.760830+00:00","updated_at":"2026-05-18T01:04:47.760830+00:00"}