{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SSR3WH5CH5OS7MZF3KROA3DJSM","short_pith_number":"pith:SSR3WH5C","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"},"canonical_sha256":"94a3bb1fa23f5d2fb325daa2e06c69932487ba99ad1e8a99e14671d3b4e561d8","source":{"kind":"arxiv","id":"1609.03106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03106","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03106v1","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03106","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"SSR3WH5CH5OS","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSR3WH5CH5OS7MZF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSR3WH5C","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SSR3WH5CH5OS7MZF3KROA3DJSM","target":"record","payload":{"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"},"canonical_sha256":"94a3bb1fa23f5d2fb325daa2e06c69932487ba99ad1e8a99e14671d3b4e561d8","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"},"source_kind":"arxiv","source_id":"1609.03106","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-18T01:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUBPv+i+JGyChu9SQo5XwO5qbvRvdvK6KSgcTWwuTzeuXRvcolQk2gjX/V7E5TwUH+/rsH2/bYFs2tw1+q1XCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:02:02.578347Z"},"content_sha256":"aa8cce36fb61c1dbcf2a9501303ae459158059febf1873c890672742d131f545","schema_version":"1.0","event_id":"sha256:aa8cce36fb61c1dbcf2a9501303ae459158059febf1873c890672742d131f545"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SSR3WH5CH5OS7MZF3KROA3DJSM","target":"graph","payload":{"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"},"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-18T01:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"degMtskGPrT7Ymy4ECWfW5bpyezYe5sw380j5nAdbVlejoJdHH9spZx9gNFqEeQHxOtxvtblxD2BnmFfbTGpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:02:02.578929Z"},"content_sha256":"6ef9e16bcf7e2620031efaff79f94068e4457ab7639bc247a240655545e1a005","schema_version":"1.0","event_id":"sha256:6ef9e16bcf7e2620031efaff79f94068e4457ab7639bc247a240655545e1a005"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/bundle.json","state_url":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/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-01T02:02:02Z","links":{"resolver":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM","bundle":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/bundle.json","state":"https://pith.science/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSR3WH5CH5OS7MZF3KROA3DJSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SSR3WH5CH5OS7MZF3KROA3DJSM","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":"53580a2e93ce7bba7044cad9cae38b1bb480dcc19f1936cb7806ea2f4f36b48f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-11T01:12:44Z","title_canon_sha256":"933228a59fc495e468f708ce03c5a5ef631489dea42ab3931083c90476163e2d"},"schema_version":"1.0","source":{"id":"1609.03106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03106","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03106v1","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03106","created_at":"2026-05-18T01:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"SSR3WH5CH5OS","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSR3WH5CH5OS7MZF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSR3WH5C","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:6ef9e16bcf7e2620031efaff79f94068e4457ab7639bc247a240655545e1a005","target":"graph","created_at":"2026-05-18T01:04:47Z","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":"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","authors_text":"Manish K. Gupta, Shreyansh A. Prajapati","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-11T01:12:44Z","title":"On Some Universally Good Fractional Repetition Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03106","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:aa8cce36fb61c1dbcf2a9501303ae459158059febf1873c890672742d131f545","target":"record","created_at":"2026-05-18T01:04:47Z","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":"53580a2e93ce7bba7044cad9cae38b1bb480dcc19f1936cb7806ea2f4f36b48f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-11T01:12:44Z","title_canon_sha256":"933228a59fc495e468f708ce03c5a5ef631489dea42ab3931083c90476163e2d"},"schema_version":"1.0","source":{"id":"1609.03106","kind":"arxiv","version":1}},"canonical_sha256":"94a3bb1fa23f5d2fb325daa2e06c69932487ba99ad1e8a99e14671d3b4e561d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94a3bb1fa23f5d2fb325daa2e06c69932487ba99ad1e8a99e14671d3b4e561d8","first_computed_at":"2026-05-18T01:04:47.760752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:47.760752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4WgOO4EYcCl9onWI8q6rrdlzBV+MgOh4oK5gQRNNm4M+FFEY5LdK37gU4YtIzBuMom7znoYynDD2zSLzAi4BDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:47.761256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa8cce36fb61c1dbcf2a9501303ae459158059febf1873c890672742d131f545","sha256:6ef9e16bcf7e2620031efaff79f94068e4457ab7639bc247a240655545e1a005"],"state_sha256":"b5db4a545e802338491228694ae28f3c7a762da4308a4a904ce4104393b32414"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqRgUQMNyAdbjJvydfuS/2JMMW530Dr8a4aWy5Z4xVhXyhj8qgxkvA9JRFDLK6wvI/O7YY4C6/Vrab9TXaXzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:02:02.583136Z","bundle_sha256":"c657be4dc3b2e11f9bdd87f128f34ec9185055800b1f589daa06b32aa29fe61c"}}