{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HRBHVYV3LGBYM3XC4HRCOWSPL6","short_pith_number":"pith:HRBHVYV3","canonical_record":{"source":{"id":"1907.03931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T01:21:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"434ea485e84937f43a9d97a9837f712fdab2a35dc648784ebac618b100a71d9b","abstract_canon_sha256":"efaf3289b75a6b6aeacd7a60e1421ff62f8dfab4940a87639d587f022084ac92"},"schema_version":"1.0"},"canonical_sha256":"3c427ae2bb5983866ee2e1e2275a4f5f83feb94bbf91dacbed612ecbd7c055ba","source":{"kind":"arxiv","id":"1907.03931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03931","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03931v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03931","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"HRBHVYV3LGBY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRBHVYV3LGBYM3XC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRBHVYV3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HRBHVYV3LGBYM3XC4HRCOWSPL6","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T01:21:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"434ea485e84937f43a9d97a9837f712fdab2a35dc648784ebac618b100a71d9b","abstract_canon_sha256":"efaf3289b75a6b6aeacd7a60e1421ff62f8dfab4940a87639d587f022084ac92"},"schema_version":"1.0"},"canonical_sha256":"3c427ae2bb5983866ee2e1e2275a4f5f83feb94bbf91dacbed612ecbd7c055ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:06.333477Z","signature_b64":"/HBKRESaFx8hCf9yv8OH5mdo8ws/Id+I8RwDrFrtXOgd+TCbzws1u/M/ORt9DuBBT/YXh0NDzKMZoqhHwrVWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c427ae2bb5983866ee2e1e2275a4f5f83feb94bbf91dacbed612ecbd7c055ba","last_reissued_at":"2026-05-17T23:41:06.332828Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:06.332828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03931","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-17T23:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nq8fcmsecjutHn+hrNqgGmazDr3q20k5zKaXgglfWWjrbvdWeZcxb/Sp7NP+fkCZ+YMojd3fRLe8faxNgG2bDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:24:41.324387Z"},"content_sha256":"d14dba2abb048788afa39648801e3a1711ce7a40c29c3a5c153f862f53c9c75c","schema_version":"1.0","event_id":"sha256:d14dba2abb048788afa39648801e3a1711ce7a40c29c3a5c153f862f53c9c75c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HRBHVYV3LGBYM3XC4HRCOWSPL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Haotian Jiang, Venkatesan Guruswami","submitted_at":"2019-07-09T01:21:27Z","abstract_excerpt":"Minimum storage regenerating (MSR) codes are MDS codes which allow for recovery of any single erased symbol with optimal repair bandwidth, based on the smallest possible fraction of the contents downloaded from each of the other symbols. Recently, certain Reed-Solomon codes were constructed which are MSR. However, the sub-packetization of these codes is exponentially large, growing like $n^{\\Omega(n)}$ in the constant-rate regime. In this work, we study the relaxed notion of $\\epsilon$-MSR codes, which incur a factor of $(1+\\epsilon)$ higher than the optimal repair bandwidth, in the context of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03931","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-17T23:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3u2RS3sE4dhx0bUfHB16st9zIWIkCmZd2MsbXwp9oGjwO621uJ/k1nR68gxezV4GcwrW2MgNyycGSQOvIh2fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:24:41.325069Z"},"content_sha256":"35e4677e4877b8e370f027d8b80c399dc5a20d8c5cf3611624e4bdab69fa1a92","schema_version":"1.0","event_id":"sha256:35e4677e4877b8e370f027d8b80c399dc5a20d8c5cf3611624e4bdab69fa1a92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRBHVYV3LGBYM3XC4HRCOWSPL6/bundle.json","state_url":"https://pith.science/pith/HRBHVYV3LGBYM3XC4HRCOWSPL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRBHVYV3LGBYM3XC4HRCOWSPL6/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-26T02:24:41Z","links":{"resolver":"https://pith.science/pith/HRBHVYV3LGBYM3XC4HRCOWSPL6","bundle":"https://pith.science/pith/HRBHVYV3LGBYM3XC4HRCOWSPL6/bundle.json","state":"https://pith.science/pith/HRBHVYV3LGBYM3XC4HRCOWSPL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRBHVYV3LGBYM3XC4HRCOWSPL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HRBHVYV3LGBYM3XC4HRCOWSPL6","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":"efaf3289b75a6b6aeacd7a60e1421ff62f8dfab4940a87639d587f022084ac92","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T01:21:27Z","title_canon_sha256":"434ea485e84937f43a9d97a9837f712fdab2a35dc648784ebac618b100a71d9b"},"schema_version":"1.0","source":{"id":"1907.03931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03931","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03931v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03931","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"HRBHVYV3LGBY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRBHVYV3LGBYM3XC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRBHVYV3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:35e4677e4877b8e370f027d8b80c399dc5a20d8c5cf3611624e4bdab69fa1a92","target":"graph","created_at":"2026-05-17T23:41:06Z","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":"Minimum storage regenerating (MSR) codes are MDS codes which allow for recovery of any single erased symbol with optimal repair bandwidth, based on the smallest possible fraction of the contents downloaded from each of the other symbols. Recently, certain Reed-Solomon codes were constructed which are MSR. However, the sub-packetization of these codes is exponentially large, growing like $n^{\\Omega(n)}$ in the constant-rate regime. In this work, we study the relaxed notion of $\\epsilon$-MSR codes, which incur a factor of $(1+\\epsilon)$ higher than the optimal repair bandwidth, in the context of","authors_text":"Haotian Jiang, Venkatesan Guruswami","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T01:21:27Z","title":"Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03931","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:d14dba2abb048788afa39648801e3a1711ce7a40c29c3a5c153f862f53c9c75c","target":"record","created_at":"2026-05-17T23:41:06Z","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":"efaf3289b75a6b6aeacd7a60e1421ff62f8dfab4940a87639d587f022084ac92","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T01:21:27Z","title_canon_sha256":"434ea485e84937f43a9d97a9837f712fdab2a35dc648784ebac618b100a71d9b"},"schema_version":"1.0","source":{"id":"1907.03931","kind":"arxiv","version":1}},"canonical_sha256":"3c427ae2bb5983866ee2e1e2275a4f5f83feb94bbf91dacbed612ecbd7c055ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c427ae2bb5983866ee2e1e2275a4f5f83feb94bbf91dacbed612ecbd7c055ba","first_computed_at":"2026-05-17T23:41:06.332828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:06.332828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HBKRESaFx8hCf9yv8OH5mdo8ws/Id+I8RwDrFrtXOgd+TCbzws1u/M/ORt9DuBBT/YXh0NDzKMZoqhHwrVWBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:06.333477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d14dba2abb048788afa39648801e3a1711ce7a40c29c3a5c153f862f53c9c75c","sha256:35e4677e4877b8e370f027d8b80c399dc5a20d8c5cf3611624e4bdab69fa1a92"],"state_sha256":"3819b4cbfe6dc30d883e3bfb120bf5165c68eb20fbd635c38aec9e408c259488"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0GUeTwFtTqWPuzOhkM57f7GM1QwJLScJeVcIUR10mxCFegQxTCNoQTYCVbRPuFeln1MNBhqlUhMq055hy2dAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:24:41.328843Z","bundle_sha256":"6ef2ba0e52284758f8f596cd8f3e4a91e2b2fb60f84239c99a3aa6779768392d"}}