{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WZDYQDK7EV6VO3OIJ3J4Z2EWWS","short_pith_number":"pith:WZDYQDK7","canonical_record":{"source":{"id":"1710.01874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-05T03:42:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"642233b66332ae1b58e462a9956ee597c78226502f2496f007f773f9ca90375e","abstract_canon_sha256":"38164039f051c3d0073b9067c2d3fd1cfa9fcfcff834ad5ce2a93ba726e42853"},"schema_version":"1.0"},"canonical_sha256":"b647880d5f257d576dc84ed3cce896b4ac301a8765401afc5d42fa1e9747ce1b","source":{"kind":"arxiv","id":"1710.01874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01874","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01874v1","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01874","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"WZDYQDK7EV6V","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZDYQDK7EV6VO3OI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZDYQDK7","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WZDYQDK7EV6VO3OIJ3J4Z2EWWS","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-05T03:42:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"642233b66332ae1b58e462a9956ee597c78226502f2496f007f773f9ca90375e","abstract_canon_sha256":"38164039f051c3d0073b9067c2d3fd1cfa9fcfcff834ad5ce2a93ba726e42853"},"schema_version":"1.0"},"canonical_sha256":"b647880d5f257d576dc84ed3cce896b4ac301a8765401afc5d42fa1e9747ce1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:38.164672Z","signature_b64":"1qcnr98/lt9WmBN+C0L5pud1Zf2SjKIJzLG/aZTFT4rWVwlIrb5gHXVEwUNzi5WucBinGw/Z4400tqmV5psjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b647880d5f257d576dc84ed3cce896b4ac301a8765401afc5d42fa1e9747ce1b","last_reissued_at":"2026-05-18T00:33:38.163976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:38.163976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01874","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:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6khdPc/fTVt3zH8OVY/Bm2tkLuJ5rTTKvTC0eiRh3VKosF+iFpBwpJ1x+lqZSsbtLzSiYWRLXIJGS0F+bvBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:07:03.667946Z"},"content_sha256":"431572e8dc8414986263880ce8cbebfb4f4efe34ed175c0b99cddd916d13fb6c","schema_version":"1.0","event_id":"sha256:431572e8dc8414986263880ce8cbebfb4f4efe34ed175c0b99cddd916d13fb6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WZDYQDK7EV6VO3OIJ3J4Z2EWWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently repairing algebraic geometry codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Lingfei Jin, Yuan Luo","submitted_at":"2017-10-05T03:42:28Z","abstract_excerpt":"Minimum storage regenerating codes have minimum storage of data in each node and therefore are maximal distance separable (MDS for short) codes. Thus, the number of nodes is upper bounded by $2^{\\fb}$, where $\\fb$ is the bits of data stored in each node. From both theoretical and practical points of view (see the details in Section 1), it is natural to consider regenerating codes that nearly have minimum storage of data, and meanwhile the number of nodes is unbounded. One of the candidates for such regenerating codes is an algebraic geometry code. In this paper, we generalize the repairing alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01874","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:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dVf3BqmwxddQSGLvgmhlH/eCj5IBBx5kaMDHqdXDeUrm0MsZvFCICZu8eoMarCQaWbsqDbPEV3R6wQomHVizDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:07:03.668783Z"},"content_sha256":"0c18069026a96913e71888fb338557cd4849ef217d0a6c63e6673b695bf491b2","schema_version":"1.0","event_id":"sha256:0c18069026a96913e71888fb338557cd4849ef217d0a6c63e6673b695bf491b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/bundle.json","state_url":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/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-07T20:07:03Z","links":{"resolver":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS","bundle":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/bundle.json","state":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WZDYQDK7EV6VO3OIJ3J4Z2EWWS","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":"38164039f051c3d0073b9067c2d3fd1cfa9fcfcff834ad5ce2a93ba726e42853","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-05T03:42:28Z","title_canon_sha256":"642233b66332ae1b58e462a9956ee597c78226502f2496f007f773f9ca90375e"},"schema_version":"1.0","source":{"id":"1710.01874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01874","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01874v1","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01874","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"WZDYQDK7EV6V","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZDYQDK7EV6VO3OI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZDYQDK7","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:0c18069026a96913e71888fb338557cd4849ef217d0a6c63e6673b695bf491b2","target":"graph","created_at":"2026-05-18T00:33:38Z","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 codes have minimum storage of data in each node and therefore are maximal distance separable (MDS for short) codes. Thus, the number of nodes is upper bounded by $2^{\\fb}$, where $\\fb$ is the bits of data stored in each node. From both theoretical and practical points of view (see the details in Section 1), it is natural to consider regenerating codes that nearly have minimum storage of data, and meanwhile the number of nodes is unbounded. One of the candidates for such regenerating codes is an algebraic geometry code. In this paper, we generalize the repairing alg","authors_text":"Chaoping Xing, Lingfei Jin, Yuan Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-05T03:42:28Z","title":"Efficiently repairing algebraic geometry codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01874","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:431572e8dc8414986263880ce8cbebfb4f4efe34ed175c0b99cddd916d13fb6c","target":"record","created_at":"2026-05-18T00:33:38Z","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":"38164039f051c3d0073b9067c2d3fd1cfa9fcfcff834ad5ce2a93ba726e42853","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-05T03:42:28Z","title_canon_sha256":"642233b66332ae1b58e462a9956ee597c78226502f2496f007f773f9ca90375e"},"schema_version":"1.0","source":{"id":"1710.01874","kind":"arxiv","version":1}},"canonical_sha256":"b647880d5f257d576dc84ed3cce896b4ac301a8765401afc5d42fa1e9747ce1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b647880d5f257d576dc84ed3cce896b4ac301a8765401afc5d42fa1e9747ce1b","first_computed_at":"2026-05-18T00:33:38.163976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:38.163976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1qcnr98/lt9WmBN+C0L5pud1Zf2SjKIJzLG/aZTFT4rWVwlIrb5gHXVEwUNzi5WucBinGw/Z4400tqmV5psjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:38.164672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:431572e8dc8414986263880ce8cbebfb4f4efe34ed175c0b99cddd916d13fb6c","sha256:0c18069026a96913e71888fb338557cd4849ef217d0a6c63e6673b695bf491b2"],"state_sha256":"5a7ee6f7b7b9d51322bab41bbd84b2f6bfd8e1bf823e6abe4412671217d1b0f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Z2tbr8jQiSyGSjN1gxwoEtHPQrGcobWR+CYP69EppvErDnDFSkB86HrgRxmR4tOulPRCIV7qXkojZ+rc1i9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:07:03.672644Z","bundle_sha256":"0e7236e0d74e5ab75491b92d670e63ad01fae8abed36db361b7ad803641d5eab"}}