{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WZDYQDK7EV6VO3OIJ3J4Z2EWWS","short_pith_number":"pith:WZDYQDK7","schema_version":"1.0","canonical_sha256":"b647880d5f257d576dc84ed3cce896b4ac301a8765401afc5d42fa1e9747ce1b","source":{"kind":"arxiv","id":"1710.01874","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.01874","created_at":"2026-05-18T00:33:38.164082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01874v1","created_at":"2026-05-18T00:33:38.164082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01874","created_at":"2026-05-18T00:33:38.164082+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZDYQDK7EV6V","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZDYQDK7EV6VO3OI","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZDYQDK7","created_at":"2026-05-18T12:31:53.515858+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/WZDYQDK7EV6VO3OIJ3J4Z2EWWS","json":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS.json","graph_json":"https://pith.science/api/pith-number/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/graph.json","events_json":"https://pith.science/api/pith-number/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/events.json","paper":"https://pith.science/paper/WZDYQDK7"},"agent_actions":{"view_html":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS","download_json":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS.json","view_paper":"https://pith.science/paper/WZDYQDK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01874&json=true","fetch_graph":"https://pith.science/api/pith-number/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/graph.json","fetch_events":"https://pith.science/api/pith-number/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/action/storage_attestation","attest_author":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/action/author_attestation","sign_citation":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/action/citation_signature","submit_replication":"https://pith.science/pith/WZDYQDK7EV6VO3OIJ3J4Z2EWWS/action/replication_record"}},"created_at":"2026-05-18T00:33:38.164082+00:00","updated_at":"2026-05-18T00:33:38.164082+00:00"}